text stringlengths 1 22.8M |
|---|
Khachik Babayan is an Iranian-Armenian violin player. He was a student of Manoug Parikian.
Life
Khachik Babayan was born in 1956 in Tabriz, Iran. He began to play the violin when he was four. At the age of seven, he began violin studies with his first violin teacher, Zaven Yedigarian. In 1972, he entered the Tehran Conservatory of Music.
In 1974, Babayan was awarded first place in the Iranian Violinists Competition and was offered a scholarship to study music in England. In 1975, when he began his musical studies at the Royal Academy of Music with Manoug Parikian. He graduated in violin performing with honors, and became an associate of The Royal College of Music in 1979. While living in England, he resided at 54 Sterndale Road, London, W 14.
On November 21, 2009, Babayan, accompanied by Serouj Kradjian, performed to a sold-out audience in his Canada Tribute concert at the Glenn Gould Studio. January 30, 2011, marks Babayan's début concert in the US at the First Baptist Church of Glendale in California.
References
21st-century Iranian musicians
Iranian people of Armenian descent
Living people
1956 births
Musicians from Tabriz
Alumni of the Royal Academy of Music
20th-century Iranian musicians |
Marcelle Karp, a.k.a. Betty Boob, (born 1964), is an American feminist writer, editor, and television director and producer.
Career
In 1993, Karp and Debbie Stoller produced the first issue of Bust, "The Magazine for Women With Something to Get Off Their Chests", now seen as one of the flagship publications of third-wave feminism, for mixing feminism with sexuality. Betty Boob was the name that Karp used in writing for the magazine (Stoller used Celina Hex). The two women met while working for Nickelodeon in New York City. They built a grassroots following, eventually distributing 100,000 copies of each issue. Her 1999 book with Stoller, "The Bust Guide to the New Girl Order", , is a collection of articles from that magazine. She was forced out of Bust in 2001.
After she left Bust, Karp began a career in broadcast as a Creative Director, working for BET, fuse, MSG, Lifetime, VH1. She continued to write for a various of publications including Sesame Street Workshop, Publishers Weekly and Covey Club. In 2012, she began produced the live stand-up show, Hello Giggles Presents at the Upright Citizen's Brigade Theatre, hosted by her daughter, Ruby Karp. It eventually became We Hope You Have Fun. Karp remains active as an activist, and spoke at Riot Fest in 2014. Her debut YA novel, Getting Over Max Cooper, will be out April 2022.
Personal life
Marcelle Karp is the mother of writer Ruby Karp. She married in 2000, shortly after her daughter's birth, then divorced in 2002.
References
External links
Getting it Off Her Chest - Womanrock.com e-interview with Karp about "The Bust Guide to the New Girl Order"
1964 births
Living people
American feminist writers
American women writers
American magazine founders
21st-century American women |
The 2018 African Judo Championships were the 39th edition of the African Judo Championships, organised by the African Judo Union. The events took place in Tunis, Tunisia from 12–15 April 2018.
Medal overview
Men
Women
Medal table
Participating nations
There were a total of 182 participants from 25 nations.
References
External links
African Judo Championships
Judo, African Championships
African Championships
Judo, 2018 African Championships
Judo, 2018 African Championships
Judo competitions in Tunisia
Judo, African Championships |
Sugar House Prison, previously the Utah Territorial Penitentiary, was a prison in the Sugar House neighborhood of Salt Lake City, Utah, United States. The prison housed more than 400 inmates. It was closed in 1951 due to encroaching housing development, and all of its inmates were moved to the new Utah State Prison in Draper. The site is now occupied by Sugar House Park and Highland High School.
History
Territorial prison
In January 1852 Territorial Assembly of the Utah Territory approved a memorial requesting Congress appropriate $70,000 for a territorial penitentiary. Congress approved an appropriation of $20,000 in March 1853 and plans were drawn up. The following October, territorial governor Brigham Young selected the government-owned site, then known as "The Big Field Survey", about six miles from central Salt Lake City. Sixteen "cozy cells dug into the ground, with iron bars on top" comprised the original prison at a cost of $32,000. The facility that became known as the Utah Territorial Penitentiary was opened in 1855. In 1867, the Utah Territorial Legislature determined that the prison was inadequate and once considered moving it onto an island in the Great Salt Lake. From 1871 to 1896, the penitentiary was federally operated by U.S. Marshals. The inmate capacity was expanded in 1875 to accommodate 300 individuals with the construction of a new cell house and prison walls.
State prison
In 1896, the buildings and surrounding lands were given to the newly created State of Utah and were designated as the Utah State Prison, sometimes referred to as the "state pen". Starting in 1900, executions by the state were carried out in the prison. Prior to that, death penalties were administered in the counties where the crimes had been committed. Tickets were distributed in 1903 for admission to publicly view an execution by firing squad.
With the continuing growth of Salt Lake City, the local residents eventually wanted the prison population relocated away from the neighborhood of Sugar House. In 1937, plans were approved for a new prison, 22 miles south of the city in Draper. By 1941, work began on the 1019-acre (408 ha) site, then called "Point of the Mountain", to replace the aging penitentiary. However, construction of the new facility was delayed because of shortages stemming from World War II. On March 12, 1951, the 575 inmates at the old prison were transferred by bus to the newly completed Utah State Prison. After nine sticks of dynamite had little effect on the heavy walls of the shuttered penitentiary, the demolition of many sections had to be carried out stone by stone.
City/County Park
Following the razing of the old prison, proposals to repurpose the land included an amusement park, campground, golf course, and shopping center. The former site eventually became Sugar House Park, jointly owned by Salt Lake City and Salt Lake County, while were set aside for the future campus of Highland High School.
Notable inmates
George Q. Cannon, early Mormon leader who was given a six-month sentence in September 1888 for "unlawful cohabitation" under the Edmunds Act.
John Deering, convicted murderer who was executed by firing squad in 1938 while hooked up to an electrocardiogram.
Joe Hill, convicted of murdering storekeeper John A. Morrison on circumstantial evidence; executed in 1915 at the prison despite attempts at intervention by President Woodrow Wilson.
See also
Capital punishment in Utah
List of Utah state prisons
Utah Department of Corrections
References
External links
Sugar House Park (official site)
Sugar House in the early 1900s (photos)
State Prison: Agency History at the Utah State Archives and Records Service
Utah Territorial Prison, Sugar House 1855-1951 at UtahRails.net
Government buildings completed in 1855
Infrastructure completed in 1855
Buildings and structures demolished in 1951
Buildings and structures in Salt Lake City
Defunct prisons in Utah
1855 establishments in Utah Territory
1951 disestablishments in Utah
Joe Hill (activist) |
Giuliano-Dalmata is the 31st of Rome, identified by the initials Q. XXXI. Its name refers to the Julian, Istrian and Dalmatian refugees that settled there in the postwar period.
History
Born in the 1930s as Villaggio Operaio E42, to house the workers employed in the construction of the World Expo 42, and abandoned during the Second World War, in the postwar period the borough remained uninhabited, until in 1947 twelve families of julian refugees settled in the area around the current Piazza Giuliani e Dalmati and renamed the settlement Villaggio Giuliano.
The official inauguration of the new district took place on 7 November 1948, when the old workers dormitories were restored and readjusted for residential use, and consigned to the refugees, in the presence of the then Secretary of the Council of Ministers Giulio Andreotti and of Mrs. De Gasperi, the wife of the then Prime Minister Alcide De Gasperi. During the ceremony, in the little chapel of the neighborhood it was celebrated the first wedding of the community, between Armando Chioggia, native of Fiume, and the Roman girl Fernanda Tombesi, symbolizing the union of the refugees with the local citizens.
In 1955, following to the coming of almost 2.000 refugees from Istria and Dalmatia, the quartiere took its current name.
Geography
The territory of the quarter includes the urban zone 12B Villaggio Giuliano and a great part of the urban zone 12E Cecchignola. In the district is also located a frazione of Rome, the only one that is not included in the Agro Romano, namely Castello della Cecchignola.
Boundaries
To the north, Giuliano-Dalmata borders with Quartiere Ardeatino (Q. XX), from which is separated by Via di Vigna Murata.
Eastward, the quartiere borders with Zona Cecchignola (Z. XXII), from which is separated by the stretch of Via Ardeatina between Via di Vigna Murata and Via della Cecchignola and by Via della Cecchignola itself.
To the south, it borders with Zona Castel di Leva (Z. XXIII), whose boundary is marked by a portion of the Grande Raccordo Anulare.
Westward, Giuliano-Dalmata borders with Zona Fonte Ostiense (Z. XXIV) and with Quartiere Europa (Q. XXII), the border being outlined by Via Laurentina.
Odonymy
The majority of the streets and squares are dedicated to prominent Julian, Istrian and Dalmatian personalities and to historical events that occurred to that geographical area, e.g. Largo Vittime delle Foibe Istriane, Largo Eccidio di Malga Bala (commemorating twelve policemen of the GNR killed in 1944 by slovene partisans on the Malga Bala plateau) or Parco Caduti per Trieste (commemorating people killed by the Anglo-American police during an irredentist turmoil on 5 and 6 November 1953).
The toponyms of the quartiere can be categorized as follows:
Astronomers, e.g. Via Andrea Argoli, Via Vincenzo Cerulli, Via Annibale De Gasparis, Via Luca Gaurico, Via Mentore Maggini, Via Giuseppe Piazzi, Via Annibale Riccò;
Julian, Istrian and Dalmatian personalities, e.g. Via Tommaso Arcidiacono, Via Gian Francesco Biondi, Via Elio Lampridio Cerva, Via Norma Cossetto, Via Giorgio da Sebenico, Via Francesco de Suppé, Via Roberto Ferruzzi, Via Marino Ghetaldi, Via Stefano Gradi, Via Fratelli Laurana (Luciano and Francesco), Via Antonio Maria Lorgna, Via Marco Marulo, Via Andrea Meldola, Via Adolfo Mussafia, Via Pier Alessandro Paravia, Via Domenico Ragnina, Via Federico Seismit-Doda, Via Oscar Sinigaglia, Via Antonio Smareglia, Via Antonio Tacconi, Via Roberto Visiani, Piazza Bernardo Zamagna;
Local names, e.g. Via del Casale Solaro, Piazza Castello della Cecchignola, Via della Cecchignola, Via della Cecchignoletta, Vicolo Colle della Strega, Via della Fonte Meravigliosa;
Military-related names near the Cecchignola Military City, e.g. Via degli Arditi, Via del Battaglione San Marco, Via Canzone del Piave, Largo dei Cappellani Militari, Piazza dei Carabinieri, Via dei Corazzieri, Via Divisione Folgore, Via Divisione Torino, Viale dell'Esercito, Via dei Paracadutisti;
Prominent women in the frazione of Castello della Cecchignola, e.g. Via Emanuela Loi, Via Linda Malnati, Via Margaret Mead, Via Beata Savina Petrilli, Via Vera Vassalle.
Places of interest
Churches
San Marco Evangelista in Agro Laurentino
Sante Perpetua e Felicita
San Giuseppe da Copertino
Santa Giovanna Antida Thouret
Sant'Anselmo alla Cecchignola
Museums
Archivio Museo Storico di Fiume
Museo Storico della Motorizzazione Militare
Other
Monument to the julian and dalmatian fallen, in Via Laurentina: it is a karstic rock coming from the WWI battlefields, bearing the coats of arms of Istria, Fiume, Trieste, Gorizia and Dalmatia
Monument to the victims of the Foibe massacres, in Largo Vittime delle Foibe Istriane
Vigna Murata water tower, in Via del Casale Solaro: it is a 120 meters tall surge tank, designed by Francesco Palpacelli in 1989
Cinema
The 1962 movie The Police Commissioner, by Alberto Sordi, was mainly shot in EUR and in Giuliano-Dalmata.
Part of the film Talcum Powder, by Carlo Verdone, was shot in Giuliano-Dalmata: the modern edifices of Via Elio Lampridio Cerva (Nadia's house), Via Veranzio (Rossella's house) and Piazza Bernardino Zamagna are recognizable. In a famous scene, the protagonist asks his wife where Via Lampridio Cerva is, being surprised by the unusual name.
The quarter has been the set of several other movies, such as 7 chili in 7 giorni, by Luca Verdone, starring Renato Pozzetto and Carlo Verdone, and Da grande, by Franco Amurri and starring Renato Pozzetto.
References
External links
The quartiere giuliano-dalmata |
Shebedino is a woreda in Southern Nations, Nationalities, and Peoples' Region, Ethiopia. Part of the Sidama Zone located in the Great Rift Valley, Shebedino is bordered on the south by Dale, on the west by Boricha, on the north by Awasa Zuria, on the east by Gorche, and on the southeast by Wensho. Towns in Shebedino include Leku. Boricha and Gorche woredas were separated from Shebedino woreda.
According to a 2004 report, Shebedino had 17 kilometers of asphalt roads, 50 kilometers of all-weather roads and 58 kilometers of dry-weather roads, for an average road density of 121 kilometers per 1000 square kilometers.
Demographics
Based on the 2007 Census conducted by the CSA, this woreda has a total population of 233,922, of whom 118,026 are men and 115,896 women; 11,831 or 5.06% of its population are urban dwellers. The majority of the inhabitants were Protestants, with 81.94% of the population reporting that belief, 8.61% were Muslim, 4.31% practiced Ethiopian Orthodox Christianity, and 2.75% were Catholic.
In the 1994 Census, this woreda had a population of 420,976, of whom 214,000 were men and 206,976 women; 10,669 or 2.53% of its population were urban dwellers. The four largest ethnic groups reported in Shebedino were the Sidama (91.43%), the Oromo (2.67%), the Amhara (2.3%), and the Welayta (2.16%); all other ethnic groups made up 1.44% of the population. Sidamo is spoken as a first language by 93.36% of the inhabitants, 2.25% speak Oromiffa, 2.13% Amharic, and 1.74% Welayta; the remaining 0.28% spoke all other primary languages reported. 61.74% of the population said they were Protestants, 15.46% were Muslim, 8.6% observed traditional religions, 6.24% embraced Catholicism, and 4.45% practiced Ethiopian Orthodox Christianity.
Notes
Districts of the Southern Nations, Nationalities, and Peoples' Region |
The Archaeological Museum of Veroia is one of the most important archaeological museums in Macedonia, Greece. The museum was established in 1965 in a building constructed especially for the purpose in Elia. Finds from the Palaeolithic to the Ottoman period are displayed in its three halls.
The Neolithic finds come from the settlement at Nea Nikomedeia, which is believed to be the oldest known permanent settlement in Europe. The Iron Age finds come from the cemetery of Vergina.
In the first hall are special showcases displaying a bronze kalpis or cinerary urn of the fourth century BC, a red-figure bell crater of the Kertsch type of the fourth century BC, and a bronze hydria kalpis used as a cinerary urn of the fourth century BC from the north-east cemetery of Veroia, and a reconstruction of a single-chambered rock-cut family tomb of the Hellenistic period, which was excavated in Veroia. Various other showcases display groups of finds from pit graves, cist graves, and rock-cut graves excavated in Veroia’s north-east, south-east, and south-west cemeteries. These groups illustrate the development of pottery and koroplastics from the end of the fifth to the end of the second century BC.
The second hall contains mainly grave stelai and Hellenistic and Roman reliefs of the first century BC from the Veroia area. Of particular note are the stela bearing the Gymnasiarch’s Law, which describes how middle and senior education was conducted in the Veroia Gymnasium, and the hunter-and-boar group, which is part of the sculptural decoration of a third-century BC grave monument from Vergina. The most notable of the stelai are those of Paterinos Antigonou and Adea Kassandrou.
The third hall contains exhibits of the Roman period, most notably an inscribed bust of the river god Olganos of the second century AD, which was found at Kopanos and is in excellent condition. There are also a grave relief of a husband and wife (second century AD), which was found in Veroia, burial offerings from a cist grave of the Roman period (third century AD), and terracotta figurines from an early Roman tomb.
Outside the museum are dozens of sarcophagi, grave stelai, and statues, the most impressive of all being a head of Medusa, a work of the second century BC, which must have been built into the north wall of the city.
During the years 2020-2021, the Archaeological Museum underwent significant structural renovations on the main building, as well as in the garden. The artefacts that were located in the garden, were placed on a newly built wall for better view from the citizens and visitors of the city.
References
Sources
External links
Museums of Macedonia
Greek Ministry of Culture site
Veroia
Buildings and structures in Veria |
```python
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
"""Unit tests for printing.py."""
import StringIO
import optparse
import sys
import time
import unittest
from webkitpy.common.host_mock import MockHost
from webkitpy.common.system import logtesting
from webkitpy.layout_tests import port
from webkitpy.layout_tests.controllers import manager
from webkitpy.layout_tests.models import test_expectations
from webkitpy.layout_tests.models import test_failures
from webkitpy.layout_tests.models import test_results
from webkitpy.layout_tests.views import printing
def get_options(args):
print_options = printing.print_options()
option_parser = optparse.OptionParser(option_list=print_options)
return option_parser.parse_args(args)
class TestUtilityFunctions(unittest.TestCase):
def test_print_options(self):
options, args = get_options([])
self.assertIsNotNone(options)
class FakeRunResults(object):
def __init__(self, total=1, expected=1, unexpected=0, fake_results=None):
fake_results = fake_results or []
self.total = total
self.expected = expected
self.expected_failures = 0
self.unexpected = unexpected
self.expected_skips = 0
self.results_by_name = {}
total_run_time = 0
for result in fake_results:
self.results_by_name[result.shard_name] = result
total_run_time += result.total_run_time
self.run_time = total_run_time + 1
class FakeShard(object):
def __init__(self, shard_name, total_run_time):
self.shard_name = shard_name
self.total_run_time = total_run_time
class Testprinter(unittest.TestCase):
def assertEmpty(self, stream):
self.assertFalse(stream.getvalue())
def assertNotEmpty(self, stream):
self.assertTrue(stream.getvalue())
def assertWritten(self, stream, contents):
self.assertEqual(stream.buflist, contents)
def reset(self, stream):
stream.buflist = []
stream.buf = ''
def get_printer(self, args=None):
args = args or []
printing_options = printing.print_options()
option_parser = optparse.OptionParser(option_list=printing_options)
options, args = option_parser.parse_args(args)
host = MockHost()
self._port = host.port_factory.get('test', options)
nproc = 2
regular_output = StringIO.StringIO()
printer = printing.Printer(self._port, options, regular_output)
return printer, regular_output
def get_result(self, test_name, result_type=test_expectations.PASS, run_time=0):
failures = []
if result_type == test_expectations.TIMEOUT:
failures = [test_failures.FailureTimeout()]
elif result_type == test_expectations.CRASH:
failures = [test_failures.FailureCrash()]
return test_results.TestResult(test_name, failures=failures, test_run_time=run_time)
def test_configure_and_cleanup(self):
# This test verifies that calling cleanup repeatedly and deleting
# the object is safe.
printer, err = self.get_printer()
printer.cleanup()
printer.cleanup()
printer = None
def test_print_config(self):
printer, err = self.get_printer()
# FIXME: it's lame that i have to set these options directly.
printer._options.pixel_tests = True
printer._options.new_baseline = True
printer._options.time_out_ms = 6000
printer._options.slow_time_out_ms = 12000
printer.print_config('/tmp')
self.assertIn("Using port 'test-mac-leopard'", err.getvalue())
self.assertIn('Test configuration: <leopard, x86, release>', err.getvalue())
self.assertIn('View the test results at file:///tmp', err.getvalue())
self.assertIn('View the archived results dashboard at file:///tmp', err.getvalue())
self.assertIn('Baseline search path: test-mac-leopard -> test-mac-snowleopard -> generic', err.getvalue())
self.assertIn('Using Release build', err.getvalue())
self.assertIn('Pixel tests enabled', err.getvalue())
self.assertIn('Command line:', err.getvalue())
self.assertIn('Regular timeout: ', err.getvalue())
self.reset(err)
printer._options.quiet = True
printer.print_config('/tmp')
self.assertNotIn('Baseline search path: test-mac-leopard -> test-mac-snowleopard -> generic', err.getvalue())
def test_print_directory_timings(self):
printer, err = self.get_printer()
printer._options.debug_rwt_logging = True
run_results = FakeRunResults()
run_results.results_by_name = {
"slowShard": FakeShard("slowShard", 16),
"borderlineShard": FakeShard("borderlineShard", 15),
"fastShard": FakeShard("fastShard", 1),
}
printer._print_directory_timings(run_results)
self.assertWritten(err, ['Time to process slowest subdirectories:\n', ' slowShard took 16.0 seconds to run 1 tests.\n', '\n'])
printer, err = self.get_printer()
printer._options.debug_rwt_logging = True
run_results.results_by_name = {
"borderlineShard": FakeShard("borderlineShard", 15),
"fastShard": FakeShard("fastShard", 1),
}
printer._print_directory_timings(run_results)
self.assertWritten(err, [])
def test_print_one_line_summary(self):
def run_test(total, exp, unexp, shards, result):
printer, err = self.get_printer(['--timing'] if shards else None)
fake_results = FakeRunResults(total, exp, unexp, shards)
total_time = fake_results.run_time + 1
printer._print_one_line_summary(total_time, fake_results)
self.assertWritten(err, result)
# Without times:
run_test(1, 1, 0, [], ["The test ran as expected.\n", "\n"])
run_test(2, 1, 1, [], ["\n", "1 test ran as expected, 1 didn't:\n", "\n"])
run_test(3, 2, 1, [], ["\n", "2 tests ran as expected, 1 didn't:\n", "\n"])
run_test(3, 2, 0, [], ["\n", "2 tests ran as expected (1 didn't run).\n", "\n"])
# With times:
fake_shards = [FakeShard("foo", 1), FakeShard("bar", 2)]
run_test(1, 1, 0, fake_shards, ["The test ran as expected in 5.00s (2.00s in rwt, 1x).\n", "\n"])
run_test(2, 1, 1, fake_shards, ["\n", "1 test ran as expected, 1 didn't in 5.00s (2.00s in rwt, 1x):\n", "\n"])
run_test(3, 2, 1, fake_shards, ["\n", "2 tests ran as expected, 1 didn't in 5.00s (2.00s in rwt, 1x):\n", "\n"])
run_test(3, 2, 0, fake_shards, ["\n", "2 tests ran as expected (1 didn't run) in 5.00s (2.00s in rwt, 1x).\n", "\n"])
def test_test_status_line(self):
printer, _ = self.get_printer()
printer._meter.number_of_columns = lambda: 80
actual = printer._test_status_line('fast/dom/HTMLFormElement/associated-elements-after-index-assertion-fail1.html', ' passed')
self.assertEqual(80, len(actual))
self.assertEqual(actual, '[0/0] fast/dom/HTMLFormElement/associa...after-index-assertion-fail1.html passed')
printer._meter.number_of_columns = lambda: 89
actual = printer._test_status_line('fast/dom/HTMLFormElement/associated-elements-after-index-assertion-fail1.html', ' passed')
self.assertEqual(89, len(actual))
self.assertEqual(actual, '[0/0] fast/dom/HTMLFormElement/associated-...ents-after-index-assertion-fail1.html passed')
printer._meter.number_of_columns = lambda: sys.maxint
actual = printer._test_status_line('fast/dom/HTMLFormElement/associated-elements-after-index-assertion-fail1.html', ' passed')
self.assertEqual(90, len(actual))
self.assertEqual(actual, '[0/0] fast/dom/HTMLFormElement/associated-elements-after-index-assertion-fail1.html passed')
printer._meter.number_of_columns = lambda: 18
actual = printer._test_status_line('fast/dom/HTMLFormElement/associated-elements-after-index-assertion-fail1.html', ' passed')
self.assertEqual(18, len(actual))
self.assertEqual(actual, '[0/0] f...l passed')
printer._meter.number_of_columns = lambda: 10
actual = printer._test_status_line('fast/dom/HTMLFormElement/associated-elements-after-index-assertion-fail1.html', ' passed')
self.assertEqual(actual, '[0/0] associated-elements-after-index-assertion-fail1.html passed')
def test_details(self):
printer, err = self.get_printer(['--details'])
result = self.get_result('passes/image.html')
printer.print_started_test('passes/image.html')
printer.print_finished_test(result, expected=False, exp_str='', got_str='')
self.assertNotEmpty(err)
def test_print_found(self):
printer, err = self.get_printer()
printer.print_found(100, 10, 1, 1)
self.assertWritten(err, ["Found 100 tests; running 10, skipping 90.\n"])
self.reset(err)
printer.print_found(100, 10, 2, 3)
self.assertWritten(err, ["Found 100 tests; running 10 (6 times each: --repeat-each=2 --iterations=3), skipping 90.\n"])
def test_debug_rwt_logging_is_throttled(self):
printer, err = self.get_printer(['--debug-rwt-logging'])
result = self.get_result('passes/image.html')
printer.print_started_test('passes/image.html')
printer.print_finished_test(result, expected=True, exp_str='', got_str='')
printer.print_started_test('passes/text.html')
result = self.get_result('passes/text.html')
printer.print_finished_test(result, expected=True, exp_str='', got_str='')
# Only the first test's start should be printed.
lines = err.buflist
self.assertEqual(len(lines), 1)
self.assertTrue(lines[0].endswith('passes/image.html\n'))
``` |
Pražského povstání () is a Prague Metro station on Line C. It is located below Náměstí Hrdinů in the neighbourhood of Pankrác (part of Nusle). The station was opened on 9 May 1974 with the first section of Prague Metro, between Sokolovská and Kačerov.
The station is a sub-surface type with a straight ceiling and depth of the platform under ground level. Its name literally means [station of the] Prague Uprising.
References
Prague Metro stations
Railway stations opened in 1974
1974 establishments in Czechoslovakia
Railway stations in the Czech Republic opened in the 20th century |
Sitnica is a village in the administrative district of Gmina Dobiegniew, within Strzelce-Drezdenko County, Lubusz Voivodeship, in western Poland. It lies approximately north-east of Dobiegniew, north-east of Strzelce Krajeńskie, and north-east of Gorzów Wielkopolski.
References
Sitnica |
```shell
Test disk speed with `dd`
Changing the `/tmp` cleanup frequency
Fixing `locale` issues in Debian systems
Get hardware stack details with `lspci`
Cancel a system shutdown
``` |
Frank Dean Butler (July 18, 1860 – July 18, 1945), was a professional baseball player who played outfielder in the Major Leagues.
External links
1860 births
1945 deaths
Major League Baseball outfielders
New York Giants (NL) players
19th-century baseball players
Macon Central City players
Atlanta Atlantas players
Memphis Giants players
Savannah Modocs players
Scranton Coal Heavers players
Nashville Seraphs players
Columbus Buckeyes (minor league) players
Columbus Senators players
Grand Rapids Furnituremakers players
Baseball players from Savannah, Georgia |
Bu ol Araz (, also Romanized as Bū ol ‘Araẕ and Bowl‘arz) is a village in Behnamarab-e Jonubi Rural District, Javadabad District, Varamin County, Tehran Province, Iran. At the 2006 census, its population was 19, in 5 families.
References
Populated places in Varamin County |
U.S. Highway 61 (US 61) is a U.S. Highway in southeast and east-central Minnesota, which runs from the Mississippi River Bridge at La Crescent and continues north to its northern terminus at its junction with Interstate 35 (I-35) at the city of Wyoming.
US 61 in Minnesota is in length. The highway connects the cities of La Crescent, Winona, Wabasha, Lake City, Red Wing, Hastings, Cottage Grove, Saint Paul, Forest Lake, and Wyoming.
Route description
US 61 enters the state of Minnesota at the city of La Crescent on the River Bridge over the Mississippi River between the cities of La Crosse and La Crescent. US 61 runs concurrently with US 14 and State Highway 16 (MN 16) as it enters the state. The four-lane divided highway continues north through La Crescent. US 61 follows the Mississippi River through southeast Minnesota; through the cities of Winona, Wabasha, Lake City, and Red Wing.
US 61 is a two-lane roadway between Wabasha and Red Wing. US 61 crosses the Mississippi River at Hastings over the new Hastings Bridge and joins US 10 at Cottage Grove. US 61 and US 10 run concurrently as a freeway between Cottage Grove and the city of Saint Paul. Within the city of Saint Paul, US 61 follows I-94 for a short distance, and then follows Mounds Boulevard, East 7th Street, and Arcade Street through the east side of St. Paul.
US 61 then proceeds north to Maplewood, where it becomes a four-lane highway named Maplewood Drive to White Bear Lake. Between I-694 and the central business district of White Bear Lake, the road serves one of the Twin Cities region's major car dealership areas. After leaving White Bear Lake, US 61 is a two-lane roadway again to Forest Lake and then to its northern terminus at the city of Wyoming. US 61 closely parallels I-35E and I-35 from Saint Paul to Wyoming.
Approximately of US 61 from La Crescent to Cottage Grove in southeast Minnesota is officially designated the Disabled American Veterans Highway. Legally, the Minnesota section of US 61 is defined as unmarked legislative routes 3, 104, 102 and 1 in the Minnesota Statutes. US 61 is not marked with these legislative numbers along the actual highway.
History
US 61 in Minnesota is an original U.S. Highway, established on November 26, 1926. It originally extended north to the Canadian border at Grand Portage, but it was cut back to its present terminus in 1991. The portion between Duluth and Grand Portage is now MN 61. Segments of the old alignment that parallel MN 61 and I-35 have been designated County Road 61 (CR 61).
In 1929, the only unpaved portions were from Hastings to Wabasha and from Winona to the Wisconsin state line. It was completely paved by 1940.
The expressway sections south of Wabasha were built in the 1960s and the 1970s. The four lane divided highway section between Red Wing and MN 316 near Miesville was completed in 1997. The freeway section of US 61 between Cottage Grove and I-494 at Newport was completed in 2007.
The US 61 Hastings High Bridge received considerable attention from increased bridge inspections in 2008 following the August 1, 2007, I-35W Bridge collapse in nearby Minneapolis. The Hastings High Bridge, a steel arch structure built in 1951, was structurally deficient and shows considerable deterioration. It was also a notorious traffic bottleneck because it had only one lane each way and discharged southbound US 61 traffic into downtown Hastings. The old Hastings bridge was replaced in 2013.
Major intersections
See also
Highway 61 Revisited (song) and album
Further reading
References
External links
61
Minnesota
061
U.S. Route 61
U.S. Route 61
U.S. Route 61
U.S. Route 61
U.S. Route 61
U.S. Route 61
U.S. Route 61
U.S. Route 61 |
Palaeozygopleuridae is an extinct taxonomic family of fossil sea snails, marine gastropod molluscs.
This family has no subfamilies.
Genera
Genera within the family Palaeozygopleuridae include:
Palaeozygopleura Horný, 1955
Palaeozygopleura chlupaci Frýda, 1993 - from early Lochkovian
Palaeozygopleura vaneki Frýda, Ferrová, Berkyová & Frýdová, 2008
subgenus Palaeozygopleura (Palaeozygopleura) Horný, 1955
Palaeozygopleura alinae (Perner, 1907) - synonym: Zygopleura alinae Perner, 1907 - type species
Palaeozygopleura vesna Horný, 1955
subgenus Palaeozygopleura (Palaeozyga) Horný, 1955
Palaeozygopleura bohemica Horný, 1955
subgenus Palaeozygopleura (Bojozyga) Horný, 1955
subgenus Palaeozygopleura (Bohemozyga) Frýda & Bandel, 1997
Palaeozygopleura kettneri (Horný, 1955)
subgenus Palaeozygopleura (Rhenozyga)
Palaeozygopleura reifenstuhli Frýda & Blodgett, 2004
Devonozyga Horný, 1955
Pragozyga Frýda, 1999
Pragozyga costata Frýda, 1999
Medfrazyga Frýda & Blodgett, 2004 - from Silurian
Medfrazyga clauticae Frýda & Blodgett, 2004
References |
Wielkie Drogi is a village in the administrative district of Gmina Skawina, within Kraków County, Lesser Poland Voivodeship, in southern Poland. It lies approximately west of Skawina and south-west of the regional capital Kraków.
References
Wielkie Drogi |
Diaethria anna, also known as Anna's eighty-eight or Finita Burrasca , is a butterfly in wet tropical forests in Middle America. On rare occasions, it can be found as a stray in south Texas. Its upperside is dark brown with a metallic bluish-green band on the forewings. The underside of the forewings are red, which is followed by a wide, black band and then white tips; the underside of the hindwings is white, with lines that approximate a black-outlined "88", giving the species its common name. Its markings occasionally appear more like of "98" or "89".
The caterpillars feed on tropical plants in the families Ulmaceae and Sapindaceae. Adults feed on rotting fruit and dung.
Subspecies are:
Diaethria anna anna
Diaethria anna salvadorensis
References
Species Detail: Anna's Eighty-eight. Butterflies and Moths of North America
Biblidinae
Butterflies described in 1844
Butterflies of North America
Nymphalidae of South America |
Al Madan District () is a district of the 'Amran Governorate, Yemen. As of 2003, the district had a population of 26,955 inhabitants.
References
Districts of 'Amran Governorate
Al Madan District |
Vireux-Wallerand is a commune in the Ardennes department and Grand Est region of north-eastern France.
Population
See also
Communes of the Ardennes department
References
Ardennes communes articles needing translation from French Wikipedia
Communes of Ardennes (department) |
Samuel Lambeth White (August 23, 1893 – November 11, 1929) was an English born Major League Baseball player. White played in only one game, for the Boston Braves in the 1919 season; he went 0 for 1. He batted left-handed and threw right-handed.
White was born in Kinsley, England, and died in Philadelphia, Pennsylvania, where he was interred in Cedar Hill Cemetery.
External links
1893 births
1929 deaths
People from the City of Wakefield
Major League Baseball catchers
Boston Braves players
Major League Baseball players from the United Kingdom
Major League Baseball players from England
English baseball players
Sportspeople from Yorkshire |
The 2005 FIBA Europe Under-16 Championship was the 19th edition of the FIBA Europe Under-16 Championship. The city of León, in Spain, hosted the tournament. Turkey won the trophy for the second time. Poland and Belgium were relegated to Division B.
Teams
Preliminary round
Group A
Group B
Group C
Group D
Classification round
Group G
Group H
Quarterfinals round
Group E
Group F
Knockout stage
13th–16th playoffs
Poland and Belgium were relegated to Division B.
9th–12th playoffs
5th–8th playoffs
Championship
Final standings
References
FIBA Archive
FIBA Europe Archive
2005
2005–06 in European basketball
2005–06 in Spanish basketball
International youth basketball competitions hosted by Spain |
Nacer Abdellah (born 3 March 1966 in Sidi Slimane) is a retired Moroccan football player. Abdellah started his career in Belgium with KV Mechelen, and played most of his career for Belgian teams. He also made 24 appearances for the Morocco, and played at the 1994 FIFA World Cup in the matches against Belgium and Saudi Arabia.
Just before the 1994 World Cup in the U.S., a statement of Nacer Abdellah lead to controversy. Abdellah said that his former teammate at Cercle Brugge, the Belgian Josip Weber wouldn't score during the tournament.
References
Cerclemuseum.be
1966 births
Living people
1994 FIFA World Cup players
Belgian Pro League players
CD Ourense footballers
Cercle Brugge K.S.V. players
Expatriate men's footballers in Belgium
Expatriate men's footballers in the Netherlands
Expatriate men's footballers in Spain
FC Den Bosch players
SC Telstar players
Moroccan men's footballers
Moroccan expatriate sportspeople in Belgium
Moroccan expatriate sportspeople in Spain
Moroccan expatriate sportspeople in the Netherlands
Morocco men's international footballers
K.V. Mechelen players
Men's association football defenders
People from Sidi Slimane
KAC Marrakech players
K.F.C. Lommel S.K. players |
The armies of the Rus' principalities emerged in the 13th century out of the military of Kievan Rus', shattered by the Mongol invasion of Kievan Rus'. The princely Rus' armies from 1240 to 1550 were characterised by feudalism, consisting of cavalry armies of noble militia and their armed servants.
Before the Mongol invasion
Before Mongol invasion of Kievan Rus' in the 13th century, a Rus' prince would be accompanied by his druzhina, a small retinue of heavy cavalry, who would often fight dismounted (eq. Battle on the Ice). Massively heavy armor was used, mostly Scandinavian-style. However, these squads, as a rule, did not exceed the number of several hundred men, and were unsuitable for united actions under a single command.
At the same time, the main part of the Kievan Rus' army was the militia infantry. It was inferior to Druzhina in armament and the ability to own it. The militia used axes and hunting spears ("rogatina"). Swords were rarely used, and they had no armor other than plain clothes and fur hats.
For the infantry, consisted of poorly armed peasants and tradesmen, numbers are uncertain. The only specific numbers mentioned for the Rus are 1,700 men of Evpaty Kolovrat (The Tale of the Destruction of Ryazan) and 3,000, men under Voivode Dorozh (Battle of the Sit River). However, these were exceptionally large numbers for Rus standards at the time. In 1242, Prince Alexander Nevski in Novgorod could muster no more than 1,000 Druzhina and 2,000 militia for the Battle on the Ice.
Feudal fragmentation
After Mongol invasion of Kievan Rus' many independent principalities were destroyed. Remaining petty states were under growing pressure from Tatars, Sweden and Lithuania. Constant warfare precipitated the development of feudalism, and diminished the importance of the Veche. The feudal militia, raised by the Boyars-landowners and individual princes, came to replace popular militia. Princes (except in the Novgorod Republic) gathered and commanded the army.
In the second half of the 14th century, Druzhina was replaced by feudally organized units headed by Boyars or dependent Princes, and these units consisted of landed gentry (so called "Boyar's children" or "service people") and their armed servants ("military slaves"). In the 15th century, such organization of detachments replaced the city regiments.
Tactics and equipment
During the period of the Mongol invasions, the Rus adopted much of Mongol military tactics and organization. While militia infantry still existed, they were, from XIV onward, mostly armed with ranged weapons, and delegated auxiliary duties, such as defending cities. The chronicles describe the Muscovites using arquebuses against the Tatars in 1480. The men shooting these weapons were the forerunners of the Streltsy.
The bulk of the army were mounted archers, who included Boyars, landed gentry ("Boyars' children") and armed slaves.
Under Tatar influence, the mail and lamellar armour of Kievan Rus' was replaced with brigandine ("Kuyak"), mail and plate ("Behterets") and mirror armour("Zertsalo"), while poor noblemen and armed serfs wore long aketons ("Tyegilyai").
Military of Novgorod
Landed Army of Muscovy
In the 15th century, the Grand Duchy of Moscow gradually conquered and annexed the northeastern Rus' principalities. This process is associated with reforming the Muscovite army, as new princedoms were absorbed, courts of independent princes were dismissed, and "service people" passed to the grand duke. As a result, the vassal princes and boyars were transformed into state servants, who received estates for service in conditional holding (less often - in fiefdom). Thus, the "Landed Army" () was formed, the bulk of which were noblemen and "boyar's children", with their armed slaves. This army organization would remain unchanged till 1550 (military reforms of Ivan the Terrible).
In the process of Muscovite state-building, the people's militia was abolished. The prince called the masses to military service only in the event of serious military danger, regulating the extent and nature of this service at his own discretion.
Gallery
References
Bibliography
Military history of Russia
Russia
Mongol invasion of Kievan Rus'
Military history of Belarus
Military history of Ukraine |
Glyphipterix gonoteles is a species of sedge moth in the genus Glyphipterix. It was described by Edward Meyrick in 1907. It is found in Australia, including Victoria and Tasmania.
References
Moths described in 1907
Glyphipterigidae
Moths of Australia |
Aden is an unincorporated community in Prince William County, Virginia, United States. The town is centered at the intersection of Aden Road and Fleetwood Drive approximately four miles due south of Manassas Airport. Aden does not have the characteristics of a distinct town entity, but one building on the northern corner bears the name "Aden Grocery". The only other building near the intersection is a single residential home.
Effingham was added to the National Register of Historic Places in 1989.
References
Unincorporated communities in Prince William County, Virginia |
The following highways are numbered 72:
International
Asian Highway 72
European route E72
Australia
Snowy Mountains Highway
Canada
Alberta Highway 72
Newfoundland and Labrador Route 72
Highway 72 (Ontario)
China
G72 Expressway
Iran
Road 72
Italy
State road 72
Korea, South
National Route 72
New Zealand
Inland Scenic Route
United States
Interstate 72
U.S. Route 72
Alabama State Route 72
Arizona State Route 72
Arkansas Highway 72
California State Route 72
Colorado State Highway 72
Connecticut Route 72
Delaware Route 72
Florida State Road 72
Georgia State Route 72
Georgia State Route 72 (1930–1941) (former)
Hawaii Route 72
Idaho State Highway 72
Illinois Route 72
Kentucky Route 72
Louisiana Highway 72
Louisiana State Route 72 (former)
Maryland Route 72 (former)
M-72 (Michigan highway)
Minnesota State Highway 72
County Road 72 (Ramsey County, Minnesota)
Missouri Route 72
Montana Highway 72
Nebraska Highway 72 (former)
Nevada State Route 72 (former)
New Jersey Route 72
County Route 72 (Bergen County, New Jersey)
County Route 72 (Ocean County, New Jersey)
New Mexico State Road 72
New York State Route 72
County Route 72 (Cattaraugus County, New York)
County Route 72 (Chautauqua County, New York)
County Route 72 (Dutchess County, New York)
County Route 72 (Essex County, New York)
County Route 72 (Jefferson County, New York)
County Route 72 (Livingston County, New York)
County Route 72 (Madison County, New York)
County Route 72 (Montgomery County, New York)
County Route 72 (Orange County, New York)
County Route 72 (Putnam County, New York)
County Route 72 (Rockland County, New York)
County Route 72 (Suffolk County, New York)
North Carolina Highway 72
Ohio State Route 72
Oklahoma State Highway 72
Oklahoma State Highway 72 (1930s) (former)
Pennsylvania Route 72
South Carolina Highway 72
Tennessee State Route 72
Texas State Highway 72
Texas State Highway Spur 72
Farm to Market Road 72
Texas Park Road 72
Utah State Route 72
Virginia State Route 72
West Virginia Route 72
Wisconsin Highway 72
Wyoming Highway 72
Territories
U.S. Virgin Islands Highway 72
See also
List of highways numbered 72A
A72 (disambiguation) |
```python
import math
import pytest
from vyper.compiler import compile_code
from vyper.exceptions import InvalidType, OverflowException
VALID_BITS = list(range(8, 257, 8))
@pytest.mark.parametrize("bits", VALID_BITS)
def test_mkstr(get_contract, bits):
n_digits = math.ceil(bits * math.log(2) / math.log(10))
code = f"""
@external
def foo(inp: uint{bits}) -> String[{n_digits}]:
return uint2str(inp)
"""
c = get_contract(code)
for i in [1, 2, 2**bits - 1, 0]:
assert c.foo(i) == str(i), (i, c.foo(i))
# test for buffer overflow
@pytest.mark.parametrize("bits", VALID_BITS)
def test_mkstr_buffer(get_contract, bits):
n_digits = math.ceil(bits * math.log(2) / math.log(10))
code = f"""
some_string: String[{n_digits}]
@internal
def _foo(x: uint{bits}):
self.some_string = uint2str(x)
@external
def foo(x: uint{bits}) -> uint256:
y: uint256 = 0
self._foo(x)
return y
"""
c = get_contract(code)
assert c.foo(2**bits - 1) == 0, bits
def test_bignum_throws():
code = """
@external
def test():
a: String[78] = uint2str(2**256)
pass
"""
with pytest.raises(OverflowException):
compile_code(code)
def test_int_fails():
code = """
@external
def test():
a: String[78] = uint2str(-1)
pass
"""
with pytest.raises(InvalidType):
compile_code(code)
``` |
Christina Elisabeth Östberg (born 10 May 1968) is a Swedish politician and a member of the Riksdag for the Sweden Democrats party. She was first elected in 2014 and has served on the Social Affairs Committee and Education Committee in parliament. In parliament, Östberg has called for tougher laws against substance and drug abuse.
References
Living people
1968 births
Members of the Riksdag 2014–2018
Members of the Riksdag 2018–2022
Members of the Riksdag from the Sweden Democrats
21st-century Swedish politicians |
The 2012–13 Cypriot First Division was the 74th season of the Cypriot top-level football league. It began on 1 September 2012 and ended on 19 May 2013. AEL Limassol were the defending champions. APOEL won the championship two matchweeks before the end of the season.
The league comprise eleven teams from the 2011–12 season and three promoted teams from the 2011–12 Second Division.
Teams
Ermis Aradippou and Anagennisi Dherynia were relegated at the end of the first stage of the 2011–12 season after finishing in the bottom two places of the table. They were joined by Aris Limassol, who finished at the bottom of the second-phase Group C.
The relegated teams were replaced by 2011–12 Second Division champions Doxa Katokopias, runners-up Ayia Napa and third-placed team AEP Paphos.
Personnel and kits
Note: Flags indicate national team as has been defined under FIFA eligibility rules. Players and Managers may hold more than one non-FIFA nationality.
Managerial changes
First phase
League table
Results
Second round
Group A
Table
Results
Group B
Table
Results
Group C
Table
Results
Relegation play-offs
The 11th-placed team Nea Salamina faced 4th-placed 2012–13 Cypriot Second Division side Anagennisi Dherynia, in a single-legged play-off for one spot in the 2013–14 Cypriot First Division. The match was held at Antonis Papadopoulos Stadium on 23 May 2013 and Nea Salamina won by 3–0, retaining its Cypriot First Division spot for the 2013–14 season.
Season statistics
Top scorers
Including matches played on 19 May 2013; Source: Cyprus Football Association
Hat-tricks
Scoring
First goal of the season: 25 minutes – Juliano Spadacio (Anorthosis) against AEP Paphos (19:25 EET, 1 September 2012)
Fastest goal of the season: 15 seconds – Mario Budimir (APOEL) against Alki (22 September 2012)
Latest goal of the season: 102 minutes and 23 seconds – Jan Rezek (Anorthosis) against Omonia (21 October 2012)
First own goal of the season: 49 minutes – Fabeta (Ayia Napa) for Omonia (20:04 EET, 2 September 2012)
First scored penalty kick of the season: 84 minutes – Freddy (Omonia) against Ayia Napa (20:39 EET, 2 September 2012)
Most scored goals in a single fixture – 38 goals (Fixture 26)
Fixture 26 results: Enosis 1–2 AEL, AEP Paphos 0–5 Olympiakos, Omonia 6–0 Nea Salamina, Alki 6–5 Ethnikos, Apollon 2–1 Ayia Napa, Doxa 2–6 AEK, Anorthosis 0–2 APOEL.
Highest scoring game: 11 goals
Alki 6–5 Ethnikos (30 March 2013)
Largest winning margin: 6 goals
APOEL 6–0 AEP Paphos (17 March 2013)
Omonia 6–0 Nea Salamina (30 March 2013)
Most goals scored in a match by a single team: 6 goals
APOEL 6–0 AEP Paphos (17 March 2013)
Omonia 6–0 Nea Salamina (30 March 2013)
Alki 6–5 Ethnikos (30 March 2013)
Doxa 2–6 AEK (31 March 2013)
Most goals scored by a losing team: 5 goals
Alki 6–5 Ethnikos (30 March 2013)
Discipline
First yellow card of the season: Gora Tall for AEP Paphos against Anorthosis, 15 minutes (19:15 EET, 1 September 2012)
First red card of the season: Kyriacos Polykarpou for Olympiakos against Nea Salamina, 37 minutes (20:37 EET, 1 September 2012)
Most yellow cards in a single match: 13
Anorthosis 1–1 AEL – 6 for Anorthosis (Dan Alexa, Paulo Jorge, Valentinos Sielis (2), Jurgen Colin, Giannis Skopelitis) and 7 for AEL (Dosa Júnior, Marco Airosa, Luciano Bebê, Carlitos, Dédé (2), Ebo Andoh) (1 December 2012)
Most red cards in a single match: 3
AEL 3–2 Apollon – 1 for AEL (Edwin Ouon) and 2 for Apollon (Sebastián Setti, Giorgos Vasiliou) (5 January 2013)
References
Sources
Cypriot First Division seasons
Cyprus
1 |
Miss Colombia 1993, the 59th Miss Colombia pageant, was held in the Centro de Convenciones Cartagena de Indias, located in Cartagena de Indias, Bolívar Department, Colombia.
Results
Placements
Special awards
Most Beautiful Hair- Valle Diana Isabel Romero
Reina de la policia - Meta Norma Herrera Leal
Best Regional Costume - Valle Diana Isabel Romero
Miss Congeniality - Cesar Cecilia Fernández Angarita
Delegates
30 delegates were selected to compete.
References
External links
Official site
Miss Colombia
1993 in Colombia
1993 beauty pageants |
Pepemkay is an extinct genus of lissoberycine trachichthyid fish in prehistoric North America.
The prehistoric ray-finned fish genus contains a single species, Pepemkay maya.
Fossil record
Pepemkay maya is known from fossils in the Sierra Madre Formation, from the Cenomanian stage during the Late Cretaceous epoch.
The geologic formation is located in Chiapas state of southwestern Mexico.
See also
References
Prehistoric ray-finned fish genera
Cretaceous Mexico
Fossils of Mexico
Late Cretaceous fish of North America
Natural history of Chiapas
Trachichthyidae
Cenomanian life
Fossil taxa described in 2013 |
Silvanus imitatus, is a species of silvan flat bark beetle found in India and Sri Lanka.
Description
Average length is about 2.41 mm. Body elongated, and moderately depressed. Dorsum uniformly reddish brown in color and covered with short,
semierect, golden pubescence. Eyes large and temple short. Antenna long and slender, with large scape and narrow pedicel. Prothorax convex, and almost equal in length and breadth. Prothorax generally broader, excluding anterior spines. Puncturation on head and pronotum are slightly coarser. Lateral margins of elytra are more distinctly wavy at middle. Scutellum large, transverse and pubescent.
References
Silvanidae
Insects of Sri Lanka
Insects of India
Insects described in 1977 |
```go
/*
*/
package queryutil
import (
"fmt"
"github.com/hyperledger/fabric-protos-go/ledger/queryresult"
commonledger "github.com/hyperledger/fabric/common/ledger"
"github.com/hyperledger/fabric/core/ledger/kvledger/txmgmt/statedb"
)
type itrCombiner struct {
namespace string
holders []*itrHolder
}
func newItrCombiner(namespace string, baseIterators []statedb.ResultsIterator) (*itrCombiner, error) {
var holders []*itrHolder
for _, itr := range baseIterators {
res, err := itr.Next()
if err != nil {
for _, holder := range holders {
holder.itr.Close()
}
return nil, err
}
if res != nil {
holders = append(holders, &itrHolder{itr, res})
}
}
return &itrCombiner{namespace, holders}, nil
}
// Next returns the next eligible item from the underlying iterators.
// This function evaluates the underlying iterators, and picks the one which is
// gives the lexicographically smallest key. Then, it saves that value, and advances the chosen iterator.
// If the chosen iterator is out of elements, then that iterator is closed, and removed from the list of iterators.
func (combiner *itrCombiner) Next() (commonledger.QueryResult, error) {
logger.Debugf("Iterators position at beginning: %s", combiner.holders)
if len(combiner.holders) == 0 {
return nil, nil
}
smallestHolderIndex := 0
for i := 1; i < len(combiner.holders); i++ {
smallestKey, holderKey := combiner.keyAt(smallestHolderIndex), combiner.keyAt(i)
switch {
case holderKey == smallestKey: // we found the same key in the lower order iterator (stale value of the key);
// we already have the latest value for this key (in smallestHolder). Ignore this value and move the iterator
// to next item (to a greater key) so that for next round of key selection, we do not consider this key again
removed, err := combiner.moveItrAndRemoveIfExhausted(i)
if err != nil {
return nil, err
}
if removed { // if the current iterator is exhausted and hence removed, decrement the index
// because indexes of the remaining iterators are decremented by one
i--
}
case holderKey < smallestKey:
smallestHolderIndex = i
default:
// the current key under evaluation is greater than the smallestKey - do nothing
}
}
kv := combiner.kvAt(smallestHolderIndex)
if _, err := combiner.moveItrAndRemoveIfExhausted(smallestHolderIndex); err != nil {
return nil, err
}
if kv.IsDelete() {
return combiner.Next()
}
logger.Debugf("Key [%s] selected from iterator at index [%d]", kv.Key, smallestHolderIndex)
logger.Debugf("Iterators position at end: %s", combiner.holders)
return &queryresult.KV{Namespace: combiner.namespace, Key: kv.Key, Value: kv.Value}, nil
}
// moveItrAndRemoveIfExhausted moves the iterator at index i to the next item. If the iterator gets exhausted
// then the iterator is removed from the underlying slice
func (combiner *itrCombiner) moveItrAndRemoveIfExhausted(i int) (removed bool, err error) {
holder := combiner.holders[i]
exhausted, err := holder.moveToNext()
if err != nil {
return false, err
}
if exhausted {
combiner.holders[i].itr.Close()
combiner.holders = append(combiner.holders[:i], combiner.holders[i+1:]...)
}
return exhausted, nil
}
// kvAt returns the kv available from iterator at index i
func (combiner *itrCombiner) kvAt(i int) *statedb.VersionedKV {
return combiner.holders[i].kv
}
// keyAt returns the key available from iterator at index i
func (combiner *itrCombiner) keyAt(i int) string {
return combiner.kvAt(i).Key
}
// Close closes all the underlying iterators
func (combiner *itrCombiner) Close() {
for _, holder := range combiner.holders {
holder.itr.Close()
}
}
// itrHolder encloses an iterator and keeps the next item available from the iterator in the buffer
type itrHolder struct {
itr statedb.ResultsIterator
kv *statedb.VersionedKV
}
// moveToNext fetches the next item to keep in buffer and returns true if the iterator is exhausted
func (holder *itrHolder) moveToNext() (exhausted bool, err error) {
var res *statedb.VersionedKV
if res, err = holder.itr.Next(); err != nil {
return false, err
}
if res != nil {
holder.kv = res
}
return res == nil, nil
}
// String returns the key that the holder has in the buffer for serving as a next key
func (holder *itrHolder) String() string {
return fmt.Sprintf("{%s}", holder.kv.Key)
}
``` |
The Irving Square Historic District is a historic district on Irving Square, Waverly, South, Columbia, Irving, Gordon and Hollis Streets in Framingham, Massachusetts. It encompasses a portion of the town's central business district just south of the railroad tracks. It includes buildings on Hollis Street, extending south from Irving Street to Gordon Street, and buildings on Irving from Hollis to just beyond Columbia Street. Most of these commercial buildings were built between 1890 and 1930, most in the 20th century. The district was listed on the National Register of Historic Places in 1982.
See also
Concord Square Historic District, just north of the railroad tracks
National Register of Historic Places listings in Framingham, Massachusetts
References
Historic districts in Framingham, Massachusetts
National Register of Historic Places in Middlesex County, Massachusetts
Historic districts on the National Register of Historic Places in Massachusetts |
My Old Man is a sitcom starring Clive Dunn as retired and embittered engine driver Sam Cobbett. ITV broadcast 13 episodes in two series during 1974 and 1975.
Set in London, Sam Cobbett is the last tenant to leave an old house on a council-condemned road. He goes to live with his daughter, her posh husband (Arthur), and their young teenage son (Ron), in a flat nearby.
Cast
Clive Dunn as Sam Cobbett
Priscilla Morgan as Doris
Edward Hardwicke as Arthur
Keith Chegwin as Ron
George Tovey as Willie
Jon Laurimore as Andrew
Peter Mayock as Cyril
Production history
The pilot was one of a series of seven one-offs in a BBC Two comedy anthology series called Seven of One (1973). The pilot starred Ronnie Barker with Graham Armitage and Ann Beach, and was produced by Sydney Lotterby and Harold Snoad.
When the BBC failed to develop Gerald Frow's script into a series, Yorkshire Television stepped in, took over and cast Clive Dunn in the lead part, whilst Ronnie Barker focused on his successful roles in Porridge and Open All Hours.
The location of the main series remained unchanged from the pilot.
Series overview
{| class="wikitable" style="text-align: center;"
|-
! style="padding:0 8px" colspan="2" rowspan="2"| Series
! style="padding:0 8px" rowspan="2"| Episodes
! colspan="2"| Originally aired
! colspan="3"| DVD release date
|-
! Series premiere
! Series finale
! Region 1
! Region 2
! Region 4
|-
|style="background:#829DDB"|
|1
|7
|
|
|
|
|
|-
|style="background:#A5BBED"|
|2
|6
|
|
|
|
|
|}
Notes
External links
My Old Man at the BFI Film & TV Database
My Old Man at Television Heaven
1970s British sitcoms
1974 British television series debuts
1975 British television series endings
ITV sitcoms
Television series by ITV Studios
Television series by Yorkshire Television
Television shows set in Bradford
English-language television shows |
Lorenz Christoph Mizler von Kolof (also known as Wawrzyniec Mitzler de Kolof and Mitzler de Koloff; 26 July 1711 – 8 May 1778) was a German physician, historian, printer, mathematician, Baroque music composer, and precursor of the Enlightenment in Poland.
Family of origin
Mizler was born Lorenz Christoph Mizler von Kolof in Heidenheim, Middle Franconia to Johann Georg Mizler, a court clerk to the Margrave of Ansbach at Heidenheim, and Barbara Stumpf, of St. Gallen, Switzerland.
Education
His first teacher was N. Müller, a minister from Obersulzbach, Lehrberg, from whom Mizler learned the flute and violin. From 1724 to 1730, Mizler studied at the Ansbach Gymnasium with Rector Oeder and Johann Matthias Gesner, who became director of the St. Thomas School, Leipzig, from 1731 to 1734.
Mizler enrolled at Leipzig University on 30 April 1731, where he studied theology. His teachers there included Gesner, Johann Christoph Gottsched, and Christian Wolff. He earned a BS in December 1733 and a MS in March 1734. During this time, he also pursued the study of composition and had some association with Johann Sebastian Bach, whom, he wrote, he had the honor to call his "good friend and patron."
Mizler moved to Wittenberg in 1735 to study law and medicine; returning to Leipzig in 1736.
Career
From May 1737, Mizler began lecturing on music history and Johann Mattheson's Neu-eröffnete Orchestre [Newly Published Orchestra] he was the first to lecture on music at a German university in 150 years. He also began a monthly publication, the Neu eröffnete musikalische Bibliothek [Newly Published Musical Library] in 1738.
At about this time, Mizler began a music publishing business; and he returned school to take a doctorate of medicine at Erfurt University in 1747.
Move to Poland
In 1743 he left Leipzig and settled permanently in Poland. Mitzler de Kolof (his nom de guerre in Poland) became secretary, teacher, librarian and court mathematician to Count Małachowski of Końskie, from whom he learned Polish and with whom he studied Polish history and literature.
In 1747 Mizler moved to Warsaw. Mitzler also began a medical practice, which included consulting as a court physician to King August III. When he became court physician, this afforded him time to study the natural sciences.
Mizler established the publishing house 'Mizlerischer Bücherverlag, Warschau und Leipzig' in 1740.
Honors
Mitzler became a member of the Erfurt Academy of Sciences in 1755, and received Polish nobility in 1768.
Publisher
In association with the Załuski Library, Mitzler published and edited Poland's first scientific periodicals: Warschauer Bibliothek (1753–55), Acta Litteraria... (1755–56), Nowe Wiadomości Ekonomiczne i Uczone [Economic and Learned News], 1758–61 and 1766–67). From 1765 he published the Monitor (1765–85), which had been founded at the initiative of King Stanisław August Poniatowski, from 1773 until 1777 as its editor. In 1756 he set up a printing establishment, which in 1768 he conveyed (together with a type foundry) to Warsaw's Corps of Cadets, while retaining the business' directorship. At this printing establishment, Mitzler published scholarly editions of historic sources (a collection of chronicles, Collectio magna, 1761–71), literary works, and textbooks for the Corps of Cadets. He also operated a bookstore.
Mitzler de Kolof promoted new ideas, including the emancipation of Poland's townspeople. From 1743 he was the chief advocate, in Poland, of Christian Wolff's philosophical doctrines.
Death
Mitzler died in Warsaw in 1778.
Music
Mitzler, an amateur composer, was deeply interested in music theory, advocating the establishment of a musical science based firmly on mathematics; philosophy; and the imitation of nature in music. He translated Johann Joseph Fux's Gradus ad Parnassum into German (the original was in Latin), having written of it that "this methodical guide to musical composition [is] among all such works the best book that we have for practical music and its composition."
Mitzler was a polymath: his interests encompassed music, mathematics, philosophy, theology, law, and the natural sciences. He was influenced in philosophy by the ideas of Wolff, Gottfried Leibniz, and Gottsched.
The journal [musical library], which he published between 1736 and 1754, is an important document of the musical life in Germany at the time, and includes reviews of books on music written from 1650 up to its publication. Mizler himself contributed commentaries and criticisms on the writings of Wolfgang Printz, Leonhard Euler, Johann Adolf Scheibe, Johann Samuel Schroeter, , Gottsched, and Mattheson; especially the latter two's Critische Dichtkunst (1729) and Vollkommene Capellmeister (1739). His essays were detailed and perceptive and offer a useful musicological resource for present-day scholars of Baroque music.
Musical society
He founded the [Corresponding Society of the Musical Sciences] in 1738. Its aim was to enable musical scholars to circulate theoretical papers in order to further musical science by encouraging discussion of the papers via correspondence. Many of the papers appear in the Musikalische Bibliothek. The entry requirements of this society resulted in both the famous 1746/1748 Haussmann portrait of Bach and his Canonic Variations on "Vom Himmel hoch da komm' ich her" for organ, BWV 769.
Membership was limited to twenty. Belonging to the society were:
1738:
Giacomo de Lucchesini
L. C. Mizler (permanent secretary)
1739
Christoph Gottlieb Schröter
Heinrich Bokemeyer
G. P. Telemann
G. H. Stölzel
1742:
Georg Friedrich Lingke
1743:
Georg Venzky
1745:
G. F. Handel
Udalricus Weiss
1746:
C. H. Graun
1747:
J. S. Bach
G. A. Sorge
1748:
J. C. F. Fischer
1751:
1752:
Johann Georg Kaltenbeck
1755:
L. Mozart (invitation declined)
Compositions
Sammlung auserlesener moralischer Oden, zum Nutzen und Vergnügen der Liebhaber des Claviers I (Leipzig, 1740), II (Leipzig, 1741), III (Leipzig, 1743). Facsimiles published (Leipzig, 1971)
Writings
Dissertatio quod musica ars sit pars eruditionis philosophicae (Leipzig, 1734)
Lusus ingenii de praesenti bello (Wittenberg, 1735)
De usu atque praestantia philosophiae in theologia, jurisprudentia, medicina (Leipzig, 1736)
Neu eröffnete musikalische Bibliothek, oder Gründliche Nachricht nebst unpartheyischem Urtheil von musikalischen Schriften und Büchern (Leipzig, 1739)
Musikalischer Staarstecher, in welchem rechtschaffener Musikverständigen Fehler bescheiden angemerket, eingebildeter und selbst gewachsener sogenannter Componisten Thorheiten aber lächerlich gemachet werden (Leipzig, 1739–1740)
Anfangs-Gründe des General-Basses nach mathematischer Lehr-Art abgehandelt (Leipzig, 1739)
Gradus ad Parnassum, oder Anführung zur regelmässigen Composition, aus dem Lateinischen ins Deutsche übersetzt, und mit Anmerkungen versehen (Leipzig, 1742), translation of J. J. Fux: Gradus ad Parnassum (Vienna, 1725)
See also
History of philosophy in Poland
References
Notes
Sources
pdf Online-Version
Further reading
J. Birke: Christian Wolffs Metaphysik und die zeitgenössische Literatur- und Musiktheorie: Gottsched, Scheibe, Mizler (Berlin, 1966)
Buelow, George J., "Mizler von Kolof [Mitzler de Kolof, Koloff], Lorenz Christoph", Grove Music Online, edited by L. Macy (accessed 8 June 2007)
H. Federhofer: L. Chr. Mizlers Kommentare zu den beiden Büchern des 'Gradus ad Parnassum' von J. J. Fux (Graz, 1995)
H. R. Jung: "Telemann und die Mizlerische 'Societat' der musikalischen Wissenschaften", Georg Philipp Telemann, ein bedeutender Meister der Aufklärungsepoche (Magdeburg, 1967)
Lorenz Christoph Mizler von Kolof. Musikalische Bibliothek 1.Band, 1736–38
Lorenz Christoph Mizler von Kolof. Musikalische Bibliothek 2.Band, 1740–43
Lorenz Christoph Mizler von Kolof. Musikalische Bibliothek 3.Band, 1746–52
Lorenz Christoph Mizler von Kolof. Neu eröffnete musikalische Bibliothek, vol. III, unchanged reprint of the original edition (1739–1754). Hilversum: Fritz Knuf. 1966. (contains vols. 3 and 4)
J. G. Walther: Musicalisches Lexicon, oder Musicalische BibliothecF. Wöhlke: Lorenz Christoph Mizler: ein Beitrag zur musikalischen Gelehrtengeschichte des 18. Jahrhunderts'' (Würzburg, 1940)
External links
Lorenz Christoph Mizler website,
Works by Lorenz Christoph Mizler in digital library Polona
1711 births
1778 deaths
18th-century German mathematicians
German music historians
German music theorists
German musicologists
18th-century German physicians
German publishers (people)
People from the Principality of Ansbach
18th-century Polish–Lithuanian philosophers
18th-century Polish historians
Polish male non-fiction writers
18th-century Polish–Lithuanian mathematicians
18th-century Polish–Lithuanian physicians
18th-century Polish nobility
Leipzig University alumni
University of Wittenberg alumni
University of Erfurt alumni
German male non-fiction writers
18th-century German composers
18th-century male musicians
People from Weißenburg-Gunzenhausen
18th-century German male writers |
"Treehouse of Horror II" is the seventh episode of the third season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on October 31, 1991. It is the second annual Treehouse of Horror episode, consisting of three self-contained segments, told as dreams of Lisa, Bart and Homer and is the only Treehouse of Horror episode to date where each segment name is not stated inside the episode. In the first segment, which was inspired by W. W. Jacobs's short story The Monkey's Paw and The New Twilight Zone episode "A Small Talent for War", Homer buys a Monkey's Paw that has the power to grant wishes, although all the wishes backfire. In the second part, which parodies the Twilight Zone episode "It's a Good Life", Bart is omnipotent, and turns Homer into a jack-in-the-box, resulting in the two spending more time together. In the final segment, Mr. Burns attempts to use Homer's brain to power a giant robotic laborer.
The episode was written by Al Jean, Mike Reiss, Jeff Martin, George Meyer, Sam Simon and John Swartzwelder while Jim Reardon was the director. The episode is presented in a similar format to the previous season's "Treehouse of Horror" and contains several similarities to the previous episode, such as Marge's opening warning, the tombstones in the opening credits and the appearance of the alien characters Kang and Kodos. "Treehouse of Horror II" was the first episode that employed the "scary names" idea, in which many of the credits have unusual names. The episode contains numerous parodies and references to horror and science fiction works, including The Twilight Zone, Frankenstein, Bride of Frankenstein, The Thing with Two Heads and Invasion of the Body Snatchers.
In its original airing on Fox, the episode had a 12.1 Nielsen rating and finished the week ranked 39th. The episode received positive reviews, and in 2006, IGN listed the third story as the eighth best Treehouse of Horror segment. The episode was nominated for two Primetime Emmy Awards: Outstanding Individual Achievement in Sound Mixing for a Comedy Series or a Special and Alf Clausen for Outstanding Music Composition for a Series.
Plot
After eating too much Halloween candy, Homer, Lisa and Bart have nightmares.
In Lisa's nightmare, Homer buys a cursed monkey's paw that will grant its owner four wishes. While he, Bart and Lisa argue, Marge pleads with them to heed the vendor's warning and not use it at all. Despite this, Maggie is granted the first wish: a new pacifier. Bart wishes for the Simpsons to be rich and famous, but the public soon tires of the family's antics and ubiquity. Horrified by the wasteful wishes, Lisa wishes for world peace, but aliens Kang and Kodos enslave the defenseless Earth. Determined to make a harmless wish, Homer demands a turkey sandwich, but the turkey is dry. With all the wishes used, he gives the paw to his neighbor Ned, who wishes for the aliens to leave and transforms his home into a castle.
In Bart's nightmare, Springfield lives in fear of Bart's omnipotent powers, including the ability to read minds, magically move objects and turn living things into grotesque forms. When Homer refuses to turn off a football game so Bart can watch The Krusty the Clown Show, Bart transports him to the football stadium in place of the ball for a field goal kick. As Homer creeps into the house trying to surprise him with a blow to the head, Bart transforms Homer into a jack-in-the-box. After Dr. Marvin Monroe says Bart is desperate for attention from his father, Homer spends quality time with his son. Bart restores Homer's human form and they share a warm moment, causing Bart to wake up screaming.
In Homer's nightmare, Homer becomes a grave digger after Mr. Burns fires him for incompetence. While building a giant robotic laborer to replace human workers, Burns searches a graveyard for a human brain to implant in the robot. After mistaking Homer, asleep in an open grave, for a corpse, he removes his brain and places it in the robot. Since Robo-Homer is just as incompetent as the old Homer, Burns declares the experiment a failure. After restoring the brain to Homer's body, Burns kicks the robot, which topples over and crushes him. Homer wakes from the nightmare to find Burns' head grafted on his shoulder. Homer tries to reassure himself that he is only dreaming, but Burns' head insists otherwise.
Production
"Treehouse of Horror II", the second edition of the Treehouse of Horror series of episodes, was written by Al Jean, Mike Reiss, Jeff Martin, George Meyer, Sam Simon, and John Swartzwelder. Jim Reardon was the director. The episode is presented in a similar format to the previous season's "Treehouse of Horror", and contains several similarities to the previous episode, such as Marge's opening warning, the tombstones in the opening credits and the appearance of the alien characters Kang and Kodos. "Treehouse of Horror II" was the first episode that employed the "scary names" idea, in which many of the names in the opening and closing credits have unusual nicknames. The idea came from Al Jean, who was inspired by old issues of EC Comics. Although the names quickly became more silly than scary, there has been a wide variety of special credits. For example, the director's name is given as Jim "Rondo" Reardon, a reference to his idol, Rondo Hatton. The "scary names" became such a burden to write that they were cut for "Treehouse of Horror XII" and "Treehouse of Horror XIII", but after hearing complaints from the fans, Jean decided to bring them back. The alien characters Kang and Kodos had been introduced in the previous year. There was a debate about whether to include them in all Halloween specials after the episode; eventually, the writers agreed to make it a tradition.
During the beginning of Lisa's dream, Hank Azaria faked some Arabic. Usually, the writers get inspiration for the Halloween specials from old horror stories, but recently, the writers tried to conceive of their own stories instead of creating more parodies. Also, when the Moroccan salesman tries to warn Homer Simpson, saying "You'll be sorry", the animators forgot to move his lips. They realized their error only after the broadcast. While writing the segment, Sam Simon, one of the writers, wanted the fingers to go down in such an order so they would eventually have the middle finger sticking up. Once the animation would have been complete, however, they could not have gone through; Fox would have refused to air the episode. They had considered the alternative of deliberately blurring the middle finger themselves, but decided that Fox would have also refused. For this episode, there were a lot of loop lines; for instance, the ending to Lisa's dream was added to the last second. As a result of the loop, they still retained Flanders's old house next to his newly created castle. In order to make the episode fill the time needed, the animators often extended the laughing time for Kang and Kodos.
The second segment is based on The Twilight Zone television series episode "It's a Good Life". That episode had also inspired the third segment of Twilight Zone: The Movie, which starred Nancy Cartwright in her debut feature film role. The segment parodies the narration of The Twilight Zone, and the producers were pleased with Harry Shearer's portrayal of Rod Serling. (Shearer had previously impersonated Serling while he was a cast member on Saturday Night Live) In addition, though it took a long time, the design of the monster version of SnowballII by Dale Hendrickson was greatly enjoyed by the producers, who thought it looked "just hideous, just right". Bart's prank call to Moe was thought of by John Swartzwelder, one of the writers; however, Hank Azaria detested the line. According to George Meyer, the animation for when Bart sits up screaming was extremely tough, especially to make the mouthlines natural.
In the third segment, Burns and Smithers go down to the lab during Homer's nightmare. The animators decided to make the animation a bit more impressive, and decided to do the concave and convex images of Burns and Smithers. Even though it was tough and took up more time, the producers felt it was a necessary tour-de-force. Originally, Homer's robotic voice was done post-animation in order to avoid stress on the voice actor. Then-head writer Jay Kogen, who created the Davy Crockett joke, thought it was so funny he actually mimicked the actions of Mr. Burns putting on Homer's brain in the writing room; the producers thought it was hilarious, so they decided to add it into the episode.
Cultural references
In the opening sequence of the episode, the Peanuts gang scurry by as trick-or-treaters, à la It's the Great Pumpkin, Charlie Brown. Marge's hair in the opening segment recalls Elsa Lanchester's character in Bride of Frankenstein.
The plot of Lisa's nightmare is a reference to W. W. Jacobs's short story The Monkey's Paw, and The New Twilight Zone episode "A Small Talent for War". Near the beginning of the segment, Moroccan soldiers stop and search the Simpsons, finding souvenirs taped to Homer's body which he was attempting to smuggle out of the country. This is a reference to the opening drug-smuggling scene of the film Midnight Express. A billboard advertisement with Bart saying "Get a Mammogram, Man!" can be seen. This was a reference to Bart's popular slogan "Don't have a cow, man!"
The plot of Bart's nightmare is a parody of The Twilight Zone episode "It's a Good Life", which was remade as part of Twilight Zone: The Movie- the remake featured Nancy Cartwright in the role of Ethel. Jasper's transformation into a dog is a reference to the 1978 remake of Invasion of the Body Snatchers. The scene in which Homer goes out with Bart during Bart's nightmare to spend time with the boy, as well as the music accompanying the scene, parody an old anti-smoking public service announcement, while the church layout was taken from a Norman Rockwell painting.
Homer's nightmare is based on much of the film Frankenstein, and the end references The Thing with Two Heads. While Mr. Burns scoops out Homer's brain, he hums the tune of "If I Only Had a Brain" which is sung by the Scarecrow in The Wizard of Oz. Burns also calls the robot that had Homer's brain a "clinking, clattering cacophony of caliginous cogs and camshafts", similar to the Wizard's line to the Tin Man: "You clinking, clanking, clattering collection of caliginous junk!" In Homer's nightmare, The Tonight Show Starring Johnny Carson is broadcast on a TV. When Mr. Burns puts on Homer's brain, he says "Look at me! I'm Davy Crockett", a reference to Crockett's popular image as a frontiersman who wore a hat made of raccoon fur.
Reception
In its original airing on Fox, the episode had a 12.1 Nielsen rating and was viewed in approximately 11.14 million homes. It finished the week ranked 39th. It was the highest rated show on Fox the week it aired, tied with In Living Color.
The authors of the book I Can't Believe It's a Bigger and Better Updated Unofficial Simpsons Guide, Warren Martyn and Adrian Wood praised the episode as "A marked improvement on the first, uneven Hallowe'en special. All three tales succeed, with Bart's nightmare of gaining awesome powers being perhaps the most successful". Bill Gibron of DVD Verdict lauded the episode for having "wonderfully wild moments", especially "the parody of The Twilight Zone's 'It's a Good Life,' with Bart in the place of Billy Mumy's omnipresent monster". He gave the episode a score of 90 out of 100 a possible score. DVD Movie Guide's Colin Jacobson critiqued the episode as "not so hot their first couple of years", though he admitted that "the 1991 incarnation does top the original from 1990". However, he thought that "None of the three stories stands out as particularly excellent, though the monkey's paw one probably works the best. Chalk up this episode as a decent Halloween set." He thought the best quote was "Damn it Smithers, this isn't rocket science. It's brain surgery!"
In 2006, IGN published a list of the top ten Treehouse of Horror segments, and they placed the third segment at number eight. They wrote, "'Treehouse of Horror II' contained three quality segments, but [the third] was easily the best. Featuring a story reminiscent to Frankenstein, this episode made us laugh from beginning to end with Homer's crazy antics. [...] The humor that is derived from the multiple movie and literary parodies was enough to leave a last impression on us as an audience — and who doesn't like a robot whose primary function is to find donuts?" Writing for the Star Tribune, Neal Justin rated the episode as the one of his ten favorite episodes, writing, "The annual Halloween specials glow because all the rules are thrown out, never with more ingenuity than in this second installment." The episode's reference to Midnight Express was named the 18th greatest film reference in the history of the show by Total Film's Nathan Ditum.
The episode was nominated for two Primetime Emmy Awards: Outstanding Individual Achievement in Sound Mixing for a Comedy Series or a Special and Alf Clausen for Outstanding Music Composition for a Series.
References
Bibliography
External links
The Simpsons (season 3) episodes
1991 American television episodes
Treehouse of Horror
Television episodes set in Morocco
Television episodes about nightmares
Television shows written by John Swartzwelder
Television episodes written by Al Jean
Halloween television episodes
it:La paura fa novanta I-X#La paura fa novanta II
fi:Simpsonit (3. tuotantokausi)#Painajaisia (Treehouse of Horror II) |
Đoko Šalić (, born September 18, 1995) is a Serbian-Bosnian professional basketball player for Borac Čačak of the Adriatic League and the Basketball League of Serbia.
Professional career
Šalić played in youth categories of Spars Sarajevo. In 2013, he signed his first professional contract with Serbian team Partizan Belgrade. In his first season with Partizan, he won the Serbian League defeating Crvena zvezda with 3–1 in the final series. In November 2014, he terminated his contract with Partizan. The next month, he returned to Spars Sarajevo for the rest of the season. In September 2015, he signed with the Montenegrin club Sutjeska.
In April 2019, Šalić signed for Serbian team Dynamic Belgrade. On May 30, he scored 47 points in a 116–113 win over Novi Pazar.
In July 2021, Šalić signed for Wilki Morskie Szczecin of the Polish Basketball League. On 1 January 2022, he was waived. On 3 January, Šalić signed with Cherkaski Mavpy of the Ukrainian Basketball SuperLeague.
In 2022, he played for Labas Gas Prienai of the Lithuanian Basketball League.
Serbian national team
Šalić played for Serbian national team at the 2013 FIBA Under-19 World Championship in Prague and won a silver medal. He averaged 3.4 points and 2.3 rebounds per game.
References
External links
Đoko Šalić at aba-liga.com
Đoko Šalić at euroleague.net
Đoko Šalić at fiba.com
1995 births
Living people
ABA League players
Basketball League of Serbia players
Bosnia and Herzegovina expatriate basketball people in Serbia
Centers (basketball)
KK Dynamic players
KK Partizan players
KK Sutjeska players
OKK Spars players
People from Sokolac
Serbian expatriate basketball people in Bosnia and Herzegovina
Serbian expatriate basketball people in Montenegro
Serbian expatriate basketball people in Poland
Serbian expatriate basketball people in Slovenia
Serbian men's basketball players
Serbs of Bosnia and Herzegovina
KK Kansai Helios Domžale players
Wilki Morskie Szczecin players
Serbian expatriate basketball people in France |
Panasonic Lumix DMC-FZ20 is a 2004 superzoom bridge digital camera by Panasonic. It is the successor of the FZ10. The highest-resolution pictures it records are 2,560 by 1,920 pixels (4.9 megapixels). It has a polycrystalline, thin-film transistor, liquid crystal display and EVF (electronic view finder). It records to Secure Digital media. The camera also has a microphone. The camera's dimensions are 127.6 mm (5.02 inches) in width, 87.2 mm (3.43 inches) in height, and 106.2 mm (4.18 inches) in depth. Its mass is 520 g (18.3 ounces).
This camera is known for its Leica lens with "Mega OIS" optical image stabilisation. It has a 12x optical zoom, often said to be equal to a 400 mm lens, which can stay f/2.8 for the entire zoom range. There are full manual controls too. Optional lenses are available to double the focal length or for wide-angle view.
Modes include full automatic, aperture priority, shutter priority, full manual, macro (from 5 centimetres on), film, and sequence of shots. Film is recorded at 320x240 px resolution in mJPEG format and playable in QuickTime.
Files can be stored in TIFF and two levels of JPEG, either a high quality or lower quality. The camera can be set to save both a JPEG and TIFF file.
The lens itself extends from the barrel of the camera and cannot have filters or lens hoods attached directly to it. A special adapter is required which allows 72 mm filters and the included lens hood to be attached to the barrel of the camera. Alternatively, adapters are available from third-party manufacturers that allow less expensive 62 mm filters to be used.
Its successors are the FZ30, announced on July 20, 2005, and the FZ50, announced around a year later.
See also
List of bridge cameras
References
External links
Review at Digital Photography Review.
Review at Digital Camera Resource Page.
Bridge digital cameras
Superzoom cameras
FZ20
Live-preview digital cameras
Digital cameras with CCD image sensor |
was a former justice on the Supreme Court of Japan. In spring 2009, Ueda was awarded the highest decoration of Japan, the Grand Cordon of the Order of the Rising Sun. Before being appointed to the Supreme Court in 2002, he headed the courts in Osaka and in Hiroshima and served as a judge in Tokyo and Maebashi.
References
Supreme Court of Japan justices
Living people
1937 births
Grand Cordons of the Order of the Rising Sun |
Bennie Junior Tuinstra (born 12 September 2000) is a Dutch professional volleyball player who plays as an outside hitter for Ziraat Bankası Ankara and the Netherlands national team.
Honours
Club
Domestic
2019–20 Dutch Cup, with Lycurgus Groningen
2020–21 Dutch SuperCup, with Lycurgus Groningen
2020–21 Dutch Cup, with Lycurgus Groningen
2021–22 Turkish SuperCup, with Ziraat Bankası Ankara
2021–22 Turkish Championship, with Ziraat Bankası Ankara
2022–23 Turkish SuperCup, with Ziraat Bankası Ankara
2022–23 Turkish Championship, with Ziraat Bankası Ankara
Individual awards
2018: CEV U20 European Championship – Best outside spiker
References
External links
Player profile at Volleybox.net
2000 births
Living people
Sportspeople from Sneek
Dutch men's volleyball players
Dutch expatriate sportspeople in France
Expatriate volleyball players in France
Dutch expatriate sportspeople in Turkey
Expatriate volleyball players in Turkey
Ziraat Bankası volleyball players
Outside hitters
Dutch expatriate volleyball players |
The Dragon Murder Case (first published in 1934) is a novel in a series by S. S. Van Dine about fictional detective Philo Vance. It was also adapted to a film version in 1934, starring Warren William as Vance.
Plot
A guest at an estate in northern Manhattan (Inwood Hill Park) dives into the swimming pool and disappears. His murder brings up references to a mythological dragon which is said to prey on the imprudent, but Philo Vance uses his knowledge of both dragons and criminals to demonstrate whodunit.
Background
The estate in the novel was based on Tryon Hall, built in 1907 by C. K. G. Billings, a retired president of the Chicago Coke and Gas Company. In 1917 he sold the mansion to John D. Rockefeller Jr. The mansion burned down in 1926, and Rockefeller developed the property, and others, into Fort Tryon Park, which he then donated to New York City.
Literary significance and criticism
The Dragon Murder Case is the seventh novel featuring Van Dine's Philo Vance character. Some critics saw this as marking a significant change in the series, including crime novelist Julian Symons who wrote, "The decline in the last six Vance books is so steep that the critic who called the ninth of them 'one more stitch in his literary shroud' was not overstating the case." Further unfavorable critiques from culture historian Jacques Barzun noted, "The estate and its denizens are meant to be as picturesque as the persons and the plot, but all succeed only in being as egregious and improbable as Philo Vance and his antics. This tale is one of the author's worst ..."
References
External links
The text of the novel is available from Project Gutenberg, Australia
1934 American novels
American novels adapted into films
Novels by S. S. Van Dine
Novels set in New York City
Philo Vance novels
Novels about dragons |
Lieutenant Colonel Joseph Norris Peart (12 February 1900 – 4 September 1942) was a New Zealand army officer and the fourth headmaster of King's College. He served in the army during World War II and was killed at El Alamein during the Battle of Alam el Halfa at the age of 42.
Early life
Peart was born in Collingwood to Alfred and Salina Peart. He was an alumnus of Auckland Grammar School, and a graduate of Cambridge University. After graduation, Peart pursued a career in education.
Headmastership
In 1937, Peart was appointed as the fourth headmaster of King's College, an independent secondary school in Middlemore. During his tenure as headmaster, Peart was remembered by his students as being youthful and as being a disciplinarian.
Military service
Shortly after the outbreak of World War II in 1939, Peart enlisted in the New Zealand Army and was granted a commission as a Major. His first posting was as the Deputy Assistant Adjutant General in Greece and Crete. From November 1941 to March 1942, Peart was the Commanding Officer (CO) of the 18th Battalion. Later, from 1 May 1942, he was the CO of the 26th Battalion. Peart was awarded the Distinguished Service Order; the award was gazetted on 24 September 1942, i.e. three weeks after his death. The citation for this award reads as thus:
"For outstanding leadership, bravery and determination. At El Mreir Depression on the night 21/22 July, 1942 Lieutenant Colonel Peart led his Battalion in the 6 (NZ) Infantry Brigade attack on El Mreir Depression ... During all the fighting Lieutenant Colonel Peart was constantly moving about among his men encouraging them and at all times setting a high example of courage and perseverance. It is due to his outstanding leadership, determination and sound judgement that the Battalion remains a fighting unit."
Peart was killed on 4 September 1942 at El Alamein during the Battle of Alam el Halfa and he is buried at the El Alamein War Cemetery in Egypt.
Legacy
Joseph Peart is the eponym of Peart House, King's College.
See also
Western Desert campaign
References
Alumni of Emmanuel College, Cambridge
1900 births
1942 deaths
People from Collingwood, New Zealand
New Zealand military personnel killed in World War II
New Zealand Army officers
People educated at Auckland Grammar School
New Zealand Companions of the Distinguished Service Order |
The International Studies of Infarct Survival (ISIS) were four randomized controlled trials of several drugs for treating suspected acute myocardial infarction ("heart attack"). More than 134,000 patients from over 20 countries took part in four large simple trials between 1981 and 1993, coordinated from Oxford, England.
ISIS-1
The First International Study of Infarct Survival (ISIS-1) was a placebo-controlled trial of the beta-blocker atenolol. It recruited 16,027 patients and was completed in 1985.
ISIS-2
The Second International Study of Infarct Survival (ISIS-2) was a 2×2 factorial placebo-controlled trial of aspirin and the thrombolytic drug streptokinase. It recruited 17,187 patients and was completed in 1988.
ISIS-3
The Third International Study of Infarct Survival (ISIS-3) was a 3×2 factorial trial that compared the three thrombolytic drugs streptokinase, tissue plasminogen activator (tPA) and anistreplase to each other, and also compared the anticoagulant heparin to no heparin. All patients were also given aspirin. It recruited 41,299 patients and was completed in 1991.
ISIS-4
The Fourth International Study of Infarct Survival (ISIS-4) was a 2×2×2 factorial placebo-controlled trial of the angiotensin-converting enzyme inhibitor (ACE inhibitor) captopril, isosorbide mononitrate and magnesium sulphate. It recruited 58,050 patients and was completed in 1993.
See also
GISSI, an Italian group who conducted four similar large clinical trials
Thrombolysis In Myocardial Infarction (TIMI)
Myocardial infarction management
References
Clinical trials related to cardiology
Interventional cardiology |
Laura Yihan Zeng (; Zeng Yi-Han; born October 14, 1999) is an American former individual rhythmic gymnast. She represented the United States at the 2016 and 2020 Summer Olympics. She swept all of the events at the 2015 Pan American Games and at the 2018 Pan American Championships. She is the 2014 Youth Olympic and 2019 Summer Universiade all-around bronze medalist and the 2019 Grand Prix Final hoop bronze medalist. She is an eight-time national all-around champion, six times at the senior level (2015-19, 2021) and twice at the junior level (2013-14).
Personal life
Zeng was born in Hartford, Connecticut, and raised in Libertyville, Illinois, where she attended Libertyville High School. Her parents, Li Chen and Tian Zeng, immigrated from China. After first studying Chinese dance and ballet, Zeng started rhythmic gymnastics at age seven after her friend told her about it. Her sister Yecca is eight years older than her and is a fashion designer. In 2018, Laura graduated from high school as a National Merit Scholar Finalist and committed to Yale University. She enrolled at Yale in the fall of 2021 after taking three gap years to train for the 2020 Olympic Games.
Career
When she was eight years old, Zeng won the all-around gold medal at the 2008 J.O. Compulsory Championships in level 5. The next year, she moved up to level 7 and won the all-around gold medal at the 2009 J.O. Optional Championships. Then at the 2010 J.O. Optional Championships, she finished fourth all-around in level 8. She moved up to the Hopes division in 2011 and won the all-around gold medal at the Visa Championships.
Junior
2012
Zeng began competing as a junior in 2012. She won the all-around silver medal in the junior division of the Rhythmic Challenge held in Colorado Springs, Colorado. She made her international debut at the 2012 Junior Pacific Rim Championships where she won the team gold medal and the all-around silver medal behind Canada's Patricia Bezzoubenko. In the event finals, she won ribbon gold, clubs and ball silver, and hoop bronze. She then competed in the Dundee Cup in Sofia, Bulgaria and won the all-around bronze medal behind Aleksandra Soldatova and Zhena Trashlieva. Then at the USA Gymnastics Rhythmic Championships, she won the all-around silver medal and was named to the United States junior national rhythmic gymnastics team.
2013
Zeng began the 2013 season at the Rhythmic Challenge and won the all-around gold medal. She then competed at the Gymnastik Schmiden International in Fellbach, Germany winning gold in all-around, hoop, clubs, ribbon and bronze in ball. She won another all-around gold medal at the Rhythmic National Qualifier held in Deerfield, Illinois. Then at the U.S. Rhythmic Championships in Orlando, she won her first junior national all-around title.
2014
In 2014, Zeng started her season competing at the Rhythmic Challenge winning the all-around and all four event titles. Then at the Lisbon International Tournament, she won the ball silver medal and the hoop bronze medal. At her next competition, the Pesaro International Junior Tournament, she won the hoop silver medal and bronze medals in team, clubs, and ribbon. At the 2014 Junior Pan American Championships, Zeng swept all gold medals and won the United States a spot at the 2014 Youth Olympic Games. She then traveled to Minsk to compete at the Crystal Rose Junior Tournament where she won team gold, ball and ribbon silver, and hoop and clubs bronze. She defended her junior all-around title at the USA Gymnastics Championships,.
Zeng was selected as the sole representative of United States at the 2014 Summer Youth Olympics in Nanjing, China. She placed second in the qualification round behind Russia's Irina Annenkova with a total score of 57.375. She went on to take the all-around bronze in the finals with a total score of 56.750, just two hundredths behind Belarus’ Mariya Trubach. This marked the first rhythmic gymnastics medal for the United States at an Olympic or Youth Olympic Games.
Senior
2015
Zeng began age eligible for senior competition in 2015. She won the all-around gold medal at the Rhythmic Challenge held in Lake Placid, New York. She made her World Cup debut at the Lisbon World Cup and finished fourteenth in the all-around. Then at the Pesaro World Club, she finished eleventh in the all-around and placed seventh in the ribbon final. At the International Rhythmic Gymnastics Tournament in Corbeil-Essonnes, France, she won the all-around bronze medal behind Russians Arina Averina and Dina Averina and won a team silver medal behind the Averinas with teammate Jazzy Kerber. In the event finals, she won silver in clubs and bronze in ball and placed fourth in ribbon. She then won her first senior national all-around title at the USA Gymnastics Championships, and she also won the hoop, clubs, and ribbon titles.
At the Pan American Games, Zeng swept the gold medals in the all-around and all the apparatus finals, becoming the second American to win the all-around and all the apparatus finals at the Pan American Games after Mary Sanders in 2003. Zeng was the most decorated athlete of the Pan American Games. Her next competition was the Kazan World Cup where she finished tenth in the all-around and eighth in the ball final.
Zeng was selected to compete in her first World Championships in Stuttgart alongside Jazzy Kerber, Camilla Feeley and Serena Lu. The team placed ninth, and individually, Zeng ranked eleventh all-around in qualifications. She qualified for the clubs final where she placed seventh. In the all-around finals, she finished eighth with a total of 70.416 points, the best-ever finish for an American rhythmic gymnast at the World Championships, beating the tenth place of Mary Sanders at the 2003 World Championships. Her results earned the United States an individual spot for the 2016 Olympic Games.
2016
Zeng began her 2016 season at the Rhythmic Challenge where she won the all-around gold medal. A couple of weeks later she competed at the Lisbon World Cup where she finished seventh in the all-around with a total of 70.150 points and qualified for three event finals placing eighth in clubs and hoop and fifth in ball. Next she competed at the Pesaro World Cup where she finished nineteenth in the all-around and seventh in the clubs final. At the Minsk World Cup, she made history by becoming the first American to win a medal in a World Cup series when she won bronze medals in both hoop and ribbon. She then won her second consecutive national all-around title and was selected to represent the United States at the 2016 Summer Olympics.
Prior to the Olympic Games, Zeng finished eleventh all-around, sixth in hoop, and fifth in clubs and ribbon at the Kazan World Cup. Then at the Baku World Cup, she placed eleventh all-around, fifth in hoop and clubs, and sixth in ribbon. At the 2016 Summer Olympics held in Rio de Janeiro, Brazil, she finished eleventh all-around in the qualifications, narrowly missing the individual all-around final. Zeng's finish tied for the best for an American rhythmic gymnast with Valerie Zimring's eleventh-place finish at the 1984 Olympic Games in Los Angeles.
2017
Zeng's first competition after the 2016 Olympic Games was the Rhythmic Challenge in Indianapolis, Indiana where she won the all-around gold medal. Then at the Pesaro World Cup, and she finished fourth in the all-around. She qualified for all four event finals and earned her third and fourth career World Cup bronze medals in hoop and clubs and also finished seventh in ball and ribbon. She then participated at the MTM Ljubljana International Tournament and won the all-around gold medal. In event finals, she also took gold in clubs, hoop and ribbon and a bronze medal for ball. She then finished tenth all-around, sixth in ball, and fifth in ribbon at the Guadalajara World Challenge Cup.
Zeng secured her third consecutive senior national all-around title and won the clubs gold medal, the hoop and ribbon silver medals, and the ball bronze medal. She then competed at the World Games in Wrocław, Poland where she finished fifth in clubs and seventh in ball and ribbon. Then at the Kazan World Challenge Cup, she finished eleventh in the all-around. At the World Championships in Pesaro, Zeng finished sixth in the all-around besting her own eighth-place finish in 2015 as the best-ever all-around finish for an American at the World Rhythmic Gymnastics Championships. She also advanced into three event finals along with teammate Evita Griskenas who advanced into two event finals, marking the first time two American gymnasts qualified for event finals at the World Championships. In the event finals, she placed fifth in clubs and ribbon and sixth in ball.
2018
Zeng began the 2018 season at the Rhythmic Challenge and won the all-around gold medal. In April, she competed at the Baku World Cup and won the hoop bronze medal in a tie-breaker with Boryana Kaleyn behind Russia's Mariia Sergeeva and Belarus's Katsiaryna Halkina. Then in July, she won her fourth consecutive national all-around title marking the first rhythmic gymnast to win four U.S. all-around titles since Sue Soffe in 1979. In August, she competed at the BSB Bank World Challenge Cup in Minsk and finished fourteenth in the all-around. The next week she competed at the Kazan World Challenge Cup where she placed fifth in the clubs final and ninth in the all-around. At the World Championships, Zeng, Evita Griskenas, and Camilla Feeley finished seventh in the team event, the highest ever finish for the United States. Individually, she qualified for the all-around final and placed eighth with a total score of 66.950. After the World Championships, she competed at the Pan American Championships and won the all-around gold and team gold with Lili Mizuno and Nastasya Generalova. Zeng also swept the four event gold medals.
On October 18, 2018, Zeng tested positive for acetazolamide during out-of-competition testing. She provided evidence to the United States Anti-Doping Agency (USADA) that she was prescribed an altitude sickness medication containing acetazolamide while on vacation in Machupicchu, Peru believing it was ibuprofen. On December 19, she accepted a six-month suspension from USADA beginning on the date of her positive test.
2019
Zeng began her 2019 season at the Tashkent World Cup where she placed eighth in the all-around and clubs and sixth in ball. She then won a bronze medal in hoop at the Baku World Cup behind Dina Averina and Linoy Ashram. Then in May, she placed sixth all-around, fourth in hoop, fifth in ball, and eighth in clubs at the Guadalajara World Challenge Cup. She won another hoop bronze medal at the Brno Grand Prix and placed fifth in ribbon and tenth in all-around. She then competed at the USA Gymnastics Championships in Des Moines, Iowa, and won her fifth straight all-around national title and also won hoop, ball, and clubs gold and ribbon bronze. She won the all-around bronze medal at the Summer Universiade behind Ekaterina Selezneva and Zohra Aghamirova, and she also finished fourth in the hoop, ball, and clubs final.
Zeng finished sixth in the all-around at the Portimao World Challenge Cup, and she also finished seventh in the hoop, ball, and clubs finals. At the World Championships in Baku, Azerbaijan, the American team of Zeng, Evita Griskenas, and Camilla Feeley placed seventh. In the ribbon final, she finished fifth, and she finished tenth in the all-around final with a total score of 81.850. As a result, Zeng earned one of two spots along with her teammate Evita Griskenas for the United States for the 2020 Summer Olympics, marking the first time the United States qualified two rhythmic gymnasts for the Olympic Games since 1992. At the end of the World Championships, she was awarded the Longines Prize for Elegance.
2020-21
Zeng won the all-around gold medal at the 2020 Rhythmic Challenge in Lake Placid, New York. This was her only competition of 2020 due to the COVID-19 pandemic. She returned to competition in February 2021 at the Rhythmic Challenge and won the all-around silver medal behind Evita Griskenas. Her next competition was the 2021 Sofia World Cup where she finished sixth in hoop, seventh in the all-around, and eighth in ball. Then at the Tashkent World Cup, she finished seventh in hoop and eighth in ball. She finished sixth in hoop and ninth in all-around at the Baku World Cup. Her final World Cup was in Pesaro, and she placed sixth in hoop and seventh all-around and ball.
Zeng won the all-around at the 2021 USA Gymnastics Championships and was selected to represent the United States at the 2020 Summer Olympics. Before the Olympics, she competed at the Israel Grand Prix in Tel Aviv where she placed sixth in clubs and seventh in all-around, hoop, and ball. At the 2020 Olympic Games in Tokyo, she finished thirteenth in the qualification round for the individual all-around and was the third reserve for the final.
Achievements
First Non-European gymnast to win Longines Prize for Elegance since 1997 when the Prize started.
First American rhythmic gymnast to qualify for two Olympic Games.
First and only American rhythmic gymnast to win a medal at the World University Games (2019 Napoli Universiade).
First American rhythmic gymnast to win a medal at the World Cup series (Minsk 2016, Pesaro 2017, Baku 2018, Baku 2019).
First and only American rhythmic gymnast to win a medal at the Youth Olympic Games (Nanjing 2014).
2013–2019 USA all-around national champion (2013-14 junior, 2015-19 senior).
Swept all five gold medals in Toronto Pan American Games in 2015. She was the most decorated athlete for the game.
In Rio Olympic Games in 2016, she finished 11th, which tied the best performance by an American in an Olympics, missing finals by 1/10th point.
She holds the best All-Around finish in a World Championship by an American ever. She was 6th in the 2017 World Championships in Pesaro, besting her own record of 8th in the 2015 World Championships in Stuttgart.
First American rhythmic gymnast to qualify for three event finals in a world championship (clubs, ribbon, and ball in 2017 Worlds).
She holds best event finals finish by an American in a world championship (5th in ribbon and ball in 2017 Worlds and 5th in ribbon in 2019 Worlds).
She holds the best team finish in a World Championship by any American team ever. She, along with Evita Griskenas and Camilla Feeley, finished 7th in the 2018 World Championships in Sofia, and 2019 Worlds in Baku.
Retirement
Zeng announced her retirement from rhythmic gymnastics on her Instagram account on January 22, 2022. She is studying urban studies and cognitive science at Yale University and is a staff reporter for the student newspaper, Yale Daily News.
References
External links
1999 births
Living people
American rhythmic gymnasts
American sportswomen of Chinese descent
Doping cases in gymnastics
Gymnasts at the 2015 Pan American Games
Gymnasts at the 2014 Summer Youth Olympics
Pan American Games gold medalists for the United States
Pan American Games medalists in gymnastics
Gymnasts at the 2016 Summer Olympics
Universiade medalists in gymnastics
Universiade bronze medalists for the United States
Olympic gymnasts for the United States
Medalists at the 2019 Summer Universiade
Medalists at the 2015 Pan American Games
Gymnasts at the 2020 Summer Olympics
21st-century American women
Medalists at the Rhythmic Gymnastics Pan American Championships |
Trosia circumcincta is a moth of the Megalopygidae family. It was described by William Schaus in 1905. It is found in French Guiana.
The wingspan is about 41 mm. The forewings are dark mouse grey with a red line along the basal third of the costa, then below the costa and along vein 7 to the apex. Another red line is found from the base of the costa to the inner margin near the angle, then up to vein 5 on the extreme margin. The outer two-thirds of the costa and the outer margin below vein 5 are black. The fringe between vein 5 and the apex is yellowish. The hindwings are blackish, with the outer margin broadly red, except a black line on the extreme margin and the fringe between vein 3 and the anal angle.
References
Moths described in 1905
Megalopygidae |
Nick Bantock (born 14 July 1949) is a British artist and author based in Saltspring Island, British Columbia, known for his series, The Griffin and Sabine Trilogy. His books are published by Raincoast Books in Canada and Chronicle Books in the United States, and are known for their elaborate designs featuring faux postage stamps, handwritten documents, passports, postcards and other ephemera.
Career
Bantock attended schools in the northeast suburbs of London, and later an art college in Maidstone, Kent. He began a career as a freelance artist at the age of 23, producing 300 book covers in the ensuing 16 years. In 1988 he moved to Vancouver, and soon after to the nearby Bowen Island, where he had the idea that became the Griffin and Sabine series.
In 1993, he won the Bill Duthie Bookseller's Choice Award for Sabine's Notebook.
In 2006, he adapted the Griffin and Sabine series into a play, also called "Griffin and Sabine", which premiered in Vancouver at the Granville Island Stage and ran from 5 October – 4 November 2006.
In 2007, he resumed painting full-time, and opened a studio-gallery, 'The Forgetting Room', on Saltspring Island. Between 2007 and 2010, Bantock was one of the twelve committee members responsible for selecting Canada's postage stamps.
Bibliography
The Griffin and Sabine Saga
The Griffin and Sabine Trilogy
Griffin and Sabine: An Extraordinary Correspondence (1991)
Sabine's Notebook: In Which the Extraordinary Correspondence of Griffin and Sabine Continues (1992)
The Golden Mean: In Which the Extraordinary Correspondence of Griffin and Sabine Concludes (1993)
The Morning Star Trilogy
The Gryphon: In Which the Extraordinary Correspondence of Griffin and Sabine is Rediscovered (2001)
Alexandria: In Which the Extraordinary Correspondence of Griffin and Sabine Unfolds (2002)
The Morning Star: In Which the Extraordinary Correspondence of Griffin and Sabine is Illuminated (2003)
The Pharos Gate: Griffin and Sabine's Lost Correspondence (2016)
The Missing Nose Flute and Other Mysteries of Life (1991) - postcard book
The Egyptian Jukebox (1993)
Averse to Beasts (1994)
The Venetian's Wife (1996)
Paris Out of Hand (1996) - with Karen Elizabeth Gordon and Barbara Hodgson
Capolan ArtBox (1997)
The Forgetting Room (1997)
The Museum at Purgatory (1999)
The Artful Dodger: Images and Reflections (2000) - a visual autobiography, and retrospective
Urgent 2nd Class: Creating Curious Collage, Dubious Documents, and Other Art from Ephemera (2004)
Windflower (2006) - with Edoardo Ponti
The Canterbury Tales (2010) - illustrations only, retold by Peter Ackroyd
The Trickster's Hat: A Mischievous Apprenticeship in Creativity (2014)
Dubious Documents (2018)
The Archeo: Personal Archetype Cards (2021)
Popup books
There Was An Old Lady (1990)
Wings (1990)
Jabberwocky (1991)
Runners, Sliders, Bouncers, Climbers (1992)
Solomon Grundy (1992)
The Walrus and the Carpenter (1992)
Kubla Khan (1993)
Robin Hood (1993)
My Foolish Heart: A Pop-Up Book of Love (2017)
References
External links
NickBantock.com - Official site
Interview with Nick Bantock at January Magazine
Museo 5 - Nick Bantock
Nick Bantock Podcasts Windflower
Nick Bantock Appreciation group on Facebook
The Venetian for iPad
The Complete Book Catalog
Living people
English illustrators
20th-century English novelists
21st-century English novelists
1949 births
English male novelists
20th-century English male writers
21st-century English male writers |
Junk Bay, also known by its Chinese transliteration Tseung Kwan O (); is a bay in Sai Kung District, New Territories, Hong Kong. In the northern tip of the bay lies the Tseung Kwan O Village.
The Tseung Kwan O New Town, one of the nine new towns in Hong Kong, was mainly built on reclaimed land in the northern half of the bay. The population as of 2011 is about 368,000.
Name
In Cantonese, Tseung Kwan () means the "general" of an army, and O () means "bay". Therefore, Tseung Kwan O literally means "General's Bay".
The exact origin of the name Tseung Kwan O is unknown, but it is said to be named in honour of a Ming Dynasty soldier who visited Tseung Kwan O at some point. Another theory is that the name was chosen in the 17th century, when naval battles were fought against pirates from Japan at Tseung Kwan O. Yet another theory is that the pronunciation of "將軍" can sound like "Junk Wan" to the ears of English speakers; wan is also a transliteration of the Chinese word for "bay" ().
The current town center of Tseung Kwan O stands on reclaimed land. The English name Junk Bay was said to be derived from the existence of junks in the bay, and the reclamation land based on the landfill. The landfill did not exist when the bay was first named, so "junk" very likely refers only to ships, not the detritus deposited there in recent years. This seems to be a common misconception. |date=October 2010}}. The first landfill was opened in 1978, decades after Junk Bay was named. The Fat Tong Chau (Junk Island) is in the southeastern part of the bay.
History and geography
The bay is near the eastern mouth of Hong Kong's Victoria Harbour.
A local gazette, Genuine record of Guangdong province (Chinese traditional: 粵大記), clearly contained the place name: 將軍澳 (Chinese characters of Tseung Kwan O). A genuine record of Guangdong province was published during the Ming Dynasty: Residents inhabited Tseung Kwan O area then.
Before the development of the new town, the area around the bay was occupied by fishing towns and villages. Settlements in the area began as early as in the 13th century. Major settlements, however, did not occur until the late 16th century when small fishing villages were founded in the area. Hang Hau quickly emerged into a market town and became the most populated and prosperous place in the whole of Clear Water Bay Peninsula; it continued for the next few centuries as such. Other towns and villages include Rennie's Mill (Tiu Keng Leng), Hang Hau and Yau Yue Wan. Rennie's Mill was where Kuomintang loyalists were settled following the end of the Chinese civil war, and Hang Hau had a ship-building industry.
The Hong Kong Government had been interested in developing a new town at Hang Hau because of its proximity to the urban area. The project was postponed for a long time owing to the extensive scale of reclamation in the bay, which is rather deep. It finally started under the name of Tseung Kwan O. The area of Tseung Kwan O is about 1,790 ha, with a projected population of 490,000 upon completion.
Tseung Kwan O today comprises five main areas: Po Lam, Hang Hau, Tseung Kwan O, Tiu Keng Leng and LOHAS Park. All 5 have MTR stations.
Climate
Development of Tseung Kwan O
In 1983, development of Phase I of the New Town to an initial population of about 175,000 was formally endorsed. By 1986, construction of the two tubes of Tseung Kwan O Tunnel began, which provided potential for further increasing the population of the New Town. To maximize the utilization of the road infrastructure and to meet the demand for land for public housing, the Government decided that the New Town should include a Phase II development, with an increase in the projected population to about 325,000. To cater for redevelopment of the Tiu Keng Leng Cottage Area and to provide land for development of Tseung Kwan O Industrial Estate and deep waterfront industries, in 1988, the Government further decided to proceed with Phase III development of the New Town for about 490,000 people.
Photo gallery
See also
List of bays in Hong Kong
Tiu Keng Leng
Po Lam
References
Bays of Hong Kong
Sai Kung District
Restricted areas of Hong Kong red public minibus |
Eric Bryan Lindros (; born February 28, 1973) is a Canadian former professional ice hockey player. Lindros was born in London, Ontario, but grew up in Toronto. He played junior hockey in the Ontario Hockey League (OHL) for the Oshawa Generals prior to being chosen first overall in the 1991 NHL Entry Draft by the Quebec Nordiques. He refused to play for the Nordiques and was eventually traded to the Philadelphia Flyers in June 1992 in exchange for a package of players and draft picks including Peter Forsberg. During his OHL career, Lindros led the Generals to a Memorial Cup victory in 1990. Prior to being drafted in 1991, Lindros captured the Red Tilson Trophy as the Most Outstanding Player in the OHL, and also was named the CHL Player of the Year.
Lindros began his National Hockey League (NHL) career with the Flyers during the 1992–93 season. He was an exemplary power forward, and averaged more than a point per game. His hard-nosed style caused him to miss significant time with injuries, and he had many problems with concussions. Lindros captured the Hart Memorial Trophy as the league MVP and Lester B. Pearson Award as the most outstanding player after the lockout-shortened 1994–95 season. In August 2001, Lindros joined the New York Rangers via a trade. He then signed with the Toronto Maple Leafs for the 2005–06 season before finishing his career in 2006–07 with the Dallas Stars.
Internationally, Lindros represented Canada at the World Junior Championships three times (1990, 1991 and 1992), winning gold medals in 1990 and 1991. He was Canada's all-time points leader at the World Junior Championships with 31 points until surpassed by Connor Bedard in 2023, five points ahead of Jordan Eberle and Brayden Schenn. Lindros has also represented Canada's senior team at the World Hockey Championships, leading the squad in scoring at the 1993 tournament. In Olympic play, Lindros represented Canada three times (1992, 1998 and 2002), winning a silver medal in 1992 and gold in 2002. In 2016, Lindros was inducted into the Ontario Sports Hall of Fame where he credited the quality facilities in London, Ontario, his coaches, and his parents for his success. In 2016 Lindros was inducted into the Hockey Hall of Fame. In 2017 he was named one of the '100 Greatest NHL Players' in history. Lindros's jersey, #88, was retired by the Flyers in 2018.
Hockey career
As a youth, Lindros played in the 1985 and 1987 Quebec International Pee-Wee Hockey Tournaments with the Toronto Marlboros and Toronto Young Nationals minor ice hockey teams, respectively.
Junior career (1989–1992)
As a teenage power forward playing minor hockey, Lindros became nationally famous both for his scoring feats and his ability to physically dominate players older than himself. He attended Monarch Park and later North Toronto Collegiate in Toronto. Both Eric and his younger brother Brett (Eric in 1988–89) played for the Metro Junior "B" St. Michael's Buzzers before moving up to the OHL. Lindros's play made him the most highly valued amateur player in North America and he was often nicknamed "The Next One", a reference to Wayne Gretzky's moniker "The Great One."
Throughout his career, Lindros has been tagged with various other nicknames, including "The Big E." The hype around Lindros during his early career led to an exclusive deal with sports card manufacturer Score. Attempting to leverage this arrangement as much as possible, he was even featured on a baseball card showing him as a third baseman for the Toronto Blue Jays, although the closest he came to a professional baseball career was taking batting practice one day with the Blue Jays.
Lindros refused to sign with the Sault Ste. Marie Greyhounds after being drafted from St. Michael's. Greyhounds owner Phil Esposito had drafted him anyway, enabling Esposito to sell his share in the team at a higher price. Lindros was traded to the Oshawa Generals instead.
He played parts of three seasons for the Generals from 1990 to 1992. During that time, he scored 180 goals, 200 assists, 380 points and had 437 penalty minutes in 157 games played.
Lindros helped lead the Generals to the 1990 J. Ross Robertson Cup, and a 1990 Memorial Cup victory.
During the 1990–91 season, Lindros won the Eddie Powers Memorial Trophy as top scorer, the Red Tilson Trophy as MVP, the CHL Player of the Year award and the CHL Top Draft Prospect Award. The Generals returned to the Robertson Cup finals, facing Sault Ste. Marie. The series was one of the more dramatic in OHL history given Lindros's attitude toward the team, with fans from the Soo loudly jeering him every time he touched the puck. The Greyhounds upset the heavily favoured defending champions in a six-game series, winning the last game on home ice.
On March 6, 2008, the Generals retired his jersey number 88, the second number to be retired by the franchise, and it was declared Eric Lindros Day in Oshawa.
1991 NHL Entry Draft
Lindros was selected first overall by the Quebec Nordiques in the 1991 NHL Entry Draft. Lindros had signaled in advance that he would never play for the Nordiques, citing the ownership. Despite this, the team selected him anyway. Nordiques owner Marcel Aubut publicly announced that they would make Lindros the centrepiece of their franchise turnaround, and refused to trade Lindros, saying that the only way he would play in the NHL would be in a Nordiques uniform. While he awaited a trade, Lindros spent the time playing with the Generals and also participated in the 1992 Winter Olympics, winning a silver medal with Canada.
At the 1992 NHL Entry Draft, the Nordiques worked out trades involving Lindros with both the Philadelphia Flyers and New York Rangers. The Flyers trade had the Nordiques receiving Steve Duchesne, Ron Hextall, Kerry Huffman, Mike Ricci, the rights to Peter Forsberg, the Flyers' first-round pick in 1992 (seventh overall) and 1993 and $15 million. The trade with the Rangers had the Nordiques receiving Tony Amonte, Alexei Kovalev, John Vanbiesbrouck, Doug Weight, three first-round picks (in 1993, 1994 and 1996) and $12 million. Additionally, if Vanbiesbrouck was declared an unrestricted free agent, James Patrick would have replaced him in the deal. The Flyers, believing they had consummated their deal with the Nordiques first, filed a complaint and the NHL announced an independent arbitrator was appointed.
On June 30, 1992, 11 days after the draft, arbitrator Larry Bertuzzi ruled in favour of the Flyers. Bertuzzi determined that the Flyers and Nordiques had agreed to a trade 80 minutes before the Rangers and Nordiques had reached their agreement. Since the Flyers used the 1992 pick to select Ryan Sittler and Quebec had no interest in Sittler, the Flyers and Nordiques had to agree on a substitution for the pick. On July 21, Bertuzzi ruled that Chris Simon and the Flyers' 1994 first-round pick would be added to the trade.
After Lindros was officially traded to the Flyers, he stated that he had been wary of playing for the Nordiques primarily because of what he called a "lack of winning spirit" in the organization. At the time they picked him, the Nordiques had finished dead last in the league for three years in a row. However, in 2016, he told ESPN that his objection to playing in Quebec was based "solely" on Aubut. While he didn't elaborate, he said, "I was not going to play for that individual--period."
Philadelphia Flyers
With his imposing physical strength and playmaking ability, Lindros established himself as the top player on a Flyers team that had perennially been in contention but always fell short. His time in Philadelphia saw him score points (for much of his first five seasons in the NHL, Lindros hovered around fourth all-time in points per game) and become one of the most feared and dominating players in the NHL. In September 1994, Lindros succeeded Kevin Dineen as Flyers captain. Along with John LeClair and Mikael Renberg, he played on the dreaded "Legion of Doom" line. He scored over 40 goals in each of his first two seasons and won the Hart Memorial Trophy as MVP in the lockout-shortened season of 1995 after scoring 29 goals and 41 assists in 46 games and leading the Flyers to their first playoff appearance in six years.
Lindros led the Flyers to the 1997 Stanley Cup Finals, handily defeating the Pittsburgh Penguins, Buffalo Sabres and the New York Rangers in five games apiece. In the Finals, however, the Flyers were swept in four games by the Detroit Red Wings; Lindros's only goal came with 14 seconds left in the third period of Game 4. Detroit Head Coach Scotty Bowman used the finesse-oriented defence pairing of Nicklas Lidström and Larry Murphy against Lindros's Legion of Doom line instead of sending out—as everyone, including the Flyers, expected—Vladimir Konstantinov to engage in a physical confrontation.
In 1998, Lindros, at just 25 years of age, was ranked number 54th on The Hockey News''' list of the 100 Greatest Hockey Players of all time. The only player of comparable age was 37th-ranked Jaromír Jágr, who was 26 at the time.
Lindros's relationship with Flyers General Manager Bobby Clarke soon deteriorated. He and Clarke feuded in the media, with Clarke questioning his toughness; Lindros spent many games on the injured reserve and suffered a series of concussions, the first in 1998 from a hit delivered by Pittsburgh's Darius Kasparaitis that sidelined him for 18 games. Lindros suffered a second concussion in January 1999 that sidelined him for two games. During a game against the Nashville Predators on April 1, 1999, Lindros suffered what was diagnosed as a rib injury. Later that night, the teammate he was sharing a hotel room with, Keith Jones, discovered Lindros lying in a tub, pale and cold. In a call to the Flyers, the trainer was told to put Lindros on a plane that was returning to Philadelphia with injured teammate Mark Recchi. But Jones insisted that Lindros be taken to a nearby hospital and it was discovered Lindros had a collapsed lung caused by internal bleeding of his chest wall. Lindros's father wrote the Flyers a letter in which he stated that if the trainer had followed team orders, Eric would be dead, a statement supported by the doctors who treated him in Nashville.
The 1999–2000 season was Lindros's last as a Flyer. Having suffered his second concussion of the season (fourth overall) in March, Lindros criticized the team's trainers for failing to diagnose a concussion as he played with symptoms following a hit he suffered in a game against the Boston Bruins two weeks prior. Clarke then stripped Lindros of the captaincy for his actions. Lindros sat out the remainder of the regular season and suffered another concussion while rehabilitating for a return to the lineup. Lindros ultimately returned for Game 6 of the Eastern Conference Finals against the New Jersey Devils; he scored the lone goal in a 2–1 Flyers loss. In Game 7 of the series, Lindros was coming over the blue line with his head down, when Devils defenseman Scott Stevens hit Lindros with a shoulder check, knocking him unconscious and suffering yet another concussion. He was able to get off the ice with help from teammates. The Flyers lost Game 7, 2–1 and the series despite leading three games to one, and Lindros became a restricted free agent during the off-season. He refused to accept a two-way qualifying offer with a minor league provision from the Flyers, who still owned his rights. After Lindros was cleared to play in December, the Flyers refused to deal his rights to the Toronto Maple Leafs, as he preferred, and Lindros sat out the entire 2000–01 season.
New York Rangers
Bobby Clarke eventually traded Lindros to the New York Rangers on August 20, 2001, in exchange for Jan Hlaváč, Kim Johnsson, Pavel Brendl and a 2003 third-round draft choice (Štefan Ružička). The Rangers would also receive a 2003 first-round draft pick if Lindros were to suffer a concussion in the pre-season or the first 50 games of the regular season, and did not return to action for at least 12 months.
In 2001–02, Lindros averaged a little over a point a game with 37 goals and 36 assists for 73 points in 72 games. His impressive start also led to his seventh and final All-Star selection, but due to an injury he was unable to participate and was replaced by teammate Mike York. Though 2002–03 was the first injury-free season of his career, he struggled to match his previous season, scoring just 53 points in 81 games. In 2003–04, Lindros's eighth concussion limited him to just 39 games, though he did collect 32 points. He again became an unrestricted free agent after the season.
Toronto Maple Leafs
On August 11, 2005, after the NHL labour dispute had cancelled the 2004–05 season, Lindros signed a one-year, $1.55 million contract with the Maple Leafs for the 2005–06 season. After a steady start to his tenure with Toronto in which he recorded 22 points in 32 games, Lindros suffered a tear of a ligament in his left wrist against the Dallas Stars on December 10, 2005. After a 27-game absence, Lindros returned to the Toronto lineup on February 28, 2006, his 33rd birthday, against the Washington Capitals. His return was brief, however, as he re-injured his wrist while taking a slapshot in a game against the Ottawa Senators on March 4, effectively ending his season. He had surgery on the wrist at the Hand and Upper Limb Centre in London, Ontario, two days after the game.
Dallas Stars and retirement
Lindros signed a one-year contract for the 2006–07 season with Dallas on July 17, 2006. He played in 49 regular season games collecting 26 points, and three games in the 2007 playoffs.
Lindros officially announced his retirement on November 8, 2007, in London at the age of 34.
International play
Played for Canada in:
1990 World Junior Championships (gold medal)
1991 World Junior Championships (gold medal)
1991 Canada Cup (championship)
1992 World Junior Championships
1992 Winter Olympics (silver medal)
1993 World Championships
1996 World Cup of Hockey
1998 Winter Olympics
2002 Winter Olympics (gold medal)
Post-playing career
On the day of his retirement, November 8, 2007, it was also announced that Lindros had donated $5 million to the London Health Sciences Centre. This donation supports programs such as the Fowler Kennedy Sport Medicine Clinic, and is one of the largest personal donations by a Canadian sports figure.
On November 11, 2007, three days after his retirement, the National Hockey League Players' Association (NHLPA) appointed Lindros to the newly created position of NHLPA ombudsman. Lindros had been involved with the organization throughout his career. Lindros cut ties with the NHLPA, however, on February 3, 2009, resigning as ombudsman after 15 months on the job.
On May 9, 2010, Lindros, along with his mother Bonnie, supermodel/actress Monika Schnarre and a few other Canadian notables, helped Habitat for Humanity Toronto by recognizing Mother's Day by building homes.
On December 31, 2011, he played in the 2012 NHL Winter Classic Alumni Game between the New York Rangers and the Philadelphia Flyers.
In April 2016 Lindros supported Rowan's Law. This was concussion-education legislation named in memory of a teen rugby player from Ottawa who died during a game. The legislation was privately sponsored by Nepean-Carleton MPP Lisa MacLeod. Later MacLeod revealed she knew of rumours relating to alleged sexual misconduct by Patrick Brown, then Ontario Progressive Conservative leader. In 2018 she acknowledged her source had been Lindros.
In June 2016, Lindros was announced as one of four appointees to the 2016 Hockey Hall of Fame induction class, joined by the late Pat Quinn, goaltender Rogie Vachon and Russian winger Sergei Makarov.
On January 14, 2017, Lindros reunited with his former "Legion of Doom" linemates John LeClair and Mikael Renberg to play in the 50th Anniversary Alumni game between the Pittsburgh Penguins and the Philadelphia Flyers.
In a 2017 interview on French Canadian television, he opened up about his time being drafted by the Nordiques. He later stated that he had no problem with Quebec City or the people, stating that his wife is French Canadian. He stated that the real reason was he did not respect Marcel Aubut and criticized on how he would never play for him. At the end of the interview, he was given the Nordiques igloo and fleur-de-lys jersey at last, 26 years after the saga began.
On January 18, 2018, the Flyers retired Lindros's no. 88 jersey in a pre-game ceremony at the Wells Fargo Center.
Personal life
The oldest son of Carl Lindros and Bonnie Roszell-Lindros, Lindros has Swedish heritage. The name "Lindros" means "rose of the linden tree." His great-grandfather Axel immigrated to Canada from Bredaryd, a small village in Sweden, and Eric is the third generation of the Lindros family to be born in Canada. His father Carl Lindros received a Bachelor of Arts degree from the University of Western Ontario (where he played football, well enough to be drafted 30th overall by the Canadian Football League's Edmonton Eskimos in the 1970 CFL College Draft), and became a chartered accountant. Lindros's mother Bonnie is a registered nurse. Lindros has one brother, Brett, and one sister, Robin.
Lindros's younger brother Brett played for the New York Islanders and retired early on May 1, 1996, due to post-concussion syndrome.
The book Fire on Ice'', co-written by Randy Starkman and published in October 1991 by HarperCollins, chronicled the life and early hockey career of Lindros.
In 2012 Lindros married Kina Lamarche, a native Quebecer and former president of the North American wing of Travelex. They have three children: Carl Pierre, and twins Sophie and Ryan. Lindros and his family currently reside in Toronto. They are close friends with Goldie Hawn and Kurt Russell, with both families owning a cottage on Lake Rosseau in Muskoka, Ontario.
Career statistics
Regular season and playoffs
International
All-Star Games
Career achievements
Awards
Junior
Professional
International
Records
Fourth-fastest player in NHL history to score 300 points (210 games) behind Wayne Gretzky (159), Mario Lemieux (186) and Peter Šťastný (186);
Fourth-fastest player in NHL history to score 400 points (277 games) behind Wayne Gretzky (197), Mario Lemieux (240) and Peter Šťastný (247);
Fifth-fastest player in NHL history to score 500 points (352 games) behind Wayne Gretzky (234), Mario Lemieux (287), Peter Šťastný (322) and Mike Bossy (349);
Sixth-fastest player in NHL history to score 600 points (429 games) behind Wayne Gretzky (274), Mario Lemieux (323), Peter Šťastný (394), Mike Bossy (400) and Jari Kurri (419).
Quotes
By Lindros
"Right now my focus is the 'PA work, I'm not really concerned about the rest of it. But the last couple of years have been pretty frustrating in terms of not getting through without being injury-free. It's just frustrating."
"My decision to retire from professional hockey is something that I have been considering for some time and did not come easily. I will miss the day-to-day activity of being a member of a team and the camaraderie that I developed with my teammates will never be forgotten. I played with the best, I played against the best — it was a blast. It really truly was. I enjoyed myself immensely."
About Lindros
"He had it all: size, strength and finesse, It is unfortunate injuries cut his time in the NHL short, but he had a great career and left his mark on the game." —John LeClair.
"Yes, based on his ability to play the game and based on his contributions as a player, I think you have to separate all the crap that went on. Particularly when he played for the Flyers, it was just outstanding, dominant hockey — the first of the huge, big men with small man's skill." — Bobby Clarke, on whether Lindros should be in the Hockey Hall of Fame.
References
External links
October 2011 Interview with The Hockey Writers
"Great Expectations Haunt Talented Lindros", ESPN.com, Bob Carter.
Lindros snubs Quebec (CBC video)
1973 births
Living people
Canadian ice hockey centres
Canadian people of Swedish descent
21st-century Canadian philanthropists
Dallas Stars players
Hart Memorial Trophy winners
Hockey Hall of Fame inductees
Ice hockey people from Toronto
Ice hockey players at the 1992 Winter Olympics
Ice hockey players at the 1998 Winter Olympics
Ice hockey players at the 2002 Winter Olympics
Lester B. Pearson Award winners
Medalists at the 1992 Winter Olympics
Medalists at the 2002 Winter Olympics
National Hockey League All-Stars
National Hockey League first-overall draft picks
National Hockey League first-round draft picks
National Hockey League players with retired numbers
New York Rangers players
Olympic gold medalists for Canada
Olympic ice hockey players for Canada
Olympic medalists in ice hockey
Olympic silver medalists for Canada
Oshawa Generals players
Philadelphia Flyers captains
Philadelphia Flyers players
Quebec Nordiques draft picks
Ice hockey people from London, Ontario
Toronto Maple Leafs players |
Stamford is a village in Delaware County, New York, United States. The population was 1,119 at the 2010 census. The village is located partly in the town of Stamford and partly in the town of Harpersfield. The village is on routes 23 and 10. The village has termed itself the "Queen of the Catskills".
History
The area was visited by farmers and trappers in the 18th century. The village was incorporated in 1870. By the early part of the 20th century Stamford reached its peak as a tourist area, mostly aided by the arrival of the Ulster and Delaware Railroad from Kingston in 1872. Passenger service lasted until March 31, 1954; freight service until September 28, 1976.
The Churchill Park Historic District and Erskine L. Seeley House are listed on the National Register of Historic Places.
Geography
Stamford is located in northeastern Delaware County at (42.4116, -74.6189). The village is in the Catskill Mountains. The headwaters of the West Branch Delaware River passes through the center of the village and forms the boundary between the town of Harpersfield to the west and the town of Stamford to the east. Slightly more than half of the village is in the town of Stamford.
New York State Routes 10 and 23 intersect on the west side of the village. NY 10 leads north to Cobleskill and southwest to Delhi, while NY 23 leads west to Oneonta and east to Catskill.
According to the United States Census Bureau, the village of Stamford has a total area of , of which , or 0.66%, is water.
Demographics
As of the census of 2000, there were 1,265 people, 496 households, and 290 families residing in the village. The population density was . There were 621 housing units at an average density of . The racial makeup of the village was 97.55% White, 0.40% Black or African American, 0.08% Native American, 0.63% Asian, 0.40% from other races, and 0.95% from two or more races. Hispanic or Latino of any race were 3.64% of the population.
There were 496 households, out of which 28.2% had children under the age of 18 living with them, 44.6% were married couples living together, 10.3% had a female householder with no husband present, and 41.5% were non-families. 34.5% of all households were made up of individuals, and 16.1% had someone living alone who was 65 years of age or older. The average household size was 2.28 and the average family size was 2.99.
In the village, the population was spread out, with 22.2% under the age of 18, 6.4% from 18 to 24, 21.1% from 25 to 44, 24.0% from 45 to 64, and 26.2% who were 65 years of age or older. The median age was 45 years. For every 100 females, there were 88.0 males. For every 100 females age 18 and over, there were 83.9 males.
The median income for a household in the village was $30,664, and the median income for a family was $38,864. Males had a median income of $27,500 versus $21,607 for females. The per capita income for the village was $18,012. About 9.4% of families and 15.2% of the population were below the poverty line, including 22.8% of those under age 18 and 13.6% of those age 65 or over.
Attractions
The village of Stamford is a stop on the Catskill Scenic Trail, a multi-use rail trail following the former route of the Ulster and Delaware Railroad. Catskill is also home of the Headwaters Trails. Overlooking Stamford on the east is Mount Utsayantha, which includes an observatory and a viewing tower. It is a popular destination for hang-gliding enthusiasts.
References
External links
Village of Stamford official website
Mount Utsayantha Photo Gallery
News, photos and opinion from "The Queen of the Catskills"
Villages in New York (state)
Villages in Delaware County, New York |
East Blockhouse may refer to:
East Blockhouse, a Palmerston Fort in Milford Haven
East Blockhouse, a 16th-century fortification in Angle, Pembrokeshire |
My GamesFever was a live daytime interactive game show formerly aired on MyNetworkTV stations owned by the Fox Television Stations Group. Featured in the two-hour program were interactive games where the viewers could win cash prizes. The show aired from 1 p.m. – 3 p.m, in two separate feeds (Eastern and Pacific) every Monday through Friday.
Format
On My GamesFever, the contestants were home viewers. American residents 18 or older could enter the contest by text messaging a request or using the network's website. Potential contestants could enter up to twenty-five times per phone number on each show.
After a few moments, a contestant was notified whether or not their entry is chosen (at random) to proceed to another random selection process. If an entry was selected in the second phase, the contestant was called on his or her home or mobile phone, depending on the method of entry. The contestant then came on-air and was given a chance to play.
Contestant selection was based on call volume, as reflected by an on-screen thermometer. When the thermometer reached a certain level, or after a certain amount of time, a caller was selected to play the game. A $.99 fee was charged for each text message entry, in addition to standard text messaging rates charged by the wireless provider. Entries on the website were free. Regardless of the method of entry, each entry had an equal chance of being selected. Residents of certain states were ineligible to play various entry methods.
Programming history
The show premiered online on December 4, 2006 and began its television broadcasting one week later. The program aired without commercials.
The show ended on April 20, 2007 with 105 episodes with the last episode having all on air personalities on the show.
My GamesFever was broadcast from Miami, Florida, under a grant from the Governor's Office of Film and Entertainment. and was produced by Shine Matrix Limited in association with 20th Television.
Games
My GamesFever featured various minigames that were played throughout the program. The rewards for the games were usually cash prizes ranging from $200 – $500 in cash. Most games were word games, featuring variations on anagrams, word searches, crosswords and fill-in-the-blanks.
See also
PlayMania
Quiznation
100 Winners
Midnight Money Madness
Play2Win
ITV Play
References
External links
2000s American game shows
2006 American television series debuts
2007 American television series endings
Phone-in quiz shows
Television series by Endemol |
José Aparecido Gonçalves de Almeida (born 21 July 1960) is a Brazilian Roman Catholic bishop. He had previously served as Under-Secretary of the Pontifical Council for Legislative Texts.
Gonçalves de Almeida was born in the city of Ourinhos. He felt a vocation to the priesthood. He attended a course in Philosophy at the FAI - "Faculdades Associadas do Ipiranga" in São Paulo (1980-1982) and the Bachelor of Theology at the "Faculdade Nossa Senhora da Assunção," São Paulo (1983-1986). He also holds a Doctorate in Canon Law at the Pontifical University of the Holy Cross. He was ordained on 21 December 1986 at the age of 26 for the Diocese of Santo Amaro.
In the course of his priestly ministry he served as parochial vicar of the parish and then Administrator of the Parish "Santa Cruz" from 1987–1988. He was pastor of the parish of "Nossa Senhora do Socorro Perpétuo" from 1988–1990. He was called to work in the Roman Curia as an official of the Pontifical Council for Legislative Texts from 1994. On 14 June 2010 he was appointed as Under-Secretary by Pope Benedict XVI. He held the office until 8 May 2013 when Pope Francis appointed him Titular Bishop of Enera and Auxiliary Bishop of Brasília.
His episcopal consecration took place on 13 July with Archbishop Sérgio da Rocha as principal consecrator and Bishop Fernando Antônio Figueiredo, O.F.M. of Santo Amaro and Bishop Juan Ignacio Arrieta Ochoa de Chinchetru as principal co-consecrators.
References
1960 births
Living people
People from Ourinhos
21st-century Roman Catholic titular bishops
Pontifical University of the Holy Cross alumni
Roman Catholic Ecclesiastical Province of Brasília
21st-century Roman Catholic bishops in Brazil
Roman Catholic bishops of Brasília |
GlobalGiving is 501(c)(3) non-profit organization based in the United States that provides a global crowdfunding platform for grassroots charitable projects. Since 2002, more than 1.6 million donors on GlobalGiving have donated more than $750 million to support more than 33,000 projects in 175 countries.
History
Before founding GlobalGiving, Mari Kuraishi and Dennis Whittle were heads of strategy and innovation at the World Bank. While in that post, they created the first-ever Innovation Marketplace for Bank staff in 1998, an internal competition in which Bank employees pitched their own ideas for fighting poverty worldwide. The winners received grants to develop their ideas.
In 2000, they took the concept and competition to the outside world. The Development Marketplace enabled any social entrepreneur to compete for Bank funds. The program was extremely successful — finalists from all over the world gathered in Washington, D.C., and $5 million was awarded to the 44 most innovative projects.
Based on the Marketplaces' success, Mari and Dennis created an Internet-based platform to facilitate a broader range of social and economic investments in developing countries. In October 2000, they left the World Bank and on February 14, 2002, GlobalGiving (formerly DevelopmentSpace) was launched.
Major funding for the launch and early stages was provided by the Omidyar Network, the Skoll Foundation, the William and Flora Hewlett Foundation, and the Sall Foundation. GlobalGiving was launched as a collaboration between the GlobalGiving Foundation and ManyFutures, Inc. In December 2008, ManyFutures became a formal subsidiary of the GlobalGiving Foundation, and all operations were placed under direct foundation management.
Victoria Vrana, a longtime senior leader at the Gates Foundation, became CEO in January 2023. Donna Callejon, who has held multiple leadership positions in the organization since 2003, was appointed Interim CEO in December 2021, succeeding Alix Guerrier, who was appointed CEO in 2018. Mari Kuraishi stepped down as President on November 1, 2018 and joined her co-founder and former CEO, Dennis Whittle, on the organization’s Board of Directors.
Structure
The GlobalGiving Foundation is a US-based non-profit organization that individuals and companies can donate to through the website globalgiving.org. It is supported by a network of implementing, corporate and institutional partners.
Potential donors can browse and select from a wide offering of projects that are organized by geography or by themes such as health care, the environment and education. A donor can contribute any amount using a credit/debit card, check, PayPal, Apple Pay, stock transfer, DAF, or M-Pesa. Donors can purchase gift cards which recipients can redeem in support of a project of their choosing.
GlobalGiving funds itself by retaining a 5-12% nonprofit support fee plus a 3% third-party processing fee for each donation. The nonprofit support fee covers the cost of providing support and training to nonprofits, conducting rigorous due diligence on organizations, and conducting field visits. GlobalGiving's administrative overhead is 3.0%.
Companies can also use the GlobalGiving platform to allow their employees, customers, partners, or foundation entities to donate directly to grassroots social and economic development projects around the world.
GlobalGiving as a web-based fundraising platform is fundamentally different from the World Bank Development Marketplace because it is based on social networks and real-time feedback between donors and grassroots social entrepreneurs or "project leaders." Each organization pitches one or more development projects to prospective donors on the website. The funding decision for each project is crowd-sourced to the public, rather than determined by a team of experts, as in the Development Marketplace. However, in practice, organizations that promote themselves through email and social media campaigns vastly improve their fundraising potential. Each project depends on evangelists (people who spread good news) to flourish. The funding and project update history for each project is public and acts as a form of reputation system for the organization implementing the project.
Disaster relief
In response to natural disasters and humanitarian crises, GlobalGiving regularly launches relief funds to support nonprofits helping those in need. The Disaster Recovery Network at GlobalGiving deploys a "model of effective, community-led relief and recovery through locally focused grants, advocacy, and training programs." GlobalGiving's former Chief Program Officer describes the approach as:
GlobalGiving's community of nonprofits, donors, and companies has funded relief work in response to a wide range of disasters, including Hurricane Maria in 2017, the Nepal earthquake in 2015, the Ebola outbreak in West Africa in 2014, Typhoon Haiyan in 2013, the Tohoku earthquake and tsunami in 2011, and the ongoing Syrian refugee crisis, among others. GlobalGiving is regularly recommended by USAID's Center for International Disaster Information to donors looking to support disaster relief efforts.
Vetting
GlobalGiving runs a vetting program for nonprofits participating in its community. Nonprofits are judged on characteristics such as transparency, accountability, financials, and compliance with local regulations and international philanthropic guidelines. The vetting also factors in GlobalGiving-specific criteria such as engagement with the GlobalGiving community, ability to crowdfund on the platform, and ability to manage the programs fundraising on the platform.
Reviews
GlobalGiving earned Charity Navigator's highest rating of four stars in the latest ratings published by the charity evaluator. The Better Business Bureau's 2019 review states that GlobalGiving meets all of its charity accreditation standards.
References
External links
Official website
Development charities based in the United States
Peer-to-peer charities
Crowdfunding platforms of the United States
Non-profit organizations listed in Russia as foreign agents |
Prior to World War I, the Tkhuma ( "Borderland") were one of five principal and semi-independent Assyrian tribes subject to the spiritual and temporal jurisdiction of the Assyrian Patriarch with the title Mar Shimun. The Assyrians claimed the status of a firman of protection from the Caliphate and of an Ottoman millet to preserve their customs and traditions along with the tribes of Jelu, Baz, Tyari, and Deez/Diz, "forming the highest authority under His Holiness Mar Shimun, the patriarch." The Tkhuma Tribe is a tribe of Assyrians that lived in upper Mesopotamia until 1915, when they were dispersed into Persia, Iraq, and Syria during the Sayfo or Assyrian genocide. In 1915, the representative of the Assyrian Patriarch Shimun XX Paulos wrote that the Tkhuma of "many Christian villages" had "been entirely destroyed."
In 1933, Malik Loco Badawi, the chief of the Tkhuma tribe, from the Royal House of Badawi, went with the chief of the Tyari and 700 armed Assyrians into Syria at the outset of the Simele massacre. The League of Nations took responsibility for the resettlement of the Tkhuma Assyrians, reporting in 1937 that 2,350 Tkhuma had been settled in three villages in Syria.
Military
It was said that they the Tkhuma Tribe were the best fighters in the West Asia along with the Assyrian tribe of Tyari. Their Muslim neighbors stated that in order to stand a chance they needed to outnumber the Assyrians of Tkhuma or Tyari five to one, and have superior modern weapons.
A journalist of the Ottoman Empire wrote, "The people of Tkhuma put up a great defense on September 27th and 28th [1915]. But while they were building trenches for themselves the Kurds were destroying them with guns. The Turks destroyed... Inner Tkhuma and many other places.".
In the early 1930s the Assyrians consisting mainly of Tkhoumnayeh and Tyarayeh successfully defeated the Iraqis in Dairabun killing 33 and wounding 40 including 3 officers while the Assyrians suffered significantly less losses. The Iraqis were armed with modern weapons and attack planes given to them by the British while the Assyrians were only equipped with old rifles.
References
Assyrian tribes
Hakkari |
The Dreieckhorn is a mountain of the Bernese Alps, overlooking Konkordiaplatz in the canton of Valais.
References
External links
Dreieckhorn on Hikr
Mountains of the Alps
Alpine three-thousanders
Mountains of Switzerland
Mountains of Valais
Bernese Alps |
The 24 May 1993 PKK attack, sometimes referred to as the Bingöl massacre was a Kurdistan Workers Party (PKK) attack on unarmed Turkish military soldiers on the Elazığ-Bingöl highway, west of Bingöl. 33 Turkish soldiers and varying conflicting accounts of civilians were killed (two, four five). This occurred following the breaking of the first ever PKK-Turkish ceasefire when Turkish forces attacked the PKK in Kulp.
Background
In late 1991, Turkish president Turgut Özal attempted to establish dialogue with the PKK. He had said the idea of a federation could be discussed and a Kurdish language TV channel could be opened. He also passed a bill, partially unbanning the use of the Kurdish language. In response the PKK declared a cease-fire on 20 March 1993. On 17 April 1993 Turgut Özal died under suspicious circumstances. The Turkish military began to increase their attacks on the PKK, in particular on 19 May, in Kulp killing around a dozen rebels. Under the control of the provincial commander of the area at the time, Şemdin Sakık reported to Abdullah Öcalan that the soldiers were losing respect. Öcalan responded by stating you may retaliate if attacked to defend yourself, unaware of what would be planned.
The attack
Sasik decided on a show of strength, ordering units to block all main rounds to the Diyarbakir which was a favored operation by the rebels as it asserted authority. Due to the remoteness of some of these stretches of highway, the Turkish military were not eager to confront the PKK so sometimes sent off-duty soldiers via unmarked buses to avoid being targeted or identified at any roadblock.
One of these roads was the Elazığ-Bingöl highway which was allegedly manned by over 150 PKK militants, who had come down from the mountains to the southeast. The PKK stopped several buses transferring unarmed Turkish soldiers in civilian clothes, and then dragged 33 soldiers and five civilians (including four teachers) from the vehicles and executed them. Some 22 soldiers were spared by the PKK and taken prisoner, before being released. The military was criticized for the fact that the soldiers were unarmed and there were no units protecting them. Sakık, later captured by the Turkish security forces, testified during the Ergenekon trials that deep state elements in the Turkish military had sent the soldiers unarmed in the hope they would be killed, as part of the Doğu Çalışma Grubu's coup plans.
Aftermath
On the 8 June 1993, Abdullah Öcalan announced the cease fire it declared in March was over. The Turkish military intensified its anti-insurgency operations against the PKK during the following months. A total of 92 Turkish security forces, 203 Kurdish rebels and 29 civilians were killed during anti-insurgency operations in May and June, an additional 120 Kurds were arrested during these operations.
Turkish claimed that Kucuk Zeki, the PKK's commander in Muş at the time, described the attack as a turning point in the conflict, as the state stepped up its operations against the PKK and "the war got much worse".
Legacy
On 24 May 2012, the 33 Martyrs Memorial near Bingöl was dedicated to the 33 victims of the attack.
References
1993 in military history
Mass murder in 1993
Massacres in 1993
Military history of Turkey
1993 in Turkey
Conflicts in 1993
Kurdistan independence movement
History of Elazığ Province
History of Bingöl Province
Kurdistan Workers' Party attacks
Ambushes in Asia
May 1993 events in Turkey
May 1993 crimes
Massacres in Turkey
1993 murders in Turkey |
Utagawa Kuniyoshi (, ; January 1, 1798 – April 14, 1861) was one of the last great masters of the Japanese ukiyo-e style of woodblock prints and painting. He was a member of the Utagawa school.
The range of Kuniyoshi's subjects included many genres: landscapes, beautiful women, Kabuki actors, cats, and mythical animals. He is known for depictions of the battles of legendary samurai heroes. His artwork incorporated aspects of Western representation in landscape painting and caricature.
Life
Kuniyoshi was born on January 1, 1798, the son of a silk-dyer, Yanagiya Kichiyemon, originally named Yoshisaburō. Apparently he assisted his father's business as a pattern designer, and some have suggested that this experience influenced his rich use of color and textile patterns in prints. It is said that Kuniyoshi was impressed, at an early age of seven or eight, by ukiyo-e warrior prints, and by pictures of artisans and commoners (as depicted in craftsmen manuals), and it is possible these influenced his own later prints.
Yoshisaburō proved his drawing talents at age 12, quickly attracting the attention of the famous ukiyo-e print master Utagawa Toyokuni. He was officially admitted to Toyokuni's studio in 1811, and became one of his chief pupils. He remained an apprentice until 1814, at which time he was given the name "Kuniyoshi" and set out as an independent artist. During this year he produced his first published work, the illustrations for the kusazōshi gōkan Gobuji Chūshingura, a parody of the original Chūshingura story. Between 1815 and 1817 he created a number of book illustrations for yomihon, kokkeibon, gōkan and hanashibon, and printed his stand-alone full color prints of "kabuki" actors and warriors.
Despite his promising debut, the young Kuniyoshi failed to produce many works between 1818 and 1827, probably due to a lack of commissions from publishers, and the competition of other artists within the Utagawa school (Utagawa-ryū). However, during this time he did produce pictures of beautiful women ('bijin-ga') and experimented with large textile patterns and light-and-shadow effects found in Western art, although his attempts showed more imitation than real understanding of these principles.
His economic situation turned desperate at one point when he was forced to sell used tatami mats. A chance encounter with his prosperous fellow pupil Kunisada, to whom he felt that he was superior in artistic talent, led him to redouble his efforts (but did not create any lingering ill-feeling between the two, who later collaborated on a number of series).
During the 1820s, Kuniyoshi produced a number of heroic triptychs that show the first signs of an individual style. In 1827 he received his first major commission for the series, One hundred and eight heroes of the popular Suikoden all told (Tsūzoku Suikoden gōketsu hyakuhachinin no hitori), based on the incredibly popular Chinese tale, the Shuihu Zhuan. In this series Kuniyoshi illustrated individual heroes on single-sheets, drawing tattoos on his heroes, a novelty which soon influenced Edo fashion. The Suikoden series became extremely popular in Edo, and the demand for Kuniyoshi's warrior prints increased, gaining him entrance into the major ukiyo-e and literary circles.
He continued to produce warrior prints, drawing much of his subjects from war tales such as Tale of the Heike () and The rise and fall of the Minamoto and the Taira (Genpei Seisuiki). His warrior prints were unique in that they depicted legendary popular figures with an added stress on dreams, ghostly apparitions, omens, and superhuman feats. This subject matter is instilled in his works The ghost of Taira no Tomomori at Daimotsu bay (Taira Tomomori borei no zu) and the 1839 triptych The Gōjō bridge (Gōjō no bashi no zu), where he manages to invoke an effective sense of action intensity in his depiction of the combat between Yoshitsune and Benkei. These new thematic styles satisfied the public's interest in the ghastly, exciting, and bizarre that was growing during the time.
The Tenpō Reforms of 1841–1843 aimed to alleviate economic crisis by controlling public displays of luxury and wealth, and the illustration of courtesans and actors in ukiyō-e was officially banned at that time. This may have had some influence on Kuniyoshi's production of caricature prints or comic pictures (giga), which were used to disguise actual actors and courtesans. Many of these symbolically and humorously criticized the shogunate (such as the 1843 design showing Minamoto no Yorimitsu asleep, haunted by the Earth Spider and his demons) and became popular among the politically dissatisfied public. Timothy Clark, curator of Japanese art at the British Museum, asserts that the repressive conventions of the day produced unintended consequences. The government-created limitations became a kind of artistic challenge which actually encouraged Kuniyoshi's creative resourcefulness by forcing him to find ways to veil criticism of the shogunate allegorically.
During the decade leading up to the reforms, Kuniyoshi also produced landscape prints (fūkeiga), which were outside the bounds of censorship and catered to the rising popularity of personal travel in late Edo Japan. Notable among these were Famous products of the provinces (Sankai meisan zukushi, c. 1828–30)—where he incorporated Western shading and perspective and pigments—and Famous views of the Eastern capital in the early 1830s, which was certainly influenced by Hokusai's early-1830s Thirty-six Views of Mount Fuji (Fugaku sanjūrokkei). Kuniyoshi also produced during this time works of purely natural subject matter, notably of animals, birds and fish that mimicked traditional Japanese and Chinese painting.
In the late 1840s, Kuniyoshi began again to illustrate actor prints, this time evading censorship (or simply evoking creativity) through childish, cartoon-like portraits of famous kabuki actors, the most notable being "Scribbling on the storehouse wall" (Nitakaragurakabe no mudagaki). Here he creatively used elementary, childlike script sloppily written in kana under the actor faces. Reflecting his love for felines, Kuniyoshi also began to use cats in the place of humans in kabuki and satirical prints. He is also known during this time to have experimented with wide composition, magnifying visual elements in the image for a dramatic, exaggerated effect (ex. Masakado's daughter the princess Takiyasha, at the old Soma palace).
In 1856 Kuniyoshi suffered from palsy, which caused him much difficulty in moving his limbs. It is said that his works from this point onward were noticeably weaker in the use of line and overall vitality. Before his death in 1861, Kuniyoshi was able to witness the opening of the port city of Yokohama to foreigners, and in 1860 produced two works depicting Westerners in the city (Yokohama-e, ex. View of Honchō and The pleasure quarters, Yokohama). He died at the age of 63 in April 1861 in his home in Genyadana.
Pupils
Kuniyoshi was an excellent teacher and had numerous pupils who continued his branch of the Utagawa school. Among the most notable were Yoshitoshi, Yoshitora, Yoshiiku, Yoshikazu, Yoshitsuya, and Yoshifuji. Typically his students began an apprenticeship in which they worked primarily on musha-e in a style similar to that of their master. As they became established as independent artists, many went on to develop highly innovative styles of their own. His most important student was Yoshitoshi, who is now regarded as the "last master" of the Japanese woodblock print.
Among those influenced by Kuniyoshi was Toyohara Chikanobu. Takashi Murakami credits the pioneering influence of Kuniyoshi affecting his work.
Print series
Here is a partial list of his print series, with dates:
Illustrated Abridged Biography of the Founder (c. 1831)
Famous Views of the Eastern Capital (c. 1834)
Heroes of Our Country's Suikoden (c. 1836)
Stories of Wise and Virtuous Women (c. 1841-1842)
Fifty-Three Parallels for the Tōkaidō (1843–1845) (with Hiroshige and Toyokuni III)
Twenty-Four Paragons of Filial Piety (1843–1846)
Mirror of the Twenty-Four Paragons of Filial Piety (1844–1846)
Six Crystal Rivers (1847–1848)
Fidelity in Revenge (c. 1848)
Twenty-Four Chinese Paragons of Filial Piety (c. 1848)
Sixty-Nine Stations along the Kisokaido (1852)
Portraits of Samurai of True Loyalty (1852)
24 Generals of Kai Province (1853)
Half-length portrait of Goshaku Somegoro
Takiyasha the Witch and the Skeleton Spectre
See The Kuniyoshi Project for a more extensive list.
Gallery
Multi-sheet impressions, triptychs
Yoko-e, a print in horizontal or "landscape" format
Single sheet format
Themes
Kuniyoshi's work may be parsed thematically, as in this group of images which feature cats.
Caricatures were among Kuniyoshi's themes.
The Monster's Chūshingura (Bakemono Chūshingura), ca. 1836, Princeton University Art Museum
Kuniyoshi's work is held in the permanent collections of many museums worldwide, including the Metropolitan Museum of Art, the Princeton University Art Museum, the Nasher Museum of Art, the University of Michigan Museum of Art, the Walters Art Museum, the Portland Art Museum, the Seattle Art Museum, the Birmingham Museum of Art, the Fine Arts Museums of San Francisco, the Indianapolis Museum of Art, the Brooklyn Museum, and the Van Gogh Museum.
See also
List of Utagawa school members
Bakeneko
Notes
References
Kitagawa, Hiroshi and Burce T. Tsuchida, ed. (1975). The Tale of the Heike. Tokyo: University of Tokyo Press. OCLC 164803926
Nussbaum, Louis Frédéric and Käthe Roth. (2005). Japan Encyclopedia. Cambridge: Harvard University Press. ; OCLC 48943301
Utagawa, Kuniyoshi; Robert A Rorex and Victoria Rovine. (1997). Samurai Stories: Woodblock Prints of Ichiyusai Kuniyoshi, from a Private Collection. Iowa City, Iowa: University of Iowa Museum of Art. OCLC 37678997
Further reading
Forbes, Andrew ; Henley, David (2012). Forty-Seven Ronin: Utagawa Kuniyoshi Edition. Chiang Mai: Cognoscenti Books. ASIN: B00ADQM8II
Merlin C. Dailey, David Stansbury, Utagawa Kuniyoshi: An Exhibition of the Work of Utagawa Kuniyoshi Based on the Raymond A. Bidwell Collection of Japanese Prints at the Springfield Museum of Fine Arts (Museum of Fine Arts, Springfield, 1980)
Merlin C. Dailey, The Raymond A. Bidwell Collections of Prints by Utagawa Kuniyoshi (Museum of Fine Arts, Springfield, 1968) Note: completely different volume from the preceding
Klompmakers, Inge, “Kuniyoshi’s Tattooed Heroes of the Suikoden”, Andon, No. 87, 2009, pp. 18–26.
B. W. Robinson, Kuniyoshi (Victoria and Albert, London, 1961)
B. W. Robinson, Kuniyoshi: The Warrior Prints (Cornell University, Ithaca, 1982) contains the definitive listing of his prints
Robert Schaap, Timothy T. Clark, Matthi Forrer, Inagaki Shin'ichi, Heroes and Ghosts: Japanese Prints By Kuniyoshi 1797-1861 (Hotei, Leiden, 1998) is now the definitive work on him
External links
Utagawa Kuniyoshi's Cats
Kuniyoshi Project
Utagawa Kuniyoshi Online
Ukiyo-e Caricatures 1842-1905 Database of the Department of East Asian Studies of the University of Vienna. Over 400 prints of Kuniyoshi are included.
Short biography at Artelino
Graphic Heroes, Magic Monsters Gallery exhibition at New York's Japan Society featuring Kuniyoshi prints.
1798 births
1861 deaths
Japanese portrait painters
Ukiyo-e artists
Kuniyoshi
19th-century Japanese painters
Artists from Tokyo |
Mitrella nix is a species of sea snail, a marine gastropod mollusk in the family Columbellidae, the dove snails.
Description
The length of the shell attains 9.2 mm.
Distribution
This marine species occurs off New Caledonia.
References
Monsecour, K.; Monsecour, D. (2016). Deep-water Columbellidae (Mollusca: Gastropoda) from New Caledonia. in: Héros, V. et al. (Ed.) Tropical Deep-Sea Benthos 29. Mémoires du Muséum national d'Histoire naturelle (1993). 208: 291-362.
External links
nix
Gastropods described in 2016 |
Tyagun () is a rural locality (a station) and the administrative center of Tyagunsky Selsoviet, Zarinsky District, Altai Krai, Russia. The population was 1,926 as of 2013. There are 40 streets.
Geography
Tyagun is located 52 km southeast of Zarinsk (the district's administrative centre) by road. Kytmanushka is the nearest rural locality.
References
Rural localities in Zarinsky District
Populated places established in 1949
Former urban-type settlements of Altai Krai |
Raymond Bonal (1600–1653) was a founder of the Congregation of the Priests of St. Mary (Bonalists), a French order active in the sixteenth and seventeenth centuries.
References
1600 births
1653 deaths
17th-century French Roman Catholic priests |
Konstan is a surname. Notable people with the surname include:
David Konstan (born 1940), American historian
Joseph A. Konstan, American computer scientist |
Kagua-Erave FC, sometimes stylised as Kagua Erave FC, is a semi-professional association football club based in the Kagua-Erave District in the Southern Highlands of Papua New Guinea. The club was founded in 2018.
The club competed in the 2019 edition of the Papua New Guinea National Soccer League, having been drawn into the Highlands Conference. The club topped the conference and reached the quarter-finals.
History
On 30 December 2018, it was revealed that a side under the name of Kagua Erave from the Southern Highlands had submitted an official application and paid their fee towards participation in the 2019 Papua New Guinea National Soccer League. Players were recruited predominantly from the Kagua-Erave District, following trials in the first weekend of January, and the club was managed by former PNG international Steven Mune. On 15 January 2019, it was reported that the club had received financial support of K60,000 from two backers ahead of the new season.
The club enjoyed a strong start to the season, winning their opening match against Blue Kumuls 3–1, followed by an 11–1 victory over Enga Laima in their second match in which Neil Hans scored four and Jordan Kaven scored three. The side went on to win all of their five matches in the first half of the season. Their first defeat came on 30 March when they lost 1–0 to Aporo Mai, and this was followed on 13 April by a defeat by the same scoreline against Enga Laima, having qualified for the next stage of the competition on the previous weekend. The side finished top of the conference.
In early May, the club's participation in the playoffs was thrown into doubt, after it was reported that players hadn't been paid. However, the club did eventually take to the field against Northern Conference runners-up Morobe United on 11 May in Goroka, going down 5–0.
Domestic Record
National Competitions
Papua New Guinea National Soccer League
2019: Quarter-Finals
References
Football clubs in Papua New Guinea
Association football clubs established in 2018
2018 establishments in Papua New Guinea |
Herbert Edward Cobb (August 6, 1904 – January 8, 1980) was a Major League Baseball pitcher who played in one game for the St. Louis Browns on April 21, . He pitched the eighth inning for the Browns, facing seven batters, and giving up four earned runs on three hits.
Pro career
Herb Cobb's pro career began with the Wilson Bugs of the Virginia league as a nineteen year old pitcher. That year he won nine games and lost sixteen games and finished with 4.24 E.R.A. His breakout season for Wilson game in 1926 when he won twenty games for the club while losing thirteen. He attracted the attention of scouts and signed with the St. Louis Browns, who then assigned Cobb to the minor league team in Wichita Falls in the Texas League. After going 14–7 in Wichita Falls, he was promoted to the Browns' Double A team, the Milwaukee Brewers.
In 1929, Cobb made his first and only appearance in the major leagues. He came on in relief off Chad Kimsey, who'd just surrendered seven runs himself in a relief appearance. In his only inning of work, Cobb gave up three hits and allowed four runs, all earned, including surrendering a home run to Tigers pitcher Earl Whitehill, where Cobb surrendered three of the runs he allowed. The Detroit Tigers defeated the St. Louis Browns in that game, 16–9. After the game, Cobb was demoted to Milwaukee and never again appeared in the major leagues. His baseball career ended in 1931 after he was released by the St. Louis Browns.
References
External links
Baseball Reference.com
1904 births
1980 deaths
St. Louis Browns players
Major League Baseball pitchers
Baseball players from North Carolina
People from Edgecombe County, North Carolina |
Jo Gjende (1794 – 27 February 1884) was a Norwegian outdoorsman and freethinker. He is believed to have been the model for Henrik Ibsen's Peer Gynt.
He was born in Vågå, the son of Tjøstolv Olsson Kleppe of Sygaard (a well-known rabble-rouser, also called "Galin-Tjøstolv", who died in 1797) and Marit Pedersdotter (died 1803) from Horgje in Heidal. He had four siblings. He lived during the period 1803–18 with his maternal aunt on Heringstad farm in Heidal and later took over the farm.
He was well known for reindeer hunting and sharpshooting in the Jotunheimen mountains and built many cabins or huts at Lake Gjende. He moved there in 1842. In 1850 he bought the mountain farm Brurusten in Murudal from Jakob Kleiven.
He took the name John Gjendin, and shortened it to Jo Gjende in his later days.
He was publicly skeptical about established Christianity. Occupied by natural philosophy, he participated frequently in discussions with the local minister. As a result, he was recognized as a freethinker.
He died on the Brurusten farm in Murudal, and was buried in Vågå churchyard. On his grave is a small soapstone monument, which shows a wild reindeer herd in flight, after a painting by Gerhard Munthe.
References
Biography by Jacob Bøckmann. John Gjendin (en biographisk skitse)., Norsk Jæger- og Fisker-Forenings tidsskrift, 1873.
Excerpts from the municipality history by municipality historian Ivar Kleiven from the books I Gamle Daagaa and Heimegrendi.
Appearances in literature. Theodor Caspari, Vildren, et livsbillede fra høifjeldet. Tore Ørjasæter, Jo Gjende. Possible model for Peer Gynt by Henrik Ibsen.
Portrait by Per Hohle, Jo Gjende – storjeger og livsfilosof, fra Mennesker i Naturen, NKS-Forlaget 1973.
Trygve M. Røer: I Emanuel Mohn og Jo Gjendes fotspor, eller Historien om en vindmølle, og litt til, Sollia forlag, 2004.
1794 births
1884 deaths
19th-century Norwegian people
Culture in Oppland
People from Vågå |
Igloo Creek Patrol Cabin No. 25 is a log shelter in the National Park Service Rustic style in Denali National Park. Originally built by the Alaska Road Commission, it was the site of a summer construction camp, and was used for supply storage. The cabin is now part of a network of shelters used by patrolling park rangers throughout the park. It is a standard design by the National Park Service Branch of Plans and Designs and was built in 1928.
References
External links
Ranger stations in Denali National Park and Preserve
Historic American Buildings Survey in Alaska
Log cabins in the United States
National Register of Historic Places in Denali National Park and Preserve
Park buildings and structures on the National Register of Historic Places in Alaska
Rustic architecture in Alaska
Log buildings and structures on the National Register of Historic Places in Alaska
1928 establishments in Alaska
Buildings and structures on the National Register of Historic Places in Denali Borough, Alaska |
Bahuwara is a village in Jagdishpur block of Bhojpur district in Bihar, India. As of 2011, its population was 1,462, in 216 households. It is located southeast of the city of Jagdishpur, on the Chher Nadi stream.
References
Villages in Bhojpur district, India |
The Madonna and Child with Three Angels (also known as Madonna del Padiglione) is a painting by the Italian Renaissance master Sandro Botticelli, executed around 1493. It is housed in the Pinacoteca Ambrosiana of Milan.
The Virgin Mary is portrayed with her right hand expressing milk from her exposed breast and gesturing to the Child, the latter being supported by an angel. The Italian name (padiglione meaning "pavilion") derives from the rich baldachin over the scene. The open book on a small prie-dieu is a familiar symbol of Christ, the "word [of God] made flesh" (John 1:14) and the Christ child gestures toward the book to signal his identity.
The "pavilion" is a reference to the same verse in Gospel of John: "The word became flesh and dwelt among us." In the Greek language of the gospel, the word "dwelt" actually means "tented," a reference to the book of Exodus in the Old Testament where God's glory entered the tabernacle in the wilderness of Sinai: "Then the cloud covered the tent of meeting, and the glory of the Lord filled the tabernacle" (Exodus 40:34). The tabernacle was a movable tent shrine created according to God's directions to hold the Ark of the Covenant, the sacred container of the Ten Commandments, God's words. In this painting, the Virgin Mary is the new Ark of the Covenant since she, like the Ark, contained the Word of God (Leith, 117). The book and the open tent/pavilion signify the revelation that the Old Testament prophecy has been fulfilled in the birth of the Christ Child to the Virgin.
See also
List of works by Sandro Botticelli
Notes
References
Mary Joan Winn Leith, The Virgin Mary: A Very Short Introduction (Oxford, 2021).
1493 paintings
Paintings of the Madonna and Child by Sandro Botticelli
Paintings in the Pinacoteca Ambrosiana
Angels in art
Books in art |
Peng Shepherd (born May 12, 1986) is an American author. Her first novel, The Book of M, was released in 2018, followed by The Future Library in 2021 and The Cartographers in 2022. She is a National Endowment for the Arts Fellow.
Early life and education
Peng Shepherd was born and raised in Phoenix, Arizona, a daughter of Lin Sue Cooney, a retired Channel 12 anchor. Peng earned a Bachelor of Arts in Chinese Language and Literature from Arizona State University in 2006. Peng then completed an M.A. in International Studies and Diplomacy, and Chinese Language at the SOAS University of London in 2008. From New York University, she received her M.F.A. in Creative Writing in 2014, where she was a Stein Fellow and a Veterans Fellow, in 2013 and 2014, respectively.
Literary career
Her debut novel The Book of M, a dystopian fantasy, was published by Harper Collins in 2018, and received mainly favorable reviews. Per The Hollywood Reporter, The Book of M was optioned for screen adaptation on television by Liz Sarnoff from Universal Content Productions.
Her other works have been noted and reviewed by various publications and literary critics, including The Washington Post, Kirkus Reviews, Associated Press, The Wall Street Journal, Sun Sentinel, The Guardian, and Chicago Tribune, among others. Vivian Shaw, the editor from the Washington Post, wrote about The Cartographers in her book review:
"Shepherd, also the author of “The Book of M”, nails the sense of deep-seated, profound connection and love between a small group of people drawn together by shared experience and interest, creating an intense familial bond."
Shepherd is a recipient of a National Endowment for the Arts Fellowship (2020) and the 2019 Neukom Institute Literary Arts Award for "Debut Speculative Fiction" from the Neukom Institute for Computational Science at Dartmouth College. Her books have been translated to French, Polish, Czech, and Turkish, with the translation right sold in Chinese, Arabic, Dutch and Danish.
Bibliography
The Book of M (June 2018), ISBN 9780008225629.
The Future Library (August 2021), ISBN 9781250828675.
The Cartographers (March 2022), ISBN 9780062910721.
Translations
Polish: Księga M (The Book of M).
Czech: Kniha M (The Book of M).
Turkish: The Book of M: Kıyamet Başlıyor.
French: Le Livre de M.
Danish: Kartograferne.
References
External links
Official website
National Endowment for the Arts - Peng Shepherd
Living people
21st-century American novelists
21st-century American women writers
American fantasy writers
Women science fiction and fantasy writers
Chinese-American literature
New York University alumni
Alumni of SOAS University of London
Arizona State University alumni
1986 births |
Mitrephora keithii is a species of plant in the family Annonaceae. It is native to Myanmar, Peninsular Malaysia and Thailand. Henry Nicholas Ridley, the English botanist who first formally described the species, named it in honor of Dr. A. Keith who collected the sample that Ridley examined.
Description
It is a small tree reaching 6 meters in height. Its leathery, oval to lance-shaped leaves are 7.5-17.5 by 2.5-5 centimeters with pointed bases tips. The upper side of the leaves are matt and hairless, while the undersides are covered in sparse, fine hairs. The leaves have 7-11 pairs of secondary veins emanating from their midribs. Its petioles are 3–8.5 by 1.5-3 millimeters and covered in sparse, fine hairs. The flowers occur in groups of 3 or fewer on a rachis. Flowers are attached to the rachis by fleshy, densely hairy pedicels that are 4.5-9 by 0.8-1.5 millimeters. The pedicels have an oval, basal bract that is 1.5 by 2 millimeters, and another upper bract that is 1–2.5 by 1.5-2.5 millimeters. Its flowers have 3 triangular sepals that are 3-4 by 3–4.5 millimeters. The sepals are covered in dense, brown hairs on their outer surface and sparse hairs on their inner surface. Its 6 petals are arranged in two rows of 3. The yellow, oval, outer petals are 9-18 by 6.5-9.5 millimeters and come to a point at their tips. The outer surface of the outer petals is covered in dense, brown, fine hairs while the inner surface is sparsely hairy. The edges of the outer petals are slightly wavy when mature. The inner petals are yellow with pink edges. The inner petals are 7.5-10 by 4.5-6 millimeters. The inner petals have dense, fine hairs on their outer surface. The inner surface of inner petals is covered in hairs that become longer at the tip. Its flowers have stamen that are 1-1.2 by 0.5-0.8 millimeters. Its flowers have 12-14 carpels that are 1.5-1.8 by 0.5-0.8 millimeters. The carpels have 6-12 ovules. Its fruit occur in clusters of 4–6 on pedicels that are 10 by 2 millimeters and covered in sparse, fine hairs. The smooth, sparsely hairy, oblong fruit are 14-30 by 7.5 millimeters. The fruit are attached to the pedicel by stipes that are 3-3.5 by 2 millimeters and covered in sparse, grey-brown, fine hairs. Each fruit has 4-12 seeds that are 8.5-14 by 7.5 millimeters.
Reproductive biology
The pollen of M. keithii is shed as permanent tetrads.
Habitat and distribution
It has been observed growing in evergreen forests with limestone soil at elevations of 0 to 300 meters.
References
keithii
Flora of Myanmar
Flora of Peninsular Malaysia
Flora of Thailand
Plants described in 1911
Taxa named by Henry Nicholas Ridley |
```javascript
// Extra validation errors messages for Parsley
// Load this after Parsley
Parsley.addMessages('sr', {
dateiso: "Unesite validan datum u formatu YYYY-MM-DD.",
minwords: "Potrebno je da unesete %s ili vie rei.",
maxwords: "Mogue je uneti maksimalno %s rei.",
words: "Potrebno je da unesete izmeu %s i %s rei.",
gt: "Ova vrednost mora da bude vea.",
gte: "Ova vrednost mora da bude vea ili jednaka.",
lt: "Ova vrednost mora da bude manja.",
lte: "Ova vrednost mora da bude manja ili jednaka.",
notequalto: "Sadraj ovog polja mora biti razliit."
});
``` |
Gorny () is an urban-type settlement in Solnechny District, Khabarovsk Krai, Russia. Population:
References
Notes
Sources
Urban-type settlements in Khabarovsk Krai |
The Salt mine of Imón (Spanish: Salinas de Imón) is a salt mine located in Sigüenza, Spain. It was declared Bien de Interés Cultural in 1992.
References
Bien de Interés Cultural landmarks in the Province of Guadalajara
Salt mines in Spain
Sigüenza |
Raoul Daddo-Langlois (1922 – 10 July 1943) was a British flying ace of the Royal Air Force (RAF) during the Second World War. He was credited with destroying at least five aircraft.
From the Channel Islands, Daddo-Langlois joined the RAF in 1940 and on completion of his flight training was posted to No. 66 Squadron. In February 1942, he was sent to Malta and assigned to No. 249 Squadron, he achieved a number of aerial victories before departing the island in July. He served as an instructor for several months before returning to operational duties, briefly serving with a photo-reconnaissance squadron before returning to Malta to join No. 93 Squadron. He flew a number of sorties prior to and during the Allied invasion of Sicily. On 10 July 1943, his aircraft was damaged during an engagement with German bombers. Severely injured in the following crash-landing on a beach, he was killed in an incident of friendly fire when the boat transporting him to a hospital ship was bombed and sunk.
Early life
Raoul Daddo-Langlois, born William Raoul Daddo-Langlois in Guernsey, the Channel Islands, in 1922, was the son of William James Daddo-Langlois, an officer serving in the Royal Air Force (RAF), and his wife Dorothy Darling. Much of Daddo-Langlois's early life was spent on the RAF stations at which his father was based. Educated at Chard School as a boarder, he was an active sportsman and desired a career as a journalist. His preferred vocation was not supported by his father and instead, once his education was completed, he became a teacher at a school in Sussex.
Second World War
Daddo-Langlois joined the RAF in the autumn of 1940 and after attending an Initial Training Wing at Cambridge, was sent to Canada for flying instruction. At No. 11 Elementary Flying School in Ontario, he flew Fleet Finch training aircraft and proceeded to No. 2 Service Flying Training School where he was instructed on North American Harvard trainers. A fellow student was Laddie Lucas, and the two became friends. Having gained his wings and been promoted to pilot officer on probation in February 1941, Daddo-Langlois returned to the United Kingdom three months later.
After attending No. 52 Operational Training Unit (OTU) at Debden, both Daddo-Langlois and Lucas were posted to No. 66 Squadron in July. Their new squadron, based at Perranporth in the West Country, operated Supermarine Spitfire fighters on patrols and bomber escort missions to Holland. On at least two occasions Daddo-Langlois was involved with failed interceptions of incoming German bombers, but otherwise he saw little action and became bored. While on a test flight, he took it upon himself to make a sortie to Brittany, in France, and attack any targets he could identify. His Spitfire was damaged by anti-aircraft fire and on his return to base, he was disciplined but avoided a courtmartial, thanks to the discretion of his squadron's commander.
Malta
In early 1942, Daddo-Langlois volunteered for service in Burma. However, he and Lucas, another volunteer, were instead sent to Malta along with 13 other pilots. Flown aboard a Short Sunderland flying boat, they arrived at Kalafrana on 16 February and were posted to No. 185 Squadron, based at Takali and operating tired Hawker Hurricane fighters. Daddo-Langlois, unfamiliar with the aircraft, crashed one on his second flight with the unit. Later in the month he was transferred to No. 249 Squadron. By this time, he was a flying officer, having been promoted a week after his arrival on the island.
No. 249 Squadron operated newly arrived Spitfires from Takali, part of Malta's aerial defences against attacking Italian and German bombers. On 10 March Daddo-Langlois, who was nicknamed Daddy Longlegs by his fellow pilots, made his first claim, for a damaged Messerschmitt Bf 109 fighter that he engaged over Malta. This was the first engagement for the Spitfires on the island. On 4 April, Daddo-Langlois damaged a Junkers Ju 88 medium bomber. His own aircraft was damaged in the encounter. Although he safely landed back at Takali, the scarcity of aircraft meant that it was several days before he flew again. He and other pilots not flying would pitch in and help with repairing bomb-damaged facilities at the airfield. On 20 April, while making a head-on attack against a Bf 109, he collided with his target and, missing his wing tip, had to make a crash-landing. The Bf 109 was destroyed in the encounter, Daddo-Langlois seeing it going down into the sea.
At the end of April, Daddo-Langlois was one of five pilots flown to Gibraltar and embarked onto HMS Eagle, an aircraft carrier transporting new Spitfires to Malta. He flew one of these off Eagle on 18 May, making a safe landing on Malta. On a sortie to the east of Zonkor on 6 June, he destroyed a Reggiane Re.2001 fighter. He shot down a Ju 88 over Malta on 2 July and then two days later shared in the destruction of what he claimed as a CANT Z.1007 bomber. An Italian prisoner of war later told him it was a Savoia-Marchetti SM.84. His final aerial victory while serving at Malta came on 11 July, when he shot down a Bf 109 over the island.
Along with Lucas, Daddo-Langlois departed Malta on 18 July for the United Kingdom. He was subsequently posted to No. 52 OTU, at Chedworth, on instructing duties. He found the work dull and in April, having been promoted to flight lieutenant two months previously, sought a posting to a photo reconnaissance unit (PRU). Lucas, now commanding a squadron and not believing Daddo-Langlois had the right temperament to be a PRU pilot, tried to talk him out of it but failed. Assigned to No. 543 Squadron in May, Daddo-Langlois was tasked with flying a new PRU Spitfire Mk IX to Libya. While crossing Algeria, he had to land in the desert after running out of fuel. Abandoning his Spitfire, he was rescued by local Arabs and with their assistance made his way to his intended destination, Castel Benito.
Invasion of Sicily
Instead of returning to the United Kingdom so that he could fly another PRU Spitfire back to the Middle East, Daddo-Langlois sought a posting to a fighter squadron instead. He was duly posted to No. 93 Squadron, which was at Malta, and arrived on the island on 30 June. Flying as one of the squadron's flight commanders, he was soon engaged on bomber escort missions to Sicily, preparing for the forthcoming Allied invasion of the island.
On the day of the invasion itself, No. 93 Squadron flew protective patrols over the landing beaches. Daddo-Langlois led his flight in intercepting several Ju 88s that were bombing the beaches below. He reported over his radio that he had shot one down but, due to damage to his Spitfire, was going to attempt to land on the Sicilian beaches. He was severely injured when he crashlanded. Unconscious, he was treated by a Royal Navy surgeon ashore before he transferred to a hospital ship. The small boat that he was being transported on was accidentally bombed upon by American aircraft and was sunk. His body was retrieved the following day and was buried at sea.
Daddo-Langlois is credited with having shot down five aircraft, including the Ju 88 that he reported destroyed on the day of his death, and sharing in the destruction of a sixth. He also damaged two more aircraft. His name is recorded on the Malta Memorial, which commemorates the nearly 2,300 Commonwealth airmen who were killed over and around the Mediterranean.
Notes
References
1922 births
1943 deaths
Guernsey people
People educated at Chard School
Royal Air Force officers
Royal Air Force pilots of World War II
British World War II flying aces
Royal Air Force personnel killed in World War II
Deaths by airstrike during World War II |
The 1909 Taunton by-election was held on 23 February 1909. The by-election was held due to the ill health of the incumbent Conservative MP, Edward Boyle. It was won by the Conservative candidate William Peel, previously the MP for Manchester South. Peel was the son of Arthur Peel, 1st Viscount Peel, a former Liberal MP and Speaker of the House of Commons, and the grandson of former Prime Minister Robert Peel.
References
Taunton by-election
History of Taunton
Taunton by-election
By-elections to the Parliament of the United Kingdom in Somerset constituencies
20th century in Somerset
Taunton by-election |
The chairman of the Council of Ministers of Bosnia and Herzegovina (Bosnian/Croatian: Predsjedavajući Vijeća ministara Bosne i Hercegovine, ) is the head of the government of Bosnia and Herzegovina.
The chairman of the Council of Ministers is nominated by the Presidency of Bosnia and Herzegovina, and appointed by the House of Representatives of Bosnia and Herzegovina. As head of the government, the chairman of the Council of Ministers has no authority for appointing ministers, and his role is that of a coordinator. Ministers are appointed in his or her stead by the majority-parties according to ethnic and entity representation rules, so that a deputy minister must not be of same ethnicity as the respective minister.
Borjana Krišto is the 11th and current chairwoman of the Council of Ministers. She took office on 25 January 2023, following the 2022 general election. Krišto is the first female occupant of the office.
Responsibilities
The chairman represents the Council of Ministers and is responsible for:
for harmonizing the work of the Council of Ministers;
for harmonizing the constitutional relations of the Council of Ministers with the work of the Presidency, the Parliamentary Assembly, as well as with the entities and Brčko District;
to ensure cooperation between the Council of Ministers and entity governments and lower levels of government;
for convening sessions of the Council of Ministers;
for presiding over sessions of the Council of Ministers;
for the agenda of the sessions of the Council of Ministers;
for the implementation of decisions of the Council of Ministers;
for the work of the Directorate for EU integration.
The chairman of the Council of Ministers, in cooperation with his deputies, determines the policy of the work of the Council of Ministers, and especially the priorities and dynamics of the work of the Council of Ministers. They particularly coordinate and monitor the activities of government institutions in Bosnia and Herzegovina related to the Accession of Bosnia and Herzegovina to the European Union.
In order to effectively perform these duties and tasks, the Directorate for EU integration is directly responsible to the chairman of the Council of Ministers. The chairman is responsible for his work to the Parliamentary Assembly and the Presidency.
In case of his absence, the chairman is replaced by one of the vice-chairmen in accordance with the Rules of Procedure.
Constitutional background
Article V.4 of the Constitution defines the Council of Ministers and its responsibilities. The Council of Ministers is composed of the chair of the Council of Ministers and a certain number of ministers as may be appropriate, who are responsible for the implementation of the policy and the decisions of Bosnia and Herzegovina from within the competencies of the institutions of Bosnia and Herzegovina.
The Presidency of Bosnia and Herzegovina appoints the chair of the Council of Ministers of Bosnia and Herzegovina, who assumes the office upon the approval by the House of Representatives of the Parliamentary Assembly of Bosnia and Herzegovina; the chair of the Council of Ministers appoints the Minister of Foreign Affairs, the Minister of Foreign Trade and Economic Relations and other ministers as may be appropriate (no more than two thirds of the ministers may be appointed from the territory of the Federation of Bosnia and Herzegovina), who assume the office upon the approval by the House of Representatives; also, the chair appoints deputy ministers (who may not be from the same constituent people as their ministers), who assume the office upon the approval by the House of Representatives.
Recent chairpersons
Timeline
See also
List of heads of government of Bosnia and Herzegovina
Council of Ministers of Bosnia and Herzegovina
Presidency of Bosnia and Herzegovina
Chairman of the Presidency of Bosnia and Herzegovina
References
Government of Bosnia and Herzegovina
Politics of Bosnia and Herzegovina |
Gauriganj is a city, tehsil and administrative headquarters of Amethi district in Ayodhya division, Uttar Pradesh, India. It is situated about 126 km from Lucknow, the capital of Uttar Pradesh. It is located in Eastern Uttar Pradesh. Before July 2010, Gauriganj was part of Sultanpur district and then taking Gauriganj, Amethi, Jais, Jagdispur and Salon, formed a new district called Chatrapati Sahuji Maharaj Nagar, later named Gauriganj and now Amethi. Gauriganj is connected with State Highway 34 and National Highway 128.
Etymology
Gauriganj is named after goddess Gauri.
History
At the turn of the 20th century, Gauriganj was described as "a rising town, with a station on the Oudh and Rohilkhand Railway." It then technically consisted of two villages, Katra-Lalganj and Madhopur. The bazar was founded by Madho Singh, the Raja of Amethi (d.1891). Gauriganj then hosted a rising grain market and had a pound, police station, and post office, as well as an upper primary school, which had many students from both Gauriganj itself and the surrounding countryside; it had a small building, though, which was not big enough to accommodate the student body adequately. The town was then surrounded by several deep hollows. West of Katra-Lalganj were low-lying fields where only jarhan rice was grown. The population of Gauriganj as of 1901 was 2,543, including a large Bania community which was larger than any other town in the district except Sultanpur. There was a Muslim minority of 194, and the rest of the town's population was a mix of Ahirs, Kurmis, and Gadariyas, as well as some Pasis.
Geography
Climate
Gauriganj has a warm subtropical climate with very cold and dry winters from December to mid-February, and dry, hot summers from April to mid-June. During extreme winters, the maximum temperature is around 12 degrees Celsius and the minimum is around 3 to 4 degrees Celsius. Fog is quite common from late December to late January. Summers can be quite hot with temperatures rising to 40 to 45 degrees Celsius.
Gauriganj has a tropical wet and dry climate with average temperatures ranging between 20 and 28 °C (68 to 82 °F). Gauriganj experiences three distinct seasons: summer, monsoon and a mild autumn. Typical summer months are from March to May, with maximum temperatures ranging from 30 to 45 °C (86 to 100 °F). Although summer doesn't end until May, the city often receives heavy thundershowers in May, and humidity remains high. The rainy season is from mid-June to mid-September, when it gets an average rainfall of 722 mm, mostly from the south-west monsoon winds. Even during the hottest months, the nights are usually cool due to Gauriganj's altitude. The highest temperature ever recorded was 48.3 °C (118.9 °F). The monsoon lasts from June to October, with moderate rainfall and temperatures ranging from 10 to 28 °C (50 to 82 °F). Autumn begins in November. The daytime temperature hovers around 28 °C (82 °F) while the night temperature is below 10 °C (50 °F) for most of December and January, often dropping to 3 to 4 °C (37 to 39 °F).
Demographics
As of 2011 Indian Census, Gauriganj tehsil had a total population of 390,935, of which 196,844 were males and 194,091 were females. Population within the age group of 0 to 6 years was 59,192. The total number of literates in Gauriganj was 214,282, which constituted 54.8% of the population with male literacy of 60.1% and female literacy of 45.4%. The effective literacy rate of 7+ population of Gauriganj was 64.6%, of which male literacy rate was 75.9% and female literacy rate was 53.3%. The Scheduled Castes and Scheduled Tribes population was 108,841 and 86 respectively. Gauriganj had 67,832 households in 2011.
The 1961 census recorded Gauriganj as having a population of 1,883 people (1,038 male and 845 female), in 468 households and 456 physical houses.
Languages and religion
Hindi and Urdu are the official languages. Awadhi is also widely spoken along with English.
Hinduism is followed by large numbers of the population. A significant part of the population of the city consists of followers of Islam and Sikhism. Christians and Jains constitute a minority of the population.
Government and politics
Civic administration
Gauriganj had a police force of 2 sub-inspectors, 1 head constable, and 13 constables.
Amenities
Gauriganj has a post office, a railway station, a library, and a government-run dispensary with 4 male and 2 female beds, as well as a maternity and child welfare centre and a family planning centre.
Economy
Gauriganj hosts a grain market on Mondays and Fridays, with an average attendance of about 2,000 at the time of the 1961 census.
Cityscape / Culture
Durga Puja is celebrated in Gauriganj with cultural activities from the 8th day of Navratri for 14 days. Moorty Visarjan is also a big event as it takes approximately 90 hours to complete with thousands of indulged people. Krishna Janmashtami is also celebrated with great joy. In Some Aashram (likes: Baba Balak Das etc.) and some temples (e.g. Doodh Nath Mandir, Ram Janki Mandir, Hanuman Mandir) Feast (i.e. Vishal Bhog Bhandara) took places annually.
Eid-ul-Fitr, Eid-ul-Adha, Eid Milad-un-Nabi and Shab-e-Barat are also celebrated in Gauriganj.
Places of interest
Nandmahar Dham
Lodi Baba Mandir
Durgan Dham Temple
Mata Mawai Dham
Ulta Gadha Dham
Education
The 1951 census recorded Gauriganj as having a district board-run primary school, with 201 students in attendance as of 1 January of the year.
Villages
Gauriganj CD block has the following 102 villages:
Notable people
Manoj Muntashir is an Indian lyricist, poet and screenwriter was born in this town.
Rakesh Pandey Writer and author
Jagdish Piyush, Journalist, writer, author and leader
Deepak Singh, politician and member of Uttar Pradesh Legislative Council
Gallery
References
Cities and towns in Amethi district
pl:Gauriganj |
Collothecaceae is an order of rotifers belonging to the class Monogononta.
Families:
Atrochidae
Collothecidae
References
Monogononta |
The Chair of RTVE, officially Chair of the Spanish Radio and Television Corporation, is the head of the RTVE Corporation and of the RTVE Board. The chair of RTVE is the chief executive of the corporation and chairs the Board, convene its meetings and execute its guidelines. The chair is appointed by the majority of the Congress of Deputies.
The current chair of RTVE is the journalist Elena Sánchez Caballero, who was appointed on 27 September 2022 as acting president after the resignation of the previous chair, José Manuel Pérez Tornero.
Powers
The powers of the chair of the RTVE Board and of the RTVE Corporation are regulated in Section II of the Radio and Television of State Ownership Act of 2006:
To execute and enforce the agreements of the board
To prepare the formulation of the annual accounts of each fiscal year in accordance with commercial legislation
To prepare the operating and capital budget draft of the RTVE Corporation
To prepare the annual report on the management of the RTVE Corporation and its subsidiaries and on the fulfillment of the public service missions entrusted, the program contract with the State and the other economic and financial obligations assumed by the RTVE Corporation due to its public nature
To execute the general guidelines of action of the RTVE Corporation approved by the Board, as well as execute the principles that the said body approves on production, commercial activity and programming on state radio and television
To approve and celebrate the acts, contracts and legal business in matters and amounts agreed by the board
To propose to the Board the approval of the basic organization of the RTVE Corporation and its subsidiaries
To propose to the Board the appointment and removal of the first level officials of the RTVE Corporation
To direct and coordinate the activities of the governing bodies of the RTVE Corporation in accordance with the guidelines of the board
To propose to the Board the appointment and removal, at the General Meeting, of the administrators of the subsidiaries
The senior management of the staff and services of the RTVE Corporation under the basic guidelines established by the board
To be responsible for the automated files of the RTVE Corporation and ensure compliance with personal data protection legislation
During an electoral process, to act as a communication body between the electoral administration and the board
Delegation of powers
In accordance with article 21 of the Radio and Television of State Ownership Act, the Board may delegate to the President any other power of the Board, which will require the approval of the majority of two thirds of its components. However, the law itself limits this delegation; the Board cannot delegate its powers in matters related to the appointment of first-level personnel, to economic-budgetary matters, to internal control bodies, those related to the fundamental right of Article 20.3 of the Constitution or the proposal to remove a member of the Board.
Appointment, removal and sole administrator
Appointment
In accordance with Royal Decree-Law 4/2018, of June 22, which specifies, urgently, the legal regime applicable to the designation of the Board of the RTVE Corporation and its Chair, the Congress of Deputies is the body responsible for electing the Chair of the Corporation and of the Board, by a two-thirds majority, among the ten members that make up the Board. If this majority is not reached and, after 48 hours, the Congress must vote again and an absolute majority will be sufficient to confirm the candidate to Chair of RTVE.
Removal
The removal of the chair of the Corporation complies with the general requirements for the removal of the rest of the members of the Board:
Resignation
End of the term
Removal approved by a two-thirds majority of the Congress of Deputies, at the proposal of the RTVE Board, by:
Permanent inability to exercise the office
Firm conviction for any malicious crime
A conflict of interest with other office or personal activity
Reasoned agreement
Decision of the Congress of Deputies by a two-thirds majority of its members
Sole administrator
The position of sole administrator is a figure included in the Capital Companies Act of 2010. The sole administrator is a position that assumes all the powers of a company for its administration. The Radio and Television of State Ownership Act includes this possibility, although in its article 22 it prohibits that the Chair of the Corporation that has been removed, along with the rest of the Board, due to a bad economic management may occupy this position.
In 2018, a reform was introduced in the form of the election of the chair, which requires that if after fifteen days, there were still not enough majorities to appoint the Board members, the Government shall propose a sole provisional administrator to assume the powers of both the Board and the Chair of the Corporation with the same previous procedure. This Sole Provisional Administrator shall be responsible for the administration and representation of the Corporation until the appointments of the Board members occur. This exceptional clause was first used on 27 July 2018, naming Rosa María Mateo as sole administrator with 180 votes in favor of the 350 possible. As such, Mateo assumed all the powers of the chairship and the Board of Directors until the appointment of a new Chair on 26 March 2021.
List of chairs
Director Generals of Radiodifusión y Televisión
(1957–1962)
(1962–1964)
Jesús Aparicio-Bernal Sánchez (1964–1969)
Adolfo Suárez González (1969–1973)
(1973–1974)
Juan José Rosón Pérez (1974)
Jesús Sancho Rof (1974–1975)
(1975–1976)
(1976–1977)
Director General of Organismo Autónomo RTVE
(1977–1981)
Director Generals of Ente Público RTVE
(1981)
Carlos Robles Piquer (1981–1982)
Eugenio Nasarre Goicoechea (1982)
(1982–1986)
Pilar Miró Romero (1986–1989)
Luis Solana Madariaga (1989–1990)
(1990–1996)
Mónica Ridruejo Ostrowska (1996–1997)
(1997–1998)
Pío Cabanillas Alonso (1998–2000)
(2000–2002)
(2002–2004)
(2004–2007)
President of Corporación RTVE
(2007–2009)
Alberto Oliart Saussol (2009–2011)
(2011–2014)
(2014–2018)
Rosa María Mateo Isasi (2018–2021) (as Sole Administrator)
José Manuel Pérez Tornero (2021–2022)
Elena Sánchez Caballero (2022–)
References
RTVE |
Burdett College, also known as Burdett Business College or Burdett College of Business and Shorthand, was an educational institution primarily located in Boston, Massachusetts. Founded in 1879, it focused on business and shorthand and operated as a junior college. It closed in 1999.
History
The college was founded on August 1, 1879, by brothers Charles A. Burdett (1858–1922) and Fred H. Burdett (1861–1935). They each served as president of the college, followed by Fred's wife, Sadie. Fred and Sadie's son, C. Fred Burdett (c.1905–1988), was then president from the mid-1930s until 1970.
In 1938, the institution was described a junior college of business training, offering one- and two-year courses of study in the areas of business administration, accounting, executive secretarial, stenographic, and general business.
Upon C. Fred Burdett's retirement in 1970, the college was sold to the Bradford School Corporation, a subsidiary of The Life Insurance Company of Virginia. The website for the Massachusetts Department of Higher Education lists the college as having closed in 1999. Bay State College in Boston is the custodian of records for several closed institutions, including Burdett College.
Locations
Locations of Burdett College included:
167 Tremont Street, Boston (1882–1885)
592 Washington Street, Boston (1886–1891)
694 Washington Street, Boston (1891–1904)
18 Boylston Street, Boston (1905–1928)
156 Stuart Street, Boston (1928–1954)
160 Beacon Street, Boston (1954–1972)
745 Boylston Street, Boston (c. 1998)
74 Mt. Vernon Street, Lynn, Massachusetts (c. 1939)
100 Front Street, Worcester, Massachusetts (c. 1999)
Alumni
Notable alumni of the college include:
Garrett H. Byrne, District Attorney of Suffolk County, Massachusetts
John F. Cotter, Commissioner of the Boston Fire Department
Joseph N. Hermann, Massachusetts politician
William E. Hurley, Massachusetts politician
Clementina Poto Langone, Italian-American activist, politician, and philanthropist
John Shea (New Hampshire politician)
Hal Weafer, major league baseball umpire
Grafton Kenyon, Rhode Island businessman and politician
Athletics
The college fielded teams in several sports, including:
Baseball – c.1894–c.1902
Basketball – c.1948–c.1962
In 1957, the team won the Boston Small College title, with a 10–0 record.
Football – c.1895–c.1905
Opponents included Phillips Exeter Academy, New Hampshire, and MIT.
Ice polo – c.1896
Note: a form of ice hockey played with a ball rather than a puck
References
Defunct private universities and colleges in Massachusetts
Educational institutions established in 1879
Educational institutions disestablished in 1999
1879 establishments in Massachusetts |
The Castlereagh Nature Reserve is a protected nature reserve located in the western suburbs of Sydney in New South Wales, Australia. The reserve is situated west of the central business district, approximately north-east of and located near the townships of and . In 1960, was reclaimed for use as a Child Welfare Training School, and in 1971, was reclaimed for the establishment of a liquid waste disposal facility.
The boundary of the reserve is marked by The Northern Road to the west, by Llandilo Road to the east, rural properties to the south and by the Castlereagh Waste Management Centre to the north. The nature reserve was formerly Castlereagh State Forest and was managed as a production forest from 1917 to 1988, then as a demonstration forest from 1988 to 1995.
Features
Geology
The Castlereagh Nature Reserve contains a geographically restricted substrate of Tertiary alluvials producing clays, sand, gravel and shales at depth. Parts of the reserve support Cumberland Plain Woodland vegetation. The nature reserve is between above sea level and is predominantly flat with broad, shallow depressions forming a sparse drainage network. Small, shallow lakes form after wet weather to the north of the reserve where gravels and other alluvials have been extracted when the reserve was a production forest.
Flora
Open forest occurs on clay soils and is dominated by broad-leaved ironbark Eucalyptus fibrosa sap. Fibrosa with occasional mugga ironbark Eucalyptus sideroxylon, thin-leaved stringybark Eucalyptus enugeniodes, woollybutt Eucalyptus longifolia and Scribbly Gum Eucalyptus sclerophylla. Threatened plant species found in the nature reserve include Dillwynia tenuifolia, Pultenea parviflora, Acacia bynoeana, dwarf casuarina Allocasuarina glareicola, nodding geebung Persoonia nutans and Micromyrtus minutiflora.
The reserve is relatively free of significant weed infestations. A few slash pines Pinus elliotti are found in the northern section of the reserve from when of Castlereagh State Forest was used for trial plantings of pines in the 1920s and 1930s. Heavy harvesting of ironbark during the Second World War, illegal timber collection and numerous fires generally thinned the forest, resulting in no mature trees in some areas.
Fauna
The nature reserve is home to a diverse range of mammals including sugar gliders, Petaurus breviceps; brush-tailed possum, Trichosurus vulpecula; and eastern grey kangaroo, Macropus giganteus. The eastern brown snake, Pseudonaja textilis; red-bellied black snake, Psuedechris porphriacus; lace monitor, Varanus varius; and a number of frog species including the endangered green and golden bell frog, Litoria aurea; also reside within the reserve.
Environmental impacts
In 1987 the area around the old gravel pits was planted with over 3,000 seedlings but ultimately the plantings were unsuccessful. Due to past logging and other plantings, parts of the reserve are dominated by immature regrowth and has modified species composition and abundance.
An area of to the north western boundary of the nature reserve adjacent to the Castlereagh Waste Management Centre was previously used as an area for the disposal of heavy metals including zinc, cadmium and lead. The contaminated soil was removed in 1996 and replaced with clean local fill. Groundwater quality is monitored at six sampling stations by Waste Services.
Fire has been a major factor in shaping the flora in the reserve. The last major fire occurred in 1982 and burnt over 75 percent of the reserve, which has altered the understory of the forest and woodland communicates. Subsequently, a fire in November 2016 that started near The Northern Road Londonderry burnt through 336 ha of the nature reserve and was contained at Government Road, Berkshire Park.
Accidents
In 1957 a Vampire fighter jet crashed into Castlereagh State Forest however the Flying Officer was able to eject safely.
See also
Protected areas of New South Wales
References
Nature reserves in Sydney
Hawkesbury River
Protected areas established in 1995
1995 establishments in Australia |
Dichocrocis actinialis is a moth in the family Crambidae. It was described by George Hampson in 1899. It is found in Meghalaya, India.
References
Moths described in 1899
Spilomelinae |
Abruzzo is one of the 29 constituencies () represented in the Chamber of Deputies, the lower house of the Italian parliament. The constituency currently elects 14 deputies. Its boundaries correspond to those of the Italian region of Abruzzo. The electoral system uses a parallel voting system, which act as a mixed system, with 37% of seats allocated using a first-past-the-post electoral system and 61% using a proportional method, with one round of voting.
The constituency was first established by the Mattarella law on 4 August 1993 and later confirmed by the Calderoli law on 21 December 2005 and by the Rosato law on 3 November 2017.
Elected members
Legislature XVIII (2018–present)
Legislature XVII (2013–2018)
References
Chamber of Deputies constituencies in Italy
1993 establishments in Italy
Constituencies established in 1993
Politics of Abruzzo |
Ali Rashid Ahmad Lootah () is the vice chairman of Mashreq bank and former chairman of Nakheel, a property development company in Dubai, United Arab Emirates.
Early life and career
Lootah was born in 1960 in Dubai, and pursued his education in civil engineering at Clarkson University in the United States. He established the UAE Society of Engineers, in which he became a member of founding board.
He started his career working in the UAE's Ministry of Public Works, where he was later appointed as Assistant Under-secretary of the Ministry. Lootah was appointed as chairman of Nakheel in 2012 replacing Sultan Ahmed bin Sulayem, and led the new strategy for the company also restarting some of its development projects. He was replaced as chairman in 2020.
References
External links
Nakheel Website
Living people
Businesspeople from Dubai
Emirati civil engineers
1960 births |
Kusakabe Kimbei (日下部 金兵衛; 1841–1934) was a Japanese photographer. He usually went by his given name, Kimbei, because his clientele, mostly non-Japanese-speaking foreign residents and visitors, found it easier to pronounce than his family name.
Career
Kusakabe Kimbei worked with Felice Beato and Baron Raimund von Stillfried as a photographic colourist and assistant. In 1881, Kimbei opened his own workshop in Yokohama, in the Benten-dōri quarter. From 1889, the studio operated in the Honmachi quarter.
By 1893, his was one of the leading Japanese studios supplying art to Western customers. Many of the photographs in the studio's catalogue featured depictions of Japanese women, which were popular with tourists of the time. Kimbei preferred to portray female subjects in a traditional bijinga style, and hired geisha to pose for the photographs. Many of his albums are mounted in accordion fashion.
Around 1885, Kimbei acquired the negatives of Felice Beato and of Stillfried, as well as those of Uchida Kuichi. Kusakabe also acquired some of Ueno Hikoma's negatives of Nagasaki.
Kimbei retired as a photographer in 1914.
Gallery
References
Further reading
Musée Nicéphore Niépce; Collection du musée Niépce. Thé/Laque/Photographie. Accessed 3 April 2006.
Nagasaki University Library; Japanese Old Photographs in Bakumatsu-Meiji Period: "Kusakabe, Kinbei". Accessed 30 May 2008.
Turner, Jane, ed. The Dictionary of Art, vol. 18 (New York: Grove's Dictionaries, 1996), 534.
Union List of Artist Names, s.v. "Kimbei, Kusakabe". Accessed 3 April 2006.
External links
Old Photos of Japan. Kusakabe Kimbei . A selection of photographs by Kusakabe, with footnoted descriptive text. Accessed 28 May 2009.
I Photo Central. Kusakabe Kimbei . A selection of photographs by Kusakabe. Accessed 30 May 2008.
Some of Kimbei Kusakabe's photos. At the Freer Gallery of Art and Arthur M. Sackler Gallery Archives.
Fostinum: Photographs by Kusakabe Kimbei
Photos of Japan. Kusakabe Kimbei. A collection of Japanese prints by Kusakabe Kimbei.
Kusakabe Kimbei, photographs, Canadian Centre for Architecture
1841 births
1930s deaths
Japanese portrait photographers |
The Bogibeel Bridge is a combined road and rail bridge over the Brahmaputra River in the northeastern Indian state of Assam between Dhemaji district and Dibrugarh district, which was started in the year 2002 and took a total of 200 months to complete, Bogibeel river bridge is the longest rail-cum-road bridge in India, measuring 4.94 kilometres over the Brahmaputra river. As it is situated in an earthquake-prone area it is India's first bridge to have fully welded steel-concrete support beams that can withstand earthquakes of magnitudes up to 7 on the Richter scale. It is Asia's second longest rail-cum-road bridge and has a serviceable period of around 120 years.
It is the 5th longest bridge in India after Bhupen Hazarika Setu, Dibang River Bridge, Mahatma Gandhi Setu and Bandra–Worli Sea Link. The bridge was constructed by a consortium of construction companies headed by Hindustan Construction Company. The bridge has a double rail line on the lower deck and a three lane road on the upper deck. It was inaugurated by Prime Minister Narendra Modi on 25 December 2018 on the occasion of Good Governance Day.
Location
The Bogibeel Bridge, situated 17 km downstream of Dibrugarh and Dhemaji, spans the Brahmaputra River and will connect the town of Dibrugarh in the south to Dhemaji to the river's north. The bridge is located just over 20 km away from the Assam- Arunachal Pradesh border and acts as an alternative to the Kolia Bhomora Setu, Tezpur in providing connectivity to nearly five million people residing in Upper Assam and Arunachal Pradesh.
The Bogibeel Bridge is the longest rail-cum-road bridge of India on the Brahmaputra River in Assam. Owing to its location, the bridge is of strategic importance to India as it significantly eases India's ability to transport troops and supplies to the border with Tibet in Arunachal Pradesh. Being located in an area of intense rainfall, its construction had been significantly slowed down by the fact that construction largely took place only during a period of four dry months between November and March.
Road connectivity
The bridge connects Dhemaji district and Dibrugarh district in Assam through National Highway 15.
Rail connectivity
The Bogibeel Bridge provides a connection between the Rangiya–Murkongselek section of the Northeast Frontier Railway, located on the northern bank of the Brahmaputra River, and the Lumding–Dibrugarh section that lies to the southern bank. A New Dibrugarh Railway Station, expected to be the largest in the region, has been proposed and is to be linked to the Rangiya–Murkongselek line via Chaulkhowa and Moranhat. The Railways have initiated the gauge conversion of the Dhamalgaon to Sisiborgaon rail line to the north of the bridge and commissioned the 44 km Chalkhowa–Moranhat line to the south.
History
The bridge traces its origins to the Assam Accord of 1985 and was one of several major infrastructural projects to be set up in Assam in accordance with the pact. It was sanctioned by the Government of India in 1997-98 and was expected to be completed by the end of the Ninth Five Year Plan. The foundation of the bridge was laid in January 1997 by Prime Minister H. D. Deve Gowda, but its construction was inaugurated only in 2002 by Prime Minister, A. B. Vajpayee. Thereafter, North East Frontier Railway took up this work in right earnest and posted Sri Pramod Kumar Gupta as Deputy Chief Engineer (Construction) for construction of Bogibeel Bridge. M/s RITES was awarded the Design and Consultancy work. Model Studies were done by UPIRI near Roorkee. A Global Expression of Interest was invited (Global EOI was invited for the first time in India) for the work. Many Chinese, Korean and European companies participated. DSD Steel of Germany was shortlisted for construction of Superstructure Work, as no Indian company had any experience of proposed type of superstructure. By 2004 the preliminary design and shortlisting of agencies was completed. The project was to be completed in six years following the inauguration, however the work did not begin even in 2007, owing to lack of funds and attention. Consequently, that same year, the Bogibeel Bridge was granted a national project status by the Government of India in 2007 by Prime Minister Manmohan Singh, but the implementation was slow, notwithstanding a Congress government in Assam. Accordingly, the Union Ministry of Finance funded 75% of the project costs while the Ministry of Railways financed the rest. The actual work on the project only began in 2011.
In April 2008, the Northeast Frontier Railway contracted Gammon India to construct the sub-structure of the bridge while a consortium of Hindustan Construction Company, DSD Brückenbau GmbH, Germany and VNR Infrastructures won the bid to build the superstructure.
The bridge's construction was subject to large time and cost overruns over time. The cost, initially estimated at , escalated to by 2014. According to a press release by the Indian Ministry of Railway on 25 July 2014, in the main bridge 36 out of 42 well foundations and 28 out of 40 piers had been completed, while 2 out of 41 girders had been launched. An expenditure of was incurred on the project till March 2014, and a further outlay of was sanctioned for the year 2014–2015, with the project then-expected to be completed by March 2017. However, a correspondent writing in The Hindu Business Line claimed that when he visited the project in July 2014, only 15 out of the 42 piers were "coming up", while the work on the rest had barely begun.
On 2 December 2018, the bridge opened as the first freight train crossed it. On 25 December, the Indian Prime Minister Narendra Modi inaugurated the Bogibeel bridge, on the birth anniversary of former Prime Minister Atal Bihari Vajpayee, and also flag off an intercity express connecting Tinsukia and Naharlagun. The overall cost of the project ultimately escalated to as the total length of the bridge increased from to .
Structure
The design of the bridge has 41 spans of 125 m and a superstructure of composite welded steel truss and reinforced concrete. It is designed to be able to carry a double line broad-gauge railway on the lower deck and a 3-lane road on the upper deck. Owing to its strategic importance, it was also built with supporting the movement of tanks and aircraft in mind. It is the longest combined rail and road bridge in India and second longest bridge in Assam over the Brahmaputra, after Bhupen Hazarika Setu at 9.15 km.
See also
List of bridges on Brahmaputra River
References
Railway bridges in India
Bridges in Assam
Bridges over the Brahmaputra River
Transport in Dibrugarh
Road bridges in India
Road-rail bridges in India
Bridges completed in 2018
2018 establishments in Assam
Dibrugarh district |
Bahadur Singh Sagoo (born 7 May 1973) is an Indian former shot putter who competed in the 2000 Summer Olympics and in the 2004 Summer Olympics. He is a recipient of the civilian honour of Padma Shri.
References
External links
1973 births
Living people
Indian male shot putters
Olympic athletes for India
Athletes (track and field) at the 2000 Summer Olympics
Athletes (track and field) at the 2004 Summer Olympics
Athletes (track and field) at the 1998 Asian Games
Athletes (track and field) at the 2002 Asian Games
Asian Games medalists in athletics (track and field)
Asian Games gold medalists for India
Recipients of the Padma Shri in sports
Medalists at the 2002 Asian Games
Place of birth missing (living people)
Indian Sikhs |
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.arrow.driver.jdbc.accessor.impl.complex;
import java.util.List;
import java.util.function.IntSupplier;
import org.apache.arrow.driver.jdbc.accessor.ArrowFlightJdbcAccessorFactory;
import org.apache.arrow.vector.FieldVector;
import org.apache.arrow.vector.complex.FixedSizeListVector;
/** Accessor for the Arrow type {@link FixedSizeListVector}. */
public class ArrowFlightJdbcFixedSizeListVectorAccessor
extends AbstractArrowFlightJdbcListVectorAccessor {
private final FixedSizeListVector vector;
public ArrowFlightJdbcFixedSizeListVectorAccessor(
FixedSizeListVector vector,
IntSupplier currentRowSupplier,
ArrowFlightJdbcAccessorFactory.WasNullConsumer setCursorWasNull) {
super(currentRowSupplier, setCursorWasNull);
this.vector = vector;
}
@Override
protected long getStartOffset(int index) {
return (long) vector.getListSize() * index;
}
@Override
protected long getEndOffset(int index) {
return (long) vector.getListSize() * (index + 1);
}
@Override
protected FieldVector getDataVector() {
return vector.getDataVector();
}
@Override
protected boolean isNull(int index) {
return vector.isNull(index);
}
@Override
public Object getObject() {
List<?> object = vector.getObject(getCurrentRow());
this.wasNull = object == null;
this.wasNullConsumer.setWasNull(this.wasNull);
return object;
}
}
``` |
Big Bottom may refer to:
the Big Bottom massacre of the Northwest Indian War
"Big Bottom," a song by Spinal Tap from the soundtrack This Is Spinal Tap (album)
Big Bottom, South Dakota, a ghost town in Meade County |
Fort Blackmore is an unincorporated community in Scott County, Virginia. Fort Blackmore is located on Virginia State Route 65 west-southwest of Dungannon. Fort Blackmore has a post office with ZIP code 24250.
Notable people
John King, stock car racing driver
References
Unincorporated communities in Scott County, Virginia
Unincorporated communities in Virginia |
```c++
/*
Qalculate (library)
This program is free software; you can redistribute it and/or modify
(at your option) any later version.
*/
#include "support.h"
#include "MathStructure.h"
#include "Calculator.h"
#include "BuiltinFunctions.h"
#include "Number.h"
#include "Function.h"
#include "Variable.h"
#include "Unit.h"
#include "Prefix.h"
#include "MathStructure-support.h"
using std::string;
using std::cout;
using std::vector;
using std::ostream;
using std::endl;
bool factorize_fix_root_power(MathStructure &m) {
if(!m[0].isFunction() || m[0].function()->id() != FUNCTION_ID_ROOT || !VALID_ROOT(m[0])) return false;
if(m[1].isNumber() && m[1].number().isInteger() && !m[1].number().isMinusOne()) {
if(m[1] == m[0][1]) {
// root(x, a)^a=x
m.setToChild(1, true);
m.setToChild(1, true);
return true;
} else if(m[1].number().isIntegerDivisible(m[0][1].number())) {
// root(x, a)^(2a)=x^2
if(m[1].number().divide(m[0][1].number())) {
m[0].setToChild(1, true);
return true;
}
} else if(m[0][1].number().isIntegerDivisible(m[1].number())) {
// root(x, 3a)^(a)=root(x, 3)
if(m[0][1].number().divide(m[1].number())) {
m.setToChild(1, true);
m.childUpdated(2);
return true;
}
}
}
return false;
}
bool sqrfree_differentiate(const MathStructure &mpoly, const MathStructure &x_var, MathStructure &mdiff, const EvaluationOptions &eo) {
if(mpoly == x_var) {
mdiff.set(1, 1, 0);
return true;
}
switch(mpoly.type()) {
case STRUCT_ADDITION: {
mdiff.clear();
mdiff.setType(STRUCT_ADDITION);
for(size_t i = 0; i < mpoly.size(); i++) {
mdiff.addChild(m_zero);
if(!sqrfree_differentiate(mpoly[i], x_var, mdiff[i], eo)) return false;
}
mdiff.calculatesub(eo, eo, false);
break;
}
case STRUCT_VARIABLE: {}
case STRUCT_FUNCTION: {}
case STRUCT_SYMBOLIC: {}
case STRUCT_UNIT: {}
case STRUCT_NUMBER: {
mdiff.clear();
break;
}
case STRUCT_POWER: {
if(mpoly[0] == x_var) {
mdiff = mpoly[1];
mdiff.multiply(x_var);
if(!mpoly[1].number().isTwo()) {
mdiff[1].raise(mpoly[1]);
mdiff[1][1].number()--;
}
mdiff.evalSort(true);
} else {
mdiff.clear();
}
break;
}
case STRUCT_MULTIPLICATION: {
if(mpoly.size() < 1) {
mdiff.clear();
break;
} else if(mpoly.size() < 2) {
return sqrfree_differentiate(mpoly[0], x_var, mdiff, eo);
}
mdiff.clear();
for(size_t i = 0; i < mpoly.size(); i++) {
if(mpoly[i] == x_var) {
if(mpoly.size() == 2) {
if(i == 0) mdiff = mpoly[1];
else mdiff = mpoly[0];
} else {
mdiff.setType(STRUCT_MULTIPLICATION);
for(size_t i2 = 0; i2 < mpoly.size(); i2++) {
if(i2 != i) {
mdiff.addChild(mpoly[i2]);
}
}
}
break;
} else if(mpoly[i].isPower() && mpoly[i][0] == x_var) {
mdiff = mpoly;
if(mpoly[i][1].number().isTwo()) {
mdiff[i].setToChild(1);
} else {
mdiff[i][1].number()--;
}
if(mdiff[0].isNumber()) {
mdiff[0].number() *= mpoly[i][1].number();
} else {
mdiff.insertChild(mpoly[i][1].number(), 1);
}
mdiff.evalSort();
break;
}
}
break;
}
default: {
return false;
}
}
return true;
}
bool fix_root_pow(MathStructure &m, const MathStructure &xvar, const EvaluationOptions &eo) {
if(m.isPower() && m[0].contains(xvar) && m[1].isNumber()) {
return m.calculateRaiseExponent(eo);
}
bool b_ret = false;
for(size_t i = 0; i < m.size(); i++) {
if(fix_root_pow(m[i], xvar, eo)) {m.childUpdated(i + 1); b_ret = true;}
}
if(b_ret) m.calculatesub(eo, eo, false);
return b_ret;
}
bool sqrfree_yun(const MathStructure &a, const MathStructure &xvar, MathStructure &factors, const EvaluationOptions &eo) {
MathStructure w(a);
MathStructure z;
if(!sqrfree_differentiate(a, xvar, z, eo)) {
return false;
}
MathStructure g;
if(!MathStructure::gcd(w, z, g, eo)) {
return false;
}
if(g.isOne()) {
factors.addChild(a);
return true;
}
MathStructure y;
MathStructure tmp;
do {
tmp = w;
if(!MathStructure::polynomialQuotient(tmp, g, xvar, w, eo)) {
return false;
}
if(!MathStructure::polynomialQuotient(z, g, xvar, y, eo)) {
return false;
}
if(!sqrfree_differentiate(w, xvar, tmp, eo)) {
return false;
}
z = y;
z.calculateSubtract(tmp, eo);
if(!MathStructure::gcd(w, z, g, eo)) {
return false;
}
factors.addChild(g);
} while (!z.isZero());
return true;
}
bool sqrfree_simple(const MathStructure &a, const MathStructure &xvar, MathStructure &factors, const EvaluationOptions &eo) {
MathStructure w(a);
while(true) {
MathStructure z, zmod;
if(!sqrfree_differentiate(w, xvar, z, eo)) return false;
polynomial_smod(z, nr_three, zmod, eo);
if(z == w) {
factors.addChild(w);
break;
}
MathStructure mgcd;
if(!MathStructure::gcd(w, z, mgcd, eo)) return false;
if(mgcd.isOne() || mgcd == w) {
factors.addChild(w);
break;
}
MathStructure tmp(w);
if(!MathStructure::polynomialQuotient(tmp, mgcd, xvar, w, eo)) return false;
if(!sqrfree_simple(mgcd, xvar, factors, eo)) return false;
}
return true;
}
void lcmcoeff(const MathStructure &e, const Number &l, Number &nlcm);
void lcmcoeff(const MathStructure &e, const Number &l, Number &nlcm) {
if(e.isNumber() && e.number().isRational()) {
nlcm = e.number().denominator();
if(l.isInteger()) nlcm.lcm(l);
else nlcm.multiply(l);
} else if(e.isAddition()) {
nlcm.set(1, 1, 0);
for(size_t i = 0; i < e.size(); i++) {
Number c(nlcm);
lcmcoeff(e[i], c, nlcm);
}
if(l.isInteger()) nlcm.lcm(l);
else nlcm.multiply(l);
} else if(e.isMultiplication()) {
nlcm.set(1, 1, 0);
for(size_t i = 0; i < e.size(); i++) {
Number c(nlcm);
lcmcoeff(e[i], nr_one, c);
nlcm *= c;
}
if(l.isInteger()) nlcm.lcm(l);
else nlcm.multiply(l);
} else if(e.isPower()) {
if(IS_A_SYMBOL(e[0]) || e[0].isUnit()) {
nlcm = l;
} else {
lcmcoeff(e[0], l, nlcm);
nlcm ^= e[1].number();
}
} else {
nlcm = l;
}
}
void lcm_of_coefficients_denominators(const MathStructure &e, Number &nlcm) {
return lcmcoeff(e, nr_one, nlcm);
}
void multiply_lcm(const MathStructure &e, const Number &lcm, MathStructure &mmul, const EvaluationOptions &eo) {
if(e.isMultiplication()) {
Number lcm_accum(1, 1);
mmul.clear();
for(size_t i = 0; i < e.size(); i++) {
Number op_lcm;
lcmcoeff(e[i], nr_one, op_lcm);
if(mmul.isZero()) {
multiply_lcm(e[i], op_lcm, mmul, eo);
if(mmul.isOne()) mmul.clear();
} else {
mmul.multiply(m_one, true);
multiply_lcm(e[i], op_lcm, mmul[mmul.size() - 1], eo);
if(mmul[mmul.size() - 1].isOne()) {
mmul.delChild(i + 1);
if(mmul.size() == 1) mmul.setToChild(1);
}
}
lcm_accum *= op_lcm;
}
Number lcm2(lcm);
lcm2 /= lcm_accum;
if(mmul.isZero()) {
mmul = lcm2;
} else if(!lcm2.isOne()) {
if(mmul.size() > 0 && mmul[0].isNumber()) {
mmul[0].number() *= lcm2;
} else {
mmul.multiply(lcm2, true);
}
}
mmul.evalSort();
} else if(e.isAddition()) {
mmul.clear();
for (size_t i = 0; i < e.size(); i++) {
if(mmul.isZero()) {
multiply_lcm(e[i], lcm, mmul, eo);
} else {
mmul.add(m_zero, true);
multiply_lcm(e[i], lcm, mmul[mmul.size() - 1], eo);
}
}
mmul.evalSort();
} else if(e.isPower()) {
if(IS_A_SYMBOL(e[0]) || e[0].isUnit()) {
mmul = e;
if(!lcm.isOne()) {
mmul *= lcm;
mmul.evalSort();
}
} else {
mmul = e;
Number lcm_exp = e[1].number();
lcm_exp.recip();
multiply_lcm(e[0], lcm ^ lcm_exp, mmul[0], eo);
if(mmul[0] != e[0]) {
mmul.calculatesub(eo, eo, false);
}
}
} else if(e.isNumber()) {
mmul = e;
mmul.number() *= lcm;
} else if(IS_A_SYMBOL(e) || e.isUnit()) {
mmul = e;
if(!lcm.isOne()) {
mmul *= lcm;
mmul.evalSort();
}
} else {
mmul = e;
if(!lcm.isOne()) {
mmul.calculateMultiply(lcm, eo);
mmul.evalSort();
}
}
}
//from GiNaC
bool sqrfree(MathStructure &mpoly, const EvaluationOptions &eo) {
vector<MathStructure> symbols;
collect_symbols(mpoly, symbols);
return sqrfree(mpoly, symbols, eo);
}
bool sqrfree(MathStructure &mpoly, const vector<MathStructure> &symbols, const EvaluationOptions &eo) {
EvaluationOptions eo2 = eo;
eo2.assume_denominators_nonzero = true;
eo2.warn_about_denominators_assumed_nonzero = false;
eo2.reduce_divisions = true;
eo2.keep_zero_units = false;
eo2.do_polynomial_division = false;
eo2.sync_units = false;
eo2.expand = true;
eo2.calculate_functions = false;
eo2.protected_function = CALCULATOR->getFunctionById(FUNCTION_ID_SIGNUM);
if(mpoly.size() == 0) {
return true;
}
if(symbols.empty()) return true;
size_t symbol_index = 0;
if(symbols.size() > 1) {
for(size_t i = 1; i < symbols.size(); i++) {
if(mpoly.degree(symbols[symbol_index]).isGreaterThan(mpoly.degree(symbols[i]))) symbol_index = i;
}
}
MathStructure xvar(symbols[symbol_index]);
UnknownVariable *var = NULL;
if(xvar.size() > 0) {
var = new UnknownVariable("", format_and_print(xvar));
var->setAssumptions(xvar);
mpoly.replace(xvar, var);
xvar = var;
}
Number nlcm;
lcm_of_coefficients_denominators(mpoly, nlcm);
MathStructure tmp;
multiply_lcm(mpoly, nlcm, tmp, eo2);
MathStructure factors;
factors.clearVector();
if(!sqrfree_yun(tmp, xvar, factors, eo2)) {
if(var) tmp.replace(var, symbols[symbol_index]);
factors.clearVector();
factors.addChild(tmp);
} else {
if(var) tmp.replace(var, symbols[symbol_index]);
}
if(var) {mpoly.replace(var, symbols[symbol_index]); var->destroy();}
vector<MathStructure> newsymbols;
for(size_t i = 0; i < symbols.size(); i++) {
if(i != symbol_index) newsymbols.push_back(symbols[i]);
}
if(newsymbols.size() > 0) {
for(size_t i = 0; i < factors.size(); i++) {
if(!sqrfree(factors[i], newsymbols, eo)) return false;
}
}
mpoly.set(1, 1, 0);
for(size_t i = 0; i < factors.size(); i++) {
if(CALCULATOR->aborted()) return false;
if(!factors[i].isOne()) {
if(mpoly.isOne()) {
mpoly = factors[i];
if(i != 0) mpoly.raise(MathStructure((long int) i + 1, 1L, 0L));
} else {
mpoly.multiply(factors[i], true);
mpoly[mpoly.size() - 1].raise(MathStructure((long int) i + 1, 1L, 0L));
}
}
}
if(CALCULATOR->aborted()) return false;
if(mpoly.isZero()) {
CALCULATOR->error(true, "mpoly is zero: %s. %s", format_and_print(tmp).c_str(), _("This is a bug. Please report it."), NULL);
return false;
}
MathStructure mquo;
MathStructure mpoly_expand(mpoly);
EvaluationOptions eo3 = eo;
eo3.expand = true;
mpoly_expand.calculatesub(eo3, eo3);
MathStructure::polynomialQuotient(tmp, mpoly_expand, xvar, mquo, eo2);
if(CALCULATOR->aborted()) return false;
if(mquo.isZero()) {
//CALCULATOR->error(true, "quo is zero: %s. %s", format_and_print(tmp).c_str(), _("This is a bug. Please report it."), NULL);
return false;
}
if(newsymbols.size() > 0) {
if(!sqrfree(mquo, newsymbols, eo)) return false;
}
if(!mquo.isOne()) {
mpoly.multiply(mquo, true);
}
if(!nlcm.isOne()) {
nlcm.recip();
mpoly.multiply(nlcm, true);
}
eo3.expand = false;
mpoly.calculatesub(eo3, eo3, false);
return true;
}
bool MathStructure::integerFactorize() {
if(isVector()) {
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).isVector()) {
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if(!CHILD(i)[i2].isNumber()) return false;
}
} else if(!CHILD(i).isNumber()) {
return false;
}
}
bool b = false;
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).integerFactorize()) b = true;
}
return b;
}
if(!isNumber() || !o_number.isRational()) return false;
if(!o_number.isInteger()) {
MathStructure mnum(o_number.numerator()), mden(o_number.denominator());
if(mnum.integerFactorize() && mden.integerFactorize()) {
if(!mnum.isMultiplication() && !mden.isMultiplication()) return true;
set(mnum);
divide(mden);
return true;
}
return false;
}
vector<Number> factors;
if(!o_number.factorize(factors)) return false;
if(factors.size() <= 1) return true;
clear(true);
bool b_pow = false;
Number *lastnr = NULL;
for(size_t i = 0; i < factors.size(); i++) {
if(lastnr && factors[i] == *lastnr) {
if(!b_pow) {
LAST.raise(m_one);
b_pow = true;
}
LAST[1].number()++;
} else {
APPEND(factors[i]);
b_pow = false;
}
lastnr = &factors[i];
}
m_type = STRUCT_MULTIPLICATION;
return true;
}
size_t count_powers(const MathStructure &mstruct) {
if(mstruct.isPower()) {
if(mstruct[1].isInteger()) {
bool overflow = false;
int c = mstruct.number().intValue(&overflow) - 1;
if(overflow) return 0;
if(c < 0) return -c;
return c;
}
}
size_t c = 0;
for(size_t i = 0; i < mstruct.size(); i++) {
c += count_powers(mstruct[i]);
}
return c;
}
bool gather_factors(const MathStructure &mstruct, const MathStructure &x_var, MathStructure &madd, MathStructure &mmul, MathStructure &mexp, bool mexp_as_x2 = false) {
madd.clear();
if(mexp_as_x2) mexp = m_zero;
else mexp = m_one;
mmul = m_zero;
if(mstruct == x_var) {
mmul = m_one;
return true;
} else if(mexp_as_x2 && mstruct.isPower()) {
if(mstruct[1].isNumber() && mstruct[1].number().isTwo() && mstruct[0] == x_var) {
mexp = m_one;
return true;
}
} else if(!mexp_as_x2 && mstruct.isPower() && mstruct[1].isInteger() && mstruct[0] == x_var) {
if(mstruct[0] == x_var) {
mexp = mstruct[1];
mmul = m_one;
return true;
}
} else if(mstruct.isMultiplication() && mstruct.size() >= 2) {
bool b_x = false;
bool b2 = false;
size_t i_x = 0;
for(size_t i = 0; i < mstruct.size(); i++) {
if(!b_x && mstruct[i] == x_var) {
b_x = true;
i_x = i;
} else if(!b_x && mexp_as_x2 && mstruct[i].isPower() && mstruct[i][1].isNumber() && mstruct[i][1].number().isTwo() && mstruct[i][0] == x_var) {
b_x = true;
b2 = true;
i_x = i;
} else if(!b_x && !mexp_as_x2 && mstruct[i].isPower() && mstruct[i][1].isInteger() && mstruct[i][0] == x_var) {
b_x = true;
i_x = i;
mexp = mstruct[i][1];
} else if(mstruct[i].containsRepresentativeOf(x_var, true, true) != 0) {
return false;
}
}
if(!b_x) return false;
if(mstruct.size() == 1) {
if(b2) mexp = m_one;
else mmul = m_one;
} else if(mstruct.size() == 2) {
if(b2) {
if(i_x == 1) mexp = mstruct[0];
else mexp = mstruct[1];
} else {
if(i_x == 1) mmul = mstruct[0];
else mmul = mstruct[1];
}
} else {
if(b2) {
mexp = mstruct;
mexp.delChild(i_x + 1, true);
} else {
mmul = mstruct;
mmul.delChild(i_x + 1, true);
}
}
return true;
} else if(mstruct.isAddition()) {
mmul.setType(STRUCT_ADDITION);
if(mexp_as_x2) mexp.setType(STRUCT_ADDITION);
madd.setType(STRUCT_ADDITION);
for(size_t i = 0; i < mstruct.size(); i++) {
if(mstruct[i] == x_var) {
if(mexp_as_x2 || mexp.isOne()) mmul.addChild(m_one);
else return false;
} else if(mexp_as_x2 && mstruct[i].isPower() && mstruct[i][1].isNumber() && mstruct[i][1].number().isTwo() && mstruct[i][0] == x_var) {
mexp.addChild(m_one);
} else if(!mexp_as_x2 && mstruct[i].isPower() && mstruct[i][1].isInteger() && mstruct[i][0] == x_var) {
if(mmul.size() == 0) {
mexp = mstruct[i][1];
} else if(mexp != mstruct[i][1]) {
return false;
}
mmul.addChild(m_one);
} else if(mstruct[i].isMultiplication()) {
bool b_x = false;
bool b2 = false;
size_t i_x = 0;
for(size_t i2 = 0; i2 < mstruct[i].size(); i2++) {
if(!b_x && mstruct[i][i2] == x_var) {
if(!mexp_as_x2 && !mexp.isOne()) return false;
i_x = i2;
b_x = true;
} else if(!b_x && mexp_as_x2 && mstruct[i][i2].isPower() && mstruct[i][i2][1].isNumber() && mstruct[i][i2][1].number().isTwo() && mstruct[i][i2][0] == x_var) {
b2 = true;
i_x = i2;
b_x = true;
} else if(!b_x && !mexp_as_x2 && mstruct[i][i2].isPower() && mstruct[i][i2][1].isInteger() && mstruct[i][i2][0] == x_var) {
if(mmul.size() == 0) {
mexp = mstruct[i][i2][1];
} else if(mexp != mstruct[i][i2][1]) {
return false;
}
i_x = i2;
b_x = true;
} else if(mstruct[i][i2].containsRepresentativeOf(x_var, true, true) != 0) {
return false;
}
}
if(b_x) {
if(mstruct[i].size() == 1) {
if(b2) mexp.addChild(m_one);
else mmul.addChild(m_one);
} else {
if(b2) {
mexp.addChild(mstruct[i]);
mexp[mexp.size() - 1].delChild(i_x + 1, true);
mexp.childUpdated(mexp.size());
} else {
mmul.addChild(mstruct[i]);
mmul[mmul.size() - 1].delChild(i_x + 1, true);
mmul.childUpdated(mmul.size());
}
}
} else {
madd.addChild(mstruct[i]);
}
} else if(mstruct[i].containsRepresentativeOf(x_var, true, true) != 0) {
return false;
} else {
madd.addChild(mstruct[i]);
}
}
if(mmul.size() == 0 && (!mexp_as_x2 || mexp.size() == 0)) {
mmul.clear();
if(mexp_as_x2) mexp.clear();
return false;
}
if(mmul.size() == 0) mmul.clear();
else if(mmul.size() == 1) mmul.setToChild(1);
if(mexp_as_x2) {
if(mexp.size() == 0) mexp.clear();
else if(mexp.size() == 1) mexp.setToChild(1);
}
if(madd.size() == 0) madd.clear();
else if(madd.size() == 1) madd.setToChild(1);
return true;
}
return false;
}
bool factorize_find_multiplier(const MathStructure &mstruct, MathStructure &mnew, MathStructure &factor_mstruct, bool only_units) {
factor_mstruct.set(m_one);
switch(mstruct.type()) {
case STRUCT_ADDITION: {
if(!only_units) {
bool bfrac = false, bint = true;
idm1(mstruct, bfrac, bint);
if(bfrac || bint) {
Number gcd(1, 1);
idm2(mstruct, bfrac, bint, gcd);
if((bint || bfrac) && !gcd.isOne()) {
if(bfrac) gcd.recip();
factor_mstruct.set(gcd);
}
}
}
size_t nfac = 0;
if(mstruct.size() > 0) {
size_t i = 0;
const MathStructure *cur_mstruct;
while(true) {
if(mstruct[0].isMultiplication()) {
if(i >= mstruct[0].size()) {
break;
}
cur_mstruct = &mstruct[0][i];
} else {
cur_mstruct = &mstruct[0];
}
if(!cur_mstruct->containsInterval(true) && !cur_mstruct->isNumber() && (!only_units || cur_mstruct->isUnit_exp())) {
const MathStructure *exp = NULL;
const MathStructure *bas;
if(cur_mstruct->isPower() && IS_REAL((*cur_mstruct)[1]) && !(*cur_mstruct)[0].isNumber()) {
exp = cur_mstruct->exponent();
bas = cur_mstruct->base();
} else {
bas = cur_mstruct;
}
bool b = true;
for(size_t i2 = 1; i2 < mstruct.size(); i2++) {
b = false;
size_t i3 = 0;
const MathStructure *cmp_mstruct;
while(true) {
if(mstruct[i2].isMultiplication()) {
if(i3 >= mstruct[i2].size()) {
break;
}
cmp_mstruct = &mstruct[i2][i3];
} else {
cmp_mstruct = &mstruct[i2];
}
if(cmp_mstruct->equals(*bas)) {
if(exp) {
exp = NULL;
}
b = true;
break;
} else if(cmp_mstruct->isPower() && IS_REAL((*cmp_mstruct)[1]) && cmp_mstruct->base()->equals(*bas)) {
if(exp) {
if(cmp_mstruct->exponent()->number().isLessThan(exp->number())) {
exp = cmp_mstruct->exponent();
}
b = true;
break;
} else {
b = true;
break;
}
}
if(!mstruct[i2].isMultiplication()) {
break;
}
i3++;
}
if(!b) break;
}
if(b) {
b = !factor_mstruct.isOne();
if(exp) {
MathStructure *mpow = new MathStructure(*bas);
mpow->raise(*exp);
if(factor_mstruct.isOne()) {
factor_mstruct.set_nocopy(*mpow);
mpow->unref();
} else {
factor_mstruct.multiply_nocopy(mpow, true);
}
} else {
if(factor_mstruct.isOne()) factor_mstruct.set(*bas);
else factor_mstruct.multiply(*bas, true);
}
nfac++;
if(b) {
size_t i3 = 0;
const MathStructure *cmp_mstruct;
b = false;
while(true) {
if(i3 >= factor_mstruct.size() - 1) {
break;
}
cmp_mstruct = &factor_mstruct[i3];
if(cmp_mstruct->equals(factor_mstruct.last())) {
if(exp) {
exp = NULL;
}
b = true;
break;
} else if(cmp_mstruct->isPower() && IS_REAL((*cmp_mstruct)[1]) && cmp_mstruct->base()->equals(factor_mstruct.last())) {
if(exp) {
if(cmp_mstruct->exponent()->number().isLessThan(exp->number())) {
exp = cmp_mstruct->exponent();
}
b = true;
break;
} else {
b = true;
break;
}
}
i3++;
}
if(b) {
factor_mstruct.delChild(factor_mstruct.size(), true);
nfac--;
}
}
}
}
if(!mstruct[0].isMultiplication()) {
break;
}
i++;
}
}
if(!factor_mstruct.isOne()) {
if(&mstruct != &mnew) mnew.set(mstruct);
MathStructure *mfactor;
size_t i = 0;
int b_mul = factor_mstruct.isMultiplication();
while(true) {
if(b_mul > 0) {
if(i >= factor_mstruct.size()) break;
mfactor = &factor_mstruct[i];
} else {
mfactor = &factor_mstruct;
}
for(size_t i2 = 0; i2 < mnew.size(); i2++) {
switch(mnew[i2].type()) {
case STRUCT_NUMBER: {
if(mfactor->isNumber()) {
mnew[i2].number() /= mfactor->number();
}
break;
}
case STRUCT_POWER: {
if(!IS_REAL(mnew[i2][1])) {
if(mfactor->isNumber()) {
mnew[i2].transform(STRUCT_MULTIPLICATION);
mnew[i2].insertChild(MathStructure(1, 1, 0), 1);
mnew[i2][0].number() /= mfactor->number();
} else {
mnew[i2].set(m_one);
}
} else if(mfactor->isNumber()) {
mnew[i2].transform(STRUCT_MULTIPLICATION);
mnew[i2].insertChild(MathStructure(1, 1, 0), 1);
mnew[i2][0].number() /= mfactor->number();
} else if(mfactor->isPower() && IS_REAL((*mfactor)[1])) {
if(mfactor->equals(mnew[i2])) {
mnew[i2].set(m_one);
} else {
mnew[i2][1].number() -= mfactor->exponent()->number();
if(mnew[i2][1].number().isOne()) {
mnew[i2].setToChild(1, true);
} else if(factorize_fix_root_power(mnew[i2])) {
mnew.childUpdated(i2 + 1);
}
}
} else {
mnew[i2][1].number() -= 1;
if(mnew[i2][1].number().isOne()) {
mnew[i2].setToChild(1);
} else if(mnew[i2][1].number().isZero()) {
mnew[i2].set(m_one);
} else if(factorize_fix_root_power(mnew[i2])) {
mnew.childUpdated(i2 + 1);
}
}
break;
}
case STRUCT_MULTIPLICATION: {
bool b = true;
if(mfactor->isNumber() && (mnew[i2].size() < 1 || !mnew[i2][0].isNumber())) {
mnew[i2].insertChild(MathStructure(1, 1, 0), 1);
}
for(size_t i3 = 0; i3 < mnew[i2].size() && b; i3++) {
switch(mnew[i2][i3].type()) {
case STRUCT_NUMBER: {
if(mfactor->isNumber()) {
if(mfactor->equals(mnew[i2][i3])) {
mnew[i2].delChild(i3 + 1);
} else {
mnew[i2][i3].number() /= mfactor->number();
}
b = false;
}
break;
}
case STRUCT_POWER: {
if(!IS_REAL(mnew[i2][i3][1])) {
if(mfactor->equals(mnew[i2][i3])) {
mnew[i2].delChild(i3 + 1);
b = false;
}
} else if(mfactor->isPower() && IS_REAL((*mfactor)[1]) && mfactor->base()->equals(mnew[i2][i3][0])) {
if(mfactor->equals(mnew[i2][i3])) {
mnew[i2].delChild(i3 + 1);
} else {
mnew[i2][i3][1].number() -= mfactor->exponent()->number();
if(mnew[i2][i3][1].number().isOne()) {
MathStructure mstruct2(mnew[i2][i3][0]);
mnew[i2][i3] = mstruct2;
} else if(mnew[i2][i3][1].number().isZero()) {
mnew[i2].delChild(i3 + 1);
} else if(factorize_fix_root_power(mnew[i2][i3])) {
mnew[i2].childUpdated(i3 + 1);
mnew.childUpdated(i2 + 1);
}
}
b = false;
} else if(mfactor->equals(mnew[i2][i3][0])) {
if(mnew[i2][i3][1].number() == 2) {
MathStructure mstruct2(mnew[i2][i3][0]);
mnew[i2][i3] = mstruct2;
} else if(mnew[i2][i3][1].number().isOne()) {
mnew[i2].delChild(i3 + 1);
} else {
mnew[i2][i3][1].number() -= 1;
if(factorize_fix_root_power(mnew[i2][i3])) {
mnew[i2].childUpdated(i3 + 1);
mnew.childUpdated(i2 + 1);
}
}
b = false;
}
break;
}
default: {
if(mfactor->equals(mnew[i2][i3])) {
mnew[i2].delChild(i3 + 1);
b = false;
}
}
}
}
if(mnew[i2].size() == 1) {
MathStructure mstruct2(mnew[i2][0]);
mnew[i2] = mstruct2;
}
if(b) {
if(b_mul > 0 && nfac == 1 && &mstruct != &mnew) {
b_mul = -1;
mnew.set(mstruct);
} else {
return false;
}
}
break;
}
default: {
if(mfactor->isNumber()) {
mnew[i2].transform(STRUCT_MULTIPLICATION);
mnew[i2].insertChild(MathStructure(1, 1, 0), 1);
mnew[i2][0].number() /= mfactor->number();
} else {
mnew[i2].set(m_one);
}
}
}
}
if(b_mul > 0) {
i++;
} else if(b_mul < 0) {
b_mul = 0;
} else {
break;
}
}
return true;
}
}
default: {}
}
return false;
}
bool polynomial_divide_integers(const vector<Number> &vnum, const vector<Number> &vden, vector<Number> &vquotient) {
vquotient.clear();
long int numdeg = vnum.size() - 1;
long int dendeg = vden.size() - 1;
Number dencoeff(vden[dendeg]);
if(numdeg < dendeg) return false;
vquotient.resize(numdeg - dendeg + 1, nr_zero);
vector<Number> vrem = vnum;
while(numdeg >= dendeg) {
Number numcoeff(vrem[numdeg]);
numdeg -= dendeg;
if(!numcoeff.isIntegerDivisible(dencoeff)) break;
numcoeff /= dencoeff;
vquotient[numdeg] += numcoeff;
for(size_t i = 0; i < vden.size(); i++) {
vrem[numdeg + i] -= (vden[i] * numcoeff);
}
while(true) {
if(vrem.back().isZero()) vrem.pop_back();
else break;
if(vrem.size() == 0) return true;
}
numdeg = (long int) vrem.size() - 1;
}
return false;
}
bool combination_factorize_is_complicated(MathStructure &m) {
if(m.isPower()) {
return combination_factorize_is_complicated(m[0]) || combination_factorize_is_complicated(m[1]);
}
return m.size() > 0;
}
bool combination_factorize(MathStructure &mstruct) {
bool retval = false;
switch(mstruct.type()) {
case STRUCT_ADDITION: {
bool b = false;
// 5/y + x/y + z = (5 + x)/y + z
MathStructure mstruct_units(mstruct);
MathStructure mstruct_new(mstruct);
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(mstruct_units[i].isMultiplication()) {
for(size_t i2 = 0; i2 < mstruct_units[i].size();) {
if(!mstruct_units[i][i2].isPower() || !mstruct_units[i][i2][1].hasNegativeSign()) {
mstruct_units[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_units[i].size() == 0) mstruct_units[i].setUndefined();
else if(mstruct_units[i].size() == 1) mstruct_units[i].setToChild(1);
for(size_t i2 = 0; i2 < mstruct_new[i].size();) {
if(mstruct_new[i][i2].isPower() && mstruct_new[i][i2][1].hasNegativeSign()) {
mstruct_new[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_new[i].size() == 0) mstruct_new[i].set(1, 1, 0);
else if(mstruct_new[i].size() == 1) mstruct_new[i].setToChild(1);
} else if(mstruct_new[i].isPower() && mstruct_new[i][1].hasNegativeSign()) {
mstruct_new[i].set(1, 1, 0);
} else {
mstruct_units[i].setUndefined();
}
}
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(!mstruct_units[i].isUndefined()) {
for(size_t i2 = i + 1; i2 < mstruct_units.size();) {
if(mstruct_units[i2] == mstruct_units[i]) {
mstruct_new[i].add(mstruct_new[i2], true);
mstruct_new.delChild(i2 + 1);
mstruct_units.delChild(i2 + 1);
b = true;
} else {
i2++;
}
}
if(mstruct_new[i].isOne()) mstruct_new[i].set(mstruct_units[i]);
else mstruct_new[i].multiply(mstruct_units[i], true);
}
}
if(b) {
if(mstruct_new.size() == 1) {
mstruct.set(mstruct_new[0], true);
} else {
mstruct = mstruct_new;
}
b = false;
retval = true;
}
if(mstruct.isAddition()) {
// y*f(x) + z*f(x) = (y+z)*f(x)
MathStructure mstruct_units(mstruct);
MathStructure mstruct_new(mstruct);
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(mstruct_units[i].isMultiplication()) {
for(size_t i2 = 0; i2 < mstruct_units[i].size();) {
if(!combination_factorize_is_complicated(mstruct_units[i][i2])) {
mstruct_units[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_units[i].size() == 0) mstruct_units[i].setUndefined();
else if(mstruct_units[i].size() == 1) mstruct_units[i].setToChild(1);
for(size_t i2 = 0; i2 < mstruct_new[i].size();) {
if(combination_factorize_is_complicated(mstruct_new[i][i2])) {
mstruct_new[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_new[i].size() == 0) mstruct_new[i].set(1, 1, 0);
else if(mstruct_new[i].size() == 1) mstruct_new[i].setToChild(1);
} else if(combination_factorize_is_complicated(mstruct_units[i])) {
mstruct_new[i].set(1, 1, 0);
} else {
mstruct_units[i].setUndefined();
}
}
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(!mstruct_units[i].isUndefined()) {
for(size_t i2 = i + 1; i2 < mstruct_units.size();) {
if(mstruct_units[i2] == mstruct_units[i]) {
mstruct_new[i].add(mstruct_new[i2], true);
mstruct_new.delChild(i2 + 1);
mstruct_units.delChild(i2 + 1);
b = true;
} else {
i2++;
}
}
if(mstruct_new[i].isOne()) mstruct_new[i].set(mstruct_units[i]);
else mstruct_new[i].multiply(mstruct_units[i], true);
}
}
if(b) {
if(mstruct_new.size() == 1) mstruct.set(mstruct_new[0], true);
else mstruct = mstruct_new;
retval = true;
}
}
if(mstruct.isAddition()) {
// 5x + pi*x + 5y + xy = (5 + pi)x + 5y + xy
MathStructure mstruct_units(mstruct);
MathStructure mstruct_new(mstruct);
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(mstruct_units[i].isMultiplication()) {
for(size_t i2 = 0; i2 < mstruct_units[i].size();) {
if(!mstruct_units[i][i2].containsType(STRUCT_UNIT, true) && !mstruct_units[i][i2].containsUnknowns()) {
mstruct_units[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_units[i].size() == 0) mstruct_units[i].setUndefined();
else if(mstruct_units[i].size() == 1) mstruct_units[i].setToChild(1);
for(size_t i2 = 0; i2 < mstruct_new[i].size();) {
if(mstruct_new[i][i2].containsType(STRUCT_UNIT, true) || mstruct_new[i][i2].containsUnknowns()) {
mstruct_new[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_new[i].size() == 0) mstruct_new[i].set(1, 1, 0);
else if(mstruct_new[i].size() == 1) mstruct_new[i].setToChild(1);
} else if(mstruct_units[i].containsType(STRUCT_UNIT, true) || mstruct_units[i].containsUnknowns()) {
mstruct_new[i].set(1, 1, 0);
} else {
mstruct_units[i].setUndefined();
}
}
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(!mstruct_units[i].isUndefined()) {
for(size_t i2 = i + 1; i2 < mstruct_units.size();) {
if(mstruct_units[i2] == mstruct_units[i]) {
mstruct_new[i].add(mstruct_new[i2], true);
mstruct_new.delChild(i2 + 1);
mstruct_units.delChild(i2 + 1);
b = true;
} else {
i2++;
}
}
if(mstruct_new[i].isOne()) mstruct_new[i].set(mstruct_units[i]);
else mstruct_new[i].multiply(mstruct_units[i], true);
}
}
if(b) {
if(mstruct_new.size() == 1) mstruct.set(mstruct_new[0], true);
else mstruct = mstruct_new;
retval = true;
}
}
//if(retval) return retval;
}
default: {
bool b = false;
for(size_t i = 0; i < mstruct.size(); i++) {
if(combination_factorize(mstruct[i])) {
mstruct.childUpdated(i);
b = true;
}
}
if(b) retval = true;
}
}
return retval;
}
bool MathStructure::factorize(const EvaluationOptions &eo_pre, bool unfactorize, int term_combination_levels, int max_msecs, bool only_integers, int recursive, struct timeval *endtime_p, const MathStructure &force_factorization, bool complete_square, bool only_sqrfree, int max_factor_degree) {
if(CALCULATOR->aborted()) return false;
struct timeval endtime;
if(max_msecs > 0 && !endtime_p) {
#ifndef CLOCK_MONOTONIC
gettimeofday(&endtime, NULL);
#else
struct timespec ts;
clock_gettime(CLOCK_MONOTONIC, &ts);
endtime.tv_sec = ts.tv_sec;
endtime.tv_usec = ts.tv_nsec / 1000;
#endif
endtime.tv_sec += max_msecs / 1000;
long int usecs = endtime.tv_usec + (long int) (max_msecs % 1000) * 1000;
if(usecs >= 1000000) {
usecs -= 1000000;
endtime.tv_sec++;
}
endtime.tv_usec = usecs;
max_msecs = 0;
endtime_p = &endtime;
}
EvaluationOptions eo = eo_pre;
eo.sync_units = false;
eo.structuring = STRUCTURING_NONE;
if(unfactorize) {
unformat(eo_pre);
EvaluationOptions eo2 = eo;
eo2.expand = true;
eo2.combine_divisions = false;
eo2.sync_units = false;
calculatesub(eo2, eo2);
do_simplification(*this, eo, true, false, true);
} else if(term_combination_levels && isAddition()) {
MathStructure *mdiv = new MathStructure;
mdiv->setType(STRUCT_ADDITION);
for(size_t i = 0; i < SIZE; ) {
bool b = false;
if(CHILD(i).isMultiplication()) {
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if(CHILD(i)[i2].isPower() && CHILD(i)[i2][1].hasNegativeSign()) {
b = true;
break;
}
}
} else if(CHILD(i).isPower() && CHILD(i)[1].hasNegativeSign()) {
b = true;
}
if(b) {
CHILD(i).ref();
mdiv->addChild_nocopy(&CHILD(i));
ERASE(i)
} else {
i++;
}
}
if(mdiv->size() > 0) {
bool b_ret = false;
if(SIZE == 1 && recursive) {
b_ret = CHILD(0).factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
} else if(SIZE > 1) {
b_ret = factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
}
if(mdiv->size() > 1) {
// 5/y + x/y + z = (5 + x)/y + z
MathStructure mstruct_units(*mdiv);
MathStructure mstruct_new(*mdiv);
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(mstruct_units[i].isMultiplication()) {
for(size_t i2 = 0; i2 < mstruct_units[i].size();) {
if(!mstruct_units[i][i2].isPower() || !mstruct_units[i][i2][1].hasNegativeSign()) {
mstruct_units[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_units[i].size() == 0) mstruct_units[i].setUndefined();
else if(mstruct_units[i].size() == 1) mstruct_units[i].setToChild(1);
for(size_t i2 = 0; i2 < mstruct_new[i].size();) {
if(mstruct_new[i][i2].isPower() && mstruct_new[i][i2][1].hasNegativeSign()) {
mstruct_new[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_new[i].size() == 0) mstruct_new[i].set(1, 1, 0);
else if(mstruct_new[i].size() == 1) mstruct_new[i].setToChild(1);
} else if(mstruct_new[i].isPower() && mstruct_new[i][1].hasNegativeSign()) {
mstruct_new[i].set(1, 1, 0);
} else {
mstruct_units[i].setUndefined();
}
}
bool b = false;
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(!mstruct_units[i].isUndefined()) {
for(size_t i2 = i + 1; i2 < mstruct_units.size();) {
if(mstruct_units[i2] == mstruct_units[i]) {
mstruct_new[i].add(mstruct_new[i2], true);
mstruct_new.delChild(i2 + 1);
mstruct_units.delChild(i2 + 1);
b = true;
} else {
i2++;
}
}
if(mstruct_new[i].isOne()) mstruct_new[i].set(mstruct_units[i]);
else mstruct_new[i].multiply(mstruct_units[i], true);
}
}
if(b) {
if(mstruct_new.size() == 1) {
mdiv->set_nocopy(mstruct_new[0], true);
} else {
mdiv->set_nocopy(mstruct_new);
}
b_ret = true;
}
}
size_t index = 1;
if(isAddition()) index = SIZE;
if(index == 0) {
set_nocopy(*mdiv);
mdiv->unref();
} else if(mdiv->isAddition()) {
for(size_t i = 0; i < mdiv->size(); i++) {
(*mdiv)[i].ref();
add_nocopy(&(*mdiv)[i], true);
}
mdiv->unref();
} else {
add_nocopy(mdiv, true);
}
if(recursive) {
for(; index < SIZE; index++) {
b_ret = CHILD(index).factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree) || b_ret;
}
}
return b_ret;
}
mdiv->unref();
}
MathStructure mden, mnum;
evalSort(true);
if(term_combination_levels >= -1 && isAddition() && isRationalPolynomial()) {
MathStructure msqrfree(*this);
eo.protected_function = CALCULATOR->getFunctionById(FUNCTION_ID_SIGNUM);
if(sqrfree(msqrfree, eo)) {
if((!only_sqrfree || msqrfree.isPower()) && !equals(msqrfree) && (!msqrfree.isMultiplication() || msqrfree.size() != 2 || (!(msqrfree[0].isNumber() && msqrfree[1].isAddition()) && !(msqrfree[1].isNumber() && msqrfree[0].isAddition())))) {
MathStructure mcopy(msqrfree);
EvaluationOptions eo2 = eo;
eo2.expand = true;
eo2.calculate_functions = false;
CALCULATOR->beginTemporaryStopMessages();
mcopy.calculatesub(eo2, eo2);
CALCULATOR->endTemporaryStopMessages();
bool b_equal = equals(mcopy);
if(!b_equal && !CALCULATOR->aborted()) {
MathStructure mcopy2(*this);
CALCULATOR->beginTemporaryStopMessages();
mcopy.calculatesub(eo2, eo2, true);
mcopy2.calculatesub(eo2, eo2, true);
CALCULATOR->endTemporaryStopMessages();
b_equal = mcopy.equals(mcopy2);
}
if(!b_equal) {
eo.protected_function = eo_pre.protected_function;
if(CALCULATOR->aborted()) return false;
CALCULATOR->error(true, "factorized result is wrong: %s != %s. %s", format_and_print(msqrfree).c_str(), format_and_print(*this).c_str(), _("This is a bug. Please report it."), NULL);
} else {
eo.protected_function = eo_pre.protected_function;
set(msqrfree);
if(!isAddition()) {
if(isMultiplication()) flattenMultiplication(*this);
if(isMultiplication() && SIZE >= 2 && CHILD(0).isNumber()) {
for(size_t i = 1; i < SIZE; i++) {
if(CHILD(i).isNumber()) {
CHILD(i).number() *= CHILD(0).number();
CHILD(0).set(CHILD(i));
delChild(i);
} else if(CHILD(i).isPower() && CHILD(i)[0].isMultiplication() && CHILD(i)[0].size() >= 2 && CHILD(i)[0][0].isNumber() && CHILD(i)[0][0].number().isRational() && !CHILD(i)[0][0].number().isInteger() && CHILD(i)[1].isInteger()) {
CHILD(i)[0][0].number().raise(CHILD(i)[1].number());
CHILD(0).number().multiply(CHILD(i)[0][0].number());
CHILD(i)[0].delChild(1);
if(CHILD(i)[0].size() == 1) CHILD(i)[0].setToChild(1, true);
}
}
if(SIZE > 1 && CHILD(0).isOne()) {
ERASE(0);
}
if(SIZE == 1) SET_CHILD_MAP(0);
}
if(isMultiplication() && SIZE >= 2 && CHILD(0).isNumber() && CHILD(0).number().isRational() && !CHILD(0).number().isInteger()) {
Number den = CHILD(0).number().denominator();
for(size_t i = 1; i < SIZE; i++) {
if(CHILD(i).isAddition()) {
bool b = true;
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if(CHILD(i)[i2].isNumber()) {
if(!CHILD(i)[i2].number().isIntegerDivisible(den)) {b = false; break;}
} else if(CHILD(i)[i2].isMultiplication() && CHILD(i)[i2][0].isNumber()) {
if(!CHILD(i)[i2][0].number().isIntegerDivisible(den)) {b = false; break;}
} else {
b = false;
break;
}
}
if(b) {
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if(CHILD(i)[i2].isNumber()) {
CHILD(i)[i2].number().divide(den);
} else if(CHILD(i)[i2].isMultiplication()) {
CHILD(i)[i2][0].number().divide(den);
if(CHILD(i)[i2][0].isOne() && CHILD(i)[i2].size() > 1) {
CHILD(i)[i2].delChild(1);
if(CHILD(i)[i2].size() == 1) {
CHILD(i)[i2].setToChild(1, true);
}
}
}
}
CHILD(0).set(CHILD(0).number().numerator(), true);
if(SIZE > 1 && CHILD(0).isOne()) {
ERASE(0);
}
if(SIZE == 1) SET_CHILD_MAP(0);
break;
}
}
}
}
if(isMultiplication()) {
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).isPower() && CHILD(i)[1].isInteger()) {
if(CHILD(i)[0].isAddition()) {
bool b = true;
for(size_t i2 = 0; i2 < CHILD(i)[0].size(); i2++) {
if((!CHILD(i)[0][i2].isNumber() || !CHILD(i)[0][i2].number().isNegative()) && (!CHILD(i)[0][i2].isMultiplication() || CHILD(i)[0][i2].size() < 2 || !CHILD(i)[0][i2][0].isNumber() || !CHILD(i)[0][i2][0].number().isNegative())) {
b = false;
break;
}
}
if(b) {
for(size_t i2 = 0; i2 < CHILD(i)[0].size(); i2++) {
if(CHILD(i)[0][i2].isNumber()) {
CHILD(i)[0][i2].number().negate();
} else {
CHILD(i)[0][i2][0].number().negate();
if(CHILD(i)[0][i2][0].isOne() && CHILD(i)[0][i2].size() > 1) {
CHILD(i)[0][i2].delChild(1);
if(CHILD(i)[0][i2].size() == 1) {
CHILD(i)[0][i2].setToChild(1, true);
}
}
}
}
if(CHILD(i)[1].number().isOdd()) {
if(CHILD(0).isNumber()) CHILD(0).number().negate();
else {
PREPEND(MathStructure(-1, 1, 0));
i++;
}
}
}
} else if(CHILD(i)[0].isMultiplication() && CHILD(i)[0].size() >= 2 && CHILD(i)[0][0].isNumber() && CHILD(i)[0][0].number().isNegative()) {
CHILD(i)[0][0].number().negate();
if(CHILD(i)[0][0].isOne() && CHILD(i)[0].size() > 1) {
CHILD(i)[0].delChild(1);
if(CHILD(i)[0].size() == 1) {
CHILD(i)[0].setToChild(1, true);
}
}
if(CHILD(i)[1].number().isOdd()) {
if(CHILD(0).isNumber()) CHILD(0).number().negate();
else {
PREPEND(MathStructure(-1, 1, 0));
i++;
}
}
}
} else if(CHILD(i).isAddition()) {
bool b = true;
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if((!CHILD(i)[i2].isNumber() || !CHILD(i)[i2].number().isNegative()) && (!CHILD(i)[i2].isMultiplication() || CHILD(i)[i2].size() < 2 || !CHILD(i)[i2][0].isNumber() || !CHILD(i)[i2][0].number().isNegative())) {
b = false;
break;
}
}
if(b) {
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if(CHILD(i)[i2].isNumber()) {
CHILD(i)[i2].number().negate();
} else {
CHILD(i)[i2][0].number().negate();
if(CHILD(i)[i2][0].isOne() && CHILD(i)[i2].size() > 1) {
CHILD(i)[i2].delChild(1);
if(CHILD(i)[i2].size() == 1) {
CHILD(i)[i2].setToChild(1, true);
}
}
}
}
if(CHILD(0).isNumber()) CHILD(0).number().negate();
else {
PREPEND(MathStructure(-1, 1, 0));
i++;
}
}
}
}
if(SIZE > 1 && CHILD(0).isOne()) {
ERASE(0);
}
if(SIZE == 1) SET_CHILD_MAP(0);
}
if(isPower() && CHILD(1).isInteger()) {
if(CHILD(0).isAddition()) {
bool b = true;
for(size_t i2 = 0; i2 < CHILD(0).size(); i2++) {
if((!CHILD(0)[i2].isNumber() || !CHILD(0)[i2].number().isNegative()) && (!CHILD(0)[i2].isMultiplication() || CHILD(0)[i2].size() < 2 || !CHILD(0)[i2][0].isNumber() || !CHILD(0)[i2][0].number().isNegative())) {
b = false;
break;
}
}
if(b) {
for(size_t i2 = 0; i2 < CHILD(0).size(); i2++) {
if(CHILD(0)[i2].isNumber()) {
CHILD(0)[i2].number().negate();
} else {
CHILD(0)[i2][0].number().negate();
if(CHILD(0)[i2][0].isOne() && CHILD(0)[i2].size() > 1) {
CHILD(0)[i2].delChild(1);
if(CHILD(0)[i2].size() == 1) {
CHILD(0)[i2].setToChild(1, true);
}
}
}
}
if(CHILD(1).number().isOdd()) {
multiply(MathStructure(-1, 1, 0));
CHILD_TO_FRONT(1)
}
}
} else if(CHILD(0).isMultiplication() && CHILD(0).size() >= 2 && CHILD(0)[0].isNumber() && CHILD(0)[0].number().isNegative()) {
CHILD(0)[0].number().negate();
if(CHILD(0)[0].isOne() && CHILD(0).size() > 1) {
CHILD(0).delChild(1);
if(CHILD(0).size() == 1) {
CHILD(0).setToChild(1, true);
}
}
if(CHILD(1).number().isOdd()) {
multiply(MathStructure(-1, 1, 0));
CHILD_TO_FRONT(1)
}
}
}
}
evalSort(true);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
}
}
eo.protected_function = eo_pre.protected_function;
}
switch(type()) {
case STRUCT_ADDITION: {
if(CALCULATOR->aborted()) return false;
if(term_combination_levels >= -1 && !only_sqrfree && max_factor_degree != 0) {
if(SIZE <= 3 && SIZE > 1) {
MathStructure *xvar = NULL;
Number nr2(1, 1);
if(CHILD(0).isPower() && CHILD(0)[0].size() == 0 && CHILD(0)[1].isNumber() && CHILD(0)[1].number().isTwo()) {
xvar = &CHILD(0)[0];
} else if(CHILD(0).isMultiplication() && CHILD(0).size() == 2 && CHILD(0)[0].isNumber()) {
if(CHILD(0)[1].isPower()) {
if(CHILD(0)[1][0].size() == 0 && CHILD(0)[1][1].isNumber() && CHILD(0)[1][1].number().isTwo()) {
xvar = &CHILD(0)[1][0];
nr2.set(CHILD(0)[0].number());
}
}
}
if(xvar) {
bool factorable = false;
Number nr1, nr0;
if(SIZE == 2 && CHILD(1).isNumber()) {
factorable = true;
nr0 = CHILD(1).number();
} else if(SIZE == 3 && CHILD(2).isNumber()) {
nr0 = CHILD(2).number();
if(CHILD(1).isMultiplication()) {
if(CHILD(1).size() == 2 && CHILD(1)[0].isNumber() && xvar->equals(CHILD(1)[1])) {
nr1 = CHILD(1)[0].number();
factorable = true;
}
} else if(xvar->equals(CHILD(1))) {
nr1.set(1, 1, 0);
factorable = true;
}
}
if(factorable) {
Number nr4ac(4, 1, 0);
nr4ac *= nr2;
nr4ac *= nr0;
Number nr2a(2, 1, 0);
nr2a *= nr2;
Number sqrtb24ac(nr1);
sqrtb24ac.raise(nr_two);
sqrtb24ac -= nr4ac;
if(sqrtb24ac.isNegative()) factorable = false;
MathStructure mstructb24(sqrtb24ac);
if(factorable) {
if(!only_integers) {
if(eo.approximation == APPROXIMATION_EXACT && !sqrtb24ac.isApproximate()) {
sqrtb24ac.raise(nr_half);
if(sqrtb24ac.isApproximate()) {
mstructb24.raise(nr_half);
} else {
mstructb24.set(sqrtb24ac);
}
} else {
mstructb24.number().raise(nr_half);
}
} else {
mstructb24.number().raise(nr_half);
if((!sqrtb24ac.isApproximate() && mstructb24.number().isApproximate()) || (sqrtb24ac.isInteger() && !mstructb24.number().isInteger())) {
factorable = false;
}
}
}
if(factorable) {
MathStructure m1(nr1), m2(nr1);
Number mul1(1, 1), mul2(1, 1);
if(mstructb24.isNumber()) {
m1.number() += mstructb24.number();
m1.number() /= nr2a;
if(m1.number().isRational() && !m1.number().isInteger()) {
mul1 = m1.number().denominator();
m1.number() *= mul1;
}
m2.number() -= mstructb24.number();
m2.number() /= nr2a;
if(m2.number().isRational() && !m2.number().isInteger()) {
mul2 = m2.number().denominator();
m2.number() *= mul2;
}
} else {
m1.calculateAdd(mstructb24, eo);
m1.calculateDivide(nr2a, eo);
if(m1.isNumber()) {
if(m1.number().isRational() && !m1.number().isInteger()) {
mul1 = m1.number().denominator();
m1.number() *= mul1;
}
} else {
bool bint = false, bfrac = false;
idm1(m1, bfrac, bint);
if(bfrac) {
idm2(m1, bfrac, bint, mul1);
idm3(m1, mul1, true);
}
}
m2.calculateSubtract(mstructb24, eo);
m2.calculateDivide(nr2a, eo);
if(m2.isNumber()) {
if(m2.number().isRational() && !m2.number().isInteger()) {
mul2 = m2.number().denominator();
m2.number() *= mul2;
}
} else {
bool bint = false, bfrac = false;
idm1(m2, bfrac, bint);
if(bfrac) {
idm2(m2, bfrac, bint, mul2);
idm3(m2, mul2, true);
}
}
}
nr2 /= mul1;
nr2 /= mul2;
if(m1 == m2 && mul1 == mul2) {
MathStructure xvar2(*xvar);
if(!mul1.isOne()) xvar2 *= mul1;
set(m1);
add(xvar2, true);
raise(MathStructure(2, 1, 0));
if(!nr2.isOne()) {
multiply(nr2);
}
} else {
m1.add(*xvar, true);
if(!mul1.isOne()) m1[m1.size() - 1] *= mul1;
m2.add(*xvar, true);
if(!mul2.isOne()) m2[m2.size() - 1] *= mul2;
clear(true);
m_type = STRUCT_MULTIPLICATION;
if(!nr2.isOne()) {
APPEND_NEW(nr2);
}
APPEND(m1);
APPEND(m2);
}
EvaluationOptions eo2 = eo;
eo2.expand = false;
calculatesub(eo2, eo2, false);
evalSort(true);
return true;
}
}
}
}
MathStructure *factor_mstruct = new MathStructure(1, 1, 0);
MathStructure mnew;
if(factorize_find_multiplier(*this, mnew, *factor_mstruct) && !factor_mstruct->isZero() && !mnew.isZero()) {
mnew.factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
factor_mstruct->factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
clear(true);
m_type = STRUCT_MULTIPLICATION;
APPEND_REF(factor_mstruct);
APPEND(mnew);
EvaluationOptions eo2 = eo;
eo2.expand = false;
calculatesub(eo2, eo2, false);
factor_mstruct->unref();
evalSort(true);
return true;
}
factor_mstruct->unref();
if(SIZE > 1 && CHILD(SIZE - 1).isNumber() && CHILD(SIZE - 1).number().isInteger() && max_factor_degree != 0) {
MathStructure *xvar = NULL;
Number qnr(1, 1);
int degree = 1;
bool overflow = false;
int qcof = 1;
if(CHILD(0).isPower() && !CHILD(0)[0].isNumber() && CHILD(0)[0].size() == 0 && CHILD(0)[1].isNumber() && CHILD(0)[1].number().isInteger() && CHILD(0)[1].number().isPositive()) {
xvar = &CHILD(0)[0];
degree = CHILD(0)[1].number().intValue(&overflow);
} else if(CHILD(0).isMultiplication() && CHILD(0).size() == 2 && CHILD(0)[0].isNumber() && CHILD(0)[0].number().isInteger()) {
if(CHILD(0)[1].isPower()) {
if(CHILD(0)[1][0].size() == 0 && !CHILD(0)[1][0].isNumber() && CHILD(0)[1][1].isNumber() && CHILD(0)[1][1].number().isInteger() && CHILD(0)[1][1].number().isPositive()) {
xvar = &CHILD(0)[1][0];
qcof = CHILD(0)[0].number().intValue(&overflow);
if(!overflow) {
if(qcof < 0) qcof = -qcof;
degree = CHILD(0)[1][1].number().intValue(&overflow);
}
}
}
}
int pcof = 1;
if(!overflow) {
pcof = CHILD(SIZE - 1).number().intValue(&overflow);
if(pcof < 0) pcof = -pcof;
}
if(xvar && !overflow && degree <= 1000 && degree > 2 && qcof != 0 && pcof != 0) {
bool b = true, b2 = true;
for(size_t i = 1; b && i < SIZE - 1; i++) {
switch(CHILD(i).type()) {
case STRUCT_NUMBER: {
b = false;
break;
}
case STRUCT_POWER: {
if(!CHILD(i)[1].isNumber() || !xvar->equals(CHILD(i)[0]) || !CHILD(i)[1].number().isInteger() || !CHILD(i)[1].number().isPositive()) {
b = false;
}
break;
}
case STRUCT_MULTIPLICATION: {
if(!(CHILD(i).size() == 2) || !CHILD(i)[0].isNumber()) {
b = false;
} else if(CHILD(i)[1].isPower()) {
if(!CHILD(i)[1][1].isNumber() || !xvar->equals(CHILD(i)[1][0]) || !CHILD(i)[1][1].number().isInteger() || !CHILD(i)[1][1].number().isPositive()) {
b = false;
}
} else if(!xvar->equals(CHILD(i)[1])) {
b = false;
}
if(b && b2 && !CHILD(i)[0].isInteger()) b2 = false;
break;
}
default: {
if(!xvar->equals(CHILD(i))) {
b = false;
}
}
}
}
if(b) {
vector<Number> factors;
factors.resize(degree + 1, Number());
factors[0] = CHILD(SIZE - 1).number();
vector<int> ps;
vector<int> qs;
vector<Number> zeroes;
int curdeg = 1, prevdeg = 0;
for(size_t i = 0; b && i < SIZE - 1; i++) {
switch(CHILD(i).type()) {
case STRUCT_POWER: {
curdeg = CHILD(i)[1].number().intValue(&overflow);
if(curdeg == prevdeg || curdeg > degree || (prevdeg > 0 && curdeg > prevdeg) || overflow) {
b = false;
} else {
factors[curdeg].set(1, 1, 0);
}
break;
}
case STRUCT_MULTIPLICATION: {
if(CHILD(i)[1].isPower()) {
curdeg = CHILD(i)[1][1].number().intValue(&overflow);
} else {
curdeg = 1;
}
if(curdeg == prevdeg || curdeg > degree || (prevdeg > 0 && curdeg > prevdeg) || overflow) {
b = false;
} else {
factors[curdeg] = CHILD(i)[0].number();
}
break;
}
default: {
curdeg = 1;
factors[curdeg].set(1, 1, 0);
}
}
prevdeg = curdeg;
}
while(b && degree > 2) {
for(int i = 1; i <= 1000; i++) {
if(i > pcof) break;
if(pcof % i == 0) ps.push_back(i);
}
for(int i = 1; i <= 1000; i++) {
if(i > qcof) break;
if(qcof % i == 0) qs.push_back(i);
}
Number itest;
int i2;
size_t pi = 0, qi = 0;
if(ps.empty() || qs.empty()) break;
Number nrtest(ps[0], qs[0], 0);
while(true) {
itest.clear(); i2 = degree;
while(true) {
itest += factors[i2];
if(i2 == 0) break;
itest *= nrtest;
i2--;
}
if(itest.isZero()) {
break;
}
if(nrtest.isPositive()) {
nrtest.negate();
} else {
qi++;
if(qi == qs.size()) {
qi = 0;
pi++;
if(pi == ps.size()) {
break;
}
}
nrtest.set(ps[pi], qs[qi], 0);
}
}
if(itest.isZero()) {
itest.clear(); i2 = degree;
Number ntmp(factors[i2]);
for(; i2 > 0; i2--) {
itest += ntmp;
ntmp = factors[i2 - 1];
factors[i2 - 1] = itest;
itest *= nrtest;
}
degree--;
nrtest.negate();
zeroes.push_back(nrtest);
if(degree == 2) {
break;
}
qcof = factors[degree].intValue(&overflow);
if(!overflow) {
if(qcof < 0) qcof = -qcof;
pcof = factors[0].intValue(&overflow);
if(!overflow) {
if(pcof < 0) pcof = -pcof;
}
}
if(overflow || qcof == 0 || pcof == 0) {
break;
}
} else {
break;
}
ps.clear();
qs.clear();
}
if(zeroes.size() > 0) {
MathStructure mleft;
MathStructure mtmp;
MathStructure *mcur;
for(int i = degree; i >= 0; i--) {
if(!factors[i].isZero()) {
if(mleft.isZero()) {
mcur = &mleft;
} else {
mleft.add(m_zero, true);
mcur = &mleft[mleft.size() - 1];
}
if(i > 1) {
if(!factors[i].isOne()) {
mcur->multiply(*xvar);
(*mcur)[0].set(factors[i]);
mcur = &(*mcur)[1];
} else {
mcur->set(*xvar);
}
mtmp.set(i, 1, 0);
mcur->raise(mtmp);
} else if(i == 1) {
if(!factors[i].isOne()) {
mcur->multiply(*xvar);
(*mcur)[0].set(factors[i]);
} else {
mcur->set(*xvar);
}
} else {
mcur->set(factors[i]);
}
}
}
mleft.factorize(eo, false, 0, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
vector<long int> powers;
vector<size_t> powers_i;
int dupsfound = 0;
for(size_t i = 0; i < zeroes.size() - 1; i++) {
while(i + 1 < zeroes.size() && zeroes[i] == zeroes[i + 1]) {
dupsfound++;
zeroes.erase(zeroes.begin() + (i + 1));
}
if(dupsfound > 0) {
powers_i.push_back(i);
powers.push_back(dupsfound + 1);
dupsfound = 0;
}
}
MathStructure xvar2(*xvar);
Number *nrmul;
if(mleft.isMultiplication()) {
set(mleft);
evalSort();
if(CHILD(0).isNumber()) {
nrmul = &CHILD(0).number();
} else if(CHILD(0).isMultiplication() && CHILD(0).size() > 0 && CHILD(0)[0].isNumber()) {
nrmul = &CHILD(0)[0].number();
} else {
PREPEND(m_one);
nrmul = &CHILD(0).number();
}
} else {
clear(true);
m_type = STRUCT_MULTIPLICATION;
APPEND(m_one);
APPEND(mleft);
nrmul = &CHILD(0).number();
}
size_t pi = 0;
for(size_t i = 0; i < zeroes.size(); i++) {
if(zeroes[i].isInteger()) {
APPEND(xvar2);
} else {
APPEND(m_zero);
}
mcur = &CHILD(SIZE - 1);
if(pi < powers_i.size() && powers_i[pi] == i) {
mcur->raise(MathStructure(powers[pi], 1L, 0L));
mcur = &(*mcur)[0];
if(zeroes[i].isInteger()) {
mcur->add(zeroes[i]);
} else {
Number nr(zeroes[i].denominator());
mcur->add(zeroes[i].numerator());
(*mcur)[0] *= xvar2;
(*mcur)[0][0].number() = nr;
nr.raise(powers[pi]);
nrmul->divide(nr);
}
pi++;
} else {
if(zeroes[i].isInteger()) {
mcur->add(zeroes[i]);
} else {
nrmul->divide(zeroes[i].denominator());
mcur->add(zeroes[i].numerator());
(*mcur)[0] *= xvar2;
(*mcur)[0][0].number() = zeroes[i].denominator();
}
}
}
if(CHILD(0).isNumber() && CHILD(0).number().isOne()) {
ERASE(0);
} else if(CHILD(0).isMultiplication() && CHILD(0).size() > 0 && CHILD(0)[0].isNumber() && CHILD(0)[0].number().isOne()) {
if(CHILD(0).size() == 1) {
ERASE(0);
} else if(CHILD(0).size() == 2) {
CHILD(0).setToChild(2, true);
} else {
CHILD(0).delChild(1);
}
}
evalSort(true);
Number dupspow;
for(size_t i = 0; i < SIZE - 1; i++) {
mcur = NULL;
if(CHILD(i).isPower()) {
if(CHILD(i)[0].isAddition() && CHILD(i)[1].isNumber()) {
mcur = &CHILD(i)[0];
}
} else if(CHILD(i).isAddition()) {
mcur = &CHILD(i);
}
while(mcur && i + 1 < SIZE) {
if(CHILD(i + 1).isPower()) {
if(CHILD(i + 1)[0].isAddition() && CHILD(i + 1)[1].isNumber() && mcur->equals(CHILD(i + 1)[0])) {
dupspow += CHILD(i + 1)[1].number();
} else {
mcur = NULL;
}
} else if(CHILD(i + 1).isAddition() && mcur->equals(CHILD(i + 1))) {
dupspow++;
} else {
mcur = NULL;
}
if(mcur) {
ERASE(i + 1);
}
}
if(!dupspow.isZero()) {
if(CHILD(i).isPower()) {
CHILD(i)[1].number() += dupspow;
} else {
dupspow++;
CHILD(i) ^= dupspow;
}
dupspow.clear();
}
}
if(SIZE == 1) {
setToChild(1, true);
} else {
EvaluationOptions eo2 = eo;
eo2.expand = false;
calculatesub(eo2, eo2, false);
}
evalSort(true);
return true;
}
}
if(b && b2 && (max_factor_degree < 0 || max_factor_degree >= 2) && degree > 3 && degree < 50) {
// Kronecker method
vector<Number> vnum;
vnum.resize(degree + 1, nr_zero);
bool overflow = false;
for(size_t i = 0; b && i < SIZE; i++) {
switch(CHILD(i).type()) {
case STRUCT_POWER: {
if(CHILD(i)[0] == *xvar && CHILD(i)[1].isInteger()) {
int curdeg = CHILD(i)[1].number().intValue(&overflow);
if(curdeg < 0 || overflow || curdeg > degree) b = false;
else vnum[curdeg] += 1;
} else {
b = false;
}
break;
}
case STRUCT_MULTIPLICATION: {
if(CHILD(i).size() == 2 && CHILD(i)[0].isInteger()) {
long int icoeff = CHILD(i)[0].number().intValue(&overflow);
if(!overflow && CHILD(i)[1].isPower() && CHILD(i)[1][0] == *xvar && CHILD(i)[1][1].isInteger()) {
int curdeg = CHILD(i)[1][1].number().intValue(&overflow);
if(curdeg < 0 || overflow || curdeg > degree) b = false;
else vnum[curdeg] += icoeff;
} else if(!overflow && CHILD(i)[1] == *xvar) {
vnum[1] += icoeff;
} else {
b = false;
}
} else {
b = false;
}
break;
}
default: {
if(CHILD(i).isInteger()) {
long int icoeff = CHILD(i).number().intValue(&overflow);
if(overflow) b = false;
else vnum[0] += icoeff;
} else if(CHILD(i) == *xvar) {
vnum[1] += 1;
} else {
b = false;
}
break;
}
}
}
long int lcoeff = vnum[degree].lintValue();
vector<int> vs;
if(b && lcoeff != 0) {
degree /= 2;
if(max_factor_degree > 0 && degree > max_factor_degree) degree = max_factor_degree;
for(int i = 0; i <= degree; i++) {
if(CALCULATOR->aborted()) return false;
MathStructure mcalc(*this);
mcalc.calculateReplace(*xvar, Number((i / 2 + i % 2) * (i % 2 == 0 ? -1 : 1), 1), eo);
mcalc.calculatesub(eo, eo, false);
if(!mcalc.isInteger()) break;
bool overflow = false;
int v = ::abs(mcalc.number().intValue(&overflow));
if(overflow) {
if(i > 2) degree = i;
else b = false;
break;
}
vs.push_back(v);
}
}
if(b) {
vector<int> factors0, factorsl;
factors0.push_back(1);
for(int i = 2; i < vs[0] / 3 && i < 1000; i++) {
if(vs[0] % i == 0) factors0.push_back(i);
}
if(vs[0] % 3 == 0) factors0.push_back(vs[0] / 3);
if(vs[0] % 2 == 0) factors0.push_back(vs[0] / 2);
factors0.push_back(vs[0]);
for(int i = 2; i < lcoeff / 3 && i < 1000; i++) {
if(lcoeff % i == 0) factorsl.push_back(i);
}
factorsl.push_back(1);
if(lcoeff % 3 == 0) factorsl.push_back(lcoeff / 3);
if(lcoeff % 2 == 0) factorsl.push_back(lcoeff / 2);
factorsl.push_back(lcoeff);
long long int cmax = 500000LL / (factors0.size() * factorsl.size());
if(term_combination_levels != 0) cmax *= 10;
if(degree >= 2 && cmax > 10) {
vector<Number> vden;
vector<Number> vquo;
vden.resize(3, nr_zero);
long int c0;
for(size_t i = 0; i < factors0.size() * 2; i++) {
c0 = factors0[i / 2];
if(i % 2 == 1) c0 = -c0;
long int c2;
for(size_t i2 = 0; i2 < factorsl.size(); i2++) {
c2 = factorsl[i2];
long int c1max = vs[1] - c0 - c2, c1min;
if(c1max < 0) {c1min = c1max; c1max = -vs[1] - c0 - c2;}
else {c1min = -vs[1] - c0 - c2;}
if(-(vs[2] - c0 - c2) < -(-vs[2] - c0 - c2)) {
if(c1max > -(-vs[2] - c0 - c2)) c1max = -(-vs[2] - c0 - c2);
if(c1min < -(vs[2] - c0 - c2)) c1min = -(vs[2] - c0 - c2);
} else {
if(c1max > -(vs[2] - c0 - c2)) c1max = -(vs[2] - c0 - c2);
if(c1min < -(-vs[2] - c0 - c2)) c1min = -(-vs[2] - c0 - c2);
}
if(c1min < -cmax / 2) c1min = -cmax / 2;
for(long int c1 = c1min; c1 <= c1max && c1 <= cmax / 2; c1++) {
long int v1 = ::labs(c2 + c1 + c0);
long int v2 = ::labs(c2 - c1 + c0);
if(v1 != 0 && v2 != 0 && v1 <= vs[1] && v2 <= vs[2] && (c1 != 0 || c2 != 0) && vs[1] % v1 == 0 && vs[2] % v2 == 0) {
vden[0] = c0; vden[1] = c1; vden[2] = c2;
if(CALCULATOR->aborted()) return false;
if(polynomial_divide_integers(vnum, vden, vquo)) {
MathStructure mtest;
mtest.setType(STRUCT_ADDITION);
if(c2 != 0) {
MathStructure *mpow = new MathStructure();
mpow->setType(STRUCT_POWER);
mpow->addChild(*xvar);
mpow->addChild_nocopy(new MathStructure(2, 1, 0));
if(c2 == 1) {
mtest.addChild_nocopy(mpow);
} else {
MathStructure *mterm = new MathStructure();
mterm->setType(STRUCT_MULTIPLICATION);
mterm->addChild_nocopy(new MathStructure(c2, 1L, 0L));
mterm->addChild_nocopy(mpow);
mtest.addChild_nocopy(mterm);
}
}
if(c1 == 1) {
mtest.addChild(*xvar);
} else if(c1 != 0) {
MathStructure *mterm = new MathStructure();
mterm->setType(STRUCT_MULTIPLICATION);
mterm->addChild_nocopy(new MathStructure(c1, 1L, 0L));
mterm->addChild(*xvar);
mtest.addChild_nocopy(mterm);
}
mtest.addChild_nocopy(new MathStructure(c0, 1L, 0L));
MathStructure mthis(*this);
MathStructure mquo;
if(mtest.size() > 1 && polynomialDivide(mthis, mtest, mquo, eo, false)) {
mquo.factorize(eo, false, 0, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
set(mquo, true);
multiply(mtest, true);
return true;
}
}
}
}
}
}
}
for(int i_d = 3; i_d <= degree; i_d++) {
if(CALCULATOR->aborted()) return false;
long int t1max = ::pow(cmax / (i_d - 1), 1.0 / (i_d - 1));
if(t1max < 1) break;
if(t1max > 1000) t1max = 1000;
long int c2totalmax = t1max;
long int c2cur;
for(int i = 0; i < i_d - 3; i++) {
c2totalmax *= t1max;
}
vector<Number> vden;
vector<Number> vquo;
long int *vc = (long int*) malloc(sizeof(long int) * (i_d + 1));
vden.resize(i_d + 1, nr_zero);
for(size_t i = 0; i < factors0.size() * 2; i++) {
vc[0] = factors0[i / 2] * (i % 2 == 1 ? -1 : 1);
for(size_t i2 = 0; i2 < factorsl.size(); i2++) {
vc[i_d] = factorsl[i2];
for(long int c2p = 0; c2p <= c2totalmax; c2p++) {
c2cur = c2p;
for(int i = 2; i < i_d; i++) {
vc[i] = c2cur % t1max;
if(vc[i] % 2 == 1) vc[i] = -vc[i];
vc[i] = vc[i] / 2 + vc[i] % 2;
c2cur /= t1max;
}
long int c1max = t1max / 2 + t1max % 2, c1min = -t1max / 2 - t1max % 2;
for(size_t i = 1; i < vs.size(); i++) {
long int vsmax = vs[i] - vc[0];
long int vsmin = -vs[i] - vc[0];
int ix = (i / 2 + i % 2) * (i % 2 == 0 ? -1 : 1);
int ixi = ix;
for(int i2 = 2; i2 <= i_d; i2++) {
ixi *= ix;
vsmax -= vc[i2] * ixi;
}
vsmax /= ix;
vsmin /= ix;
if(vsmax < vsmin) {
if(c1max > vsmin) c1max = vsmin;
if(c1min < vsmax) c1min = vsmax;
} else {
if(c1max > vsmax) c1max = vsmax;
if(c1min < vsmin) c1min = vsmin;
}
}
for(long int c1 = c1min; c1 <= c1max; c1++) {
vc[1] = c1;
bool b = true;
for(size_t i = 1; i < vs.size(); i++) {
long int v = vc[0];
int ix = (i / 2 + i % 2) * (i % 2 == 0 ? -1 : 1);
int ixi = 1;
for(int i2 = 1; i2 <= i_d; i2++) {
ixi *= ix;
v += vc[i2] * ixi;
}
if(v < 0) v = -v;
if(v == 0 || v > vs[i] || vs[i] % v != 0) {
b = false;
break;
}
}
if(b) {
if(CALCULATOR->aborted()) return false;
for(size_t iden = 0; iden < vden.size(); iden++) {
vden[iden] = vc[iden];
}
if(polynomial_divide_integers(vnum, vden, vquo)) {
MathStructure mtest;
mtest.setType(STRUCT_ADDITION);
for(int i2 = i_d; i2 >= 2; i2--) {
if(vc[i2] != 0) {
MathStructure *mpow = new MathStructure();
mpow->setType(STRUCT_POWER);
mpow->addChild(*xvar);
mpow->addChild_nocopy(new MathStructure(i2, 1, 0));
if(vc[i2] == 1) {
mtest.addChild_nocopy(mpow);
} else {
MathStructure *mterm = new MathStructure();
mterm->setType(STRUCT_MULTIPLICATION);
mterm->addChild_nocopy(new MathStructure(vc[i2], 1L, 0L));
mterm->addChild_nocopy(mpow);
mtest.addChild_nocopy(mterm);
}
}
}
if(vc[1] == 1) {
mtest.addChild(*xvar);
} else if(vc[1] != 0) {
MathStructure *mterm = new MathStructure();
mterm->setType(STRUCT_MULTIPLICATION);
mterm->addChild_nocopy(new MathStructure(vc[1], 1L, 0L));
mterm->addChild(*xvar);
mtest.addChild_nocopy(mterm);
}
mtest.addChild_nocopy(new MathStructure(vc[0], 1L, 0L));
MathStructure mthis(*this);
MathStructure mquo;
if(mtest.size() > 1 && polynomialDivide(mthis, mtest, mquo, eo, false)) {
mquo.factorize(eo, false, 0, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
free(vc);
set(mquo, true);
multiply(mtest, true);
return true;
}
}
}
}
}
}
}
free(vc);
}
}
}
}
}
if(SIZE == 2 && max_factor_degree != 0) {
Number nr1(1, 1, 0), nr2(1, 1, 0);
bool b = true, b_nonnum = false;
bool b1_neg = false, b2_neg = false;
for(size_t i = 0; i < SIZE && b; i++) {
b = false;
if(CHILD(i).isInteger() && CHILD(i).number().integerLength() < 100) {
b = true;
if(i == 0) nr1 = CHILD(i).number();
else nr2 = CHILD(i).number();
} else if(CHILD(i).isMultiplication() && CHILD(i).size() > 1) {
b_nonnum = true;
b = true;
size_t i2 = 0;
if(CHILD(i)[0].isInteger() && CHILD(i).number().integerLength() < 100) {
if(i == 0) nr1 = CHILD(i)[0].number();
else nr2 = CHILD(i)[0].number();
i2++;
}
for(; i2 < CHILD(i).size(); i2++) {
if(!CHILD(i)[i2].isPower() || !CHILD(i)[i2][1].isInteger() || !CHILD(i)[i2][1].number().isPositive() || !CHILD(i)[i2][1].number().isEven() || CHILD(i)[1].number().integerLength() >= 100 || !CHILD(i)[i2][0].representsNonMatrix()) {
b = false;
break;
}
}
} else if(CHILD(i).isPower() && CHILD(i)[1].isNumber() && CHILD(i)[1].number().isInteger() && CHILD(i)[1].number().isPositive() && CHILD(i)[1].number().isEven() && CHILD(i)[1].number().integerLength() < 100 && CHILD(i)[0].representsNonMatrix()) {
b_nonnum = true;
b = true;
}
}
if(!b_nonnum) b = false;
if(b) {
b1_neg = nr1.isNegative();
b2_neg = nr2.isNegative();
if(b1_neg == b2_neg) b = false;
}
if(b) {
if(b1_neg) b = nr1.negate();
if(b && !nr1.isOne()) {
b = nr1.isPerfectSquare() && nr1.isqrt();
}
}
if(b) {
if(b2_neg) nr2.negate();
if(!nr2.isOne()) {
b = nr2.isPerfectSquare() && nr2.isqrt();
}
}
if(b) {
bool calc = false;
MathStructure *mmul = new MathStructure(*this);
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).isNumber()) {
if(i == 0) {
CHILD(i).number() = nr1;
if(b1_neg) nr1.negate();
(*mmul)[i].number() = nr1;
} else {
CHILD(i).number() = nr2;
if(b2_neg) nr2.negate();
(*mmul)[i].number() = nr2;
}
} else if(CHILD(i).isMultiplication() && CHILD(i).size() > 1) {
b = true;
size_t i2 = 0;
if(CHILD(i)[0].isNumber()) {
if(i == 0) {
CHILD(i)[0].number() = nr1;
if(b1_neg) nr1.negate();
(*mmul)[i][0].number() = nr1;
} else {
CHILD(i)[0].number() = nr2;
if(b2_neg) nr2.negate();
(*mmul)[i][0].number() = nr2;
}
i2++;
}
for(; i2 < CHILD(i).size(); i2++) {
if(CHILD(i)[i2][1].number().isTwo()) {
CHILD(i)[i2].setToChild(1, true);
(*mmul)[i][i2].setToChild(1, true);
} else {
CHILD(i)[i2][1].number().divide(2);
(*mmul)[i][i2][1].number().divide(2);
}
CHILD(i).childUpdated(i2 + 1);
(*mmul)[i].childUpdated(i2 + 1);
}
if(CHILD(i)[0].isOne()) CHILD(i).delChild(1, true);
if((*mmul)[i][0].isOne()) (*mmul)[i].delChild(1, true);
} else if(CHILD(i).isPower()) {
if(CHILD(i)[1].number().isTwo()) {
CHILD(i).setToChild(1, true);
(*mmul)[i].setToChild(1, true);
} else {
CHILD(i)[1].number().divide(2);
(*mmul)[i][1].number().divide(2);
}
}
if(CHILD(i).isAddition()) calc = true;
CHILD_UPDATED(i)
mmul->childUpdated(i + 1);
}
if(calc) {
calculatesub(eo, eo, false);
mmul->calculatesub(eo, eo, false);
}
if(recursive) {
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
mmul->factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
}
multiply_nocopy(mmul);
evalSort(true);
return true;
}
}
//x^3-y^3=(x-y)(x^2+xy+y^2)
if(max_factor_degree != 0 && SIZE == 2 && CHILD(0).isPower() && CHILD(0)[1].isNumber() && CHILD(0)[1].number() == 3 && CHILD(1).isMultiplication() && CHILD(1).size() == 2 && CHILD(1)[0].isMinusOne() && CHILD(1)[1].isPower() && CHILD(1)[1][1].isNumber() && CHILD(1)[1][1].number() == 3) {
if(CHILD(0)[0].representsNonMatrix() && CHILD(1)[1][0].representsNonMatrix()) {
MathStructure *m2 = new MathStructure(*this);
(*m2)[0].setToChild(1, true);
(*m2)[1][1].setToChild(1, true);
EvaluationOptions eo2 = eo;
eo2.expand = false;
m2->calculatesub(eo2, eo2, false);
CHILD(0)[1].set(2, 1, 0, true);
CHILD(1).setToChild(2, true);
CHILD(1)[1].set(2, 1, 0, true);
MathStructure *m3 = new MathStructure(CHILD(0)[0]);
m3->calculateMultiply(CHILD(1)[0], eo2);
add_nocopy(m3, true);
calculatesub(eo2, eo2, false);
multiply_nocopy(m2, true);
evalSort(true);
return true;
}
}
//-x^3+y^3=(-x+y)(x^2+xy+y^2)
if(max_factor_degree != 0 && SIZE == 2 && CHILD(1).isPower() && CHILD(1)[1].isNumber() && CHILD(1)[1].number() == 3 && CHILD(0).isMultiplication() && CHILD(0).size() == 2 && CHILD(0)[0].isMinusOne() && CHILD(0)[1].isPower() && CHILD(0)[1][1].isNumber() && CHILD(0)[1][1].number() == 3) {
if(CHILD(1)[0].representsNonMatrix() && CHILD(0)[1][0].representsNonMatrix()) {
MathStructure *m2 = new MathStructure(*this);
(*m2)[1].setToChild(1, true);
(*m2)[0][1].setToChild(1, true);
EvaluationOptions eo2 = eo;
eo2.expand = false;
m2->calculatesub(eo2, eo2, false);
CHILD(1)[1].set(2, 1, 0, true);
CHILD(0).setToChild(2, true);
CHILD(0)[1].set(2, 1, 0, true);
MathStructure *m3 = new MathStructure(CHILD(0)[0]);
m3->calculateMultiply(CHILD(1)[0], eo2);
add_nocopy(m3, true);
calculatesub(eo2, eo2, false);
multiply_nocopy(m2, true);
evalSort(true);
return true;
}
}
if(max_factor_degree != 0 && !only_integers && !force_factorization.isUndefined() && SIZE >= 2) {
MathStructure mexp, madd, mmul;
if(gather_factors(*this, force_factorization, madd, mmul, mexp) && !madd.isZero() && !mmul.isZero() && mexp.isInteger() && mexp.number().isGreaterThan(nr_two)) {
if(!mmul.isOne()) madd.calculateDivide(mmul, eo);
bool overflow = false;
int n = mexp.number().intValue(&overflow);
if(!overflow) {
if(n % 4 == 0) {
int i_u = 1;
if(n != 4) {
i_u = n / 4;
}
MathStructure m_sqrt2(2, 1, 0);
m_sqrt2.calculateRaise(nr_half, eo);
MathStructure m_sqrtb(madd);
m_sqrtb.calculateRaise(nr_half, eo);
MathStructure m_bfourth(madd);
m_bfourth.calculateRaise(Number(1, 4), eo);
m_sqrt2.calculateMultiply(m_bfourth, eo);
MathStructure m_x(force_factorization);
if(i_u != 1) m_x ^= i_u;
m_sqrt2.calculateMultiply(m_x, eo);
MathStructure *m2 = new MathStructure(force_factorization);
m2->raise(Number(i_u * 2, 1));
m2->add(m_sqrtb);
m2->calculateAdd(m_sqrt2, eo);
set(force_factorization, true);
raise(Number(i_u * 2, 1));
add(m_sqrtb);
calculateSubtract(m_sqrt2, eo);
multiply_nocopy(m2);
} else {
int i_u = 1;
if(n % 2 == 0) {
i_u = 2;
n /= 2;
}
MathStructure *m2 = new MathStructure(madd);
m2->calculateRaise(Number(n - 1, n), eo);
for(int i = 1; i < n - 1; i++) {
MathStructure *mterm = new MathStructure(madd);
mterm->calculateRaise(Number(n - i - 1, n), eo);
mterm->multiply(force_factorization);
if(i != 1 || i_u != 1) {
mterm->last().raise(Number(i * i_u, 1));
mterm->childUpdated(mterm->size());
}
if(i % 2 == 1) mterm->calculateMultiply(m_minus_one, eo);
m2->add_nocopy(mterm, true);
}
MathStructure *mterm = new MathStructure(force_factorization);
mterm->raise(Number((n - 1) * i_u, 1));
m2->add_nocopy(mterm, true);
mterm = new MathStructure(force_factorization);
if(i_u != 1) mterm->raise(Number(i_u, 1));
set(madd, true);
calculateRaise(Number(1, n), eo);
add_nocopy(mterm);
multiply_nocopy(m2);
}
if(!mmul.isOne()) multiply(mmul, true);
evalSort(true);
return true;
}
}
}
//-x-y = -(x+y)
bool b = true;
for(size_t i2 = 0; i2 < SIZE; i2++) {
if((!CHILD(i2).isNumber() || !CHILD(i2).number().isNegative()) && (!CHILD(i2).isMultiplication() || CHILD(i2).size() < 2 || !CHILD(i2)[0].isNumber() || !CHILD(i2)[0].number().isNegative())) {
b = false;
break;
}
}
if(b) {
for(size_t i2 = 0; i2 < SIZE; i2++) {
if(CHILD(i2).isNumber()) {
CHILD(i2).number().negate();
} else {
CHILD(i2)[0].number().negate();
if(CHILD(i2)[0].isOne() && CHILD(i2).size() > 1) {
CHILD(i2).delChild(1);
if(CHILD(i2).size() == 1) {
CHILD(i2).setToChild(1, true);
}
}
}
}
multiply(MathStructure(-1, 1, 0));
CHILD_TO_FRONT(1)
}
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).isMultiplication() && CHILD(i).size() > 1) {
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if(CHILD(i)[i2].isAddition()) {
for(size_t i3 = i + 1; i3 < SIZE; i3++) {
if(CHILD(i3).isMultiplication() && CHILD(i3).size() > 1) {
for(size_t i4 = 0; i4 < CHILD(i3).size(); i4++) {
if(CHILD(i3)[i4].isAddition() && CHILD(i3)[i4] == CHILD(i)[i2]) {
MathStructure *mfac = &CHILD(i)[i2];
mfac->ref();
CHILD(i).delChild(i2 + 1, true);
CHILD(i3).delChild(i4 + 1, true);
CHILD(i3).ref();
CHILD(i).add_nocopy(&CHILD(i3));
CHILD(i).calculateAddLast(eo);
CHILD(i).multiply_nocopy(mfac);
CHILD_UPDATED(i)
delChild(i3 + 1, true);
evalSort(true);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
}
}
}
if(SIZE > 2) {
MathStructure mtest(*this);
mtest.delChild(i + 1);
if(mtest == CHILD(i)[i2]) {
CHILD(i).delChild(i2 + 1, true);
SET_CHILD_MAP(i);
add(m_one, true);
multiply(mtest);
evalSort(true);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
}
}
}
}
}
}
//complete the square
if(max_factor_degree != 0 && (term_combination_levels != 0 || complete_square)) {
if(only_integers) {
if(SIZE <= 3 && SIZE > 1) {
MathStructure *xvar = NULL;
Number nr2(1, 1);
if(CHILD(0).isPower() && CHILD(0)[0].size() == 0 && CHILD(0)[1].isNumber() && CHILD(0)[1].number().isTwo()) {
xvar = &CHILD(0)[0];
} else if(CHILD(0).isMultiplication() && CHILD(0).size() == 2 && CHILD(0)[0].isNumber()) {
if(CHILD(0)[1].isPower()) {
if(CHILD(0)[1][0].size() == 0 && CHILD(0)[1][1].isNumber() && CHILD(0)[1][1].number().isTwo()) {
xvar = &CHILD(0)[1][0];
nr2.set(CHILD(0)[0].number());
}
}
}
if(xvar) {
bool factorable = false;
Number nr1, nr0;
if(SIZE == 2 && CHILD(1).isNumber()) {
factorable = true;
nr0 = CHILD(1).number();
} else if(SIZE == 3 && CHILD(2).isNumber()) {
nr0 = CHILD(2).number();
if(CHILD(1).isMultiplication()) {
if(CHILD(1).size() == 2 && CHILD(1)[0].isNumber() && xvar->equals(CHILD(1)[1])) {
nr1 = CHILD(1)[0].number();
factorable = true;
}
} else if(xvar->equals(CHILD(1))) {
nr1.set(1, 1, 0);
factorable = true;
}
}
if(factorable && !nr2.isZero() && !nr1.isZero()) {
Number nrh(nr1);
nrh /= 2;
nrh /= nr2;
if(nrh.isInteger()) {
Number nrk(nrh);
if(nrk.square()) {
nrk *= nr2;
nrk.negate();
nrk += nr0;
set(MathStructure(*xvar), true);
add(nrh);
raise(nr_two);
if(!nr2.isOne()) multiply(nr2);
if(!nrk.isZero()) add(nrk);
evalSort(true);
return true;
}
}
}
}
}
} else {
MathStructure m2, m1, m0;
const MathStructure *xvar = NULL;
if(!force_factorization.isUndefined()) {
xvar = &force_factorization;
} else {
if(CHILD(0).isPower() && CHILD(0)[0].size() == 0 && CHILD(0)[1].isNumber() && CHILD(0)[1].number().isTwo()) {
xvar = &CHILD(0)[0];
} else if(CHILD(0).isMultiplication()) {
for(size_t i2 = 0; i2 < CHILD(0).size(); i2++) {
if(CHILD(0).isPower() && CHILD(0)[i2][0].size() == 0 && CHILD(0)[i2][1].isNumber() && CHILD(0)[i2][1].number().isTwo()) {
xvar = &CHILD(0)[0];
}
}
}
}
if(xvar && gather_factors(*this, *xvar, m0, m1, m2, true) && !m1.isZero() && !m2.isZero()) {
MathStructure *mx = new MathStructure(*xvar);
set(m1, true);
calculateMultiply(nr_half, eo);
if(!m2.isOne()) calculateDivide(m2, eo);
add_nocopy(mx);
calculateAddLast(eo);
raise(nr_two);
if(!m2.isOne()) multiply(m2);
if(!m1.isOne()) m1.calculateRaise(nr_two, eo);
m1.calculateMultiply(Number(-1, 4), eo);
if(!m2.isOne()) {
m2.calculateInverse(eo);
m1.calculateMultiply(m2, eo);
}
m0.calculateAdd(m1, eo);
if(!m0.isZero()) add(m0);
if(recursive) {
CHILD(0).factorize(eo, false, 0, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
CHILD(1).factorize(eo, false, 0, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
CHILDREN_UPDATED
}
evalSort(true);
return true;
}
}
}
//Try factorize combinations of terms
if(SIZE > 2 && term_combination_levels > 0) {
bool b = false, b_ret = false;
// 5/y + x/y + z = (5 + x)/y + z
MathStructure mstruct_units(*this);
MathStructure mstruct_new(*this);
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(mstruct_units[i].isMultiplication()) {
for(size_t i2 = 0; i2 < mstruct_units[i].size();) {
if(!mstruct_units[i][i2].isPower() || !mstruct_units[i][i2][1].hasNegativeSign()) {
mstruct_units[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_units[i].size() == 0) mstruct_units[i].setUndefined();
else if(mstruct_units[i].size() == 1) mstruct_units[i].setToChild(1);
for(size_t i2 = 0; i2 < mstruct_new[i].size();) {
if(mstruct_new[i][i2].isPower() && mstruct_new[i][i2][1].hasNegativeSign()) {
mstruct_new[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_new[i].size() == 0) mstruct_new[i].set(1, 1, 0);
else if(mstruct_new[i].size() == 1) mstruct_new[i].setToChild(1);
} else if(mstruct_new[i].isPower() && mstruct_new[i][1].hasNegativeSign()) {
mstruct_new[i].set(1, 1, 0);
} else {
mstruct_units[i].setUndefined();
}
}
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(!mstruct_units[i].isUndefined()) {
for(size_t i2 = i + 1; i2 < mstruct_units.size();) {
if(mstruct_units[i2] == mstruct_units[i]) {
mstruct_new[i].add(mstruct_new[i2], true);
mstruct_new.delChild(i2 + 1);
mstruct_units.delChild(i2 + 1);
b = true;
} else {
i2++;
}
}
if(mstruct_new[i].isOne()) mstruct_new[i].set(mstruct_units[i]);
else mstruct_new[i].multiply(mstruct_units[i], true);
}
}
if(b) {
if(mstruct_new.size() == 1) {
set(mstruct_new[0], true);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
} else {
set(mstruct_new);
}
b = false;
b_ret = true;
}
// a*y + a*z + x = a(y + z) + x
vector<MathStructure> syms;
vector<size_t> counts;
collect_symbols(*this, syms);
size_t max_count = 0, max_i = 0;
Number min_pow;
for(size_t i = 0; i < syms.size(); i++) {
if(syms[i].containsUnknowns()) {
size_t count = 0;
Number min_pow_i;
for(size_t i2 = 0; i2 < SIZE; i2++) {
if(CHILD(i2).isMultiplication()) {
for(size_t i3 = 0; i3 < CHILD(i2).size(); i3++) {
if(CHILD(i2)[i3].isPower() && CHILD(i2)[i3][1].isNumber() && CHILD(i2)[i3][1].number().isRational() && CHILD(i2)[i3][1].number().isNegative() && CHILD(i2)[i3][0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[i3][1].number() > min_pow_i) min_pow_i = CHILD(i2)[i3][1].number();
count++;
break;
}
}
} else if(CHILD(i2).isPower() && CHILD(i2)[1].isNumber() && CHILD(i2)[1].number().isRational() && CHILD(i2)[1].number().isNegative() && CHILD(i2)[0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[1].number() > min_pow_i) min_pow_i = CHILD(i2)[1].number();
count++;
}
}
if(count > 1 && count > max_count) {
max_count = count;
min_pow = min_pow_i;
max_i = i;
}
}
}
if(!max_count) {
for(size_t i = 0; i < syms.size(); i++) {
if(syms[i].containsUnknowns()) {
size_t count = 0;
Number min_pow_i;
for(size_t i2 = 0; i2 < SIZE; i2++) {
if(CHILD(i2).isMultiplication()) {
for(size_t i3 = 0; i3 < CHILD(i2).size(); i3++) {
if(CHILD(i2)[i3].isPower() && CHILD(i2)[i3][1].isNumber() && CHILD(i2)[i3][1].number().isRational() && CHILD(i2)[i3][1].number().isPositive() && CHILD(i2)[i3][0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[i3][1].number() < min_pow_i) min_pow_i = CHILD(i2)[i3][1].number();
count++;
break;
} else if(CHILD(i2)[i3] == syms[i]) {
if(min_pow_i.isZero() || min_pow_i > 1) min_pow_i = 1;
count++;
break;
}
}
} else if(CHILD(i2).isPower() && CHILD(i2)[1].isNumber() && CHILD(i2)[1].number().isRational() && CHILD(i2)[1].number().isPositive() && CHILD(i2)[0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[1].number() < min_pow_i) min_pow_i = CHILD(i2)[1].number();
count++;
} else if(CHILD(i2) == syms[i]) {
if(min_pow_i.isZero() || min_pow_i > 1) min_pow_i = 1;
count++;
}
}
if(count > 1 && count > max_count) {
max_count = count;
min_pow = min_pow_i;
max_i = i;
}
}
}
}
if(max_count > 0) {
size_t i = max_i;
vector<MathStructure*> mleft;
for(size_t i2 = 0; i2 < SIZE;) {
b = false;
if(CHILD(i2).isMultiplication()) {
for(size_t i3 = 0; i3 < CHILD(i2).size(); i3++) {
if(CHILD(i2)[i3].isPower() && CHILD(i2)[i3][1].isNumber() && CHILD(i2)[i3][1].number().isRational() && (min_pow.isPositive() ? CHILD(i2)[i3][1].number().isPositive() : CHILD(i2)[i3][1].number().isNegative()) && CHILD(i2)[i3][0] == syms[i]) {
if(CHILD(i2)[i3][1] == min_pow) CHILD(i2).delChild(i3 + 1, true);
else if(CHILD(i2)[i3][1] == min_pow + 1) CHILD(i2)[i3].setToChild(1, true);
else {
CHILD(i2)[i3][1].number() -= min_pow;
factorize_fix_root_power(CHILD(i2)[i3]);
}
b = true;
break;
} else if(min_pow.isPositive() && CHILD(i2)[i3] == syms[i]) {
if(min_pow.isOne()) CHILD(i2).delChild(i3 + 1, true);
else {
CHILD(i2)[i3].raise((-min_pow) + 1);
factorize_fix_root_power(CHILD(i2)[i3]);
}
b = true;
break;
}
}
} else if(CHILD(i2).isPower() && CHILD(i2)[1].isNumber() && CHILD(i2)[1].number().isRational() && (min_pow.isPositive() ? CHILD(i2)[1].number().isPositive() : CHILD(i2)[1].number().isNegative()) && CHILD(i2)[0] == syms[i]) {
if(CHILD(i2)[1] == min_pow) CHILD(i2).set(1, 1, 0, true);
else if(CHILD(i2)[1] == min_pow + 1) CHILD(i2).setToChild(1, true);
else {
CHILD(i2)[1].number() -= min_pow;
factorize_fix_root_power(CHILD(i2));
}
b = true;
} else if(min_pow.isPositive() && CHILD(i2) == syms[i]) {
if(min_pow.isOne()) CHILD(i2).set(1, 1, 0, true);
else {
CHILD(i2).raise((-min_pow) + 1);
factorize_fix_root_power(CHILD(i2));
}
b = true;
}
if(b) {
i2++;
} else {
CHILD(i2).ref();
mleft.push_back(&CHILD(i2));
ERASE(i2)
}
}
multiply(syms[i]);
if(!min_pow.isOne()) LAST ^= min_pow;
for(size_t i2 = 0; i2 < mleft.size(); i2++) {
add_nocopy(mleft[i2], true);
}
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
if(LAST.isNumber()) {
MathStructure *mdel = &LAST;
mdel->ref();
delChild(SIZE, true);
b = factorize(eo, false, term_combination_levels - 1, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
add_nocopy(mdel, true);
if(term_combination_levels == 1) return b || b_ret;
if(b) b_ret = true;
}
for(size_t i = 0; !b && i < SIZE; i++) {
MathStructure *mdel = &CHILD(i);
mdel->ref();
delChild(i + 1, true);
b = true;
if(mdel->isMultiplication()) {
for(size_t i2 = 0; i2 < mdel->size(); i2++) {
if((*mdel)[i2].isPower() && (*mdel)[i2][0].containsUnknowns()) {
if(contains((*mdel)[i2][0], false, false, false) > 0) {b = false; break;}
} else if((*mdel)[i2].containsUnknowns()) {
if(contains((*mdel)[i2], false, false, false) > 0) {b = false; break;}
}
}
} else {
b = contains(*mdel, false, false, false) <= 0;
}
if(b) {
b = factorize(eo, false, term_combination_levels - 1, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
if(recursive) mdel->factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
add_nocopy(mdel, true);
if(term_combination_levels == 1) return b || b_ret;
if(b) b_ret = true;
break;
} else {
insertChild_nocopy(mdel, i + 1);
}
}
b = false;
// a*y + a*z + x = a(y + z) + x
syms.clear();
counts.clear();
collect_symbols(*this, syms);
max_count = 0; max_i = 0;
for(size_t i = 0; i < syms.size(); i++) {
size_t count = 0;
Number min_pow_i;
for(size_t i2 = 0; i2 < SIZE; i2++) {
if(CHILD(i2).isMultiplication()) {
for(size_t i3 = 0; i3 < CHILD(i2).size(); i3++) {
if(CHILD(i2)[i3].isPower() && CHILD(i2)[i3][1].isNumber() && CHILD(i2)[i3][1].number().isRational() && CHILD(i2)[i3][1].number().isNegative() && CHILD(i2)[i3][0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[i3][1].number() > min_pow_i) min_pow_i = CHILD(i2)[i3][1].number();
count++;
break;
}
}
} else if(CHILD(i2).isPower() && CHILD(i2)[1].isNumber() && CHILD(i2)[1].number().isRational() && CHILD(i2)[1].number().isNegative() && CHILD(i2)[0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[1].number() > min_pow_i) min_pow_i = CHILD(i2)[1].number();
count++;
}
}
if(count > 1 && count > max_count) {
max_count = count;
min_pow = min_pow_i;
max_i = i;
}
}
if(!max_count) {
for(size_t i = 0; i < syms.size(); i++) {
size_t count = 0;
Number min_pow_i;
for(size_t i2 = 0; i2 < SIZE; i2++) {
if(CHILD(i2).isMultiplication()) {
for(size_t i3 = 0; i3 < CHILD(i2).size(); i3++) {
if(CHILD(i2)[i3].isPower() && CHILD(i2)[i3][1].isNumber() && CHILD(i2)[i3][1].number().isRational() && CHILD(i2)[i3][1].number().isPositive() && CHILD(i2)[i3][0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[i3][1].number() < min_pow_i) min_pow_i = CHILD(i2)[i3][1].number();
count++;
break;
} else if(CHILD(i2)[i3] == syms[i]) {
if(min_pow_i.isZero() || min_pow_i > 1) min_pow_i = 1;
count++;
break;
}
}
} else if(CHILD(i2).isPower() && CHILD(i2)[1].isNumber() && CHILD(i2)[1].number().isRational() && CHILD(i2)[1].number().isPositive() && CHILD(i2)[0] == syms[i]) {
if(min_pow_i.isZero() || CHILD(i2)[1].number() < min_pow_i) min_pow_i = CHILD(i2)[1].number();
count++;
} else if(CHILD(i2) == syms[i]) {
if(min_pow_i.isZero() || min_pow_i > 1) min_pow_i = 1;
count++;
}
}
if(count > 1 && count > max_count) {
max_count = count;
min_pow = min_pow_i;
max_i = i;
}
}
}
if(max_count > 0) {
size_t i = max_i;
vector<MathStructure*> mleft;
for(size_t i2 = 0; i2 < SIZE;) {
b = false;
if(CHILD(i2).isMultiplication()) {
for(size_t i3 = 0; i3 < CHILD(i2).size(); i3++) {
if(CHILD(i2)[i3].isPower() && CHILD(i2)[i3][1].isNumber() && CHILD(i2)[i3][1].number().isRational() && (min_pow.isPositive() ? CHILD(i2)[i3][1].number().isPositive() : CHILD(i2)[i3][1].number().isNegative()) && CHILD(i2)[i3][0] == syms[i]) {
if(CHILD(i2)[i3][1] == min_pow) CHILD(i2).delChild(i3 + 1, true);
else if(CHILD(i2)[i3][1] == min_pow + 1) CHILD(i2)[i3].setToChild(1, true);
else {
CHILD(i2)[i3][1].number() -= min_pow;
factorize_fix_root_power(CHILD(i2)[i3]);
}
b = true;
break;
} else if(min_pow.isPositive() && CHILD(i2)[i3] == syms[i]) {
if(min_pow.isOne()) CHILD(i2).delChild(i3 + 1, true);
else {
CHILD(i2)[i3].raise((-min_pow) + 1);
factorize_fix_root_power(CHILD(i2)[i3]);
}
b = true;
break;
}
}
} else if(CHILD(i2).isPower() && CHILD(i2)[1].isNumber() && CHILD(i2)[1].number().isRational() && (min_pow.isPositive() ? CHILD(i2)[1].number().isPositive() : CHILD(i2)[1].number().isNegative()) && CHILD(i2)[0] == syms[i]) {
if(CHILD(i2)[1] == min_pow) CHILD(i2).set(1, 1, 0, true);
else if(CHILD(i2)[1] == min_pow + 1) CHILD(i2).setToChild(1, true);
else {
CHILD(i2)[1].number() -= min_pow;
factorize_fix_root_power(CHILD(i2));
}
b = true;
} else if(min_pow.isPositive() && CHILD(i2) == syms[i]) {
if(min_pow.isOne()) CHILD(i2).set(1, 1, 0, true);
else {
CHILD(i2).raise((-min_pow) + 1);
factorize_fix_root_power(CHILD(i2));
}
b = true;
}
if(b) {
i2++;
} else {
CHILD(i2).ref();
mleft.push_back(&CHILD(i2));
ERASE(i2)
}
}
multiply(syms[i]);
if(!min_pow.isOne()) LAST ^= min_pow;
for(size_t i2 = 0; i2 < mleft.size(); i2++) {
add_nocopy(mleft[i2], true);
}
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
if(isAddition()) {
b = false;
// y*f(x) + z*f(x) = (y+z)*f(x)
mstruct_units.set(*this);
mstruct_new.set(*this);
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(mstruct_units[i].isMultiplication()) {
for(size_t i2 = 0; i2 < mstruct_units[i].size();) {
if(!combination_factorize_is_complicated(mstruct_units[i][i2])) {
mstruct_units[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_units[i].size() == 0) mstruct_units[i].setUndefined();
else if(mstruct_units[i].size() == 1) mstruct_units[i].setToChild(1);
for(size_t i2 = 0; i2 < mstruct_new[i].size();) {
if(combination_factorize_is_complicated(mstruct_new[i][i2])) {
mstruct_new[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_new[i].size() == 0) mstruct_new[i].set(1, 1, 0);
else if(mstruct_new[i].size() == 1) mstruct_new[i].setToChild(1);
} else if(combination_factorize_is_complicated(mstruct_units[i])) {
mstruct_new[i].set(1, 1, 0);
} else {
mstruct_units[i].setUndefined();
}
}
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(!mstruct_units[i].isUndefined()) {
for(size_t i2 = i + 1; i2 < mstruct_units.size();) {
if(mstruct_units[i2] == mstruct_units[i]) {
mstruct_new[i].add(mstruct_new[i2], true);
mstruct_new.delChild(i2 + 1);
mstruct_units.delChild(i2 + 1);
b = true;
} else {
i2++;
}
}
if(mstruct_new[i].isOne()) mstruct_new[i].set(mstruct_units[i]);
else mstruct_new[i].multiply(mstruct_units[i], true);
}
}
if(b) {
if(mstruct_new.size() == 1) set(mstruct_new[0], true);
else set(mstruct_new);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
}
if(isAddition()) {
b = false;
mstruct_units.set(*this);
mstruct_new.set(*this);
// 5x + pi*x + 5y + xy = (5 + pi)x + 5y + xy
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(mstruct_units[i].isMultiplication()) {
for(size_t i2 = 0; i2 < mstruct_units[i].size();) {
if(!mstruct_units[i][i2].containsType(STRUCT_UNIT, true) && !mstruct_units[i][i2].containsUnknowns()) {
mstruct_units[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_units[i].size() == 0) mstruct_units[i].setUndefined();
else if(mstruct_units[i].size() == 1) mstruct_units[i].setToChild(1);
for(size_t i2 = 0; i2 < mstruct_new[i].size();) {
if(mstruct_new[i][i2].containsType(STRUCT_UNIT, true) || mstruct_new[i][i2].containsUnknowns()) {
mstruct_new[i].delChild(i2 + 1);
} else {
i2++;
}
}
if(mstruct_new[i].size() == 0) mstruct_new[i].set(1, 1, 0);
else if(mstruct_new[i].size() == 1) mstruct_new[i].setToChild(1);
} else if(mstruct_units[i].containsType(STRUCT_UNIT, true) || mstruct_units[i].containsUnknowns()) {
mstruct_new[i].set(1, 1, 0);
} else {
mstruct_units[i].setUndefined();
}
}
for(size_t i = 0; i < mstruct_units.size(); i++) {
if(!mstruct_units[i].isUndefined()) {
for(size_t i2 = i + 1; i2 < mstruct_units.size();) {
if(mstruct_units[i2] == mstruct_units[i]) {
mstruct_new[i].add(mstruct_new[i2], true);
mstruct_new.delChild(i2 + 1);
mstruct_units.delChild(i2 + 1);
b = true;
} else {
i2++;
}
}
if(mstruct_new[i].isOne()) mstruct_new[i].set(mstruct_units[i]);
else mstruct_new[i].multiply(mstruct_units[i], true);
}
}
if(b) {
if(mstruct_new.size() == 1) set(mstruct_new[0], true);
else set(mstruct_new);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
}
return b_ret;
} else if(term_combination_levels != 0 && SIZE > 2) {
int start_index = rand() % SIZE;
int index = start_index;
int best_index = -1;
int run_index = 0;
int max_run_index = SIZE - 3;
if(term_combination_levels < -1) {
run_index = -term_combination_levels - 2;
max_run_index = run_index;
} else if(term_combination_levels > 0 && term_combination_levels - 1 < max_run_index) {
max_run_index = term_combination_levels -1;
}
MathStructure mbest;
do {
if(CALCULATOR->aborted()) break;
if(endtime_p && endtime_p->tv_sec > 0) {
#ifndef CLOCK_MONOTONIC
struct timeval curtime;
gettimeofday(&curtime, NULL);
if(curtime.tv_sec > endtime_p->tv_sec || (curtime.tv_sec == endtime_p->tv_sec && curtime.tv_usec > endtime_p->tv_usec)) {
#else
struct timespec curtime;
clock_gettime(CLOCK_MONOTONIC, &curtime);
if(curtime.tv_sec > endtime_p->tv_sec || (curtime.tv_sec == endtime_p->tv_sec && curtime.tv_nsec / 1000 > endtime_p->tv_usec)) {
#endif
CALCULATOR->error(false, _("Because of time constraints only a limited number of combinations of terms were tried during factorization. Repeat factorization to try other random combinations."), NULL);
break;
}
}
MathStructure mtest(*this);
mtest.delChild(index + 1);
if(mtest.factorize(eo, false, run_index == 0 ? 0 : -1 - run_index, 0, only_integers, false, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree)) {
bool b = best_index < 0 || (mbest.isAddition() && !mtest.isAddition());
if(!b && (mtest.isAddition() == mbest.isAddition())) {
b = mtest.isAddition() && (mtest.size() < mbest.size());
if(!b && (!mtest.isAddition() || mtest.size() == mbest.size())) {
size_t c1 = mtest.countTotalChildren() + CHILD(index).countTotalChildren();
size_t c2 = mbest.countTotalChildren() + CHILD(best_index).countTotalChildren();
b = (c1 < c2);
if(c1 == c2) {
b = (count_powers(mtest) + count_powers(CHILD(index))) < (count_powers(mbest) + count_powers(CHILD(best_index)));
}
}
}
if(b) {
mbest = mtest;
best_index = index;
if(mbest.isPower()) {
break;
}
}
}
index++;
if(index == (int) SIZE) index = 0;
if(index == start_index) {
if(best_index >= 0) {
break;
}
run_index++;
if(run_index > max_run_index) break;
}
} while(true);
if(best_index >= 0) {
mbest.add(CHILD(best_index), true);
set(mbest);
if(term_combination_levels >= -1 && (run_index > 0 || recursive)) {
factorize(eo, false, term_combination_levels, 0, only_integers, true, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
}
return true;
}
}
}
default: {
if(term_combination_levels < -1) break;
bool b = false;
if(isComparison()) {
EvaluationOptions eo2 = eo;
eo2.assume_denominators_nonzero = false;
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).factorize(eo2, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree)) {
CHILD_UPDATED(i);
b = true;
}
}
} else if(recursive && (recursive > 1 || !isAddition())) {
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree)) {
CHILD_UPDATED(i);
b = true;
}
}
}
if(b) {
EvaluationOptions eo2 = eo;
eo2.expand = false;
calculatesub(eo2, eo2, false);
evalSort(true);
if(isAddition()) {
for(size_t i = 0; i < SIZE; i++) {
if(CHILD(i).isMultiplication() && CHILD(i).size() > 1) {
for(size_t i2 = 0; i2 < CHILD(i).size(); i2++) {
if(CHILD(i)[i2].isAddition()) {
for(size_t i3 = i + 1; i3 < SIZE; i3++) {
if(CHILD(i3).isMultiplication() && CHILD(i3).size() > 1) {
for(size_t i4 = 0; i4 < CHILD(i3).size(); i4++) {
if(CHILD(i3)[i4].isAddition() && CHILD(i3)[i4] == CHILD(i)[i2]) {
MathStructure *mfac = &CHILD(i)[i2];
mfac->ref();
CHILD(i).delChild(i2 + 1, true);
CHILD(i3).delChild(i4 + 1, true);
CHILD(i3).ref();
CHILD(i).add_nocopy(&CHILD(i3));
CHILD(i).calculateAddLast(eo);
CHILD(i).multiply_nocopy(mfac);
CHILD_UPDATED(i)
delChild(i3 + 1, true);
evalSort(true);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
}
}
}
if(SIZE > 2) {
MathStructure mtest(*this);
mtest.delChild(i + 1);
if(mtest == CHILD(i)[i2]) {
CHILD(i).delChild(i2 + 1, true);
SET_CHILD_MAP(i);
add(m_one, true);
multiply(mtest);
evalSort(true);
factorize(eo, false, term_combination_levels, 0, only_integers, recursive, endtime_p, force_factorization, complete_square, only_sqrfree, max_factor_degree);
return true;
}
}
}
}
}
}
}
return true;
}
}
}
return false;
}
``` |
NSB El 13 is a Norwegian electric locomotive which was used by Norwegian State Railways (NSB) for both passenger and freight trains.
The locomotive is a heavier and upgraded version of the NSB El 11 which was popular among its crew but unsuitable for journeys in heavy snow on lines such as the Bergen Line. Like the El 11, the El 13s were produced by Thune. The engines are very similar to the El 11, the main visual differences are that the El 13 is half a metre longer and has three, rather than four, windows at each end of the locomotive. The first of the 37 engines were built in 1957, the last in 1966. They were numbered 13 2121 to 13 2144 and 13 2151 to 13 2163.
The engines were withdrawn from service during the 1990s as several passenger trains were replaced with multiple units and the NSB El 18 took over the remaining locomotive hauled trains. As of 2005, There are still seven El 13s in service on the Ofoten Line. one of them El 13.2142 was donated from CargoNet to the Norwegian Railway Museum in 2003 and so far 2142 is the only El 13 in preservation so far.
Thune locomotives
El 13
Electric locomotives of Norway
Bo-Bo locomotives
Railway locomotives introduced in 1957
El 13
Standard gauge locomotives of Norway |
Admiral Cecil Minet Staveley, CB, CMG (3 April 1874 – 27 May 1934) was a Royal Navy officer who became Commander of the 1st Battle Squadron.
Naval career
Staveley was born the son of General Sir Charles Staveley, but did not follow his father and joined the Royal Navy. While serving as a lieutenant, he was in September 1902 posted to the Naval School of Telegraphy at HMS Victory, for a signals course, then the following month to the torpedo school at HMS Vernon for a short gunnery and torpedo course. He was re-assigned to the new armoured cruiser HMS Drake on 13 January 1903, as she took up her first commission in the Channel Fleet.
Staveley served in World War I becoming commanding officer of the cruiser HMS Endymion in January 1916 and Chief of Staff, The Nore in April 1918. He went on to be commanding officer of the battleship HMS Conqueror in November 1920, commanding officer of the battleship HMS Valiant in April 1921 and Chief Staff Officer for the Reserves in March 1923. He was made a CB in the 1924 Birthday Honours.
His last appointment was as commander of the 1st Battle Squadron in March 1926. He was promoted to vice-admiral on 25 May 1929 and put on the Retired list the following day. He was promoted to admiral on the Retired list in September 1933.
Staveley was elected a Fellow of the Royal Geographical Society (FRGS) in December 1902.
Family
In 1919 Staveley married Margaret Adela Sturdee, daughter of Admiral of the Fleet Sir Doveton Sturdee.
References
1874 births
1934 deaths
Companions of the Order of the Bath
Companions of the Order of St Michael and St George
Royal Navy admirals |
Princequillo (1940–1964) was a Thoroughbred racehorse conceived in France and born in Ireland. He is known for his performances in long-distance races and his successes as a sire.
Background
His sire, Prince Rose, stood at the Haras de Cheffreville stud farm in France and was mated to the mare Cosquilla. When World War II broke out, the pregnant mare was shipped to Ireland, where she gave birth to Princequillo. Considering the danger from German bombing and the likelihood there would be no racing for some considerable time, Cosquilla's owners shipped her and her colt to the United States.
Racing career
In July 1942, Princequillo made his American racing debut. After a few races, he was purchased by Boone Hall Stable, owned by Prince Dimitri Djordjadze of Georgia and his American-born wife, Audrey Emery. They placed him under the care of future Hall of Fame trainer Horatio Luro. Princequillo won several important races at longer distances. He broke the Saratoga Race Course record for 1¾ miles and his performances were such that he is considered to be the best long-distance runner, with the exception of Kelso, in American racing history.
Stud career
Retired after his four-year-old racing season, Princequillo was purchased by Arthur B. Hancock and sent to the Hancock family's Ellerslie Stud in Albemarle County, Virginia and later to their Claiborne Farm near Paris, Kentucky. At stud, he sired 64 stakes winners and became one of the most important large-heart-producer stallions.
Princequillo was the Leading sire in North America for 1957 and 1958 and Leading broodmare sire from 1966 through 1970 and again in 1972 and 1973. Among his daughters' progeny are Mill Reef, Fort Marcy, High Echelon, Triple Crown winner Secretariat, and Secretariat's chief rival Sham. His son Prince John was Leading broodmare sire in 1979, 1980, 1982 and 1986. Princequillo's descendants include, Secretariat, Triple Crown Winner in 1973, Triple Crown winner Seattle Slew and U.S. Horse of the Year winners A.P. Indy and Cigar, the second greatest money winner of all time. Zenyatta, John Henry, California Chrome and American Pharoah are also in his line of progeny. He garnered the nickname Mr. Fixit at stud thanks to his ability to sire foals with good conformation and soundness.
Princequillo died of a heart attack in 1964 and is buried at Claiborne Farm.
Pedigree
References
A history of Princequillo by Ellen Parker
Stonerside Stable profile of Princequillo
External links
Pedigree for Princequillo
Pedigree for Prince John and stats
Pedigree for Secretariat and stats
Pedigree and racing stats for Seattle Slew
Pedigree and racing stats for A.P. Indy
Pedigree and racing stats for Cigar
Pedigree and racing stats for Prince John
1940 racehorse births
1964 racehorse deaths
Racehorses bred in Ireland
Racehorses trained in the United States
Horse racing track record setters
United States Champion Thoroughbred Sires
British Champion Thoroughbred broodmare sires
Thoroughbred family 1-b
Chefs-de-Race |
Sascha Kindred (born 13 December 1977 in Münster, Germany) is a British swimmer who has competed in six Summer Paralympic Games, winning thirteen medals.
Early life
Born in Germany, Kindred moved to Britain at the age of 3. He began swimming for a club at the age of 11. He attended Mossley Hollins High School and Kaskenmoor secondary school for a short period of time before going into training at local swimming clubs such as Oldham.
Kindred has cerebral palsy, which affects the right side of his body. He competes in the S6 (butterfly), SM6 (medley) and SB7 (breaststroke) classifications.
Paralympic career
Sascha is one of the most successful Paralympic athletes ever, taking part in 6 Paralympic Games.
Kindred first competed at the Paralympic Games in Atlanta 1996 and won a silver medal in the 100 m breaststroke SB7.
In May 2016 it has been announced that he will be representing Great Britain once more, and for the 6th time, in the Paralympic Games in Rio later in the year.
At the 2000 games in Sydney, Kindred won two gold medals, a silver, and a bronze. He described the games as his biggest sporting achievement so far.
In the 2004 Athens Paralympics, Kindred won two gold medals, successfully defending the 100 m breaststroke SB7 and 200 m individual medley SM6 titles he had won in Sydney. He also won a bronze medal in the 4×50 m freestyle 20 pts.
Kindred won his fifth Paralympic gold in the 200 m individual medley SM6 at the 2008 Games in Beijing, where he set a new world record time of 2:49.19 and earned the title for the third consecutive year. He then won a second gold of the games, six titles overall, and set another world record of 1:22.18 in the 100 m breaststroke SB7. The third medal he won was a bronze in the 50 m butterfly S6.
He went on to his fifth Paralympic Games in London where he won a silver medal in the 200m IM in a time of 2:41.50
In addition to his success in the Paralympics, Kindred has won 19 medals (9 gold) at IPC World Championships, 24 medals (9 gold) at European Championships, and a gold medal at the 2006 Paralympic World Cup in Manchester.
Personal life
Kindred's wife is fellow British Paralympic gold medal-winning swimmer Nyree Lewis. Together the pair, who live in Herefordshire, are known as the "golden couple" of British disability swimming.
He includes amongst his sporting heroes Eric Cantona, Michael Johnson and Carl Lewis, and is a supporter of Manchester United.
Kindred was appointed Officer of the Order of the British Empire (OBE) in the 2009 New Year Honours and Commander of the Order of the British Empire (CBE) in the 2017 New Year Honours for services to swimming.
See also
Great Britain at the 2008 Summer Paralympics
List of Paralympic records in swimming
Swimming at the 2008 Summer Paralympics
Swimming at the 2004 Summer Paralympics
Swimming at the 2000 Summer Paralympics
Swimming at the 1996 Summer Paralympics
References
External links
1977 births
Living people
British male swimmers
Paralympic swimmers for Great Britain
Paralympic gold medalists for Great Britain
Paralympic silver medalists for Great Britain
Paralympic bronze medalists for Great Britain
Swimmers at the 1996 Summer Paralympics
Swimmers at the 2000 Summer Paralympics
Swimmers at the 2004 Summer Paralympics
Swimmers at the 2008 Summer Paralympics
Swimmers at the 2012 Summer Paralympics
Swimmers at the 2016 Summer Paralympics
Medalists at the 1996 Summer Paralympics
Medalists at the 2000 Summer Paralympics
Medalists at the 2004 Summer Paralympics
Medalists at the 2008 Summer Paralympics
Medalists at the 2012 Summer Paralympics
Commanders of the Order of the British Empire
World record holders in paralympic swimming
S6-classified para swimmers
Medalists at the 2016 Summer Paralympics
Team Bath swimmers
Team Bath Paralympic athletes
Medalists at the World Para Swimming Championships
Medalists at the World Para Swimming European Championships
Paralympic medalists in swimming
British disabled sportspeople
Sportspeople with cerebral palsy |
is a manga series based on Fujiko F. Fujio's Doraemon. As the name suggests, Doraemon Long Stories features whole volumes of longer and continuous narratives about Doraemon, Nobita and friends on their adventures into various lands of science fiction and fantasy, unlike the regular Doraemon series which is merely compilations ("volumes") of various self-contained shorts.
The series was published in CoroCoro Comic magazine. The first 16 volumes were originally illustrated by Fujiko F. Fujio himself. After his death in 1996, the remaining volumes were written and illustrated by Shintaro Mugiwara and Yasunori Okada. The last eight volumes have the company's name on their covers instead of his name.
The series was adapted to a line of Doraemon films and various remakes, released in Japan cinemas between 1980 and 2004, and back into a separate manga series with screenshots taken from the films. The first 17 were released digitally on Amazon Kindle in color, translated in English for the North American market, on December 27, 2017.
History
North American Amazon Kindle Color Releases (English)
References
External links
ドラえもんチャンネル
Shogakukan manga
CoroCoro Comic |
Menegazzia eperforata is a species of foliose lichen found in New Zealand and Australia.
See also
List of Menegazzia species
References
eperforata
Lichen species
Lichens described in 1983
Lichens of Australia
Lichens of New Zealand
Taxa named by David Galloway (botanist)
Taxa named by Peter Wilfred James |
```html
{% extends "!layout.html" -%}
{# Refer to path_to_url #}
{%- block document %}
{#
Adds a warning message on the 'latest' version.
The warning is only added on readthedocs, if the version is 'latest'.
For the 'dev' folder, no warning is shown since the 'latest' version is
usually the most up-to-date.
#}
{% if READTHEDOCS and polybar_is_latest and not pagename.startswith('dev/') %}
<div class="admonition important">
<p class="admonition-title">Development Version</p>
<p>
This is the <code class="docutils literal notranslate"><span class="pre">latest</span></code>
(unstable) version of this documentation, which may document features
not available in or compatible with released stable versions of polybar.
</p>
<p>
See the <a href="path_to_url{{ pagename }}.html">stable version</a> of this documentation page instead.
</p>
</div>
{% endif %}
{{ super() }}
{%- endblock %}
``` |
Admiral (ret.) Slamet Soebijanto (born 4 June 1951 in Mojokerto, Indonesia) was the Chief of Naval Staff of the Republic of Indonesia from 18 February 2005 to 7 November 2007. He has received the Bintang Dharma medal given to military officers for service and devotion.
References
1951 births
Living people
People from Mojokerto |
Muhammad Faizat bin Mohamad Ghazli (born 28 November 1994) is a Malaysian professional footballer who plays as a forward for Malaysia Super League side Penang and the Malaysia national team.
Faizat is the younger brother of fellow footballer Failee Ghazli.
Club career
Harimau Muda
Faizat started his football career with Harimau Muda B in 2013 until 2015. On 25 November 2015, it was confirmed that the Harimau Muda programme has disbanded by Football Association of Malaysia which means all the player from Harimau Muda A, Harimau Muda B and Harimau Muda C will be returned to their own state.
PKNS FC
On December 2017, Faizat signed a contract with Malaysia Super League club PKNS FC after two seasons at Penang.
Kedah FA
On 16 March 2020, Faizat signed a contract with Malaysia Super League club Kedah FA.
International career
Faizat has featured in 2015 Southeast Asian Games represented Malaysia U23. He has made 4 appearances during the tournament.
Career statistics
Club
1 Includes AFC Cup and AFC Champions League.
References
External links
1994 births
Living people
Malaysian people of Malay descent
Malaysian men's footballers
Penang F.C. players
Selangor F.C. II players
Kedah Darul Aman F.C. players
Footballers from Penang
Men's association football forwards |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.