title: Víctor Montoya

abstract: Víctor Montoya is a Bolivian writer, cultural journalist, and pedagogue. Imprisoned by the dictatorship in his native Bolivia, he became an exile following a campaign by Amnesty International in 1977.

text:
# Víctor Montoya

**Víctor Montoya** (born June 21, 1958) is a Bolivian writer, cultural journalist, and pedagogue. Imprisoned by the dictatorship in his native Bolivia, he became an exile following a campaign by Amnesty International in 1977.

## Biography

Born in La Paz on June 21, 1958. From early childhood he lived in the mining towns of Siglo XX and Llallagua, in northern Potosí department. There, the miserable conditions of the miners led him to identify with and join their efforts to change those conditions. At the age of 9 he witnessed the Massacre of San Juan.

In 1976, as a result of his political activities, he was persecuted, tortured, and jailed by the military dictatorship of Hugo Banzer Suárez. While imprisoned in the San Pedro Prison and in the top-security jail of Chonchocoro-Viacha, he wrote his first published book, the eyewitness account *Strike and Repression.*

Freed from prison through a campaign of Amnesty International, he arrived in Sweden as an exile in 1977. He graduated from the Stockholm Institute of Education, in whose Pedagogic Institute he took specialized courses. He taught classes on the Quechua language, coordinated cultural projects in a library, led literature workshops, and worked as a teacher for several years.

He was director of the literary magazines *PuertAbierta* and *Contraluz*. His work won him awards and literary scholarships. His stories have been translated and published in international anthologies. Currently, he writes for publications in Latin America, Europe, and the United States. He is caretaker of the digital anthology of Latin American Storytellers in Sweden.

## Bibliography

* Huelga y represión \[Strike and Repression\] (1979)
* Días y noches de angustia \[Days and Nights of Anguish\] (1982)
* Cuentos Violentos \[*Violent Stories*\] (1991)
* El laberinto del pecado \[The Labyrinth of Sin\] (1993)
* El eco de la conciencia \[The Echo of Conscience\] (1994)
* Antología del cuento latinoamericano en Suecia \[Anthology of the Latin American Short Story in Sweden\] (1995)
* Palabra encendida \[Word on Fire\] (1996)
* El niño en el cuento boliviano \[The Child in the Bolivian Short Story\] (1999)
* Cuentos de la mina \[Stories from the Mine\] (2000)
* Entre tumbas y pesadillas \[Between Tombs and Nightmares\] (2002)
* Fugas y socavones \[Escapes and Underground Tunnels\] (2002)
* Literatura infantil: Lenguaje y fantasía \[Children’s Literature: Language and Fantasy\] (2003)
* Poesía boliviana en Suecia \[Bolivian Poetry in Sweden\] (2005)
* Retratos \[Portraits\] (2006)
* Cuentos en el exilio \[Stories in Exile\] (2008)
* Conversaciones con el Tío de Potosí \[Conversations with the Tio of Potosi\] (2013)

Literatura Hispanoamericana:  Víctor Montoya:  Proyecto Patrimonio:  Rodelú:  Crónicas mineras, de Víctor Montoya:  Almiar:  Rebelión  Ficticia:  Portal ALBA:

## InfoBox

| Víctor Montoya | |
| --- | --- |
|  | |
| Born | (1958-06-21) 21 June 1958<br>La Paz, Bolivia |
| Occupation | Writer, journalist, pedagogue |
| Language | Spanish |
| Genre | Novel, short story, essay |


title: Visconti Castle (Trezzo sull'Adda)

abstract: The Visconti Castle of Trezzo was a mediaeval castle built between 1370 and 1377 by Bernabò Visconti, Lord of Milan, at Trezzo sull'Adda, Lombardy, Northern Italy. It included a massive tower, 42-meter high, and a fortified bridge on the Adda river on a single arch with a record 72-meter span. The bridge was deliberately destroyed in the 15th century during an attack on the castle. In the course of the 18th and 19th centuries, the walls of the castle were partly demolished to obtain construction materials. The stone elements of the collapsed bridge were moved to Milan for the construction of the Napoleonic Arena. The first initiatives to preserve the remains of the castle were taken in the second half of the 19th century. The surviving parts are today reduced to the tower, the bridge abutments, some walls, and the casemates.

text:
# Visconti Castle (Trezzo sull'Adda)

The **Visconti Castle of Trezzo** was a mediaeval castle built between 1370 and 1377 by Bernabò Visconti, Lord of Milan, at Trezzo sull'Adda, Lombardy, Northern Italy. It included a massive tower, 42-meter high, and a fortified bridge on the Adda river on a single arch with a record 72-meter span.

The bridge was deliberately destroyed in the 15th century during an attack on the castle. In the course of the 18th and 19th centuries, the walls of the castle were partly demolished to obtain construction materials. The stone elements of the collapsed bridge were moved to Milan for the construction of the Napoleonic Arena.

The first initiatives to preserve the remains of the castle were taken in the second half of the 19th century. The surviving parts are today reduced to the tower, the bridge abutments, some walls, and the casemates.

## History

### Origins

Since prehistoric times, the castle's site hosted a Celtic settlement and, after the 7th century, was inhabited by Lombard populations. The first fortifications on the hill are attributed to them. Along with the Early Middle Ages and until the 13th century, the buildings were repeatedly transformed.

Towers were built on two points of the peninsula: at the northern end, the Teodolinda Tower, named after the Lombard queen; on the eastern side, the Black Tower (the Torre Nera) traditionally attributed to the Emperor Frederick Barbarossa.

### The Visconti period (14th-15th centuries)

#### Bernabò Visconti

At the end of the 13th century, the Visconti family assumed the lordship of Milan. In the following decades, they extended their dominions in northern Italy, incorporating Bergamo and Brescia, east to the Adda river. After 1355, the two brothers Galeazzo II and Bernabò Visconti divided the family territories. Trezzo was part of the eastern portion obtained by Bernabò.

In 1370, Bernabò ordered the construction of a new castle on the Trezzo peninsula, as part of a broader plan to fortify the territories under his rule. The castle extended along the southern portion of the peninsula. On its northern part, the previous fortifications were not altered. The central building had a rectangular plan, elongated from south to north along the peninsula. The tower of the castle, 42-meter high, was erected a few meters south of the central building and connected to it with two walls. The castle, therefore, resulted in having a pentagonal shape. Along the two sides of the castle, parallel to the river's course, casemates were built under the wall, partly excavating the rock.

Bernabò's project included a fortified bridge over the Adda river that connected the castle to the eastern territories under his rule. The bridge had a single arch with a 72-meter span, never achieved before, and was 8-meter wide. Two towers on its ends controlled the passage through the bridge. A second walkway was realized on a lower level inside the bridge.

Both the castle and the bridge were completed in 1377. The construction materials used for the castle were stones and bricks. The masonry primarily consisted of river pebbles interspersed with brick courses. Ashlars were also used, especially in the southern walls and in the tower, where they were rusticated. The bridge was probably constructed entirely with stones.

In 1385, Gian Galeazzo Visconti, son of Galeazzo II, staged a coup against his uncle Bernabò, arrested him, and took control of all the Visconti territories. Gian Galeazzo chose the Trezzo castle as the place of imprisonment for Bernabò. A few months later, Bernabò died in his cell, supposedly after having been poisoned.

#### Crisis of the Visconti state and bridge demolition

The death of Gian Galeazzo Visconti in 1402 opened a period of crisis in the Visconti state, which led to a fragmentation of its territorial unity. Paolo Colleoni, the father of Bartolomeo and member of a family from Bergamo longtime opposer of the Visconti, occupied the Trezzo castle. In 1416 Filippo Maria Visconti, son and successor of Gian Galeazzo, instructed the condottiero Francesco Bussone da Carmagnola to retake Trezzo. Carmagnola attacked and besieged the castle from the west. After having tried in vain to stop the supply to the castle, coming from east through the bridge, he decided to undercut one of the arch abutments, causing the bridge to collapse.

### Decay and reuse of the construction materials (16th-19th centuries)

In the following centuries, the castle had no significant alterations. After the unification of the territories of Milan and Venice, laid down in the Treaty of Campo Formio in 1797, the Adda river no longer marked their border. The castle lost, therefore, its importance.

In the 19th century, when puddingstone quarries were opened near the shore of the Adds river, the older Torre Nera was destroyed. At the same time, the walls of the castle began to be dismantled to obtain construction materials. Decorative elements were transferred to the Royal Villa of Monza. Being Trezzo in the proximity of the inlet of the Martesana Canal, the blocks of the collapsed bridge were easily moved to Milan, where they were used in the construction of the Napoleonic Arena Civica.

### Preservation and restoration of the remains (19th-21st centuries)

At the beginning of the 20th century, a large hydroelectric power plant (Taccani power plant) was built at the foot of the Trezzo hill. Its architecture was designed considering the proximity of the castle.

Restoration of the ruins began at the end of the 20th, when the local municipality acquired the castle.

## Today

The restored ruins of the castle, the Taccani hydroelectric power plant, and the Adda river's natural environment characterize today the Trezzo area.

The remains of the castle are open for tourist visits. The tower can be visited up to its top. The casemates on the eastern side of the castle are also accessible. The older Teodolinda tower is visible from the river bank at the extreme north of the peninsula.

## Sources

* Black, Jane (2009). *Absolutism in Renaissance Milan. Plenitude of power under the Visconti and the Sforza 1329–1535*. Oxford: Oxford University Press. ISBN 9780199565290.
* Conti, Flavio; Hybsch, Vincenzo; Vincenti, Antonello (1990). *I castelli della Lombardia. Provincie di Milano e Pavia* (in Italian). Novara: Istituto Geografico de Agostini. ISBN 88-402-9108-3.
* Crivelli, Ariberto (1886). *Gli avanzi del castello di Trezzo – L'antico ed il nuovo ponte sull'Adda* (in Italian). Milan: Prem. Tipo-Litografia degli Ingegneri.

## InfoBox

| Visconti Castle (Trezzo sull'Adda) | |
| --- | --- |
| *Castello Visconteo di Trezzo sull'Adda* | |
| Trezzo sull'Adda, Lombardy, Northern Italy | |
| The tower of the castle in 1980 photo by Paolo Monti | |
| Visconti Castle (Trezzo sull'Adda) | |
| Coordinates | 45°36′42″N 9°31′20″E / 45.61167°N 9.52222°E / 45.61167; 9.52222 |
| Type | Medieval castle |
| Height | 42 m (138 ft) (tower) |
| Site information | |
| Owner | Municipality of Trezzo sull'Adda |
| Open to<br>the public | Yes |
| Condition | Mostly ruined; good the surviving parts (tower and part of the casemates) |
| Site history | |
| Built | 1370–1377 |
| Built by | Bernabò Visconti |
| Materials | Stone, cobblestone and bricks |
| Events | Imprisonment and death of Bernabò Visconti (1385) |


title: Yvonne Timmerman-Buck

abstract: Yvonne Elisabeth Marie Antoinette Timmerman-Buck is a Dutch politician of the Christian Democratic Appeal (CDA) party and jurist. She was a Member of the Council of State from 1 November 2009 until 2018.

text:
# Yvonne Timmerman-Buck

**Yvonne Elisabeth Marie Antoinette Timmerman-Buck** (born 26 July 1956) is a Dutch politician of the Christian Democratic Appeal (CDA) party and jurist. She was a Member of the Council of State from 1 November 2009 until 2018.

## Early life

Timmerman-Buck was born in Kerkrade on 26 July 1956. Her father Werner Buck was a politician of the Catholic People's Party and was State Secretary of Housing, Spatial Planning and the Environment in the Cabinet Biesheuvel I.

## Career

Timmerman-Buck was vice president of the Dutch Equal Treatment Commission from 1994 until 2001.

Timmerman-Buck was a Senator from June 1999 until November 2009. She was President of the Senate in the period 2003–2009, the first female to have the position. Timmerman-Buck has been a member of the State Council since 1 November 2009.

## Personal life

Timmerman-Buck has been married to Maximiliaan Timmerman since 1981.

## Decorations

| **Honours** | | | | |
| --- | --- | --- | --- | --- |
| Ribbon bar | Honour | Country | Date | Comment |
|  | Knight of the Order of Orange-Nassau | Netherlands | 30 April 2006 |  |
|

Official

## InfoBox

| Yvonne Timmerman-Buck | |
| --- | --- |
| Timmerman-Buck in 2005 | |
|  | |
| Member of the Council of State | |
| **In office**
1 November 2009  31 december 2018 | |
| Vice President | *See list* |
| President of the Senate | |
| **In office**
17 June 2003  6 October 2009 | |
| Preceded by | Gerrit Braks |
| Succeeded by | René van der Linden |
| Parliamentary leader in the Senate | |
| **In office**
2 October 2001  17 June 2003 | |
| Preceded by | Gerrit Braks |
| Succeeded by | Jos Werner |
| Parliamentary group | Christian Democratic Appeal |
| Member of the Senate | |
| **In office**
8 July 1999  1 November 2009 | |
| Parliamentary group | Christian Democratic Appeal |
|  | |
| Personal details | |
| Born | Yvonne Elisabeth Marie Antoinette Buck
(1956-07-26) 26 July 1956
Kerkrade, Netherlands |
| Political party | Christian Democratic Appeal
(from 1980) |
| Other political
affiliations | Catholic People's Party
(until 1980) |
| Spouse | Maximiliaan Timmerman  (m. 1981) |
| Children | 3 children |
| Parent |  |
| Residence(s) | The Hague, Netherlands |
| Alma mater | Tilburg University
(Bachelor of Laws, Master of Laws) |
| Occupation | Politician · Civil servant · Jurist · Researcher · Nonprofit director · Media administrator · Academic administrator |
|  | |


title: The Basin, Victoria

abstract: The Basin is a suburb in Melbourne, Victoria, Australia, 31 km east of Melbourne's Central Business District, located within the City of Knox local government area. The Basin recorded a population of 4,497 at the 2021 census.

text:
# The Basin, Victoria

**The Basin** is a suburb in Melbourne, Victoria, Australia, 31 km east of Melbourne's Central Business District, located within the City of Knox local government area. The Basin recorded a population of 4,497 at the 2021 census.

## History

### Traditional custodians

Prior to European settlement, The Basin and surrounding suburbs were often visited by the Bunurong and Yarra Yarra people—hunting in the summer months in the Dandenong Ranges and its foothills. The Wurundjeri people of the Kulin nation are the acknowledged traditional custodians of the land on which The Basin and all of City of Knox is located (source: City of Knox publication).

### Origin of the name

The Government Botanist Ferdinand von Mueller named the area The Basin about 1860 during a visit to the Dandenong Ranges because it is located in a "basin" surrounded by hills. (source: Knox Historical Society) "The Basin" is shown on an 1868 survey plan, when settlers had taken licences or made freehold purchases of the land.

### Early European settlers

William Peverill Watson is recorded as being the first official occupier of land in the area now known as The Basin in 1867. David Dobson arrived in Melbourne in 1854 and settled at The Basin as early as 1870 on land that extended from what is now Wicks Reserve through to Pavitt Lane bordered by Sheffield Road, Mountain Highway and Liverpool Road. David Dobson was instrumental in the establishment of The Basin Primary School. The Dobson family still occupies 60 acres of that original land.

Other significant early European settlers included the Chandler family. William Chandler was a market gardener who arrived in Victoria in 1854 and eventually settled in The Basin in 1873. He was the first in the area to crossbreed seeds and produce exceptional flowers and vegetables. William and Kate Chandler planted an acorn soon after they settled in The Basin—the English Oak still stands (source—historical marker). Two of William Chandler's sons established plant nurseries in the area and his grandson, Sir Gilbert Chandler was a horticulturalist and Fern Tree Gully Shire President (1938–39) who later went on to be a member of State Parliament.

Notable settlers included J.J. Miller, book-maker and publisher of Miller's Racing Guide. In 1872, Miller acquired land at The Basin in 1872 and invested considerable time and money building up a stud farm for racing horses, at one stage owning over 1,000 acres (4.0 km2) in The Basin. To encourage summer tourists to visit and see the stables, training facilities and horses, Miller ran a private coach service from Forest Road in The Basin to Bayswater Railway Station. He also helped publicise the district with a gigantic fireworks display each Christmas. Miller was prominent in local affairs and was the first President of the new Shire of Fern Tree Gully. In 1888, Miller was the first in the area to secure a wine licence at his home. Miller faced financial ruin in the 1890s when the sweepstakes were declared illegal and he had to give up his property at The Basin. The home remains as a significant local historical building.

The Basin Post Office opened around 1902.

## Government

Residents are represented in the Victorian Parliament (Legislative Assembly) by the member for the electorate of Bayswater and in the Federal Parliament (House of Representatives) by the member for the electorate of Aston.

## Media

The Boronia and The Basin Community Newspaper (BBCN) is produced and distributed each month by local volunteers. It focuses on local stories and history, including feature articles on immigrants' stories and local businesses.

## Parks and gardens

The Basin forms one of Melbourne's "green wedges" and is nestled into the forest covered foothills of Mount Dandenong and the Dandenong Ranges National Park, including Doongalla Forest. This was formerly part of the Doongalla Estate, purchased by Sir Matthew Davies in 1891. The residential development of the suburb includes bushy parks such as Wicks Reserve and some farmland.

A significant natural resource is an operating farm that is owned and operated by the Salvation Army and includes a community church. The farm was purchased by the Salvation Army from David Dobson and others in 1897. In the same year a boys' home was established on the purchased land, in response to a government request for church groups to support boys who commit criminal offences. The home was originally named "The Eden". At its height, it provided for 110 boys (source: historical marker). The Salvation Army's site on Basin Olinda Road, The Basin is used for school camps, conferences and functions.

Important buildings include the Progress Hall and Elderly Citizens Hall. Both are located within "The Basin Triangle", which also includes a Scouts hall, The Basin Fire Brigade (CFA) facility, a children's playground and open space.

## Transport

Mountain Highway runs through The Basin to Sassafras. It is a challenging and popular cycling route for people in Melbourne.

The Basin-Olinda Road is a mostly unsealed road that leads to the mountain town of Olinda.

Bus route 755 runs from The Basin to local train stations at Bayswater, Boronia and Ferntree Gully.

## Education

The suburb has three primary schools:

* The Basin Primary School. The original school building is used today to house the administration offices of the school.
* St Bernadette's Catholic Primary school. The school opened on Wednesday 2 February 1983. The land had been purchased many years earlier in anticipation of the need for a Catholic School.

There are two pre-schools—The Basin Pre-school (Forest Road) and Goodwin Estate pre-school (Rome Beauty Avenue)

## Retail

There are various shops and restaurants fronting two sides of The Basin Triangle, amidst a village atmosphere. Retail outlets include a gym, a licensed post office, two pubs, cafés, liquor store, greengrocer, jeweller, butcher, financial advisor, wine bar/restaurant, bookstore, dog training gear, nursery/gift shop, hairdressing salons, fish and chips and tattoo shop/gallery.

## Culture and community

The Basin Theatre Group is a local amateur theatre group that has operated since the first gathering of friends by Edna Chandler in 1954. Early productions were first conducted in the Basin Progress Hall. In 1962 the group constructed an A-frame barn that became known as The Hut. Later in 1973, the group constructed a larger theatre on land donated by Edna and Fergus Chandler. The group conducts four productions per year that include a range of performances in all theatrical styles. The Basin Theatre Group's mission is to provide a variety of theatrical productions that are high quality and affordable, and at times, extraordinary and inspiring. Details of productions and booking information can be found on The Basin Theatre Website.

Local groups include the Country Fire Authority and The 1st Basin Scout Group.

The inaugural The Basin Music Festival was held in March 2005 and is held annually every March. Details of musicians and tickets can be found at The Basin Music Festival website.

Places of Worship in The Basin include the Romanian Seventh-day Adventist Church, St Bernadette's Catholic Mass Centre (part of the primary school) and Vinayagar Hindu Temple.

## Sport

The town has two tennis clubs; Miller Park Tennis Club and Batterham Park Tennis Club, and Australian Rules football team, The Basin Bears, competing in the Eastern Football League.

## InfoBox

| The Basin
Melbourne, Victoria | |
| --- | --- |
| The Basin (looking towards Mount Dandenong) | |
| The Basin | |
| Coordinates | 37°51′36″S 145°18′50″E / 37.860°S 145.314°E / -37.860; 145.314 |
| Population | 4,497 (2021 census) |
| • Density | 789/km2 (2,043/sq mi) |
| Postcode(s) | 3154 |
| Elevation | 184 m (604 ft) |
| Area | 5.7 km2 (2.2 sq mi) |
| Location | 31 km (19 mi) from Melbourne |
| LGA(s) | City of Knox |
| State electorate(s) | Bayswater, Monbulk |
| Federal division(s) | Aston |
| **Suburbs around The Basin:**  Kilsyth South Kilsyth *Dandenong Ranges*  Boronia The Basin *Dandenong Ranges*  Sassafras Tremont Sassafras | |


title: Waban

abstract: Waban was a Native American of the Nipmuc group and was thought to be the first Native American convert to Christianity in Massachusetts.

text:
# Waban

**Waban** (c.1604c.1685) was a Native American of the Nipmuc group and was thought to be the first Native American convert to Christianity in Massachusetts.

## Life

Waban was born about 1604. While there is no proof that he actually did so, it is believed that his conversion to Christianity came on October 28, 1646 (Julian calendar), when the missionary Reverend John Eliot preached his first sermon to Native Americans in their own language in Waban's large wigwam in Nonantum, Massachusetts, and Waban and many of his tribe listened but were later forced at gunpoint to move from their land.

Waban maintained close and friendly relations with the white settlers of Massachusetts and, in April 1675, reported to a New England magistrate that trouble was brewing amongst the Wampanoags. Within two months, Waban's predictions came to pass when a Wampanoag named Metacomet, known as "King Philip", led his nation in the initially successful King Philip's War. Metacomet's subsequent death in August 1676 signalled the end of the brief war, and the rebellion soon collapsed due to a lack of leadership. Nevertheless, Waban, falsely accused of being a conspirator, was imprisoned in October 1675. After a brief period of captivity, Waban was released in the spring of 1676 and returned to his settlement of Natick, Massachusetts.

Waban is often considered to be tribal chief of the Nonantum tribe, but this is a misnomer. According to John Eliot, Waban was actually "the chief minister of justice", not a "*sachem*", but the title "chief minister of justice" is not used by Native Americans. In reality, Waban did not hold an authoritative, political position within his own nation.

The exact date of Waban's death is not known, with it being reported as early as late 1676 or early 1677 and as late as c.1685 when Rev. Daniel Takawambait wrote down and published the final words of Waban and several other Indians in a pamphlet entitled "Dying Speeches and Counsels Of such Indians as dyed in the Lord."

## Namesakes

One of the villages of the city of Newton, Massachusetts, is named Waban, while Nonantum is another village in the city.

A lake in Wellesley, Massachusetts, partially on the grounds of Wellesley College, is named Lake Waban.

Waban Hill is a geologic feature in the village of Chestnut Hill, Massachusetts, in the eastern part of Newton, Massachusetts.

One U.S. Navy ship, USS *Waban*, a steamer in commission from 1898 to 1919, has been named for Waban, and kept the name (as *SS Waban*) while in post-Navy mercantile service from 1919 to 1924.


title: Sirobasidium

abstract: Sirobasidium is a genus of fungi in the order Tremellales. Basidiocarps are gelatinous and appear to be parasitic on ascomycetous fungi on wood. Microscopically they are distinguished by producing septate basidia in chains which give rise to deciduous sterigmata. Species are distributed worldwide.

text:
# Sirobasidium

***Sirobasidium*** is a genus of fungi in the order Tremellales. Basidiocarps (fruit bodies) are gelatinous and appear to be parasitic on ascomycetous fungi on wood. Microscopically they are distinguished by producing septate basidia in chains which give rise to deciduous sterigmata. Species are distributed worldwide.

## Taxonomy

*Sirobasidium* was introduced in 1892 by Swedish mycologist Gustaf Lagerheim and French mycologist Narcisse Patouillard for two fungi collected in Ecuador that possessed distinctive, catenulate, tremelloid basidia (septate basidia formed in chains). Subsequent authors added further species with similar basidia.

Molecular research, based on cladistic analysis of DNA sequences, has shown that *Sirobasidium* may be polyphyletic (and hence artificial), though this is based on a single culture that may be contaminated and requires further research.

## Description

Fruit bodies are gelatinous and are variously pustular to foliose (with leaf-like or seaweed-like fronds). Colours are typically reddish, yellow, or brown.

### Microscopic characters

The basidia are "tremelloid" (globose to ellipsoid or fusiform and vertically or diagonally septate) and catenulate (formed in chains), giving rise to fusiform sterigmata or epibasidia which detach from the basidia and then produce basidiospores. These spores are smooth, globose, and germinate by hyphal tube or yeast cells.

## Habitat and distribution

*Sirobasidium* species are associated with and possibly parasitic on fungi in the Diatrypaceae growing on dead attached or fallen wood, including species of *Eutypa*, *Eutypella*, and *Diatrype*. As a group, *Sirobasidium* species occur worldwide, though individual species may have a more restricted distribution.

## InfoBox

| *Sirobasidium* | |
| --- | --- |
|  | |
| *Sirobasidium magnum* | |
|
| Scientific classification | |
| Domain: | Eukaryota |
| Kingdom: | Fungi |
| Division: | Basidiomycota |
| Class: | Tremellomycetes |
| Order: | Tremellales |
| Family: | Sirobasidiaceae |
| Genus: | *Sirobasidium*
Lagerh. & Pat. (1892) |
|
| Type species | |
| *Sirobasidium sanguineum*
Lagerh. & Pat. (1892) | |
| Species | |
| *Sirobasidium albidum*
*Sirobasidium apiculatum*
*Sirobasidium brefeldianum*
*Sirobasidium japonicum*
*Sirobasidium magnum*
*Sirobasidium minutum*
*Sirobasidium rubrofuscum*
*Sirobasidium sandwicense*
*Sirobasidium sanguineum*
 | |


title: Random-access stored-program machine

abstract: In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development and algorithm complexity theory. The RASP is a random-access machine (RAM) model that, unlike the RAM, has its program in its "registers" together with its input. The registers are unbounded; whether the number of registers is finite is model-specific. Thus the RASP is to the RAM as the Universal Turing machine is to the Turing machine. The RASP is an example of the von Neumann architecture whereas the RAM is an example of the Harvard architecture. The RASP is closest of all the abstract models to the common notion of computer. But unlike actual computers the RASP model usually has a very simple instruction set, greatly reduced from those of CISC and even RISC processors to the simplest arithmetic, register-to-register "moves", and "test/jump" instructions. Some models have a few extra registers such as an accumulator. Together with the register machine, the RAM, and the pointer machine the RASP makes up the four common sequential machine models, called this to distinguish them from the "parallel" models [cf. van Emde Boas (1990)].

text:
# Random-access stored-program machine

In theoretical computer science the **random-access stored-program** (RASP) machine model is an abstract machine used for the purposes of algorithm development and algorithm complexity theory.

The RASP is a random-access machine (RAM) model that, unlike the RAM, has its program in its "registers" together with its input. The registers are unbounded (infinite in capacity); whether the number of registers is finite is model-specific. Thus the RASP is to the RAM as the Universal Turing machine is to the Turing machine. The RASP is an example of the von Neumann architecture whereas the RAM is an example of the Harvard architecture.

The RASP is closest of all the abstract models to the common notion of computer. But unlike actual computers the RASP model usually has a very simple instruction set, greatly reduced from those of CISC and even RISC processors to the simplest arithmetic, register-to-register "moves", and "test/jump" instructions. Some models have a few extra registers such as an accumulator.

Together with the register machine, the RAM, and the pointer machine the RASP makes up the four common sequential machine models, called this to distinguish them from the "parallel" models (e.g. parallel random-access machine) \[cf. van Emde Boas (1990)\].

## Informal definition: random-access stored-program model (RASP)

Nutshell description of a RASP:

The RASP is a universal Turing machine (UTM) built on a random-access machine RAM chassis.

The reader will remember that the UTM is a Turing machine with a "universal" finite-state table of instructions that can interpret any well-formed "program" written on the tape as a string of Turing 5-tuples, hence its universality. While the classical UTM model expects to find Turing 5-tuples on its tape, any program-set imaginable can be put there given that the Turing machine expects to find them—given that its finite-state table can interpret them and convert them to the desired action. Along with the program, printed on the tape will be the input data/parameters/numbers (usually to the program's right), and eventually the output data/numbers (usually to the right of both, or intermingled with the input, or replacing it). The "user" must position the Turing machine's head over the first instruction, and the input must be placed in a specified place and format appropriate to both the program-on-tape and the finite-state machine's instruction-table.

The RASP mimics this construction: it places the "program" and "data" in the holes (registers). But unlike the UTM the RASP proceeds to "fetch" its instructions in a sequential manner, unless the conditional test sends it elsewhere.

**A point of confusion: two sets of instructions**: Unlike the UTM, the RASP model has two sets of instructions – the state machine table of instructions (the "interpreter") and the "program" in the holes. The two sets do not have to be drawn from the same set.

### An example of a RAM working as a RASP

The following example of a program will move the contents of register (hole) #18 to register (hole) #19, erasing contents of #18 in the process.

```
    5: 03 18 15    JZ 18,15       ; if [18] is zero, jump to 15 to end the program
       02 18       DEC 18         ; Decrement [18]
       01 19       INC 19         ; Increment [19]
       03 15 05    JZ 15, 5       ; If [15] is zero, jump to 5 to repeat the loop (use Halt to simulate unconditional jump)
   15: 00          H              ; Halt

   18:  n                         ; Source value to copy
   19:                            ; Destination for copy

```

The *program*-instructions available in this RASP machine will be a simple set to keep the example short:

| Instruction | Mnemonic | Action on register "r" | Action on finite state machine's Instruction Register, IR |
| --- | --- | --- | --- |
| INCrement | INC ( r ) | \[r\] +1 → r | \[IR\] +1 → IR |
| DECrement | DEC ( r ) | \[r\] -1 → r | \[IR\] +1 → IR |
| Jump if Zero | JZ ( r, z ) | none | IF \[r\] = 0 THEN z → IR ELSE \[IR\] +1 → IR |
| Halt | H | none | \[IR\] → IR |

To ease the example we will equip the *state machine* of the RAM-as-RASP with the primitive instructions drawn from the same set, but augmented with two indirect copy instructions:

RAM state machine instructions: { INC h; DEC h; JZ h,xxx; CPY ⟪ha⟫,ha; CPY ha,⟪ha⟫ }

As the RASP machine's state machine interprets the program in the registers, what exactly will the state machine be doing? The column containing the exclamation mark ! will list in time sequence the state machine's actions as it "interprets"  converts to action  the program:

|  | PC | IR |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
| hole # → | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| program, parameters → | 5 |  |  |  | JZ | 18 | 15 | DEC | 18 | INC | 19 | JZ | 15 | 5 | H |  |  | n |  |
| encoded program → | 5 |  |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| state machine instructions ↓ |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| ! |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |

Tradition divides the state-machine's actions into two major "phases" called *Fetch* and *Execute*. We will observe below that there are "sub-phases" within these two major phases. There is no agreed-to convention; every model will require its own precise description.

#### Fetch phase

The state machine has access to all the registers, both directly and indirectly. So it adopts #1 as "the program counter" PC. The role of the *program* counter will be to "keep the place" in the program's listing; the state machine has its own state register for its private use.

Upon start, the state machine expects to find a number in the PC—the first "Program-Instruction" in the program (i.e. at #5).

(Without the use of the indirect COPYs, the task of getting the pointed-to program-instruction into #2 is a bit arduous. The state machine would indirectly decrement the pointed-to register while directly incrementing (empty) register #2. During the "parse" phase it will restore the sacrificed contents of #5 by sacrificing the count in #2.)

The point of the above detour is to show that life is much easier when the state machine has access to two kinds of indirect copy:

* copy indirect from i and direct to j: CPY ⟪hi⟫,hj
* copy direct from i and indirect to j: CPY hi,⟪hj

The following example shows what happens during the state-machine's "fetch" phase. The state-machine's operations are listed on the column labelled "State machine instruction ↓". Observe that at the end of the fetch, register #2 contains the numerical value 3 of the "operation code" ("opcode") of the first instruction **JZ**:

|  |  |  | PC | PIR |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
|  |  | hole # → | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
|  |  | program, parameters → | 5 |  |  |  | JZ | 18 | 15 | DEC | 18 | INC | 19 | JZ | 15 | 5 | H |  |  | n |  |
|  |  | encoded program → | 5 |  |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| step |  | state machine instructions ↓ |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| 1 | fetch\_instr: | CPY ⟪1⟫,2 | 5 i | \[3\] |  |  | \[3\] | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |

#### Parse phase

Now that the number of the program-instruction (e.g. 3 = "JZ") is in register #2 -- the "Program-Instruction Register" PIR—the state machine proceeds to decrement the number until the IR is empty:

If the IR were empty before decrement then the program-instruction would be 0 = HALT, and the machine would jump to its "HALT" routine. After the first decrement, if the hole were empty the instruction would be INC, and the machine would jump to instruction "inc\_routine". After the second decrement, the empty IR would represent DEC, and the machine would jump to the "dec\_routine". After the third decrement, the IR is indeed empty, and this causes a jump to the "JZ\_routine" routine. If an unexpected number were still in the IR, then the machine would have detected an error and could HALT (for example).

|  |  |  | PC | IR |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
|  |  | hole # → | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
|  |  | program, parameters → | 5 |  |  |  | JZ | 18 | 15 | DEC | 18 | INC | 19 | JZ | 15 | 5 | H |  |  | n |  |
|  |  | encoded program → | 5 |  |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
|  |  | state machine instructions ↓ |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  |  | CPY ⟪1⟫,2 | 5 i | \[3\] |  |  | \[3\] | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
|  |  | JZ 2,halt | 5 | 3 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 19 | 5 | 0 |  |  | n |  |
| 3 |  | DEC 2 | 5 | 2 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 4 |  | JZ 2,inc\_routine: | 5 | 2 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 5 |  | DEC 2 | 5 | 1 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 6 |  | JZ 2,dec\_routine | 5 | 1 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 7 |  | DEC 2 | 5 | 0 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 8 |  | JZ 2, JZ\_routine | 5 | 0 ! |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  | halt: | HALT | 5 | 3 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
|  | inc\_routine: | etc. | 5 | 3 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
|  | dec\_routine: | etc. | 5 | 3 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 9 | JZ\_routine: | etc. | 5 | 3 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |

#### Execute phase, JZ\_routine

Now the state machine knows what program-instruction to execute; indeed it has jumped to the "JZ\_routine" sequence of instructions. The JZ instruction has 2 operands  (i) the number of the register to test, and (ii) the address to go to if the test is successful (the hole is empty).

**(i) Operand fetch  which register to test for empty?**: Analogous to the fetch phase, the finite state machine moves the contents of the register pointed to by the PC, i.e. hole #6, into the Program-Instruction Register PIR #2. It then uses the contents of register #2 to point to the register to be tested for zero, i.e. register #18. Hole #18 contains a number "n". To do the test, now the state machine uses the contents of the PIR to indirectly copy the contents of register #18 into a spare register, #3. So there are two eventualities (ia), register #18 is empty, (ib) register #18 is not empty.

(ia): If register #3 is empty then the state machine jumps to (ii) Second operand fetch  fetch the jump-to address.

(ib): If register #3 is not empty then the state machine can skip (ii) Second operand fetch. It simply increments twice the PC and then unconditionally jumps back to the instruction-fetch phase, where it fetches program-instruction #8 (DEC).

**(ii) Operand fetch  jump-to address**. If register #3 is empty, the state machine proceeds to use the PC to indirectly copy the contents of the register it points to (#8) into *itself*. Now the PC holds the jump-to address 15. Then the state machine unconditionally goes back to the instruction fetch phase, where it fetches program-instruction #15 (HALT).

|  |  |  | PC | IR |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
|  |  | hole # → | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
|  |  | program, parameters → | 5 |  |  |  | JZ | 18 | 15 | DEC | 18 | INC | 19 | JZ | 15 | 5 | H |  |  | n |  |
|  |  | encoded program → | 5 |  |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| step |  | state machine instructions ↓ |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| 9 | JZ\_routine | INC 1 | \[6\] | 3 |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 10 |  | CPY ⟪1⟫,2 | 6 i | \[18\] |  |  | 3 | \[18\] | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 11 | test hole: | CPY ⟪2⟫,3 | 6 | 18 i | \[n\] |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | \[n\] |  |
| 12 | test hole: | JZ 3, jump | 6 | 18 i | \[n\] |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
|  |  |  |  |  | n |  |  |  |  |  |  |  |  |  |  |  |  |  |  | n |  |
| 13 | no\_jump: | INC 1 | \[7\] | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 14 |  | INC 1 | \[8\] | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 15 |  | J fetch\_instr | 8 | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 1 | fetch\_instr: | CPY ⟪1⟫,2 | 8 i | \[2\] | n |  | 3 | 18 | 15 | \[2\] | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 2 | parse: | etc. |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| 13 | jump: | INC 1 | \[7\] | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 14 |  | CPY ⟪1⟫,1 | \[15\] | 18 | n |  | 3 | 18 | \[15\] | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 15 |  | J fetch\_instr | 15 | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 1 | fetch\_instr: | CPY ⟪1⟫,2 | 15 i | \[0\] | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | \[0\] |  |  | n |  |
| 2 | parse: | etc. |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |

#### Execute phase INC, DEC

The following completes the RAM's state-machine interpretation of program-instructions, INC h, DEC h and thus completes the demonstration of how a RAM can "impersonate" a RASP:

Target program instruction set: { INC h; DEC h; JZ h,xxx, HALT }

Without indirect state-machine instructions INCi and DECi, to execute the INC and DEC *program*-instructions the state machine must use indirect copy to get the contents of the pointed-to register into spare register #3, DEC or INC it, and then use indirect copy to send it back to the pointed-to register.

|  |  |  | PC | IR |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- | --- |
|  |  | hole # → | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
|  |  | program, parameters → | 5 |  |  |  | JZ | 18 | 15 | DEC | 18 | INC | 19 | JZ | 15 | 5 | H |  |  | n |  |
|  |  | encoded program → | 5 |  |  |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
|  |  | state machine instructions ↓ |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| 15 |  | J fetch\_instr | 8 | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 16 | fetch\_instr: | CPY ⟪1⟫,2 | 8 i | \[2\] | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 17 | parse: | JZ 2,halt | 8 | 2 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 18 |  | DEC 2 | 8 | \[1\] | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 19 |  | JZ 2, inc\_routine: | 8 | 1 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 20 |  | DEC 2 | 8 | \[0\] | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 21 |  | JZ 2, dec\_routine: | 8 | 0 ! | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 22 | dec\_routine: | INC 1 | 9 | 0 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 23 |  | CPY ⟪1⟫,2 | 9 i | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 24 |  | CPY ⟪2⟫,3 | 9 | 18 i | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 25 |  | JZ 3,\*+2 | 9 | 18 | n |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 26 |  | DEC 3 | 9 | 18 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n |  |
| 27 |  | CPY 3,⟪2⟫ | 9 | 18 i | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 28 |  | INC 1 | 10 | 18 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 29 |  | J fetch\_instr | 10 | 18 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
|  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |  |
| 30 | fetch\_instr: | CPY ⟪1⟫,2 | 10 i | 1 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 31 | parse: | JZ 2,halt | 10 | 1 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 32 |  | DEC 2 | 10 | 0 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 33 |  | JZ 2,inc\_routine: | 10 | 0 ! | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 34 | inc\_routine: | INC 1 | 11 | 0 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 35 |  | CPY ⟪1⟫,2 | 11 i | 19 | n-1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 |  |
| 36 |  | CPY ⟪2⟫,3 | 11 | 19 i | 0 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 | 0 |
| 37 |  | INC 3 | 11 | 19 | 1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 | 0 |
| 38 |  | CPY 3,⟪2⟫ | 11 | 19 i | 1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 | 1 |
| 39 |  | INC 1 | 12 | 19 | 1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 | 0 |
| 40 |  | J fetch\_instr | 12 | 19 | 1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 | 0 |
| 41 | fetch\_instr: | etc. | 12 | 19 | 1 |  | 3 | 18 | 15 | 2 | 18 | 1 | 19 | 3 | 15 | 5 | 0 |  |  | n-1 | 0 |

**Alternate instructions**: Although the demonstration resulted in a primitive RASP of only four instructions, the reader might imagine how an additional instruction such as "ADD h" or "MULT ha,⟪hb\>might be done.

#### Self-Modifying RASP programs

When a RAM is acting as a RASP, something new has been gained: unlike the RAM, the RASP has the capacity for self-modification of its *program*-instructions (the state-machine instructions are frozen, unmodifiable by the machine). Cook-Reckhow (1971) (p. 75) comment on this in their description of their RASP model, as does Hartmanis (1971) (pp. 239ff)

An early description of this notion can be found in Goldstine-von Neumann (1946):

"We need an order \[instruction\] that can substitute a number into a given order... By means of such an order the results of a computation can be introduced into the instructions governing that or a different computation" (p. 93)

Such an ability makes the following possible:

## RASP program-instruction set of Cook and Reckhow (1973)

In an influential paper Stephen A. Cook and Robert A. Reckhow define their version of a RASP:

"The Random Access Stored-Program Machine (RASP) described here is similar to the RASP's described by Hartmanis \[1971\]" (p. 74).

Their purpose was to compare execution-times of the various models: RAM, RASP and multi-tape Turing machine for use in the theory of complexity analysis.

The salient feature of their RASP model is no provision for indirect program-instructions (cf their discussion p. 75). This they achieve by requiring the program to modify itself: if necessary an instruction can modify the "parameter" (their word, i.e. "operand") of a particular instruction. They have designed their model so each "instruction" uses two consecutive registers, one for the "operation code" (their word) and the parameter "either an address or an integer constant".

Their RASP's registers are unbounded in capacity and unbounded in number; likewise their accumulator AC and instruction counter IC are unbounded. The instruction set is the following:

| operation | mnemonic | operation code | description |
| --- | --- | --- | --- |
| load constant | LOD, k | 1 | put constant k into accumulator |
| add | ADD, j | 2 | add contents of register j to accumulator |
| subtract | SUB, j | 3 | subtract contents of register j from accumulator |
| store | STO, j | 4 | copy contents of accumulator into register j |
| branch on positive accumulator | BPA, xxx | 5 | IF contents of accumulator \> 0 THEN jump to xxx ELSE next instruction |
| read | RD, j | 6 | next input into register j |
| print | PRI, j | 7 | output contents of register j |
| halt | HLT | any other - or + integer | stop |

Often both the RAM and RASP machines are presented together in the same article. These have been copied over from Random-access machine; with a few exceptions, these references are the same as those at Register machine.

* George Boolos, John P. Burgess, Richard Jeffrey (2002), *Computability and Logic: Fourth Edition*, Cambridge University Press, Cambridge, England. The original Boolos-Jeffrey text has been extensively revised by Burgess: more advanced than an introductory textbook. "Abacus machine" model is extensively developed in Chapter 5 *Abacus Computability*; it is one of three models extensively treated and compared—the Turing machine (still in Boolos' original 4-tuple form) and two recursion models.
* Arthur Burks, Herman Goldstine, John von Neumann (1946), *Preliminary discussion of the logical design of an electronic computing instrument*, reprinted pp. 92ff in Gordon Bell and Allen Newell (1971), *Computer Structures: Readings and Examples*, McGraw-Hill Book Company, New York. ISBN 0-07-004357-4 .
* Stephen A. Cook and Robert A. Reckhow (1972), *Time-bounded random access machines*, Journal of Computer Systems Science 7 (1973), 354–375.
* Martin Davis (1958), *Computability & Unsolvability*, McGraw-Hill Book Company, Inc. New York.
* Calvin Elgot and Abraham Robinson (1964), *Random-Access Stored-Program Machines, an Approach to Programming Languages*, Journal of the Association for Computing Machinery, Vol. 11, No. 4 (October, 1964), pp. 365–399.
* J. Hartmanis (1971), "Computational Complexity of Random Access Stored Program Machines," Mathematical Systems Theory 5, 3 (1971) pp. 232–245.
* John Hopcroft, Jeffrey Ullman (1979). *Introduction to Automata Theory, Languages and Computation*, 1st ed., Reading Mass: Addison-Wesley. ISBN 0-201-02988-X. A difficult book centered around the issues of machine-interpretation of "languages", NP-Completeness, etc.
* Stephen Kleene (1952), *Introduction to Metamathematics*, North-Holland Publishing Company, Amsterdam, Netherlands. ISBN 0-7204-2103-9.
* Donald Knuth (1968), *The Art of Computer Programming*, Second Edition 1973, Addison-Wesley, Reading, Massachusetts. Cf pages 462-463 where he defines "a new kind of abstract machine or 'automaton' which deals with linked structures."
* Joachim Lambek (1961, received 15 June 1961), *How to Program an Infinite Abacus*, Mathematical Bulletin, vol. 4, no. 3. September 1961 pages 295–302. In his Appendix II, Lambek proposes a "formal definition of 'program'. He references Melzak (1961) and Kleene (1952) *Introduction to Metamathematics*.
* Z. A. Melzak (1961, received 15 May 1961), *An informal Arithmetical Approach to Computability and Computation*, Canadian Mathematical Bulletin, vol. 4, no. 3. September 1961 pages 279-293. Melzak offers no references but acknowledges "the benefit of conversations with Drs. R. Hamming, D. McIlroy and V. Vyssotsky of the Bell telephone Laboratories and with Dr. H. Wang of Oxford University
* Marvin Minsky (1961). "Recursive Unsolvability of Post's Problem of 'Tag' and Other Topics in Theory of Turing Machines". *Annals of Mathematics*. **74** (3): 437–455. doi:10.2307/1970290. JSTOR 1970290.
* Marvin Minsky (1967). *Computation: Finite and Infinite Machines* (1st ed.). Englewood Cliffs, N. J.: Prentice-Hall, Inc. ISBN 0-13-165449-7. In particular see chapter 11: *Models Similar to Digital Computers* and chapter 14: *Very Simple Bases for Computability*. In the former chapter he defines "Program machines" and in the later chapter he discusses "Universal Program machines with Two Registers" and "...with one register", etc.
* John C. Shepherdson and H. E. Sturgis (1961) received December 1961 *Computability of Recursive Functions*, Journal of the Association for Computing Machinery (JACM) 10:217-255, 1963. An extremely valuable reference paper. In their Appendix A the authors cite 4 others with reference to "Minimality of Instructions Used in 4.1: Comparison with Similar Systems".

* Kaphengst, Heinz, *Eine Abstrakte programmgesteuerte Rechenmaschine'*, Zeitschrift fur mathematische Logik und Grundlagen der Mathematik:*5* (1959), 366-379.
* Ershov, A. P. *On operator algorithms*, (Russian) Dok. Akad. Nauk 122 (1958), 967-970. English translation, Automat. Express 1 (1959), 20-23.
* Péter, Rózsa *Graphschemata und rekursive Funktionen*, Dialectica 12 (1958), 373.
* Hermes, Hans *Die Universalität programmgesteuerter Rechenmaschinen*. Math.-Phys. Semsterberichte (Göttingen) 4 (1954), 42-53.
* Arnold Schönhage (1980), *Storage Modification Machines*, Society for Industrial and Applied Mathematics, SIAM J. Comput. Vol. 9, No. 3, August 1980. Wherein Schōnhage shows the equivalence of his SMM with the "successor RAM" (Random Access Machine), etc. resp. *Storage Modification Machines*, in *Theoretical Computer Science* (1979), pp. 36–37
* Peter van Emde Boas, *Machine Models and Simulations* pp. 3–66, appearing in: Jan van Leeuwen, ed. *Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity*, The MIT PRESS/Elsevier, 1990. ISBN 0-444-88071-2 (volume A). QA 76.H279 1990.

van Emde Boas' treatment of SMMs appears on pp. 32-35. This treatment clarifies Schōnhage 1980 -- it closely follows but expands slightly the Schōnhage treatment. Both references may be needed for effective understanding. * Hao Wang (1957), *A Variant to Turing's Theory of Computing Machines*, JACM (Journal of the Association for Computing Machinery) 4; 63–92. Presented at the meeting of the Association, June 23–25, 1954.


title: 1903 Isfahan anti-Baháʼí riots

abstract: The 1903 Isfahan anti-Baháʼí riots refers to a series of events that led to the massacre of Baháʼí's in the city of Isfahan in Qajar Iran. The events were centered on the Russian consulate in the city.

text:
# 1903 Isfahan anti-Baháʼí riots

The **1903 Isfahan anti-Baháʼí riots** refers to a series of events that led to the massacre of Baháʼí's in the city of Isfahan in Qajar Iran. The events were centered on the Russian consulate in the city.

## Context

As early as the 1840s, there had been anti-Bábi and later anti-Baháʼí riots in Iran. These sorts of persecution happened in some cities more than others due to involvement of religious leaders or the visibility of Bábi and Baháʼí communities. In addition to the city of Yazd, Isfahan had often been plagued by such riots. In 1903, during one of these episodic attacks, Baháʼí's tried to take sanctuary in the Russian consulate in Isfahan. The attacks, which took place over an eight-month period (1902-1903), had been prompted by the visit of Qajar prince Mirza Abol-Hasan Khan Shaykh ol-Ra'is to Isfahan. In addition to being a prince of Iran's ruling dynasty, Shaykh ol-Ra'is was also a *mojtahed* and one of the most renowned clerics at the time.

When Shaykh ol-Ra'is approached Isfahan, two wealthy Isfahani Baháʼí's, namely Agha Mohammad Javad who was the **sarraf**, i.e., "money lender" of the treasury and Mirza Ali Khan, the treasury's accountant (**mostowfi**) were in his service. However, the most renowned cleric of Isfahan, Agha Najafi, and other **mojtaheds** ignored and disrespected him. Agha Mohammad Javad and other **sarrafs** were also engaged in other Baháʼí matters; they, for example, rescued Baháʼí's from Agha Najafi and his men. To make matters more complicated, Shaykh ol-Ra'is's sermons were considered to be popular during his month of stay in Isfahan, and his presence and preaching provided the members of the Baháʼí community with confidence and renewed activism.

On 23 May 1903, a large number of Isfahani Baháʼí's, including Agha Mohammad Javad and Mirza Ali Khan, attended the funeral service of another Baháʼí money exchanger, known as Hajji Mohammad Esmail. When Agha Najafi heard about this, he sent a band of theology students (**tollab**) and vigilantes (*lutis*) to Agha Mohammad Javad and Mirza Ali Khan. The group of **tollabs** and **lutis** managed to catch Agha Mohammad Javad, and he was subsequently detained and tortured. Although without proof, Najafi argued that Javad was a Bábi, and that he had seen him drinking wine two years prior and therefore had to be punished with eighty lashes. Ali Khan had managed to escape.

On the night of 23 May 1903, the Isfahani Baháʼí's discussed the events and prepared an account for Baronovski, the acting Russian consul in Isfahan. The Russian consul allowed the Baháʼí's to take sanctuary (*bast*) in the Russian consulate of Isfahan; some 200 Baháʼí's followed the call. The next day, 24 May, Baronovski told Baháʼí's from Abadeh, Najafabad and Seda to take refuge in the consulate as well, and within a short period of time, the number of Baháʼí's in the consulate had increased to 600 or 700. From the consulate, petitions were telegraphed to Mozaffar al-Din Shah Qajar (r.1896–1907) in the capital Tehran as well as the prime minister and other state officials. The responses from Tehran were not satisfactory however, and thus Baronovski himself corresponded with Mass'oud Mirza Zell-e Soltan, then governor of Isfahan. Zell-e Soltan managed to assure and convince Mirza Ali Khan and other Baháʼí to move out of the consulate on the evening of 27 May 1903. Mirza Ali Khan and Agha Mohammad Javad were then under the protection of Zell-e Soltan, who helped them to escape to Tehran.

Then, rumors began to spread that Agha Najafi had ordered for the destruction of the Russian consulate and to murder the "Bábi's". On Friday 28 May 1903, some men surrounded the Russian consulate during the night. Mirza Ahmad Khan Fateh ol-Molk, the Iranian foreign office agent (*kargozar*), brought Agha Najafi to the environs of the consulate and informed the crowd to listen to what Agha Najafi ordered. The men slowly but surely withdrew from the Russian consulate with Najafi telling them gently to go about their own affairs. Realizing the change of events, the Russian consul Baronovski moved all the Baháʼí's out of the consulate and told them that he was unable to provide them with additional help. As the excited crowd had not entirely dispersed from the consulate, when the Baháʼí's moved out, they attacked them, and beat them to death. They also stole their belongings. The violence against the Baháʼí's continued for several days, with continued public disorder. Many Baháʼí's who had previously kept a low profile, but now thought that they were in a safe situation to join the Baháʼí refugees, were now easy targets of attack. It would take just two months after these events centered on Isfahan and the Russian consulate for another anti-Baháʼí episode to occur (this time in Yazd).

## Sources

* Sadeghian, Saghar (2016). "Minorities and Foreigners in a Provincial Iranian City: Bahāʾis in the Russian Consulate of Isfahan in 1903". *Journal of Persianate Studies*. **9** (1): 107–132. doi:10.1163/18747167-12341297.


title: Yvonne Tousek

abstract: Yvonne Tousek-Renne is a retired artistic gymnast who competed for her native Canada in the 1996 Summer Olympics in Atlanta and the 2000 Summer Olympics in Sydney.

text:
# Yvonne Tousek

**Yvonne Tousek-Renne** (born February 23, 1980, in Kitchener, Ontario) is a retired artistic gymnast who competed for her native Canada in the 1996 Summer Olympics in Atlanta and the 2000 Summer Olympics in Sydney.

## Elite career

Tousek-Renne qualified to the all-around finals at both Games, placing 26th all-around in Atlanta and 32nd all-around in Sydney.

She also competed in four World Gymnastics Championships: 1995, 1996, 1997 and 1999. Her best finish at a Worlds was 7th place on floor exercise at the 1999 World Artistic Gymnastics Championships in Tianjin, China.

At the 1999 World Championships, she also performed an original gymnastics skill that bears her name in the artistic gymnastics Code of Points: the Tousek, a cross-wise back handspring on balance beam.

At the 1999 Pan American Games in Winnipeg, Manitoba, Canada, Tousek-Renne won floor exercise and uneven bars and placed 4th all-around.

In 2000, Tousek-Renne won the all-around, bars and floor exercise at the Canadian National Gymnastics Championships, and she placed second on vault and balance beam.

During her elite career, Tousek-Renne trained with coach Elvira Saadi at Cambridge Kips in Cambridge, Ontario.

## Eponymous skill

Tousek has one eponymous skill listed in the Code of Points.

| Apparatus | Name | Description | Difficulty |
| --- | --- | --- | --- |
| Balance beam | Tousek | Flic-flac with step-out from side position | D |

## College career

During her college career with the UCLA Bruins, the freshman Tousek-Renne earned the uneven bars title at the 2001 NCAA women's gymnastic championships.

She placed fifth on bars in the event finals at the 2002 and 2003 NCAA championships, and she placed fifth on balance beam in the 2004 NCAA championships.

She also scored perfect 10s on uneven bars in the 2003 UCLA vs. Arkansas meet and the 2004 UCLA vs. Michigan meet.

## Cirque du Soleil

In 2006, she went to work as an acrobat for the Cirque du Soleil show *Corteo.* Her acts in the show included "Animation," which sets the stage for the show, plus the trampoline act "Bouncing Beds" and the high-bar act "Tournik." She also performed two comedic turns as an oversized golf ball and as half of a costumed horse. As of 2016, Tousek-Renne, who plays an Amazon in the show, continues to travel the world with Cirque du Soleil.

## Personal

In 2012, Tousek-Renne married Yohann Renne, a Cirque high-bar artist from France. Tousek-Renne and Renne had their first child, a girl, in early June 2014. Tousek-Renne was on maternity leave in early 2014 and toured North America with Renne, who is head coach on Cirque du Soleil's 2014 touring show, Amalun.

1. "Yvonne Tousek Biography and Olympic Results | Olympics at". Sports-reference.com. 1980-02-23. Archived from the original on 2020-04-18. Retrieved 2011-07-09.
2. "1999 Artistic Gymnastics World Championships Women's Finals". Gymnasticsresults.com. 2003-12-06. Archived from the original on 2011-10-29. Retrieved 2011-07-09.
3. "UCLA Gymnastics Again Signs Top Recruiting Class - UCLA Official Athletic Site". Uclabruins.com. 1999-11-17. Retrieved 2011-07-09.
4. "Yvonne Tousek". Gymn.ca. Retrieved 2011-07-09.
5. "About Cambridge Kips". Cambridgekips.com. Retrieved 2011-07-09.
6. "2022-2024 Code of Points Women's Artistic Gymnastics" (PDF). *International Gymnastics Federation*. pp. 137, 210. Archived from the original (PDF) on 12 May 2021. Retrieved 22 January 2022.
7. "Player Bio: Yvonne Tousek - UCLA Official Athletic Site". Uclabruins.com. 1980-02-23. Retrieved 2011-07-09.
8. "CTDB - Yvonne Tousek". Cirquetribune.com. Retrieved 2011-07-09.
9. "Stunts and Circuses - Feature - UCLA Magazine Online". Magazine.ucla.edu. Retrieved 2011-07-09.
10. "Cirque du Soleil: The day I ran off to join superhuman circus stars". 29 January 2016.
11. https://ca.linkedin.com/in/yvonne-tousek-renne-2387bb97%5B%5D
12. "Archived copy" (PDF). Archived from the original (PDF) on November 21, 2014. Retrieved February 11, 2016.`{{cite web}}`: CS1 maint: archived copy as title (link)

## InfoBox

| Yvonne Tousek-Renne | |
| --- | --- |
| Country represented | Canada |
| Born | (1980-02-23) February 23, 1980<br>Kitchener, Ontario |
| Discipline | Women's Artistic Gymnastics |
| Level | Senior International Elite (*Retired*) |
| Gym | Cambridge Kips |
| College team | UCLA |
| Head coach(es) | Elvira Saadi (elite), Valorie Kondos Field (UCLA) |
| Medal record      Representing  Canada  Pan American Games  1999 Winnipeg Team  1999 Winnipeg Uneven Bars  1999 Winnipeg Floor Exercise  Representing UCLA Bruins  NCAA National Championships  2001 Athens Team  2001 Athens Uneven Bars  2003 Lincoln Team  2004 Los Angeles Team  2001 Athens All-Around  2002 Tuscaloosa Team | |


title: Widjojo Soejono

abstract: General (Ret.) Widjojo Soejono was a four-star rank general in the Indonesian Army and the former Commander of Puspasus from 1967 to 1970.

text:
# Widjojo Soejono

General (Ret.)  **Widjojo Soejono** (9 May 1928 – 11 May 2022) was a four-star rank general in the Indonesian Army and the former Commander of Puspasus (now Kopassus) from 1967 to 1970.

## Profile

### Early life

Widjojo Soejono was born in Tulungagung, East Java on May 9, 1928, as the youngest son of 15 brothers with his father Martodidjojo whose ancestors came from Surakarta and Mrs. Roesmirah whose ancestors came from Yogyakarta.

He went to a Hollandsch-Inlandsche School continuing to the Technical School. He was in the same class as Soewoto Sukendar who later became Chief of Staff of the Indonesian Air Force and Widodo Budidarmo who later became the Chief of the Indonesian National Police.

### Military career

Widjojo Soejono left school at the age of 17 to take part in the training of Defender of the Homeland Voluntary Army Officers (PETA) in Bogor in early 1945. After graduating he was placed in Battalion 4, based in Malang. After the disbandment of PETA two days after the Proclamation of Indonesian Independence, he joined his senior Soehardjo to form the People's Security Agency (BKR) at Hogere Burgerschool Straat which, now Jalan Wijaya Kusuma, Surabaya, units which later became TNI Regiment 33, Division VI/Narotama.

After the war he served as Commander of Kopassus from 1967 to 1970, Commander of Kodam XIII/Merdeka from 1970 to 1971, Commander of Kodam V/Brawijaya from 1971 to 1975. He took part in operational command during Operation Seroja and became Chief of Staff of Kopkamtib from 1980 to 1982.

## Personal life

He married Siti Mastoechajah and had five children: Enny Lukitaning Diah, Wedhia Purwaningsih, Ariyati Sihwarini, Hardini Surjaningsih, and Budhi Soejono.

Widjojo Soejono, died at 04.43 WIB at the age of 94 at Gatot Soebroto Army Hospital due to an unspecified cause and Soejono was buried with military honours at Kalibata Heroes' Cemetery, South Jakarta on Wednesday, May 11, 2022, at 13.30 WIB.

## InfoBox

| General (Ret.)Widjojo Soejono | |
| --- | --- |
|  | |
|  | |
| 6th Commander of Army Special Forces Center | |
| **In office**
1967–1970 | |
| Preceded by | Colonel Sarwo Edhie Wibowo |
| Succeeded by | Brigadier General Witarmin |
|  | |
| Personal details | |
| Born | (1928-05-09)May 9, 1928
Tulungagung, East Java |
| Died | May 11, 2022(2022-05-11) (aged 94)
Central Jakarta |
| Spouse | Ny. Siti Mastoechajah |
| Relations | Martodidjojo (father)
Roesmirah (mother)
Soewondo (brother) Widjojo Soeprapto (brother) |
| Children | 1. Enny Lukitaning Diah
2. Wedhia Purwaningsih
3. Ariyati Sihwarini
4. Hardini Surjaningsih
5. Budhi Soejono |
| Military service | |
| Allegiance | Indonesia |
| Branch/service | Indonesian Army |
| Years of service | 1945–1982 |
| Rank | General |
| Unit | Infantry (Kopassandha) |
|  | |


title: Vostervatnet

abstract: Vostervatnet is a lake in the municipality of Strand in Rogaland county, Norway. The 2.62-square-kilometre (1.01 sq mi) lake lies in the northwestern part of Strand, just south of the Fognafjorden. The village of Tau lies about 3.5 kilometres (2.2 mi) southwest of the lake. The main outflow of the lake is the river Fiskåna, which flows north from the northeastern corner of the lake, down the hill to the village of Fiskå on the shore of the fjord.

text:
# Vostervatnet

**Vostervatnet** is a lake in the municipality of Strand in Rogaland county, Norway. The 2.62-square-kilometre (1.01 sq mi) lake lies in the northwestern part of Strand, just south of the Fognafjorden. The village of Tau lies about 3.5 kilometres (2.2 mi) southwest of the lake. The main outflow of the lake is the river Fiskåna, which flows north from the northeastern corner of the lake, down the hill to the village of Fiskå on the shore of the fjord.

## InfoBox

| Vostervatnet | |
| --- | --- |
| *Vostervatnet* (Bokmål) | |
| VostervatnetLocation of the lakeVostervatnetVostervatnet (Norway) | |
| Location | Strand, Rogaland |
| Coordinates | 59°05′45″N 5°58′42″E / 59.0959°N 5.9784°E / 59.0959; 5.9784 |
| Primary outflows | Fiskåna |
| Catchment area | 11.18 km2 (4.32 sq mi) |
| Basin countries | Norway |
|  | |
| Max. length | 2.9 kilometres (1.8 mi) |
| Max. width | 1.4 kilometres (0.87 mi) |
| Surface area | 2.62 km2 (1.01 sq mi) |
| Shore length1 | 10.88 kilometres (6.76 mi) |
| Surface elevation | 54 metres (177 ft) |
|  | |
| References | NVE |
| 1 Shore length is not a well-defined measure. | |


title: Visignano, Cascina

abstract: Visignano is a village in Tuscany, central Italy, administratively a frazione of the comune of Cascina, province of Pisa. Visignano is about 8 km from Pisa and 9 km from Cascina.

text:
# Visignano, Cascina

**Visignano** is a village in Tuscany, central Italy, administratively a frazione of the comune of Cascina, province of Pisa.

Visignano is about 8 km from Pisa and 9 km from Cascina.

## Bibliography

* Caciagli, Giuseppe (1972). *Pisa e la sua provincia*. Vol. 2. Pisa: Colombo Cursi Editore.

## InfoBox

| Visignano | |
| --- | --- |
| *Frazione* | |
|  | |
| VisignanoLocation of Visignano in Italy | |
| Coordinates: 43°41′10″N 10°28′44″E / 43.68611°N 10.47889°E / 43.68611; 10.47889 | |
| Country | Italy |
| Region | Tuscany |
| Province | Pisa (PI) |
| *Comune* | Cascina |
| Elevation | 3 m (10 ft) |
| Population | |
| Total | 1,500 |
| Demonym | *Visignanesi* |
| Time zone | UTC+1 (CET) |
| Summer (DST) | UTC+2 (CEST) |
| Postal code | 56023 |
| Dialing code | (+39) 050 |


title: Saliva Molapisi

abstract: Gaoage Oageng Saliva Molapisi, sometimes also known as Oagile Saliva Molapisi, is a South African politician who is currently serving as the North West's Member of the Executive Council (MEC) for Cooperative Governance, Human Settlement and Traditional Affairs since June 2024. He previously served as MEC for Community Safety and Transport Management from 2014 to 2016, before spending two years as an ordinary Member of the North West Provincial Legislature from 2016 to 2018. In December 2018, he returned to the Executive Council as the MEC for Public Works and Roads He is a member of the African National Congress (ANC). Molapisi is from the region that, in the post-apartheid era, became the Dr Kenneth Kaunda District Municipality. He was first appointed to the North West Executive Council after the May 2014 general election, in which he was ranked 22nd on the ANC's party list; newly elected Premier Supra Mahumapelo appointed him MEC for Community Safety and Transport Management. However, less than two years later, on 8 May 2016, Mahumapelo fired him. He remained an ordinary Member of the North West Provincial Legislature. He returned to the Executive Council under Mahumapelo's successor, Job Mokgoro, who appointed him MEC for Department of Public Works and Roads in a reshuffle announced on 6 December 2018. After the 2019 general election, in which Molapisi was ranked 19th on the ANC's party list, Mokgoro reappointed him to the same portfolio in his new Executive Council. In August 2022, Molapisi was elected to the Provincial Executive Committee of the ANC's branch in the North West. Following the 2024 general election, Molapisi became the MEC for Cooperative Governance, Human Settlement and Traditional Affairs in newly elected premier Lazarus Mokgosi's Executive Council.

text:
# Saliva Molapisi

**Gaoage Oageng Saliva Molapisi**, sometimes also known as **Oagile Saliva Molapisi**, is a South African politician who is currently serving as the North West's Member of the Executive Council (MEC) for Cooperative Governance, Human Settlement and Traditional Affairs since June 2024. He previously served as MEC for Community Safety and Transport Management from 2014 to 2016, before spending two years as an ordinary Member of the North West Provincial Legislature from 2016 to 2018. In December 2018, he returned to the Executive Council as the MEC for Public Works and Roads He is a member of the African National Congress (ANC).

Molapisi is from the region that, in the post-apartheid era, became the Dr Kenneth Kaunda District Municipality. He was first appointed to the North West Executive Council after the May 2014 general election, in which he was ranked 22nd on the ANC's party list; newly elected Premier Supra Mahumapelo appointed him MEC for Community Safety and Transport Management. However, less than two years later, on 8 May 2016, Mahumapelo fired him. He remained an ordinary Member of the North West Provincial Legislature.

He returned to the Executive Council under Mahumapelo's successor, Job Mokgoro, who appointed him MEC for Department of Public Works and Roads in a reshuffle announced on 6 December 2018. After the 2019 general election, in which Molapisi was ranked 19th on the ANC's party list, Mokgoro reappointed him to the same portfolio in his new Executive Council. In August 2022, Molapisi was elected to the Provincial Executive Committee of the ANC's branch in the North West.

Following the 2024 general election, Molapisi became the MEC for Cooperative Governance, Human Settlement and Traditional Affairs in newly elected premier Lazarus Mokgosi's Executive Council.

## InfoBox

| Saliva MolapisiMPL | |
| --- | --- |
|  | |
| Member of the North West Executive Council for Cooperative Governance, Human Settlement and Traditional Affairs | |
| **Incumbent** | |
| **Assumed office**
21 June 2024 | |
| Premier | Lazarus Mokgosi |
| Preceded by | Nono Maloyi |
| Member of the North West Executive Council for Public Works and Roads | |
| **In office**
December 2018  14 June 2024 | |
| Premier |  |
| Preceded by | Johanna Maluleke |
| Succeeded by | Elizabeth Mokua |
| Member of the North West Executive Council for Community Safety and Transport Management | |
| **In office**
May 2014  May 2016 | |
| Premier | Supra Mahumapelo |
| Preceded by | *Position established* |
| Succeeded by | Mpho Motlhabane |
|  | |
| Personal details | |
| Political party | African National Congress |
|  | |


title: ZFS+

abstract: ZFS+ is a combined file system and logical volume manager software subsystem initially released under the Common Development and Distribution License (CDDL). It is based on ZFS, originally developed by Sun Microsystems, with proprietary data deduplication features added by GreenBytes and subsequently made proprietary for a storage system product. GreenBytes originally owned the trademark on ZFS+, not to be confused with the ZFS trademark currently held by Oracle Corporation.

text:
# ZFS+

**ZFS+** is a combined file system and logical volume manager software subsystem initially released under the Common Development and Distribution License (CDDL). It is based on ZFS, originally developed by Sun Microsystems, with proprietary data deduplication features added by GreenBytes and subsequently made proprietary for a storage system product. GreenBytes originally owned the trademark on ZFS+, not to be confused with the ZFS trademark currently held by Oracle Corporation. (GreenBytes itself is now owned by Oracle.)

## Products

GreenBytes created a storage appliance, called Cypress NAS Filer, originally based upon the Sun Microsystems x86-64-based Sun Fire X4500 platform, and bundled their ZFS+ implementation as a value-add technology. GreenBytes claimed their ZFS+ technology could reduce storage power consumption by 50%.

In 2009, GreenBytes relaunched its technology under a new name, *GBFS* (GreenBytes File System).


title: The Art of Storytelling (Dirty album)

abstract: The Art of Storytelling is the sixth album released by rap group, Dirty. It was released on June 12, 2007 through Rap-a-Lot Records, Asylum Records, Atlantic Records and was produced by Terrence Cash and James Prince. The Art of Storytelling only made it to #40 on the Top R&B/Hip-Hop Albums, becoming their only major studio album to not make it to the Billboard 200. This would mark Dirty's final album with Rap-a-Lot Records as the duo chose to leave label after this album's release.

text:
# The Art of Storytelling (Dirty album)

***The Art of Storytelling*** is the sixth album released by rap group, Dirty. It was released on June 12, 2007 through Rap-a-Lot Records, Asylum Records, Atlantic Records and was produced by Terrence Cash and James Prince. *The Art of Storytelling* only made it to #40 on the Top R&B/Hip-Hop Albums, becoming their only major studio album to not make it to the *Billboard* 200. This would mark Dirty's final album with Rap-a-Lot Records as the duo chose to leave label after this album's release.

## Track listing

1. "Set Up"- 4:39
2. "Stop Playin'"- 3:30
3. "Makin Money"- 4:42
4. "Same Old Hood"- 3:52
5. "Shut Em Down"- 4:35
6. "Chevy Rock"- 4:16
7. "Slob on My Nobb"- 1:41
8. "I Got 50" (Skit)- 0:37
9. "I Got 50"- 4:13 (Featuring Paris)
10. "Couple Hundred"- 4:41
11. "Just Look at Her"- 3:49
12. "Makin Money"- 2:34
13. "Ride 4 Me"- 4:56
14. "I'm Hood"- 4:33
15. "Black Flagg"- 2:22
16. "Everybody Shoot"- 3:04
17. "Snitcher"- 0:54
18. "Rearview Mirror"- 4:05
19. "Whoop Em"- 4:45
20. "Check Myself"- 5:02
21. "Comin Home (Troop Song)"- 4:17

## InfoBox

| The Art of Storytelling | |
| --- | --- |
|  | |
| Studio album by Dirty | |
| Released | June 12, 2007 |
| Recorded | 2007 |
| Genre | Hip hop |
| Label |  |
| Producer | Terrence Cash, James Prince |
| Dirty chronology | |
| *Hood Stories*
(2005) ***The Art of Storytelling***
(2007) | |


title: Skenea larseni

abstract: Skenea larseni is a species of small sea snail, a marine gastropod mollusk in the family Skeneidae.

text:
# Skenea larseni

***Skenea larseni*** is a species of small sea snail, a marine gastropod mollusk in the family Skeneidae.

## Description

The size of the shell attains 2 mm.

## Distribution

This species occurs in northern Atlantic Ocean off southern Iceland to southern Faroes

* Warén A., 1993: *New and little known mollusca from Iceland and Scandinavia. Part 2*; Sarsia 78: 159–201
* Gofas, S.; Le Renard, J.; Bouchet, P. (2001). Mollusca, in: Costello, M.J. et al. (Ed.) (2001). *European register of marine species: a check-list of the marine species in Europe and a bibliography of guides to their identification*. Collection Patrimoines Naturels, 50: pp. 180–213

* "*Skenea larseni*". *Gastropods.com*. Retrieved 16 January 2019.

## InfoBox

| *Skenea larseni* | |
| --- | --- |
|
| Scientific classification | |
| Domain: | Eukaryota |
| Kingdom: | Animalia |
| Phylum: | Mollusca |
| Class: | Gastropoda |
| Subclass: | Vetigastropoda |
| Order: | Trochida |
| Superfamily: | Trochoidea |
| Family: | Skeneidae |
| Genus: | *Skenea* |
| Species: | ***S. larseni*** |
| Binomial name | |
| ***Skenea larseni***<br>Warén, 1993 | |
|


title: Random-sampling mechanism

abstract: A random-sampling mechanism (RSM) is a truthful mechanism that uses sampling in order to achieve approximately-optimal gain in prior-free mechanisms and prior-independent mechanisms. Suppose we want to sell some items in an auction and achieve maximum profit. The crucial difficulty is that we do not know how much each buyer is willing to pay for an item. If we know, at least, that the valuations of the buyers are random variables with some known probability distribution, then we can use a Bayesian-optimal mechanism. But often we do not know the distribution. In this case, random-sampling mechanisms provide an alternative solution.

text:
# Random-sampling mechanism

A **random-sampling mechanism (RSM)** is a truthful mechanism that uses sampling in order to achieve approximately-optimal gain in prior-free mechanisms and prior-independent mechanisms.

Suppose we want to sell some items in an auction and achieve maximum profit. The crucial difficulty is that we do not know how much each buyer is willing to pay for an item. If we know, at least, that the valuations of the buyers are random variables with some known probability distribution, then we can use a Bayesian-optimal mechanism. But often we do not know the distribution. In this case, **random-sampling mechanisms** provide an alternative solution.

## RSM in large markets

### Market-halving scheme

When the market is large, the following general scheme can be used:

1. The buyers are asked to reveal their valuations.
2. The buyers are split to two sub-markets, $M\_{L}$ ("left") and $M\_{R}$ ("right"), using simple random sampling: each buyer goes to one of the sides by tossing a fair coin.
3. In each sub-market $M\_{s}$, an empirical distribution function $F\_{s}$ is calculated.
4. The Bayesian-optimal mechanism (Myerson's mechanism) is applied in sub-market $M\_{R}$ with distribution $F\_{L}$, and in $M\_{L}$ with $F\_{R}$.

This scheme is called "Random-Sampling Empirical Myerson" (RSEM).

The declaration of each buyer has no effect on the price he has to pay; the price is determined by the buyers in the other sub-market. Hence, it is a dominant strategy for the buyers to reveal their true valuation. In other words, this is a truthful mechanism.

Intuitively, by the law of large numbers, if the market is sufficiently large then the empirical distributions are sufficiently similar to the real distributions, so we expect the RSEM to attain near-optimal profit. However, this is not necessarily true in all cases. It has been proved to be true in some special cases.

The simplest case is digital goods auction. There, step 4 is simple and consists only of calculating the optimal price in each sub-market. The optimal price in $M\_{L}$ is applied to $M\_{R}$ and vice versa. Hence, the mechanism is called "Random-Sampling Optimal Price" (RSOP). This case is simple because it always calculates feasible allocations. I.e, it is always possible to apply the price calculated in one side to the other side. This is not necessarily the case with physical goods.

Even in a digital goods auction, RSOP does not necessarily converge to the optimal profit. It converges only under the *bounded valuations* assumption: for each buyer, the valuation of the item is between 1 and $h$, where $h$ is some constant. The convergence rate of RSOP to optimality depends on $h$. The convergence rate also depends on the number of possible "offers" considered by the mechanism.

To understand what an "offer" is, consider a digital goods auction in which the valuations of the buyers, in dollars, are known to be bounded in $\[1,h\]$. If the mechanism uses only whole dollar prices, then there are only $h$ possible offers.

In general, the optimization problem may involve much more than just a single price. For example, we may want to sell several different digital goods, each of which may have a different price. So instead of a "price", we talk on an "offer". We assume that there is a global set $G$ of possible offers. For every offer $g\in G$ and agent $i$, $g(i)$ is the amount that agent $i$ pays when presented with the offer $g$. In the digital-goods example, $G$ is the set of possible prices. For every possible price $p$, there is a function $g\_{p}$ such that $g\_{p}(i)$ is either 0 (if $v\_{i}\<p$) or $p$ (if $v\_{i}\geq p$).

For every set $S$ of agents, the profit of the mechanism from presenting the offer $g$ to the agents in $S$ is:

$$g(S):=\sum \_{i\in S}g(i)$$

and the optimal profit of the mechanism is:

$$OPT\_{G}(S):=\max \_{g\in G}g(S)$$

The RSM calculates, for each sub-market $M\_{s}$, an optimal offer $g\_{s}$, calculated as follows:

$$g\_{s}:=\arg \max \_{g\in G}g(M\_{s})$$

The offer $g\_{L}$ is applied to the buyers in $M\_{R}$, i.e.: each buyer $i\in M\_{R}$ who said that $g\_{L}(i)\>0$ receives the offered allocation and pays $g\_{L}(i)$; each buyer in $M\_{R}$ who said that $g\_{L}(i)=0$ do not receive and do not pay anything. The offer $g\_{R}$ is applied to the buyers in $M\_{L}$ in a similar way.

### Profit-oracle scheme

*Profit oracle* is another RSM scheme that can be used in large markets. It is useful when we do not have direct access to agents' valuations (e.g. due to privacy reasons). All we can do is run an auction and watch its expected profit. In a single-item auction, where there are $n$ bidders, and for each bidder there are at most $K$ possible values (selected at random with unknown probabilities), the maximum-revenue auction can be learned using:

$$O(n^{2}K^{2})$$

calls to the oracle-profit.

## RSM in small markets

RSMs were also studied in a worst-case scenario in which the market is small. In such cases, we want to get an absolute, multiplicative approximation factor, that does not depend on the size of the market.

### Market-halving, digital goods

The first research in this setting was for a digital goods auction with Single-parameter utility.

For the Random-Sampling Optimal-Price mechanism, several increasingly better approximations have been calculated:

* By, the mechanism profit is at least 1/7600 of the optimal.
* By, the mechanism profit is at least 1/15 of the optimal.
* By, the mechanism profit is at least 1/4.68 of the optimal, and in most cases 1/4 of the optimal, which is tight.

### Single-sample, physical goods

When the agents' valuations satisfy some technical regularity condition (called monotone hazard rate), it is possible to attain a constant-factor approximation to the maximum-profit auction using the following mechanism:

* Sample a single random agent and query his value (the agents are assumed to have single-parameter utility).
* On the other agents, run a VCG auction with reserve-price determined by the sampled agent.

The profit of this mechanism is at least $n-1 \over 4n$, where $n$ is the number of agents. This is 1/8 when there are two agents, and grows towards 1/4 as the number of agents grows. This scheme can be generalized to handle constraints on the subsets of agents that can win simultaneously (e.g., there is only a finite number of items). It can also handle agents with different attributes (e.g. young vs. old bidders).

## Sample complexity

The sample complexity of a random-sampling mechanism is the number of agents it needs to sample in order to attain a reasonable approximation of the optimal welfare.

The results in imply several bounds on the sample-complexity of revenue-maximization of single-item auctions:

* For a $1/4$-approximation of the optimal expected revenue, the sample-complexity is $1$ - a single sample suffices. This is true even when the bidders are not i.i.d.
* For a $1-\epsilon $-approximation of the optimal expected revenue, when the bidders are i.i.d OR when there is an unlimited supply of items (digital goods), the sample-complexity is $O(1/\epsilon ^{2})$ when the agents' distributions have monotone hazard rate, and $O(1/\epsilon ^{3})$ when the agents' distributions are regular but do not have monotone-hazard-rate.

The situation becomes more complicated when the agents are not i.i.d (each agent's value is drawn from a different regular distribution) and the goods have limited supply. When the agents come from $k$ different distributions, the sample complexity of $1-\epsilon $-approximation of the optimal expected revenue in single-item auctions is:

* at most $O({k^{10} \over \epsilon ^{7}\ln ^{3}{k \over \epsilon })}$ - using a variant of the empirical Myerson auction.
* at least $\Omega ({k \over {\sqrt {\epsilon \ln k})}}$ (for monotone-hazard-rate regular valuations) and at least $\Omega ({k \over \epsilon })$ (for arbitrary regular valuations).

discuss arbitrary auctions with single-parameter utility agents (not only single-item auctions), and arbitrary auction-mechanisms (not only specific auctions). Based on known results about sample complexity, they show that the number of samples required to approximate the maximum-revenue auction from a given class of auctions is:

$$O{\bigg (}({H \over \epsilon })^{2}(D\ln({H \over \epsilon })+\ln({1 \over \delta })){\bigg )}$$

where:

* the agents' valuations are bounded in $\[1,H\]$,
* the pseudo-VC dimension of the class of auctions is at most $D$,
* the required approximation factor is $1-\epsilon $,
* the required success probability is $1-\delta $.

In particular, they consider a class of simple auctions called *$t$-level* auctions: auctions with $t$ reserve prices (a Vickrey auction with a single reserve price is a 1-level auction). They prove that the pseudo-VC-dimension of this class is $O(nt\ln(nt))$, which immediately translates to a bound on their generalization error and sample-complexity. They also prove bounds on the representation error of this class of auctions.

## Envy

A disadvantage of the random-sampling mechanism is that it is not envy-free. E.g., if the optimal prices in the two sub-markets $M\_{L}$ and $M\_{R}$ are different, then buyers in each sub-market are offered a different price. In other words, there is price discrimination. This is inevitable in the following sense: there is no single-price strategyproof auction that approximates the optimal profit.