Philipp IV of Hanau-Lichtenberg (20 September 1514, in Babenhausen – 19 February 1590, in Lichtenberg) was from 1538 to 1590 the reigning Count of Hanau-Lichtenberg. Before his accession he had already conducted government business on behalf of his father, Count Philipp III. He was very interested in alchemy.

Government

Reformation
Unlike his father, Philipp IV stood behind the Reformation. During his reign, the Lutheran faith took hold in the county. He appointed the clergy himself. After a long vacancy, he appointed a pastor in Bouxwiller () who was committed to the new doctrine. He worked with theologicians Erasmus Sarcerius and Philipp Neunheller, the reformer of the County of Hanau-Münzenberg. The new faith was widely introduced in 1544 and on 28 May 1548, Philipp convened a synod at Bouxwiller with all the pastors of the county of Hanau-Lichtenberg, in order to commit them to the new doctrine. This apparently happened very hesitantly, and the process of changing the clergy to adherents of the Lutheran faith continued well into the 1560s.

Philipp participated in the Diet of Augsburg in 1555, where the Peace of Augsburg was agreed, as well as the Diet in Augsburg in 1556, and the Diet of Speyer in 1570. The Catholic equipment that the, now Lutheran, churches no longer needed, was sold off from 1558 onwards. Philipp exchanged the possessions of the secularized Patershausen Abbey for Brumath, which had been held by the Archbishopric of Mainz. In 1573, a church order was adopted in Hanau-Lichtenberg. In 1580, he was among the signatories of the Book of Concord.

Guardianships in Hanau-Münzenberg
Count Philipp Ludwig I was still a minor when he inherited Hanau-Münzenberg in 1561. Philipp IV took up the guardianship, together with Count John VI of Nassau-Dillenburg. When Philipp Ludwig I died in 1580, they again acted as guardian for his minor sons Philipp Ludwig II and Albrecht of Hanau-Münzenberg. This time, there was a third guardian: Count Ludwig I of Sayn-Wittgenstein. Because Albrecht was only born in the year before his father's death and the fact that there were substantial religious disputes between the guardians, the guardianship could only be terminated in 1608. Philipp IV, however, could be replaced by his son Philipp V in this guardianship council in 1585.

Philipp Ludwig I's widow, Countess Magdalene of Waldeck-Wildungen, married in 1581 with John VII "the Middle" of Nassau-Siegen, a son of John VI. Consequently, the wards, Philipp Ludwig II and Albrecht, grew up at the court in Nassau-Dillenburg, a center of Calvinism and closely connected with the, also Calvinist, in the Electorate of the Palatinate court. The Lutheran Philipp IV opposed this Calvinist influence, as did his son Philipp V after he took over. This opposition, however, was in vain. Philipp V also tried to have the Lutheran Count Palatine Richard of Simmern-Sponheim appointed as an extra guardian. This attempt failed, despite a ruling in his favour by the Reichskammergericht. The Calvinist majority of the guardians prevented the population of Hanau-Münzenberg from paying homage to Richard. The majority then had the Electoral Administrator Count Palatine Johann Casimir of Simmern appointed as "upper guardian" — a purely honorary position — thereby strengthening the Calvinist majority among the guardians.

Territorial policies
The Archbishopric of Mainz objected to the reformation policy of Hanau-Lichtenberg and saw to it that Catholicism prevailed in the condominiums of Ober-Roden and Rodgau. Philipp IV managed to largely keep his county out of the armed conflicts of the second half of the 16th Century, that were often started under the pretext of religious differences.

Hanau-Lichtenberg owned half of the Lordship of Lichtenberg. In 1570, Count Jakob of Zweibrücken-Bitsch, who owned the other half, died without a male heir and Philipp IV manage to acquire his half as well. He had Lichtenberg Castle renovated and modernized by the military architect Daniel Specklin.

Philipp IV tried to conclude an inheritance treaty between the two lines of Counts of Hanau, Hanau-Münzenberg and Hanau-Lichtenberg, to the effect that, should one of the lines die out, the other line would inherit. Such a treaty was eventually signed after his death, in 1610, so when the Hanau-Münzenberg line died out in 1642, Hanau-Lichtenberg inherited.

In 1565, Philipp IV was appointed councillor to Emperor Maximilian II. Later, he became councillor to Maximilian II's successor Rudolf II.

Move to Alsace
He was the first Count of Hanau-Lichtenberg who saw the Alsatian possessions as the most important part of the county, rather than Babenhausen and he moved his residence there. Nevertheless, in 1578 he added a south wing to Babenhausen Castle. He also purchased Falkentein Castle and built the Château du Falkenstein on the castle grounds. The village of Philippsbourg developed around the château.

Old age and death
From 1585, the gradually transferred the business of government to his son, Philipp V.

Philipp IV died on 19 February 1590 in Lichtenberg. Philipp IV was the longest-lived member of the House of Hanau and also the count from Hanau, who has ruled the longest. A funeral sermon was published. He was buried in the crypt he had created in the Castle Church in Lichtenberg.

Marriage and issue
Philipp IV married on 22 August 1538 in Heiligenberg with Eleonore of Fürstenberg (born: 11 October 1523; died: 23 June 1544). They had the following children:
 Amalie (born: 23 February 1540  in Bouxwiller; died: 1 May 1540).
 Philipp V (born: 21 February 1541 in Bouxwiller; died: 2 June 1599).
 Anna Sibylle (born: 16 May 1542; died: 24 March 1612).
 Johanna (born: 23 May 1543 in Bouxwiller; died: 5 December 1599 in Babenhausen, buried there).
 Eleonore (born: 26 April 1544, Bouxwiller; died: 6 January 1585, buried in Ingelfingen), married to Albrecht of Hohenlohe-Weikersheim-Langenburg (born: 28 May 1543; died: 16 November 1575). This marriage was childless.

Philipp IV made his son Philipp V marry, contrary to his otherwise Lutheran policy, with the distantly related Roman Catholic Ludowika Margaretha of Zweibrücken-Bitsch, daughter of Jakob, the last Count of Zweibrücken-Bitsch. He thought her inheritance was more important than her religion.

Ancestors

References
 Adrian Willem Eliza Dek: De Afstammelingen van Juliana van Stolberg tot aan het jaar van de vrede van Munster, Zaltbommel, 1968
 Reinhard Dietrich: Die Landesverfassung in dem Hanauischen = Hanauer Geschichtsblätter, vol. 34, Hanau, 1996,
 M. Goltzené: Aus der Geschichte des Amtes Buchsweiler, in: "Pay d'Alsace", vol. 111/112, p. 64 f
 Franz Domenicus Häberlein: Neueste Teutsche Reichsgeschichte vom Anfange des Schmalkaldischen Krieges bis auf unsere Zeiten, vols. 8 and 9, Halle, 1779, 1780
 Heinrich Hermelink: Die Matrikeln der Universität Tübingen, vol. 1, Stuttgart, 1906
 J. G. Lehmann: Urkundliche Geschichte der Grafschaft Hanau-Lichtenberg im unteren Elsasse, 2 vols, 1862 (?), reprinted: Pirmasens, 1970.
 Wilhelm Morhardt: Hanau alt's - in Ehren b'halt's - Die Grafen von Hanau-Lichtenberg in Geschichte und Geschichten = "Babenhausen einst und jetzt", vol. 10, Babenhausen, 1984
 Reinhard Suchier: Genealogie des Hanauer Grafenhauses, in: Festschrift des Hanauer Geschichtsvereins zu seiner fünfzigjährigen Jubelfeier am 27. August 1894, Hanau, 1894
 Ernst J. Zimmermann: Hanau Stadt und Land, 3rd ed., Hanau, 1919, reprinted 1978

Footnotes

People from Darmstadt-Dieburg
Counts of Hanau-Lichtenberg
1514 births
1590 deaths
16th-century German people

Philipp IV, Count of Hanau-Lichtenberg


David B. Rutledge (born 1952) is the Kiyo and Eiko Tomiyasu Professor (em.) of Engineering and former chair of the Division of Engineering and Applied Science at the California Institute of Technology (Caltech), United States. His earlier work on microwave circuits has been important for various advances in wireless communications and has been useful for applications such as radar, remote sensing, and satellite broadcasting. He also covers research in estimating fossil-fuel supplies, and the implications for alternative energy sources and climate change.

Education
Rutledge earned his bachelor's degree at Williams College, his Master of Arts degree from the University of Cambridge, and his doctorate from University of California, Berkeley.

Career
He joined the Caltech faculty as an assistant professor in 1980, and rose through the faculty ranks to become the holder of the Tomiyasu chair in 2001. He served as executive officer for electrical engineering from 1999 to 2002 and chair of the Division of Engineering and Applied Science from 2005 to 2008. Rutledge was editor-in-chief of the journal IEEE Transactions on Microwave Theory and Techniques. He was also a member of Caltech's Lee Center for Advanced Networking, which aimed to create a global communication system that is as reliable and robust as a basic utility. Since 2018 he is an professor emeritus.

Published works
Rutledge is the author of  Energy: Supply and Demand, a book published by Cambridge University Press, December 2019. Focusing on trends in energy supply and demand, this text provides students with a comprehensive account of the subject and an understanding of how to use data analysis and modeling to make future projections and study climate impacts. Developments in technology and policy are discussed in depth, including the role of coal, the fracking revolutions for oil and gas, the electricity grid, wind and solar power, battery storage, and biofuels. Trends in demand are also detailed, with analysis of industrial demands such as LEDs, air conditioning, heat pumps, and information technology, and the transportation demands of railroads, ships, and cars (including electric vehicles). The environmental impacts of the energy industry are considered throughout, and a full chapter is dedicated to climate change. Real-life case studies and examples add context.

Rutledge is also the author of The Electronics of Radio, a book published by Cambridge University Press, as well as author or co-author of numerous other publications. This book provides an introduction to analog electronics by analyzing the design and construction of a radio transceiver. Essential theoretical background is provided at each step, along with carefully designed laboratory and homework exercises. The goal of this approach is to ensure a good grasp of basic electronics as well as an excellent foundation in wireless communications systems. The book begins with a thorough description of basic electronic components and simple circuits. Next, the key elements of radio electronics, including filters, amplifiers, oscillators, mixers, and antennas are described. In the laboratory exercises, the reader is led through the design, construction, and testing of a popular radio transceiver (the NorCal 40A), thereby illustrating and reinforcing the theoretical material. This book, the first to deal with elementary electronics in the context of radio, is often used as a textbook for introductory analog electronics courses, or for more advanced undergraduate classes on radio frequency electronics. It may also be of interest to electronics hobbyists and radio enthusiasts.

Honors and activities
 Institute of Electrical and Electronics Engineers Millennium Medal
 Doug DeMaw Award of the American Radio Relay League
 National Science Foundation Presidential Investigator Award
 Japan Society for the Promotion of Science Fellowship
 Distinguished Lecturer, IEEE Antennas & Propagation Society
 Microwave Prize, IEEE Microwave Theory and Techniques Society
 Distinguished Educator Award, IEEE Microwave Theory and Techniques Society
 Fellow, Institute of Electrical and Electronics Engineers
 Teaching Award, Associated Students of Caltech
 Co-founder of the Wavestream Corporation, a company that produces solid-state microwave and millimeter-wave transmitters
 Six of Professor Rutledge's students have won Presidential Investigator and Career Awards
 Author of the electronics textbook, The Electronics of Radio
 Co-author of the microwave computer-aided design software package, Puff , which has distributed over 30,000 copies.

References

External links
David B. Rutledge at the Caltech Division of Engineering and Applied Science
List of research papers

Living people
1952 births
21st-century American engineers
California Institute of Technology faculty

David Rutledge (engineer)


Superfantagenio (also known as Aladdin) is a 1986 Italian/American family comedy film starring Bud Spencer as the Genie and Luca Venantini as Aladdin, and with Spencer's daughter Diamy participating in a secondary role as Aladdin's love interest.

Plot
Al Haddin is a 14 year old who lives with his widowed mother Janet and his alcoholic grandfather Jeremiah in Miami, Florida. Al's mother works in nightclub owned by Monty Siracusa, a local mobster boss who runs a citywide protection racket. Jeremiah wastes the little money Janet makes on alcohol and horse races. Al has to work part-time in an antique shop to support his family.

Al's boss brings an old lamp, which a fisherman acquaintance of his has just salvaged from the ocean, to the store and orders Al to polish it. As Al rubs on the lamp, a genie suddenly appears before him and proclaims him his new master. Al begins to use the genie's power to fulfill some of his most eager wishes: beating up a bully and his gang, winning the affection of Patricia, his long-time crush, and riding in a real Rolls-Royce, something his late father had always dreamed of.

The presence of the Genie and his powers begin to draw unwanted attention. Patricia's father, Police Sergeant O'Connor, becomes suspicious of the brand-new Rolls-Royce cars Al suddenly gets out of nowhere. The Genie interferes with Siracusa's illicit business, which infuriates him, and is arrested twice for driving without a license. He escapes from jail both times by disappearing when summoned by Al, baffling the police superintendent. Al is kidnapped by a band of child snatchers but has to wait until the morning before the Genie comes to rescue him and the other kidnapped children because the Genie's powers only work during the day, as they have to regenerate overnight. The Chief of the Police learns of the Genie's mysterious abilities and orders his superintendent to bring the Genie to him.

Siracusa, furious about his criminal operations being disrupted, abducts Janet and Jeremiah questions them about the Genie. Although it is night when Al summons him, the Genie's human strength proves is enough to finish Siracusa's gang by himself, and the gangsters are arrested. Under a false pretense, the Genie is taken away to be dissected, but Al finds him before the operation starts and discloses to the Chief that he is a genie who possesses magical powers. The Chief then asks Al to have the Genie disable the entire world's military arsenal - all except of his own private army, so that he can seize control over the world. The Genie refuses to fulfill this wish, as it would seriously upset the balance of power, and he and Al make their escape on the Chief's office carpet converted into a flying carpet.

The pair proceeds to the Bermuda Triangle, where the Genie prepares to sink the lamp into the depths of the sea to prevent his powers from being abused. Al, however, unwilling to let his friend go, asks for one final wish, which is fulfilled. With the reward money from Siracusa's capture, the Haddins buy the nightclub and celebrate its reopening, with the Genie staying with them as a normal human being.

Cast
Bud Spencer as The Genie
Luca Venantini as Al Haddin
Janet Agren as Janet Haddin
Umberto Raho as the Police Chief
Raffaele Mottola as the Police Superintendent
Julian Voloshin as Jeremiah, Al's grandpa
Diamy Spencer as Patricia O'Connor
Tony Adams as Monty Siracusa

References

External links

1986 films
1980s fantasy comedy films
American fantasy comedy films
Italian fantasy comedy films
1980s Italian-language films
English-language Italian films
1980s English-language films
Films directed by Bruno Corbucci
Films scored by Fabio Frizzi
Films set in the Bermuda Triangle
Films set in Miami
Genies in film
Golan-Globus films
1986 multilingual films
American multilingual films
Italian multilingual films
Films produced by Menahem Golan
Films based on Aladdin
Films produced by Yoram Globus
1980s American films
1980s Italian films

Superfantagenio


Konstantine Vatskalis (born 4 April 1957) is a Greek-Australian politician and the current Lord Mayor of Darwin. Before becoming Lord Mayor in 2017 he was a Labor Party member of the Northern Territory Legislative Assembly from September 2001 to October 2014, representing the Darwin-based electorate of Casuarina. He was Minister for Business and Economic Development, Minister for Regional Development, Minister for Defence Support, Minister for Sport and Recreation, Minister for Essential Services, Minister for Health, Minister for Mines and Energy, Minister for Primary Industries and Fisheries and Minister for Children and Families.

On 30 July 2014, Vatskalis announced that he would be resigning from the Legislative Assembly at the end of the August sittings, which triggered a 2014 Casuarina by-election.

In the 2017 local government elections in the Northern Territory, Vatskalis was elected Lord Mayor of Darwin.

Early years

Vatskalis was born in Greece, and studied public health in Athens. He became involved in student politics while there, becoming a student representative at the Athens Higher Vocational School and taking part in the 1970s pro-democracy protests, where he witnessed people being arrested for speaking freely. He married an Australian woman, Linda Cotton in 1982, and in 1983, they emigrated to Western Australia. Once they had arrived in Perth, Vatskalis found that his Greek qualifications were not recognised, and was forced to start again, beginning a degree in environmental health at Curtin University, where he also joined the Labor Party. After graduating in 1985, he worked as an environmental health officer and surveyor in the Western Australian towns of Port Hedland and Wanneroo from 1986 to 1993. This period was also marked by personal tragedy, however; his wife died in 1988. In 1992, not long before leaving Western Australia, Vatskalis completed post-graduate studies this time in environmental science from Murdoch University.

In 1993, Vatskalis secured a job managing the NT Health Department's Darwin Environmental Health Unit, which meant relocating to the Northern Territory. He quickly became involved in Darwin's multicultural community, taking up a position hosting a Greek community radio show the same year, and going on to present a weekly nationwide Greek news segment on SBS Radio. Vatskalis also served a stint on the Northern Territory Police's Ethnic Advisory Committee.

Election to parliament

|}
Vatskalis left the Environmental Health Unit in 1999, taking up a position at Danila Dilba, the indigenous health service in Darwin. However, this was to be short-lived, as he soon nominated for Labor Party pre-selection to contest the seat of Casuarina at the 2001 election. Vatskalis was successful in gaining preselection, but was not widely expected to be elected.  Not only had the ALP ever won Casuarina, but Vatskalis was facing incumbent MP and Arts, Sciences and Ethnic Affairs Minister Peter Adamson. However, in an unexpected result, a massive Labor wave swept through Darwin, allowing the party to win government for the first time ever. Notably, Labor took every seat in the northern portion of the capital—among them Casuarina, for the first time ever. Vatskalis took the seat on a swing of 13 percent.

Initial success as a minister
Though he had not even been tipped to win the seat, Vatskalis was immediately appointed to the ministry upon entering parliament, with new Chief Minister Clare Martin selecting him as her Minister for Lands, Planning and Environment, Housing, Local Government and Ethnic Affairs. He sparked brief controversies in October and November, when he oversaw the sale of a large public housing complex in Alice Springs and then attempts at compulsorily acquiring homes in Berry Springs, which were dumped after a public outcry.

Despite these hiccups, he was widely seen to be an effective minister, and was subsequently appointed to three additional portfolios—Transport, Infrastructure and Essential Services in a reshuffle on 16 November. He also began to win praise from several sectors over his handling of a number of issues, including opening up a large number of new housing blocks and both introducing speed limits on the Lasseter Highway and funding road repair projects in an attempt to curb the number of road deaths. He was also responsible for closing Darwin's Lake Leanyer after a coronial inquest into a death there. In February 2002, the Northern Territory News suggested that Vatskalis had "consistently been one of the Government's better performers", though they also criticised him for not appointing "new blood" to his departments. The usually conservative tabloid made similar comments in their report on the performance of the Martin ministry on the first anniversary of the election in August, suggesting that he had "impressed observers with his willingness to confront his new responsibilities."

Difficulties and demotion
It was around this point, however, where Vatskalis' initial positive stint ended, and he began to face serious difficulties in his position. He was criticised for the sacking without explanation of one of the Territory's most senior public servants, the head of the Parks and Wildlife Service, Dr Bill Freeland, and had recurring problems surrounding the planned gas plant at Wickham Point on Darwin Harbour. As the contracts had already been signed by the Burke Country Liberal Party government, Vatskalis had little choice but to continue supporting the construction of the gas plant, despite significant pressure from angry community groups. In October 2002, Vatskalis had to be placed under police protection when he received death threats from residents angry over a decision to approve the construction of a private school in a suburban street.

In January 2003, Vatskalis—allegedly unilaterally—banned flights over the Katherine Gorge, but was forced to remove the ban less than a month later after a public outcry. He also became embroiled in a nasty stoush with the taxi industry over planned reforms, clashed with environmentalists over land-clearing around the Daly River area, and was the subject of a damaging A Current Affair report over his handling of the impact on pastoralists from the Alice Springs–Darwin Railway. These controversies were amplified by a personal scandal in August 2003, when Vatskalis was found to be offering paid translation services over the internet while an MP. Not long after, the Northern Territory media reported a number of concerns about a taxpayer-funded trip taken by Vatskalis and Chief Minister Martin in August–September.

While he had also had some successes in this period, cracking down on antisocial behavior by youths in cars, forcing licenses upon the building industry after a series of scams, and attempting to convince the federal government to hand Kakadu National Park back to the NT government—a move soon supported by MPs on both sides of NT politics—the series of incidents throughout 2003 had severely tarnished Vatskalis' reputation.

December 2003 Ministerial reshuffle
In the December 2003 ministerial reshuffle sparked by the axing of Health Minister Jane Aagaard, Vatskalis was severely demoted, losing all his portfolios except Ethnic Affairs, and being given the new responsibilities of Mines and Energy and Primary Industries and Fisheries.

Although the reshuffle had seen Vatskalis demoted, the new portfolios allowed him to move away from the areas in which he had been under siege. In his new portfolio, he signed several new resource exploration permits and launched several programs attempting to promote the Northern Territory to mining companies, in the hope of boosting the industry. He launched a significant shakeup of mining laws, blocked proposals to create a second mine in the Kakadu National Park, and oversaw the proposal to clean up the environmental damage from the abandoned Mount Todd gold mine, near Katherine. In 2006 he instigated the "China and Japan Investment attraction strategy" targeting China and Japan for the Territory's mineral resources. He led a number of delegations to China and presented the Territory's mineral wealth to mining companies and investors in China. This led to the attraction of significant investment in the mining sector by Chinese companies making China the number 1 trade partner of the territory. The success of this strategy was highlighted by the 2010 Darwin visit of the then Vice President (and current President) of China Xi Jinping.Vatskalis also won favour from the recreational fishing community, banning commercial fishing in the Adelaide River and rejecting proposals to introduce fishing licenses in the Territory.

Vatskalis faced his first electoral test at the 2005 election, and despite having won the seat from the CLP for the first time ever in 2001, was easily elected with a massive swing in his favour, amidst a landslide result across the Territory.  He comfortably retained the seat again in 2008, albeit with a 4.2% swing against him, but still holding a 14% majority.

Another cabinet reshuffle on 4 February 2009 saw Vatskalis take the Government's Health portfolio from Dr Chris Burns while remaining the Minister for Primary Industry, Fisheries and Resources. In December 2009 he added the child protection portfolio to his duties.

References

External links

1957 births
Living people
Members of the Northern Territory Legislative Assembly
Australian Labor Party members of the Northern Territory Legislative Assembly
Mayors and Lord Mayors of Darwin
Greek emigrants to Australia
Curtin University alumni
Murdoch University alumni
21st-century Australian politicians

Kon Vatskalis


The wedding of Princess Margaret and Antony Armstrong-Jones took place on Friday, 6 May 1960 at Westminster Abbey in London. Princess Margaret was the younger sister of Queen Elizabeth II, while Antony Armstrong-Jones was a noted society photographer.

Engagement
Princess Margaret met photographer Antony Armstrong-Jones in 1958 at a dinner party at the Chelsea home of Lady Elizabeth Cavendish. The two had previously encountered each other when Armstrong-Jones was the photographer at the wedding of Margaret's friends, Lady Anne Coke and The Hon. Colin Tennant, in April 1956. In October 1959, Armstrong-Jones was invited to stay at Balmoral Castle. The public assumed he was there to photograph the royal family. They became engaged shortly after and on 26 February 1960, Clarence House announced the engagement. Armstrong-Jones presented the Princess with an engagement ring set with a ruby surrounded by a marguerite of diamonds. He had designed the ring himself after a rose in honour of Margaret's middle name.

Two days before the wedding, on 4 May, there was a white-tie ball at Buckingham Palace attended by the Prime Minister and the Archbishop of Canterbury.

Wedding

Ceremony
Margaret made her way with the Duke of Edinburgh from Clarence House in the Glass Coach, arriving at the church at 11:30. The wedding took place at Westminster Abbey and was conducted by The Most Rev. Dr. Geoffery Fisher, Archbishop of Canterbury and The Very Rev. Eric Abbott, Dean of Westminster. It was the first royal wedding to be broadcast on television and had an estimated 300 million viewers, 20 million of which from the UK. Richard Dimbleby, Jean Metcalfe, Anne Edwards, Brian Johnston, and Wynford Vaughan-Thomas covered the event for the BBC.

Attendants
Armstrong-Jones's best man was Dr. Roger Gilliatt, son of the Queen's gynecologist. The Countess of Rosse, the groom's mother, had hoped he would choose his half-brother, Lord Oxmantown, as his best man. However, resentment of their mother's favouritism led him to reject this suggestion. On 19 March, it was announced he had chosen Jeremy Fry for the role, but Fry was convicted of "importuning for immoral purposes" after allegedly approaching a man for sex, so was replaced.

Princess Margaret was attended by eight bridesmaids:
 The Princess Anne, daughter of The Queen and The Duke of Edinburgh
 Miss Angela Nevill, daughter of Lord and Lady Rupert Nevill
 Lady Rose Nevill, daughter of The Marquess and Marchioness of Abergavenny
 The Hon. Catherine Vesey, daughter of The Viscount and Viscountess de Vesci
 Miss Sarah Lowther, daughter of Mr. and Mrs. John Lowther
 Lady Virginia Fitzroy, daughter of Earl and Countess of Euston
 Miss Annabel Rhodes, daughter of The Hon. Margaret and Mr. Denys Rhodes
 Miss Marilyn Wills, daughter of The Hon. Jean and Captain John Wills.

Music
Prior to the service, works by Johann Sebastian Bach, George Frideric Handel, Henry Purcell and William Henry Harris were played on the organ. The bride walked down the aisle to the hymn "Christ is Made the Sure Foundation" to the tune Westminster Abbey by Purcell. Throughout the service, anthems by Franz Schubert, William Byrd and Gustav Holst were sung. The recessional music, at the special request of the bride, was "Trumpet Tune and Airs" by Purcell.

Attire

The Princess wore a silk organza gown designed by Norman Hartnell. She accessorized with the Poltimore tiara, which she had purchased at auction a year earlier, and a diamond riviére of 34 old-cut diamonds given to the bride by her grandmother, Queen Mary. She carried a bouquet of white orchids. Hartnell also designed the outfits of The Queen and The Queen Mother.

Armstrong-Jones and all male members of the royal family, except for Lord Mountbatten, wore morning dress.

Guests
Notable guests in attendance included:

Relatives of the bride

House of Windsor
 Queen Elizabeth The Queen Mother, the bride's mother
 The Queen and the Duke of Edinburgh, the bride's sister and brother-in-law
 The Prince of Wales, the bride's nephew
 The Princess Anne, the bride's niece (bridesmaid)
 The Princess Royal, the bride's paternal aunt
 The Earl and Countess of Harewood, the bride's first cousin and his wife
 The Hon. Gerald and Mrs. Lascelles, the bride's first cousin and his wife
 The Duke and Duchess of Gloucester, the bride's paternal uncle and aunt
 Prince William of Gloucester, the bride's first cousin
 Prince Richard of Gloucester, the bride's first cousin
 The Duchess of Kent, the bride's paternal aunt by marriage
 The Duke of Kent, the bride's first cousin
 Princess Alexandra of Kent, the bride's first cousin
 Prince Michael of Kent, the bride's first cousin
 Lady Patricia and The Hon. Sir Alexander Ramsay, the bride's first cousin twice removed, and her husband
 Captain Alexander Ramsay of Mar and Mistress of Saltoun, the bride's second cousin once removed, and his wife
 Princess Alice, Countess of Athlone, the bride's first cousin, twice removed and paternal great aunt by marriage

Other descendants of Queen Victoria
 The Queen of Denmark, the bride's second cousin once removed (and godmother)
 The Earl Mountbatten of Burma, the bride's second cousin once removed
 The Lady Brabourne, the bride's third cousin
 The Hereditary Prince of Baden, the bride's third cousin
 Prince Ludwig of Baden, the bride's third cousin
 Prince Karl of Hesse, the bride's third cousin

Bowes-Lyon family
 The Hon. Jean and Captain John Wills, the bride's first cousin and her husband
 Miss Marilyn Wills, the bride's first cousin, once removed
 The Hon. Margaret and Mr. Denys Rhodes, the bride's first cousin and her husband
 Miss Annabel Rhodes, the bride's first cousin, once removed

Relatives of the groom
 Major and Mrs. Ronald Armstrong-Jones, the groom's father and stepmother
 The Viscountess and Viscount de Vesci, the groom's sister and brother-in-law
 The Hon. Catherine Vesey, the bridegroom's niece
 The Countess and Earl of Rosse, the groom's mother and stepfather
 Lord Oxmantown, the groom's half-brother
 The Hon. Martin Parsons, the groom's half-brother

Politicians

British politicians
 The Prime Minister and Lady Dorothy Macmillan
 The Foreign Secretary

Commonwealth politicians
 Robert Menzies, Prime Minister of Australia
 John Diefenbaker, Prime Minister of Canada
 Kwame Nkrumah, Prime Minister of Ghana
 Jawaharlal Nehru, Prime Minister of India
 Ayub Khan, President of Pakistan
 Walter Nash, Prime Minister of New Zealand

The wedding coincided with the 10th Commonwealth Prime Ministers' Conference held at Windsor Castle. As a result, many of the Commonwealth dignitaries attended the wedding.

Religious figures
 The Most Rev. Dr. Geoffery Fisher, Archbishop of Canterbury
 The Very Rev. Eric Abbott, Dean of Westminster

Other notable guests
 Dr. and Mrs. Roger Gilliatt (best man)
Earl and Countess of Euston
 Lady Virginia FitzRoy (bridesmaid)
 Mr. and Mrs. John Lowther
 Miss Sarah Lowther (bridesmaid)
 The Marquess and Marchioness of Abergavenny
 Lady Rose Nevill (bridesmaid)
 Lord and Lady Rupert Nevill
 Miss Angela Nevill (bridesmaid)

Aftermath
Following a balcony appearance and a wedding breakfast for 150 guests at Buckingham Palace, the bride changed into her Victor Stiebel going-away outfit and they departed in an open Rolls-Royce. They spent their six-week honeymoon touring the Caribbean on HMY Britannia. On 26 May, while away on honeymoon, Camilla Fry, wife of Jeremy Fry, gave birth to Armstrong-Jones's illegitimate daughter, Polly. Allegations of this were first raised in 2004 and confirmed when Armstrong-Jones agreed to take a paternity test.

On 6 October 1961, Armstrong-Jones was raised to the peerage as Earl of Snowdon and Viscount Linley, of Nymans in the County of Sussex, by Queen Elizabeth II. He became "The Right Honourable The Earl of Snowdon" and Princess Margaret became "Her Royal Highness The Princess Margaret, Countess of Snowdon." The couple had two children, David (born 1961), now the 2nd Earl of Snowdon, and Sarah (born 1964).

The Snowdons separated in 1976, subsequently divorcing on 11 July 1978. It was the first divorce by a senior member of the royal family since that of Princess Victoria Melita of Saxe-Coburg and Gotha and Ernest Louis, Grand Duke of Hesse in 1901. On 15 December of that year, Snowdon remarried Lucy Lindsay-Hogg, separating in 2000. They had a daughter, Frances (b. 1979). On 30 April 1998, Snowdon fathered another illegitimate child, Jasper William Oliver Cable-Alexander.

After years of ill health, Princess Margaret, who never remarried, died on 9 February 2002, aged 71. Lord Snowdon died on 13 January 2017, aged 86.

References
Notes

Sources

External links
 Order of Service for the wedding

Margaret and Antony Armstrong-Jones
Margaret and Antony Armstrong-Jones
Margaret and Antony Armstrong-Jones
Princess Margaret, Countess of Snowdon
1960 in London
May 1960 events in the United Kingdom

Wedding of Princess Margaret and Antony Armstrong-Jones


The Carolina Panthers joined the National Football League (NFL) in 1995 as the league's 29th franchise. Their first ever selection was Kerry Collins, a quarterback from Penn State, in the 1995 NFL Draft. The team's most recent first-round selection (1st pick overall) was Bryce Young, a quarterback from Alabama, in the 2023 NFL Draft.

Every year during April, each NFL franchise seeks to add new players to its roster through a collegiate draft officially known as "the NFL Annual Player Selection Meeting" but more commonly known as the NFL Draft. Teams are ranked in inverse order based on the previous season's record, with the worst record picking first, and the second worst picking second and so on. The two exceptions to this order are made for teams that appeared in the previous Super Bowl; the Super Bowl champion always picks 32nd, and the Super Bowl loser always picks 31st. Teams have the option of trading away their picks to other teams for different picks, players, cash, or a combination thereof. Thus, it is not uncommon for a team's actual draft pick to differ from their assigned draft pick, or for a team to have extra or no draft picks in any round due to these trades.

The Panthers' only first overall selection came in 2011, when they selected quarterback Cam Newton out of Auburn.  They would have picked first in 2002, however, the inception of the Houston Texans that year allowed Houston to pick first instead of Carolina. Carolina had the first overall pick in their inaugural season, but traded the pick to the Cincinnati Bengals for the 5th and 36th overall selection. The Panthers have twice selected a Miami Hurricanes player in the first round: linebackers Dan Morgan in 2001 and Jon Beason in 2007.

Collins, the team's first ever selection, made the Pro Bowl and led the Panthers to the playoffs in only their second season of existence, but he was later released after struggling on and off the field with alcoholism. Rae Carruth began his career as a promising wide receiver, but he was dropped from the team after being arrested for hiring someone to kill his pregnant girlfriend (he would later be convicted of the crime). Julius Peppers won Rookie of the Year, was named to the Pro Bowl on several occasions, and was the centerpiece of the Panthers' defensive line until signing with the Chicago Bears.  Dan Morgan was also a highly touted Pro Bowl linebacker, but repeated concussions had caused him to miss parts of several seasons until the Panthers released him in 2008. The Panthers drafted Jon Beason in 2007 partially to insure their defense against Morgan's absence. Newton threw for 422 yards in his debut game, an NFL record, went on to set several passing records as a rookie, and won the AP Offensive Rookie of the Year award. Luke Kuechly led the NFL in tackles his rookie year, and won the AP Defensive Rookie of the Year award one year after Newton's offensive ROTY.

When the Panthers and Jacksonville Jaguars joined the league together in 1995, both teams participated in an expansion draft, where they selected players from 30 existing NFL teams.  This list does not include players selected in that draft.

Key

Player selections

Notes
Notes

Footnotes

References

Carolina Panthers

First round draft picks

List of Carolina Panthers first-round draft picks


Makovsky (from mak meaning ), derived of the Polish surname Makowski, is a habitational name for someone from a place called Makov.

It is the surname of a Russian artistic family ():

Egor Makovsky (1802-1866), amateur painter and accountant, father of:
Alexandra Makovskaya (1837–1915), Russian landscape painter
Konstantin Makovsky (1839–1915), Russian history and portrait painter, father of:
Sergey Makovsky (1877–1962), Russian poet, art critic, and organizer of many art expositions.
Elena Luksch-Makovskaya (1878-1967), Russian painter and sculptor, residing in Germany.
Nikolay Makovsky (1842–1886), Russian genre painter
Vladimir Makovsky (1846–1920), Russian genre painter and art collector, father of:
Aleksandr Makovsky (1869–1924), Russian painter

Makovský is used by Czech people:

Vincenc Makovský (1900–1966), Czech sculptor and designer
Michal Makovský (born 1976), former Czech motorcycle speedway rider
Miloš Makovský (born 1957), Czech rock guitarist

Other people with the same last name:
Judianna Makovsky (born 1967), American costume designer
Zach Makovsky, American mixed martial arts fighter

Makovsky


Guitar Hero is a popular series of music video games that allows players to pretend they are a rock star by playing a controller shaped like a guitar. The player has to play rock songs from the 1960s to present. There are 18 in the series, and the last one is 2010's Guitar Hero: Warriors of Rock. Since Guitar Hero World Tour, it has added different rock instruments, such as drums and microphone. Guitar Hero games can be played on most game consoles (which is the device it is played on, like the Xbox 360,the PlayStation 3 and the Wii. Many people around the world play this popular game.

After "Guitar Hero: Warriors of Rock" did not sell well, Activision (the company that owns the "Guitar Hero" series) stopped making Guitar Hero games until 2015. Guitar Hero Live came to stores in October of that year.

Guitar Hero (series)


संचय-सम्बन्धी कलन-विधियाँ (Combinatorial algorithms)

सामान्य संचयविन्यास (combinatorial) से सम्बन्धित कलनविधियाँ

 Brent's algorithm: finds cycles in iterations using only two iterators
 Floyd's cycle-finding algorithm: finds cycles in iterations
 Pseudorandom number generators (uniformly distributed):
 Blum Blum Shub
 Mersenne twister
 Linear congruential generator
 Lagged Fibonacci generator
 Robinson-Schensted algorithm: generates permutations from pairs of Young tableaux

आरेख-सम्बन्धी कलन-विधियाँ (Graph algorithms)
 Bellman-Ford algorithm: computes shortest paths in a weighted graph (where some of the edge weights may be negative)
 Dijkstra's algorithm: computes shortest paths in a graph with non-negative edge weights
 Perturbation methods: an algorithm that computes a locally shortest paths in a graph
 Floyd-Warshall algorithm: solves the all pairs shortest path problem in a weighted, directed graph
 Johnson algorithm: All pairs shortest path algorithm in sparse weighted directed graph
 Kruskal's algorithm: finds a minimum spanning tree for a graph
 Prim's algorithm: finds a minimum spanning tree for a graph
 Boruvka's algorithm: finds a minimum spanning tree for a graph
 Ford-Fulkerson algorithm: computes the maximum flow in a graph
 Edmonds-Karp algorithm: implementation of Ford-Fulkerson
 Nonblocking Minimal Spanning Switch say, for a telephone exchange
 Spring based algorithm: algorithm for graph drawing
 Topological sort: finds linear order of nodes(e.g. jobs) based on their dependencies.
 Hungarian algorithm: algorithm for finding a perfect matching
 Coloring algorithm: Graph coloring algorithm.
 Nearest neighbour algorithm.

खोज सम्बन्धी कलन-विधियाँ (Search algorithms)
 Linear search: finds an item in an unsorted list
 Selection algorithm: finds the kth largest item in a list
 Binary search algorithm: locates an item in a sorted list
 Binary search tree: uses binary tree to maintain elements.
 Breadth-first search: traverses a graph level by level
 Depth-first search: traverses a graph branch by branch
 Best-first search: traverses a graph in the order of likely importance using a priority queue
 A* tree search: special case of best-first search that uses heuristics to improve speed
 Uniform-cost search: a tree search that finds the lowest cost route where costs vary
 Predictive search: binary like search which factors in magnitude of search term versus the high and low values in the search. Sometimes called dictionary search or interpolated search.
 Hash table: finds an item in an unsorted collection in O(1) time.
 Crazy Turtle Puzzle algorithm

अक्षर-समूह सम्ब्नधी अल्गोरिद्म (String algorithms)

Searching
 Aho-Corasick algorithm: trie based algorithm for finding all matches in dictionary.
 Bitap algorithm: fuzzy algorithm that determines strings are approximately equal.
 Boyer-Moore string search algorithm: amortised linear (sublinear in most times) algorithm
 Knuth-Morris-Pratt algorithm: bypasses reexamination of matched characters
 Rabin-Karp string search algorithm: searches multiple patterns efficiently
 Longest common subsequence problem: Haskell's dynamic programming algorithm
 Longest increasing subsequence problem
 Shortest common supersequence problem
 longest common substring problem
 Kadane's algorithm: finds maximum sub-array of any size
 Boyer-Moore-Horspool algorithm

Approximate matching
 Hirschberg's algorithm: space efficient algorithm for computing edit distance
 Levenshtein edit distance
 Metaphone: an algorithm for indexing words by their sound, when pronounced in English
 Needleman-Wunsch algorithm
 NYSIIS: phonetic algorithm
 Smith-Waterman algorithm
 Soundex

Sorting algorithms
 Binary tree sort
 Bitonic sorter
 Bogosort
 Bubble sort: for each pair of indices, swap the items if out of order
 Bucket sort
 Burstsort
 Cocktail sort
 Comb sort
 Counting sort
 Gnome sort
 Flashsort
 Heapsort: convert the list into a heap, keep removing the largest element from the heap and adding it to the end of the list
 Insertion sort: determine where the current item belongs in the list of sorted ones, and insert it there
 Library sort
 Merge sort: sort the first and second half of the list separately, then merge the sorted lists
 Odd-even sort
 Pancake sorting
 Patience sorting
 Pigeonhole sort
 Quicksort: divide list into two, with all items on the first list coming before all items on the second list.; then sort the two lists. Often the method of choice
 Radix sort: sorts strings letter by letter
 Selection sort: pick the smallest of the remaining elements, add it to the end of the sorted list
 Shell sort: an attempt to improve insertion sort
 Smoothsort
 Stooge sort
 Strand sort
 Topological sort
 Tree sort
 Walia sort

Merge algorithms
 Simple Merge algorithm
 k-way Merge algorithm

डेटा घनन की कलन-विधियाँ (Data Compression algorithms)

Lossless compression algorithms

 Burrows-Wheeler transform: preprocessing useful for improving lossless compression
 DEFLATE: lossless data compression
 Delta encoding: aid to compression of data in which sequential data occurs frequently
 Dynamic Markov Compression: Compression using predictive arithmetic coding
 Incremental encoding: delta encoding applied to sequences of strings
 LZW: lossless data compression (Lempel-Ziv-Welch)
 LZ77 (algorithm): LZ77 and LZ78 are the names for the two lossless data compression algorithms
 LZMA: short for Lempel-Ziv-Markov chain-Algorithm
 LZO: data compression algorithm that is focused on speed
 PPM compression algorithm
 Shannon-Fano coding
 Truncated binary encoding
 Run-length encoding: lossless data compression taking advantage of strings of repeated characters
 SEQUITUR algorithm: lossless compression by incremental grammar inference on a string
 EZW (Embedded Zerotree Wavelet)
 Entropy encoding: coding scheme that assigns codes to symbols so as to match code lengths with the probabilities of the symbols
 Huffman coding: simple lossless compression taking advantage of relative character frequencies
 Adaptive Huffman coding: adaptive coding technique based on Huffman coding
 Package-Merge: Optimizes Huffman coding subject to a length restriction on code strings
 Arithmetic coding: advanced entropy coding
 Range encoding: same as arithmetic coding, but looked at in a slightly different way
 Entropy coding with known entropy characteristics
 Unary coding: code that represents a number n with n ones followed by a zero
 Elias delta|gamma|omega coding: universal code encoding the positive integers
 Fibonacci coding: universal code which encodes positive integers into binary code words
 Golomb coding: form of entropy coding that is optimal for alphabets following geometric distributions
 Rice coding: form of entropy coding that is optimal for alphabets following geometric distributions

Lossy compression algorithms
 Linear predictive coding: lossy compression by representing the spectral envelope of a digital signal of speech in compressed form
 A-law algorithm: standard companding algorithm
 Mu-law algorithm: standard analog signal compression or companding algorithm
 Fractal compression: method used to compress images using fractals
 Transform coding: type of data compression for "natural" data like audio signals or photographic images
 Vector quantization: technique often used in lossy data compression
 Wavelet compression: form of data compression well suited for image compression (sometimes also video compression and audio compression)

गणनात्मक ज्यामिति (Computational geometry)
 Euclidean Distance Transform - Computes the distance between every point in a grid and a discrete collection of points.
 Fortune's Algorithm: a well-known and simple-to-understand algorithm for computing Voronoi diagrams from a set of sites
 Collision detection algorithms: check for the collision or intersection of two given solids
 Convex hull algorithms: determining the convex hull of a set of points
 Chan's algorithm
 Gift wrapping algorithm or Jarvis march
 Graham scan
 Kirkpatrick–Seidel algorithm
 Gilbert-Johnson-Keerthi distance algorithm: determining the smallest distance between two convex shapes.
 Line segment intersection: finding whether lines intersect, usually with a sweep line algorithm
 Bentley-Ottmann algorithm
 Shamos-Hoey algorithm
 Point in polygon algorithms: tests whether a given point lies within a given polygon
 Polygon triangulation algorithms: decompose a polygon into a set of triangles

कम्प्यूटर ग्राफिक्स (Computer graphics)
 Bresenham's line algorithm: plots points of a 2-dimensional array to form a straight line between 2 specified points (uses decision variables)
 Line drawing algorithm: graphical algorithm for approximating a line segment on discrete graphical media.
 DDA line algorithm: plots points of a 2-dimensional array to form a straight line between 2 specified points (uses floating-point math)
 Flood fill: fills a connected region of a multi-dimensional array with a specified symbol
 Xiaolin Wu's line algorithm: algorithm for line antialiasing.
 Painter's algorithm: detects visible parts of a 3-dimensional scenery
 Ray tracing (graphics): realistic image rendering
 Phong shading: an illumination model and an interpolation method in 3D computer graphics
 Gouraud shading: an algorithm to simulate the differing effects of light and colour across the surface of an object in 3D computer graphics
 Scanline rendering: constructs an image by moving an imaginary line over the image
 Global illumination algorithms: Considers direct illumination and reflection from other objects.
 Interpolation: Constructing new data points such as in digital zoom.
 Ramer-Douglas-Peucker algorithm: Given a 'curve' composed of line segments to find a curve not too dissimilar but that has fewer points
 Spline interpolation: Reduces error with Runge's phenomenon.

कम्प्यूटर दृष्टि (Computer vision)
 In image processing, epitomic analysis can be used to represent an image or video by a smaller image or video which preserves its statistical properties.

 Counting objects in an image: Counts the number of objects in a binary image. Uses the connected-component labeling algorithm to first label each object. Then returns the number of labeled objects.

 SIFT (Scale-invariant feature transform): is an algorithm to detect and describe local features in images.

बीज-लेखन के अल्गोरिद्म (Cryptographic algorithms)

 Symmetric (secret key) encryption:
 Advanced Encryption Standard (AES), winner of NIST competition, also known as Rijndael
 Blowfish
 Data Encryption Standard (DES), sometimes DE Algorithm, winner of NBS selection competition, replaced by AES for most purposes
 IDEA
 RC4 (cipher)
 Tiny Encryption Algorithm
 Asymmetric (public key) encryption:
 DSA
 ElGamal
 RSA
 NTRUEncrypt
 Cryptographic Message digest functions (hashing functions):
 MD5 – Note that there is now a method of generating collisions for MD5
 RIPEMD-160
 SHA-1
 HMAC: keyed-hash message authentication
 Tiger (TTH), usually used in Tiger tree hashes
 Cryptographically secure pseudo-random number generators
 Blum Blum Shub - based on the hardness of factorization
 Yarrow algorithm
 Fortuna, intended as an improvement on Yarrow algorithm
 Linear feedback shift register
 Secret sharing, Secret Splitting, Key Splitting, M of N algorithms
 Shamir's Scheme
 Blakey's Scheme
 Key exchange
 Diffie-Hellman key exchange

आंकिक संकेत प्रसंस्करण (Digital signal processing)
 CORDIC: Fast trigonometric function computation technique.
 Rainflow-counting algorithm: Reduces a complex stress history to a count of elementary stress-reversals for use in fatigue analysis
 Osem: algorithm for processing of medical images
 Goertzel algorithm Can be used for DTMF digit decoding.
 Discrete Fourier transform: determines the frequencies contained in a (segment of a) signal
 Fast Fourier transform
 Cooley-Tukey FFT algorithm
 Rader's FFT algorithm
 Bluestein's FFT algorithm
 Bruun's FFT algorithm
 Prime-factor FFT algorithm
 Richardson-Lucy deconvolution: image de-blurring algorithm
 Elser Difference-Map Algorithm: X-Ray diffraction microscopy

सॉफ्टवेयर प्रौद्योगिकी (Software engineering)
 Algorithms for Recovery and Isolation Exploiting Semantics: recovery
 Unicode Collation Algorithm
 CHS conversion: converting between disk addressing systems
 Cyclic redundancy check: calculation of a check word
 Parity: simple/fast error detection technique
 Rayrole's algorithm: resource calendar management

वितरित प्रणालियों के लिये कलन-विधियाँ (Distributed systems algorithms)
 Lamport ordering: a partial ordering of events based on the happened-before relation
 Snapshot algorithm: a snapshot is the process of recording the global state of a system
 Vector clocks: a total ordering of events
 Marzullo's algorithm: distributed clock synchronization
 intersection algorithm: another clock agreement algorithm.
 Byzantine fault tolerance: good fault tolerance.

Memory Allocation and deallocation algorithms
 Boehm garbage collector: Conservative garbage collector
 Buddy memory allocation: Algorithm to allocate memory such that fragmentation is less.
 Cheney's algorithm An improvement on the Semi-space collector
 Generational garbage collector: Fast garbage collectors that segregate memory by age
 Mark and sweep
 Reference counting
 Semi-space collector An early copying collector

Operating systems algorithms
 Banker's algorithm: Algorithm used for deadlock avoidance.
 Page replacement algorithms: Selecting the victim page under low memory conditions.
 Bully algorithm: Selecting new leader among many computers.

Disk scheduling algorithms:
 Elevator algorithm: Disk scheduling algorithm that works like an elevator.
 Shortest seek first: Disk scheduling algorithm to reduce seek time.

Process synchronisation algorithms:
 Peterson's algorithm
 Lamport's Bakery algorithm
 Dekker's algorithm

Scheduling algorithms
 Rate-monotonic scheduling
 Earliest deadline first scheduling
 Fair-share scheduling
 Round-robin scheduling
 Multi level feedback queue
 shortest job next
 shortest remaining time
 Least slack time scheduling
 List scheduling

एलेक्ट्रानिकी एवं हार्डवेयर सम्बन्धी अल्गोरिद्म
 Quine-McCluskey algorithm: Also called as Q-M algorithm, programmable method for simplyfying the boolean equations.
 Petrick's method: Another algorithm for boolean simplification.
 Espresso heuristic logic minimization: Fast algorithm for boolean function minimization.

मशीन शिक्षा के अल्गोरिद्म (Machine learning algorithms)
 Support Vector Macting

चिकित्सा सम्बन्धी अल्गोरिद्म
 Medical algorithm
 Texas Medication Algorithm Project

न्यूरल नेटवर्क (Neural networks)
 Hopfield net
 Backpropagation
 Self-organizing map

जेनेटिक अल्गोरिद्मँ
 Fitness proportionate selection - also known as roulette-wheel selection
 Truncation selection
 Tournament selection
 Stochastic universal sampling

संख्यात्म बीजगणित (Numerical algebra)
 Buchberger's algorithm: finds a Gröbner basis
 Eigenvalue algorithm
 Exponentiating by squaring: quickly computes powers of numbers and matrices
 Gram-Schmidt process: orthogonalizes a set of vectors
 Knuth-Bendix completion algorithm: for rewriting rule systems
 Multivariate division algorithm: for polynomials in several indeterminates

संख्या सिद्धान्त सम्बन्धी कलन-विधियाँ
 Discrete logarithm:
 Baby-step giant-step
 Pollard's rho algorithm for logarithms
 Pohlig-Hellman algorithm
 Index calculus algorithm
 Euclidean algorithm: computes the greatest common divisor
 Extended Euclidean algorithm: Also solves the equation ax+by = c.
 Binary gcd algorithm: Efficient way of calculating gcd.
 Integer factorization: breaking an integer into its prime factors
 prime factorization algorithm
 Fermat's factorization method
 Trial division
 Lenstra elliptic curve factorization
 Pollard's rho algorithm
 Pollard's p − 1 algorithm
 Congruence of squares
 Quadratic sieve
 Dixon's algorithm
 Special number field sieve
 General number field sieve
 Multiplication algorithms: fast multiplication of two numbers
 Booth's multiplication algorithm
 Primality tests: determining whether a given number is prime
 AKS primality test
 Miller-Rabin primality test
 Sieve of Eratosthenes
 Sieve of Atkin
 Odlyzko-Schönhage algorithm: calculates nontrivial zeroes of the Riemann zeta function

संख्यात्मक कलन-विधियाँ (Numerical algorithms)
 Approximate counting algorithm: Allows counting large number of events in a small register
 Biconjugate gradient method: solves systems of linear equations
 Borwein's algorithm: an algorithm to calculate the value of 1/π
 Dancing Links: finds all solutions to the exact cover problem
 De Boor algorithm: computes splines
 De Casteljau's algorithm: computes Bézier curves
 False position method: approximates roots of a function
 Gauss–Jordan elimination: solves systems of linear equations
 Gauss–Seidel method: solves systems of linear equations iteratively
 Gauss–Legendre algorithm: computes the digits of pi
 Kahan summation algorithm: a more accurate method of summing floating-point numbers
 Levinson recursion: solves equation involving a Toeplitz matrix
 Metropolis–Hastings algorithm: used to generate a sequence of samples from the probability distribution of one or more variables
 MISER algorithm: Monte Carlo simulation, numerical integration
 Newton's method: finds zeros of functions with calculus
 Risch algorithm: Translates indefinite integral to algebraic problem
 Rounding functions: the classic ways to round numbers
 Secant method: approximates roots of a function
 Shifting nth-root algorithm: digit by digit root extraction
 Square root: approximates the square root of a number
 Strassen algorithm: faster matrix multiplication
 Symbolic Cholesky decomposition: Efficient way of storing sparse matrix
 Tridiagonal matrix algorithm (Thomas algorithm): solves systems of tridiagonal equations

अभीष्टप्राप्ति के अल्गोरिद्म (Optimization algorithms)
 Ant colony optimization
 BFGS method: A nonlinear optimization algorithm
 Branch and bound
 Chain matrix multiplication
 Conjugate gradient
 Differential evolution
 Evolution strategy
 Gauss–Newton algorithm: An algorithm for solving nonlinear least squares problems.
 Genetic algorithms
 Gradient descent
 Interior point method
 Karmarkar's algorithm: The first reasonably efficient algorithm that solves the linear programming problem in polynomial time.
 Levenberg–Marquardt algorithm: An algorithm for solving nonlinear least squares problems.
 Line search
 Local search
 Nelder-Mead method (downhill simplex method): A nonlinear optimization algorithm.
 Newton's method in optimization
 Particle swarm
 Random-restart hill climbing
 Simplex algorithm: An algorithm for solving the linear programming problem
 Simulated annealing
 Stochastic tunneling
 Subset sum algorithm
 Tabu search
 Minimax used in game programming
 Alpha-beta pruning: search to reduce number of nodes in minimax algorithm

पार्जिंग (Parsing)
 Recursive descent parser: A top-down parser suitable for LL(k) grammars
 LL parser: A relatively simple linear time parsing algorithm for a limited class of context-free grammars
 LR parser: A more complex linear time parsing algorithm for a larger class of context-free grammars. Variants:
 Operator-precedence parser
 SLR (Simple LR) parser
 LALR (Look-ahead LR) parser
 Canonical LR parser
 Packrat parser: A linear time parsing algorithm supporting some context-free grammars and parsing expression grammars
 CYK algorithm: An O(n3) algorithm for parsing any context-free grammar
 Earley parser: Another O(n3) algorithm for parsing any context-free grammar
 GLR parser:An algorithm for parsing any context-free grammar by Masaru Tomita. It is tuned for deterministic grammars, on which it performs almost linear time and O(n3) in worst case.
 Inside-outside algorithm: An O(n3) algorithm for re-estimating production probabilities in probabilistic context-free grammars

क्वांटम अल्गोरिद्म (Quantum algorithms)
Application of quantum computation to various categories of problems and algorithms

 Grover's algorithm: provides quadratic speedup for many search problems
 Shor's algorithm: provides exponential speedup for factoring a number
 Deutsch-Jozsa algorithm: criterion of balance for Boolean function

गणना सिद्धान्त एवं आटोमेटा (Theory of computation and automata)
 Powerset construction: Algorithm to convert nondeterministic automaton to deterministic automaton.
 Todd-Coxeter algorithm: Procedure for generating cosets.

अन्य
 Alpha max plus beta min algorithm: an approximation of the square-root of the sum of two squares.
 Astronomical algorithms
 Baum-Welch algorithm: hidden markov models
 Bit manipulation algorithms: Create bit mask algorithm
 Doomsday algorithm: day of the week
 Schreier-Sims algorithm: computing a base and strong generating set (BSGS) of a permutation group
 Viterbi algorithm: hidden markov models
 Xor swap algorithm: swaps the values of two variables without using a buffer
 Luhn algorithm: a method of validating identification numbers
 Rutishauser's algorithm
 Stemming algorithm: a method of reducing words to their stem, base, or root form
 Hamming weight (population count): find the number of 1 bits in a binary word
 Heisenman-Drogulous isomoglobic algorithm
 Gerchberg–Saxton algorithm: Phase retrieval algorithm for optical planes
 Shunting yard algorithm: convert an infix-notation math expression to postfix

बाहरी कड़ियाँ
 Dictionary of Algorithms and Data Structures (अंग्रेजी मे)

कंप्यूटर
सूचियाँ

कलन-विधियों की सूची


The Game Boy Printer, known as the  in Japan, is a thermal printer accessory released by Nintendo in 1998 which ceased production in early 2003. The Game Boy Printer is compatible with all the Game Boy systems except the Game Boy Micro and is designed to be used in conjunction with the Game Boy Camera. It also prints images from compatible late-generation Game Boy and Game Boy Color games (listed below). It runs on six AA batteries and uses a proprietary 38mm wide thermal paper with adhesive backing, originally sold in white, red, yellow and blue colors. In Japan, a bright yellow Pokémon version of the Game Boy Printer was released, featuring a feed button in the style of a Poké Ball.

Games with Game Boy Printer support

 Alice in Wonderland
 Asteroids
 Austin Powers: Oh, Behave!
 Austin Powers: Welcome to My Underground Lair!
 Cardcaptor Sakura: Itsumo Sakura-chan to Issho!
 Cardcaptor Sakura: Tomoe Shōgakkō Daiundōkai
 Disney's Dinosaur
 Disney's Tarzan
 Donkey Kong Country
 E.T.: Digital Companion
 Fisher-Price Rescue Heroes: Fire Frenzy
 Game Boy Camera
 Harvest Moon 2
 Kakurenbo Battle Monster Tactics
 Kettō Transformers Beast Wars: Beast Senshi Saikyō Ketteisen
 Klax
 The Legend of Zelda: Link's Awakening DX
 The Little Mermaid 2: Pinball Frenzy
 Little Nicky
 Logical
 Magical Drop
 Mary-Kate and Ashley: Pocket Planner
 Mickey's Racing Adventure
 Mickey's Speedway USA
 Mission: Impossible
 NFL Blitz
 Perfect Dark
 Pokémon Crystal
 Pokémon Gold and Silver (except Korean versions)
 Pokémon Pinball
 Pokémon Trading Card Game
 Pokémon Card GB2: Great Rocket-Dan Sanjō!
 Pokémon Yellow: Special Pikachu Edition
 Puzzled
 Quest for Camelot
 Roadsters
 Super Mario Bros. Deluxe
 Tony Hawk's Pro Skater 2
 Trade & Battle: Card Hero

Game Boy Printer Thermal Paper

Released alongside the Game Boy Printer in 1998, Nintendo-manufactured thermal paper refill rolls were produced in white, cream, blue, yellow, and red colour variants, all of which had an integrated adhesive backing. They had a roll width of 38mm and a roll diameter of 30mm, with a central 12mm diameter red cardboard spindle. A typical roll had 390–400 cm of length. After powering the printer on, a clip at the rear of the protruding translucent grey refill housing is depressed, allowing this to be lifted away. The thermal paper roll inserted upside-down, unravelled end facing down, with this end being slotted into a thin slot. The maroon 'FEED' button is then pressed/held down, which engages the uptake motor, and pulls the paper through to the exit slot adjacent to the printer logo. This has an integrated serrator, which allows finished prints to be ripped in a zig-zag fashion off the main paper feed. Forcibly pulling the paper opposite to the feed direction causes permanent damage to the gearing within the feed mechanism.

When a picture printed from the Game Boy Camera, it would print with a 5mm margin above and below the picture and print the picture at a 23mm height. This would give the total of 33mm height per picture. Although on-box refill advertisements boasted up to 180 pictures per roll, in actuality a typical roll could only print between 118 and 121 pictures.

Sold on the official Nintendo e-Shop (as triple packs of blue, cream and white rolls) until 2007, Game Boy branded official replacement thermal paper is now difficult to source. Even brand-new, sealed, un-opened official rolls degrade relatively quickly once opened (if they were stored correctly and their seal has not failed). Most, however, have suffered degradation whilst in storage due to a chemical reaction between the thermal paper and adhesive backing layer. Due to the proprietary nature of the adhesive-backing, replacement thermal paper that is able to be adhered to surfaces once printed upon (including brands such as 'MAXStick') is prohibitively expensive.

Instead, the thermal paper rolls can be successfully substituted with a 38mm x 4m alternative, with or without ('core-less') spindle cores, without repercussions on the printer. Such rolls are also compatible with some hand-held printing calculators, such as the Canon TP-8, Texas Instruments 5000–2008, Sharp 8180, and Casio FX-802. Alternatively, wider rolls (such as 57mm x 30mm x 12.7mm) can be cut or trimmed to 38mm, and function without issue.

Please note, however, that due to the inherent limitations of thermal paper, photographs printed on thermal paper will fade over time (this depends heavily on the thermal paper variant used, and could be as short as a few months, or instead a few years) until the paper is virtually blank. Paper in this state can usually be re-used, as long as the length of the strip is long enough to be manually fed into the takeup.

It is unknown whether original Game Boy Printer paper contains the chemicals Bisphenol-A (BPA) or its analog Bisphenol-S (BPS). Previously very widely used in plastics and thermal receipt paper due to their heat resistance and stability, these are currently being phased out of thermal paper coatings due to their in-vivo accrual (via direct dermal absorption) and resultant oestrogen-mimicking and endocrine disruption. Modern thermal paper roll replacements, or their manufacturers, usually clearly state if they are Bisphenol free [BP-Free].

Game Boy Printer Protocol

The communication between the Game Boy and the Game Boy Printer is via a simple serial link. Serial clock (provided by the Game Boy for the printer), serial data output (from Game Boy to printer) as well as serial data input (to Game Boy from printer). The Game Boy sends a packet to the printer, to which the printer responds with an acknowledgement as well as a status code.

Packet Format
Communication is via the Game Boy sending to the printer a simple packet structure as shown below. In general, between the first "sync_word" til the checksum is the Game Boy communicating to the printer. The last two bytes of the packet are for the printer to acknowledge and show its current status code.

 Command may be either Initialize (0x01), Data (0x04), Print (0x02), or Inquiry (0x0F).
 Payload byte count size depends on the value of the `DATA_LENGTH` field.
 Compression field is a compression indicator. No compression = 0x00
 Checksum is a simple sum of bytes in command, data length, and the data payload.
 Status byte is a bit-field byte indicating various status of the printer itself. (e.g. If it is still printing)

Commands

Initialize (0x01)
 Typical Payload Size = 0
This packet is sent without a data payload. It signals to the printer to clear the settings and prepare for the first data payload.

Data (0x04)
 Typical Payload Size = 640
The data packet is for transferring the image data to the printer data buffer. The typical size of the data payload is 640 bytes since it can store two printable rows of 20 standard Game Boy tile (2 bit color in 8x8 pixels grid), of which the Game Boy tile takes 16 bytes.

Print (0x02)
 Typical Payload Size = 4
This commands the printer to start printing. It also has 4 settings bytes for printing.

Inquiry (0x0F)
 Typical Payload Size = 0
Used for checking the printer status byte. This may be for checking if there is enough data in the printer buffer to start printing smoothly or if the printer is currently printing.

Printer Status Reply Byte

Usage today
Mad Catz and Xchanger sold a kit that enabled users to connect a Game Boy to a PC and print images using the PC's printer. Hobbyists outside the UK can also make their own cable for uploading images to their computer. A Game Boy Printer emulator is needed for the Game Boy to interface with the PC once linked via cable. The Game Boy Printer Paper has also been discontinued, and rolls of the genuine article that still produce a reliable image are becoming more difficult to find. Regular thermal paper, such as the kind used for POS terminals, can be cut to the proper width and used successfully with the Game Boy Printer.

The system will print a test message reading "Hello" if it is turned on while the feed button is held. According to the manual, this is used to test if the printer is functioning properly. To get around using six AA batteries (1.5 volts each) for the printer, a single 9V battery can be used if wired properly, because the printer requires 9V DC.

Notes

Further Information

Reverse Engineering
'Ben Heck Reverse Engineers Game Boy Printer': https://www.youtube.com/watch?v=43FfJvd-YP4

References

Game Boy accessories
Products introduced in 1998
Computer printers
Non-impact printing

Game Boy Printer