text:
Written by Yaser Mongy
شيرين نشأت
Born on 26 March 1957, Qazvin, Northwest Iran.
<img alt="" height="55" src="/BioPics/Signatures/SN_signature_1_14.png?Width=204&Height=55" width="204" style="BORDER: 0px solid; ">
Biography
Shirin Neshat is considered one of the leading, active contemporary artists working on concepts derived from the world of women and political crises. She came to prominence especially through her artistic experiments in fields of film directing film, video art and photography, with works that revolve around the equivocal relationship between Eastern and Western cultures, and the way each views the other in semi-stereotypical types.
Neshat was born to a rich family, her father was a doctor and her mother was a housewife, devoted to looking after her home. Neshat received her primary education in a Catholic boarding school in Tehran, which influenced her early assimilation of a lot of Western values, which mixed with religious and traditional Eastern values that were transmitted to her through her maternal grandparents. However, Neshat's maturity and awareness was nurtured generally thanks to her extremely culturally open-minded family, as her father was open to Western culture and its inherent values and concepts, and was keen that his daughters continue their higher university studies to the same educational level as their male siblings. He also showed a good understanding of the ideas of Western feminism, which led him to encourage his daughters to study, travel and explore the world. This was clearly manifested in the family's decision to send Neshat at the age of seventeen, in 1974, outside Iran to study fine arts in the United States. Back then, such practice was not common within the entire Iranian social milieus.
Neshat started her studies in Los Angeles, in a period that coincided with the outbreak of the Iranian Revolution later on. By 1980, she moved to the San Francisco Bay Area to study in Dominican College, and from there to University of California Berkeley to obtain a BA and MA and then MFA. During the 1980s, Neshat benefited from the time she spent at Storefront for Art and Architecture, a nonprofit organization that was founded in 1982 by the curator Kyong Park (b. 1955), who was of Korean origin, and who Neshat married and helped run the organisation. This contributed to her exposure to numerous contemporary art concepts and to her gaining experiences that had significant impact in forming the main aspects of her artistic style.
In 1990, Neshat returned to Iran for a brief trip which was considered a turning point in her personal and artistic life. She was in deep shock when she was confronted by comparing the reality of the Iranian society she knew earlier and the profound transformations it underwent during the years after the Islamic Revolution. These transformations also lead to changing individuals in their appearances and behaviors and triggered the widespread of a fundamentally oriented ideology throughout the whole society. Such experience was a great source of inspiration for Neshat's initial works, which she created using the photographic medium. The first work was the collection Unveiling (1993) and Women of Allah she created between 1993 and 1997, which turned the attention of Western artistic circles to her, and which received significant success in several exhibitions. These series of artwork reveal her ability in working with symbols and social projections in personal portraits that appear at first glance to be documentary but that include at the same time significant discrepancy between feminist values and extremist fundamentalism, in the context of the prevalent discourse in her hometown as she perceives it. As a result, the discrepancy becomes manifested in the contradictory relationships between photographs of faces and the handwritten Persian writings which Neshat executes meticulously with Chinese ink over the images to cover its main spaces. The combination between the handwritten Persian texts and photographic printed images expresses existing tensions between the characters represented in the works and the concept of the text. The handwritten texts are considered as an authority with many meanings and many faces aimed at reconstituting the identity of women. Neshat's use of some of the feminist poems that were written in Arabic and Persian letters, caused confusion of some viewers as to the intended meaning of these texts. Some associate these texts with the concept of the sacred Islamic text, based on the common notion that generally views Arabic writing as an essentially religious text.
Neshat's early photographic experiments coincided with a wave of new consciousness in the 1990s. Many Eastern artists, intellectuals and activists have proposed several, profound arguments, which benefited greatly from the efforts of theorists such as Edward Said, and which aimed at wiping off the influence of several classical, Western and Orientalist concepts and researching the representations of the east and document it.
Neshat'swork stems from two completely contradictory cultural backgrounds, one of which, is an Eastern, traditional semi-fundamentalist, and the other Western contemporary which is open to all concepts, and which breaks all intellectual barriers. In the visual framework of her artistic experiments, she focuses on the social developments in Islamic contemporary societies, especially those related to the situations of the everyday life in Iran. Although she proposes certain cultural models in her work, she adopts a universal visual language that does not exclusively propose a traditional image of her country of origin. Neshat's work revolves primarily around notions like martyrdom, femininity, exile and threatened identity, as they are concepts that link together all her experiments in film and photographic media. In that context, it becomes clear the importance of what Neshat established, strongly re-politicizing the image. This is evident through how widely influential her photographic experiments are, and whose echoes still reverberate in the works of several young artists in the Arab world. These artists were influenced by her photographing herself, wearing the Iranian chādor or chādar (Persian: چادر) and holding a gun.
Neshat combines several symbolic layers, at the forefront of which, comes the overlap between the features of a masculine world, and what is spread in its midst of violence and authoritarian practices, and the features of the traditional, Eastern, feminine world, and what it entails in the tendency to complacency and submission in most cases. This is what happens in the context of the many contradictions, existing complexities between the codes and the social, religious, and cultural meanings, in turn letting femininity coexist with violence, on the one hand, between innocence and spirituality, and on the other, the idea of aggression. Neshat's complex, symbolic mixture with its multiple levels allows the assimilation of certain moments of the history of armed political conflict in the region. One of these key moments was the Iranian-Iraq war, which some critics, including Nada Shabout - see as an important context to understand the image of women for Neshat, considering it as a reaction and visual reference to propaganda and counter-propaganda, through which there was an investment in the images of women as victims of violence and as being the mothers of martyrs. Some of the main visual motifs that are repeated throughout her work include black clothes, writing over the body, tattoo, henna, seals, shadows, meditative poses, fire arms, desert, the sea, dust and blood.
In executing her work, Nishat relies on using black and white, which gives her the opportunity to condense a lot of meanings and visual values equally. It also allows her to show the idea of opposition and contradiction which always appears in her works, between masculinity and femininity, light and darkness, violence and tenderness, as well as between loud and whispering voices in her films, in black and white are predominantly used. Consequently, the majority of her work convey an atmosphere of mystery and a sense of estrangement. She also relies in the treatment of her films in displaying pictures that are taken from a nearly fixed camera, and moving them by linking them with each other, in an observable and measured pattern, that is governed by a sonic rhythm matching the visual effect of the scenes.
Persian poetry plays a major role in deepening the expressive and visual content in Shirin Neshat's works, especially epic and Sufi poetry, which is clearly manifested in some of her important experiments. These include Turbulent, a video installation that she executed in 1998, using in its sonic elements, a chant from Jalāl ad-Dīn Rūmī's (1207- 1273) poetry. Rūmī's, the founder of the Mewlewī/ Mevlevi Sufi Order, is known as Mevlana or Mawlānā, and as the author of The Masnavi/ Mathnavi, (مثنوي معنوي), in Persian Masnavi-I Ma'navi/Mathnawi Ma'navi.
The poetry component was also part of Neshat's work the Logic of the Birds, a film she produced between 2000 and 2001. Its title appears directly linked to the title of a famous Sufi book of poetry, carrying the same name in Arabic and Persian, Manṭiq-uṭ-Ṭayr. The title also carries overlapping meanings with her work when associated with its famous English translation, The Conference of the Birds/ Speech of the Birds. It is one of the works of the famous Persian Sufi poet Farīd ud-DīnʿAṭṭār (1145 - 1221). This also becomes clearly evident in the photographic collection The Book of Kings, which she made in 2012, using tattoos on the bodies of her subjects, and traditional drawings derived from the most famous Persian epics. The epic carries the same meaning of its title in Arabic Kitab Al-Muluk كتاب الملوك, or in Persian (The Shahnameh/ Shahnama) Šāhnāmeh, composed by Abu'l-Qāsim Ferdowsī (935 - 1020). It is considered one of the references for Modern Persian language, a foundation for Persian nationalist thinking, and one of the most important sources for the study of Persian myths and heritage.
Shirin Neshat exhibited her works widely in many countries in the world, and participated in a large number of group exhibitions in different continents. In her exhibitions and artistic projects, she is especially active in the city of New York, and particularly the Museum of Modern Art in New York (MoMA). She also exhibited in the Whitney Museum of American Art, the Art Institute of Chicago, National Museum of Contemporary Art in Athens, and the Robert Rauschenberg Foundation in New York. In addition, her photographic work appears regularly on American magazine covers. Her acquired works can also be seen in a number of important museums, including Solomon R. Guggenheim Museum, and Mathaf: Arab Museum of Modern Art. She lives in New York, USA.
2014 Shirin Neshat: Afterwords, 9 November 2014 – 15 February 2015, Mathaf: Arab Museum
of Modern Art, Doha, Qatar
2014 National Museum of Modern and Contemporary Art, Seoul, South Korea
2013 Written on the Body, Espacio Fundación Telefónica, Madrid, Spain
2012 The Book of Kings, Gladstone Gallery, New York, United States of America
2011 Women without Men, Palazzo Reale, Milan, Italy
2010 La Fabrica Galeria, Madrid, Spain
2009 Games of Desire, Gladstone Gallery, Brussels, Belgium
2008 Gladstone Gallery, New York, United States of America
2007 Zarin, Galeria Filomena Soares, Lisbon, Portugal
2006 Secret of the Veil, Espoo Museum of Modern Art, Espoo, Finland
2005 The 6th Hiroshima Art Prize, Hiroshima City Museum of Contemporary Art, Hiroshima, Japan
2004 Through the Eyes of Shirin Neshat, Auckland Art Gallery, Toi o Támaki, New Zealand
2003 Tooba, Asia Society Museum, New York, United States of America
2002 Rapture, Guggenheim Museum Bilbao, Bilbao, Spain
2001 Musée d'Art Contemporain de Montreal [traveled to: Walker Art Center, Minneapolis; Contemporary Arts Museum, Houston, Texas; Miami Art Museum, Miami], United States of America
2000 Matrix 187: Turbulent, Matrix Gallery, Berkley Art museum, Berkley, California, United States of America
1999 FOCUS: Shirin Neshat, Rapture, Art Institute of Chicago, Chicago, United States of America
1998 Turbulent, Whitney Museum of American Art, Philip Morris Branch, New York, United States of America
1997 Photographs/Video Stills, Hosfelt Gallery, San Francisco, California, United States of America
1996 Women of Allah, Marco Noire Contemporary Arts, Turin, Italy
1993 Unveiling, Franklin Furnace, New York, United States of America
2014 Crystal Award of the World Economic Forum in Davos, Switzerland
2009 Sliver Lion for Best Director in the 66th Venice Film Festival, for her film, Women without Men
2006 The Dorothy and Lillian Gish Prize
2000 The International Gwangju Biennale Prize, South Korea
Feminism, Photography, Video Art, Contemporary Iranian Art, Contemporary American Art, Cultural Identity, Persian Culture, Art and Power, Art and Violence, Representation of Eastern Women, Image and Text, Patriarchal Society
Attar, Harvey & Masani. Conference of the Birds: A Seeker's Journey to God, Newburyport: Weiser Books, 2001.
Collection Online, Artists Bios, Guggenheim New York. Accessed August 18, 2014. http://www.guggenheim.org/new-york/collections/collection-online/artists/bios/1583.
El-Guindi, Fadwa. Veil: Modesty, Privacy, and Resistance, Oxford: Berg, 1999.
Harmless, William. Mystics, Oxford: Oxford University Press, 2008.
Khaleeli, Homa. Shirin Neshat: A Long way from Home, The Guardian 2010-6-13. Accessed August 17, 2014.
http://www.theguardian.com/film/2010/jun/13/shirin-neshat-women-without-men
La Rocco, Claudia. Shirin Neshat's Performa Contribution, The New York Times, 2001 – 11-14. Accessed August 15, 2014. http://artsbeat.blogs.nytimes.com/2011/11/14/shirin-neshats-performa-contribution/?_r=0.
Mackenzie, Sue. An Unveiling, The Guardian, 2000-7-22. Accessed August 15, 2014.
http://www.theguardian.com/lifeandstyle/2000/jul/22/weekend.suziemackenzie
Neshat, Shirin. The Women of Allah, New York: Distributed Art Pub Inc (Dap), 1999.
Shirin Neshat, Birography, Gladstone Gallery. Accessed August 13, 2014.
http://www.gladstonegallery.com/artist/shirin-neshat/biography.
Shirin Neshat, Bibliography, Gladstone Gallery. Accessed August 13, 2014. http://www.gladstonegallery.com/artist/shirin-neshat/bibliography.
Becker, Carol and Bui, Phong. Shirin Neshat with Carol Becker and Phong Bui, In Conversation, The Brooklyn Rail, 2009-9-4. Accessed August 11, 2014.
http://brooklynrail.org/2009/09/art/shirin-neshat-with-carol-becker-phong-bui.
Bloom, Livia. Women Without Men's Shirin Neshat, Sundace Features, Flimmaker Magazine, 2010-1-23. Accessed August 14, 2014.
http://filmmakermagazine.com/sundance_features/2010/01/women-without-men-s-shirin-neshat-by.html
Danto, Arthur C. Shirin Neshat, Artists in Conversation, BOMB Magazine, Fall 2000. Accessed August 10, 2014. http://bombmagazine.org/article/2332/
Denson, Roger G. Shirin Neshat: Artist of the Decade, HuffPost Arts & Culture, 2010-12-30. Accessed August 19, 2014.
http://www.huffingtonpost.com/g-roger-denson/sherin-neshat-artist-of-t_b_802050.html#s216201title=Attributed_to_alWasiti
Macdonlad, Scot. Shirin Neshat in conversation with Scott MacDonald, "Between Two Worlds: An Interview with Shirin Neshat,"Feminist Studies 30, Fall 2004, No. 3, p. 630. Accessed November 14, 2014.
http://www.feministstudies.org/_img/art_gallery/0499697.0030.306.pdf


Louisville Middle School's Innovation project converted two existing underutilized spaces into purposeful, engaging and collaborative new learning environments that promote creativity, inquiry, and oracy. An outdoor learning space was created in an unused alcove and a teacher workspace was converted into a student learning commons. Although all of BVSD's innovation guiding principles apply, the project strongly aligns with "Learning is a Social Process" and "Learning is Founded in Inquiry."
The focus of our innovation funds is to convert existing unutilized or underutilized space into purposeful, engaging and collaborative new spaces that promote creativity, inquiry and oracy. Although all five innovation guiding principles apply, each space will have a focus principle. The most comprehensively remodeled space will be the addition of an outdoor classroom in an existing large alcove. This space is adjacent to the main hallway and three high usage classrooms where team-teaching and co-teaching occur daily. The outdoor space will be accessible through one of the existing classrooms or from the outside, just adjacent the main gym doors. This space will serve as an outdoor science lab, a presentation space with stadium seating and as a lab for farm-to-table growing. The second area to be modified will be an underutilized teacher workroom "The Bat Cave" that now exists between two science classrooms. We will create a new collaborative space that can be used as a breakout classroom or a small group inquiry station. Soft seating and stand up height desktops (over half lockers) will give the space flexible use. A projector and interactive board will be integrated into the back wall to assist with idea development, collaborative inquiry, and presentations. Finally, all new lockers will be stand-up desk height with shiny laminate tops that students can use for collaboration and problem solving, turning hallway space into learning space.
We put out a call to staff, students and our community to join the design process. As Principal, I invited our parents during Back to School Night and through our weekly Parent and Student bulletin. We also presented the opportunity and latest progress to our SAC (School Accountability Committee). Our Design Advisory Team is comprised of students, teachers administrators, parents and a community member as well as architects, our project manager. All staff and parents were invited to join and or contribute via google doc feedback. Our initial ideas and ultimate design came from Sketch-Up designs created by LMS students in their TIDE classes the prior spring. One of the students joined the Design Team, so he will get to see his idea come to fruition!
All three of these spaces will promote "challenging, meaningful and engaging learning opportunities". As the Boulder Valley School District vision states, LMS will provide a more "comprehensive and innovative approach to education," opening up the use of space beyond the classroom and beyond typical desks to learn and inspire curiosity. Additionally, our plan promotes the value of intellectual growth, health and physical development and social-emotional well-being of students.
Our project aligns most with two guiding principles for innovation: "learning is a social process" and "learning is founded in inquiry." All three spaces encourage collaboration, hence promoting learning as a social process. "The Bat Cave," in particular, is flexible enough to provide "nest" and "cave" space for pairs and small groups up to a small class. Both innovation spaces (Bat Cave and outdoor classroom) provide opportunities to use technology to apply teambuilding and network skills and to communicate effectively, as well as seek a variety of perspectives, work respectfully, collaboratively and effectively to meet instructional objectives. The "locker tops" work equally well as small group collaboration/ problem-solving space. "Learning is found in inquiry" is particularly evident in the outdoor classroom where there will be connections between classrooms, transparency between classroom and breakout spaces, zones to accommodate project design, collaboration, resources from multiple disciplines presentation space, maker space and technology-enhanced zones.
Students will learn through collaboration- reading, writing, speaking, listening and presenting to create learning.
Staff will collaborate to build interdisciplinary components to instruction.
The curriculum will be connected to real-world problems and will often be interdisciplinary in nature.
Anecdotal survey data from teachers will reflect the perceived impact of the spaces on collaboration, inspiration for personal learning, and cross-curricular connections. Educator Effectiveness data may reflect improved practice related to Teacher Standards 1e, 3d, 3f, 4b, and 5a. Student survey data measuring outcomes of collaborative learning, innovative use of space, welcoming and safe environment will be collected. Additionally, use of spaces for social and instructional purposes will be monitored.
LMS teachers are currently studying Dylan Wiliam's Embedding Formative Assessment, with a purpose of increasing student engagement, oracy, and ownership of their own learning through effective formative practice. This professional learning will support the use of the space. Additional opportunity with text from George Couros' The Innovator's Mindset and courses offered through the Innovation office will be beneficial.


text:
The Star's trusted source for property
Sponsored content and Magazines
CommunityYour News
List subcategories
community, your-news,
Grants of up to $1000 are up for grabs to eligible Lake Macquarie organisations hosting events and activities as part of Youth Week 2021 Lake Macquarie City Council is offering the funding for events and activities staged as part of the annual national celebration of young people, to be held in April 2021. Lake Macquarie Mayor Cr Kay Fraser said the grants were available to any incorporated non-profit organisation hosting Youth Week activities or events within Lake Macquarie aimed at young people aged 12-24. "Youth Week is an opportunity for young people to express their ideas and views, act on issues that affect their lives, and create and enjoy activities and events," Cr Fraser said. "It's important that young people in Lake Mac have the opportunity to be part of it." Events and activities that achieve outcomes identified in the Lake Macquarie Youth Strategy, such as improving access to services for young people or ensuring they have the opportunity to make a meaningful contribution to the community, will be highly regarded for funding. Cr Fraser said past Youth Week grants had helped fund a variety of events, including music competition, sport and fitness session along with a cooking competition. "We are keen to support a diverse array of fun, inclusive activities and events that engage and activate younger people throughout the City," Cr Fraser said. Grant applications can be lodged online at lakemac.com.au/youthweekgrants before 5pm Thursday 17 December 2020. A grants committee will meet in early January 2021 to review applications, with recommendations for funding going before Council in February 2021.
/images/transform/v1/crop/frm/PCe8wYNvaaq4ByZzEwBRgt/78b395a9-b27b-4a0f-bdb0-c5082991e620.jpg/r4_85_1613_994_w1200_h678_fmax.jpg
November 20 2020 - 10:06AM
Lake Macquarie Council offers grants of $1000 for Youth Week activities
Grants of up to $1000 are up for grabs to eligible Lake Macquarie organisations hosting events and activities as part of Youth Week 2021
Lake Macquarie City Council is offering the funding for events and activities staged as part of the annual national celebration of young people, to be held in April 2021.
Lake Macquarie Mayor Cr Kay Fraser said the grants were available to any incorporated non-profit organisation hosting Youth Week activities or events within Lake Macquarie aimed at young people aged 12-24.
"Youth Week is an opportunity for young people to express their ideas and views, act on issues that affect their lives, and create and enjoy activities and events," Cr Fraser said.
"It's important that young people in Lake Mac have the opportunity to be part of it."
Events and activities that achieve outcomes identified in the Lake Macquarie Youth Strategy, such as improving access to services for young people or ensuring they have the opportunity to make a meaningful contribution to the community, will be highly regarded for funding.
Cr Fraser said past Youth Week grants had helped fund a variety of events, including music competition, sport and fitness session along with a cooking competition.
"We are keen to support a diverse array of fun, inclusive activities and events that engage and activate younger people throughout the City," Cr Fraser said.
Grant applications can be lodged online at lakemac.com.au/youthweekgrants before 5pm Thursday 17 December 2020.
A grants committee will meet in early January 2021 to review applications, with recommendations for funding going before Council in February 2021.
This story $1000 Youth Week grants on offer first appeared on Lakes Mail.
A year after a traumatic crash, Owen Walton is learning to live all over again
Premier flags an easing of restrictions after another day of zero cases

redpajama_set_name: RedPajamaCommonCrawl


text:
234 USERS: B
Get Thee to a Nunnery, Hardy Boy
By Tippi Blevins | Season 9	| Episode 17	| Aired on 03.25.2014
Sam catches wind of a weird murder in a small Illinois town. A woman killed her husband after he questioned her dinner choice, with no prior incident of violence between them. Dean would prefer to stay behind at the Lair O' Letters and keep hunting for Abaddon, so Sam heads off on his own. Before he can question the wife, though, she hangs herself in her cell. All she leaves behind are bloody scrawls she scratched into the walls with her bare fingers. Sam can find no hint of sulfur or unusual EMF readings, so he's a little bit stumped.
Meanwhile, Dean continues his research at the LOL. Or, well, that's what he tries to do, but he's so jittery after his encounter with the First Blade that all he can do is down booze. When he runs low, he heads to the local dive bar and resumes drinking there. Crowley shows up to taunt Dean about how much he wants to hold the blade again, and how much like Cain he really is. When Sam calls Dean for a consult, Dean lies about being on the job. Yep, yep, totally closing in on Abaddon here and not hanging out with Crowley at all!
More and more murders crop up in the little town. While Sam is at the police station, he meets an older woman named Julia who confides in him about demons. She was a young nun at Bonaventure Convent back in 1958, and she met demons in person. She also met a man named Henry Winchester and a woman named Josie, who were pretending to be a priest and nun for an exorcism. Through flashbacks, we learn that Abaddon was possessing the Mother Superior in order to take souls. Abaddon was going to possess Henry so she could learn about the Men of Letters, but Josie sacrificed herself to save him, and he never knew about it. That's how Abaddon ended up with her fabulous red-haired meatsuit. Now, in the present day, a possessed nun is continuing to harvest souls so that Abaddon can turn them into a demonic army. The soulless people left behind then turn into psycho killers. Luckily, Sam kills the evil nun and gets the souls back to their proper owners.
At the bar, Dean notices what he thinks is a newbie hunter trying to kill Crowley. Dean stops the guy, basically telling him that he's taking on way more than he can handle. In actuality, the guy is one of Crowley's minions, and Crowley sees the whole scenario as evidence that Dean wanted to save him. It's probably more that Dean didn't want to lose his one connection to the First Blade, but whatever. Scheming Crowley is much more fun than crying Crowley.
In the end, the Winchesters meet back up at the LOL. They decide to redouble their efforts to find Abaddon, realizing that they're fast running out of episodes before the finale, and one of those is a backdoor pilot for the new spin-off. Stay tuned for the full recap.


text:
NIMASA honours firm
By Sulaimon Salau
23 January 2019 | 4:07 am
Inflation drops to 11.22% in June
Boeing shares fall as 737 MAX grounding drags on
[Dakuku Peterside, NIMASA Boss
For the second year running, Charkin Offshore Training and Safety Centre, Port Harcourt, Rivers State, has won the Nigerian Maritime Administration and Safety Agency (NIMASA) recognition award.
The centre owned by maritime educationist and safety expert, Sir Charles Wami, won in the Maritime Education and Training Institute of the Year 2018, which it also won at the maiden edition of the awards in 2017.
Accepting the award, which was presented to the company at the NIMASA Awards and Dinner, in Lagos, by the Ooni of Ife, Enitan Adeyeye Ogunwusi, Wami, solicited stakeholders' encouragement, to enable it continue to provide maritime education and training of international repute.
"The school has a trend of rendering and improving on high quality training to guarantee competence in a conducive and friendly environment. It is a one-stop-shop for marine, oil and gas training," he said.
Wami is also the promoter of Charkin Maritime Academy (CMA), Port Harcourt, which boasts of the first ever land ship in Nigeria, MV Rivers Pride, formally unveiled on February 9, 2017, by Governor Nyesom Wike. CMA prides itself as an indigenous and privately-owned maritime training institution.
The land ship comprises full mission navigational bridge simulator; ECDIS Simulation Room; GMDSS (Navigation) Simulation Room, which conforms to the 2010 Manila Amendments by the global maritime watchdog, the International Maritime Organisation (IMO); and the basic dynamic positioning class.
Other components include advanced dynamic positioning and examination class; nautical institute examination room; and the drilling system crane simulator.
The school has the approval of local and international regulatory agencies across the globe. These include NIMASA, Department of Petroleum Resources (DPR), OPITO, United Kingdom, and the International Well Control Forum (IWCF), United Kingdom, among others.
Charkin Offshore Training and Safety CentreEnitan Adeyeye OgunwusiNIMASA
28 mins ago Football
3 hours ago Boxing
Dortmund's Diallo heading to PSG
3 hours ago Football
Griezmann says Atletico outcry to Barcelona move 'is a pity'
Casillas to join Porto staff during heart attack recovery
Wimbledon champion Djokovic consolidates top ranking


Visit the image above to get your Trillonario Casino Welcome Bonus now…Trillonario will double your first deposit, with a HUGE FREE Bonus. Trillonario Casino is consistently rated one of the Best Online Casinos, with their Huge Variety of Games, Fast Withdrawals, and Awesome Rewards. Treat yourself, this Trillonario.com bonus is a limited time offer!
How do I claim my Trillonario bonus?


text:
oa Hybrid Nanocomposite Polymers For Tissue Engineering
By Ali Mohammed1
Affiliations: 1 Imperial College
Source: Qatar Foundation Annual Research Forum Proceedings, Qatar Foundation Annual Research Forum Volume 2013 Issue 1, Nov 2013, Volume 2013, BIOSP-08
DOI: https://doi.org/10.5339/qfarf.2013.BIOSP-08
The purpose of this project was to further investigate the characteristic properties of an inorganic-organic hybrid material with respect to its potential application in the field of tissue engineering. The organic component chosen for this project was a co-polymer 2-hydroxyethyl methacrylate (HEMA) and 3-trimethoxysilyl propylmethacrylate (TMSPMA), able to crosslink the polymer to the silica network via hydrolysis and condensation of the alkoxysilane functional group. Copolymers of HEMA-TMSPMA were made by the process of free radical polymerization (FRP), using azobisisobutyronitrile (AIBN) as a thermal initiator. Hybrid monoliths were then produced by the sol-gel process with hydrolysed tetraethyl orthosilicate (TEOS) and HCL solution as the inorganic precursor. The HEMA:TMSPMA ratios used for this study were 200:1, 100:1, 50:1, 20:1 and pure HEMA, at a concentration of 60wt% organic, to allow for comparison on the effect of crosslinking on the hybrids properties. Characterization of the copolymer and hybrid monoliths determined their chemical and physical properties. Characterisation techniques included Proton Nuclear Magnetic Resonance (HNMR), Gel Permeation Chromatography (GPC), Fourier Infrared Spectroscopy (FTIR), dissolution study in TRIS solution and which was analysed using Inductively Coupled Plasma (ICP), Thermo-Gravimetric Analysis (TGA), X-Ray Diffraction (XRD), compressive strength testing and Scanning Electron Microscopy (SEM). These methods were used to determine the molecular composition, mechanical properties and characteristic degradation of the copolymers and monoliths. HNMR showed that the FRP process produced highly polymerised copolymers. The sol-gel process produced successful crack-free monoliths with an average gelation/drying period of 3weeks and average of 4 crack free monoliths from samples of 10 for the optimised sol-gel process. The 3 week dissolution study showed a reduction in silica ions release rate and plateaued at a lower concentration with increasing TMSPMA content and hence a higher degree of cross-linking, with a plateau of Si release between week 2 and 3. XRD shows that no crystalline structures formed on the surface of the hybrids, which is expected as TRIS doesn't contain phosphorus or calcium meaning that no precipitates are expected. Mechanical testing shows that the 200:1 HEMA-TMSPMA monoliths have the highest compressive strength, and Pure HEMA monoliths are the most brittle as expected by the materials natural character, with values of 134.6 ± 19.80 MPa and 42.6 ± 17.39 MPa respectively.
/content/papers/10.5339/qfarf.2013.BIOSP-08
http://instance.metastore.ingenta.com/content/papers/10.5339/qfarf.2013.BIOSP-08
10.5339/qfarf.2013.BIOSP-08


Don't Eat the Paste: Tulips in the Sun to color!
Tulips in the Sun to color!
In Anchorage, Alaska right now it's about 50 degrees Fahrenheit. I'm putting out seeds that are safe for before the final frost, and my rhubarb is starting to come up. For all of you who are waiting for spring, I hope you enjoy this coloring page!
You can print the blank Tulips in the Sun coloring page below. Click the images for larger versions.


Never one to just accept a quick answer, I asked if that was more than what someone buying a used home would have. She told me that was just the application paperwork and it was not completed yet.
She went on to tell me that by the time the entire application would be ready for submission for a loan with the bank, the stack could be twice as thick.
OMG! And that was just the application.
The actual loan paperwork for new construction could add another 6-8" to the total.
Having learned that I write a blog about the modular housing industry she went on to say that it did not add anything to the paperwork except the appraiser's report might have an extra page or two about it being a manufactured home, a point I did not wish to explore with her at that moment.
Remembering back to the good old days in the '90s when I was a Realtor, the bank's paperwork could be contained completely within a single manila folder wrapped with a rubber band.
"What changed" I asked. Her answer was short and quick. Dodd-Frank. "The biggest impediment to home buying that has ever happened in the history of home buying" she answered.
Not only has it slowed the process, it is also so complicated and updates on a weekly basis come from the Fed. She said that she and the other loan officers meet every week just to go over changes.
Not only is there a lot of paperwork, a lot of it is time sensitive meaning it has to updated as the loan process goes on. If something changes during the loan process it could mean more time wasted.


text:
package esi

import (
	json "encoding/json"

	easyjson "github.com/mailru/easyjson"
	jlexer "github.com/mailru/easyjson/jlexer"
	jwriter "github.com/mailru/easyjson/jwriter"
)

// suppress unused package warning
var (
	_ *json.RawMessage
	_ *jlexer.Lexer
	_ *jwriter.Writer
	_ easyjson.Marshaler
)

func easyjsonB318302DecodeGithubComAntihaxGoesiEsi(in *jlexer.Lexer, out *GetCorporationsCorporationIdStructuresCurrentVulList) {
	isTopLevel := in.IsStart()
	if in.IsNull() {
		in.Skip()
		*out = nil
	} else {
		in.Delim('[')
		if *out == nil {
			if !in.IsDelim(']') {
				*out = make(GetCorporationsCorporationIdStructuresCurrentVulList, 0, 8)
			} else {
				*out = GetCorporationsCorporationIdStructuresCurrentVulList{}
			}
		} else {
			*out = (*out)[:0]
		}
		for !in.IsDelim(']') {
			var v1 GetCorporationsCorporationIdStructuresCurrentVul
			(v1).UnmarshalEasyJSON(in)
			*out = append(*out, v1)
			in.WantComma()
		}
		in.Delim(']')
	}
	if isTopLevel {
		in.Consumed()
	}
}
func easyjsonB318302EncodeGithubComAntihaxGoesiEsi(out *jwriter.Writer, in GetCorporationsCorporationIdStructuresCurrentVulList) {
	if in == nil && (out.Flags&jwriter.NilSliceAsEmpty) == 0 {
		out.RawString("null")
	} else {
		out.RawByte('[')
		for v2, v3 := range in {
			if v2 > 0 {
				out.RawByte(',')
			}
			(v3).MarshalEasyJSON(out)
		}
		out.RawByte(']')
	}
}

// MarshalJSON supports json.Marshaler interface
func (v GetCorporationsCorporationIdStructuresCurrentVulList) MarshalJSON() ([]byte, error) {
	w := jwriter.Writer{}
	easyjsonB318302EncodeGithubComAntihaxGoesiEsi(&w, v)
	return w.Buffer.BuildBytes(), w.Error
}

// MarshalEasyJSON supports easyjson.Marshaler interface
func (v GetCorporationsCorporationIdStructuresCurrentVulList) MarshalEasyJSON(w *jwriter.Writer) {
	easyjsonB318302EncodeGithubComAntihaxGoesiEsi(w, v)
}

// UnmarshalJSON supports json.Unmarshaler interface
func (v *GetCorporationsCorporationIdStructuresCurrentVulList) UnmarshalJSON(data []byte) error {
	r := jlexer.Lexer{Data: data}
	easyjsonB318302DecodeGithubComAntihaxGoesiEsi(&r, v)
	return r.Error()
}

// UnmarshalEasyJSON supports easyjson.Unmarshaler interface
func (v *GetCorporationsCorporationIdStructuresCurrentVulList) UnmarshalEasyJSON(l *jlexer.Lexer) {
	easyjsonB318302DecodeGithubComAntihaxGoesiEsi(l, v)
}
func easyjsonB318302DecodeGithubComAntihaxGoesiEsi1(in *jlexer.Lexer, out *GetCorporationsCorporationIdStructuresCurrentVul) {
	isTopLevel := in.IsStart()
	if in.IsNull() {
		if isTopLevel {
			in.Consumed()
		}
		in.Skip()
		return
	}
	in.Delim('{')
	for !in.IsDelim('}') {
		key := in.UnsafeString()
		in.WantColon()
		if in.IsNull() {
			in.Skip()
			in.WantComma()
			continue
		}
		switch key {
		case "day":
			out.Day = int32(in.Int32())
		case "hour":
			out.Hour = int32(in.Int32())
		default:
			in.SkipRecursive()
		}
		in.WantComma()
	}
	in.Delim('}')
	if isTopLevel {
		in.Consumed()
	}
}
func easyjsonB318302EncodeGithubComAntihaxGoesiEsi1(out *jwriter.Writer, in GetCorporationsCorporationIdStructuresCurrentVul) {
	out.RawByte('{')
	first := true
	_ = first
	if in.Day != 0 {
		if !first {
			out.RawByte(',')
		}
		first = false
		out.RawString("\"day\":")
		out.Int32(int32(in.Day))
	}
	if in.Hour != 0 {
		if !first {
			out.RawByte(',')
		}
		first = false
		out.RawString("\"hour\":")
		out.Int32(int32(in.Hour))
	}
	out.RawByte('}')
}

// MarshalJSON supports json.Marshaler interface
func (v GetCorporationsCorporationIdStructuresCurrentVul) MarshalJSON() ([]byte, error) {
	w := jwriter.Writer{}
	easyjsonB318302EncodeGithubComAntihaxGoesiEsi1(&w, v)
	return w.Buffer.BuildBytes(), w.Error
}

// MarshalEasyJSON supports easyjson.Marshaler interface
func (v GetCorporationsCorporationIdStructuresCurrentVul) MarshalEasyJSON(w *jwriter.Writer) {
	easyjsonB318302EncodeGithubComAntihaxGoesiEsi1(w, v)
}

// UnmarshalJSON supports json.Unmarshaler interface
func (v *GetCorporationsCorporationIdStructuresCurrentVul) UnmarshalJSON(data []byte) error {
	r := jlexer.Lexer{Data: data}
	easyjsonB318302DecodeGithubComAntihaxGoesiEsi1(&r, v)
	return r.Error()
}

// UnmarshalEasyJSON supports easyjson.Unmarshaler interface
func (v *GetCorporationsCorporationIdStructuresCurrentVul) UnmarshalEasyJSON(l *jlexer.Lexer) {
	easyjsonB318302DecodeGithubComAntihaxGoesiEsi1(l, v)
}

redpajama_set_name: RedPajamaGithub


Check out the included CARFAX report which shows this vehicle to be a one-owner vehicle. As with all our vehicles that we sell, this one has an optional extended warranty available. Cash Buyers Welcome. Come In and Make A Deal! We are a short drive from Waverly! With a combined average 4.8 out of 5-star reviews on Google, Facebook, Cars.com, Edmunds.com and CarGurus.com, you can rest assured knowing that you'll be in good hands with our knowledgeable and friendly staff here at Mckinna Auto Sales. Working with Navy Federal or USAA? No problem, give us a call and we'll walk you through the process. We'll finance you!


text:
How's this for a premium ship idea: USS Edsall
By PzkwVIB, October 27, 2020 in General Game Discussion
new premium
dodging all the shells
1 comment in this topic
[DESS]
PzkwVIB
PzkwVIB 22
So, let me start by saying this is merely the theory crafting of a few old WoW's vets from a few years back that I decided to put on here. The Clemson-class Destroyer USS Edsall earned its reputation in the early days of WW2 (like most ships in the game) where it went up against the Tone-class Aviation Cruiser Chikuma, along with the Kongo-class Battleships Hiei and Kirishima, and survived for a few hours, dodging 8 and 14 inch shellfire respectively. It wasn't until dive bombers from the Kaga, Hiryuu and Souryuu came in that she was immobilized and subsequently sunk by the surface force.
So, what would the Edsall be in the game? Well, that's where the fun begins. We came up with this not long after the Concealment Module (tier 8 slot) was rebalanced to add in dispersion penalties for shots fired at it. Basically, it'd be a tier 5 Clemson with health and torpedo buffs fitting a tier 5 DD, but with the tier 8 module available for usage. Why that module? Simple. The Clemson-class sit very low in the water as it stands, and are in general hard to hit at range. Now imagine one of them with the increased dispersion values granted by the concealment module. Hopefully the reason to care is fairly self evident.
Now we get to the big question. How the hell is this thing balanced? Well, it is. You see, the guns would retain their 4.5-5 second reload time, the shells would still be 120mm, and the AA would still be laughable, and since it's now at tier 5 meaning it can see tier 6 carriers. It would be a bit of a departure and a rival for the Nicholas, but considering the Nicholas would have better DPM, better torps (maybe), and has "better" AA along with faster turning guns? I think they'd be a pretty good match as far as balance goes. What do the rest of you think?


text:
Râul Țibleș se poate referi la unul din următoarele cursuri de apă din România

 Țibleș - afluent al râului Bradu
 Țibleș - afluent al râului Someșul Mare, în zona Cristeștii Ciceului.
 Țibleș - afluent al râului Someșul Mare în zona Zagra.

Vezi și
 Munții Țibleș, o grupă muntoasă a Carpaților Maramureșului și Bucovinei, aparținând de lanțul muntos al Carpaților Orientali

Toponime românești

redpajama_set_name: RedPajamaWikipedia


text:
By James Suehs on April 9, 2021 • ( Leave a comment )
UFC Bantamweight Calls For Fight With Veteran Dominick Cruz
Sean O'Malley has officially announced who he would like to fight next. Coming off his bounce back KO of Thomas Almeida, O'Malley is looking at a step up in both competition and in the rankings.
O'Malley (13-1), posted a video on his Youtube channel titled "Suga Calls Out Who?" In which he lays out why Dominick Cruz should fight him.
"Sup Dom, heard you're looking for a big fight? Who's a bigger fight than me right now?" O'Malley asked while dribbling a basketball.
As O'Malley goes through the perspective bantamweight contenders, he explains why Cruz can't or shouldn't fight them. Then, he asks again, "Who's a bigger fight?"
A potential matchup between O'Malley and Cruz became a talking point after Chael Sonnen said he had received a text from Cruz saying he wanted to fight O'Malley.
Cruz (23-3), didn't rule out the fight completely, however he did tell ESPN's Ariel Helwani that Sonnen "made this story up 100%."
Now that the call out is official, we will have to wait and see Cruz's response and whether or not the UFC is on board with this perspective matchup.
UFC Champion Sterling Undergoing Neck Surgery
UFC on ABC 2. Vettori Vs. Holland – What's At Stake


CrystalClear ParaSalt is formulated to increase koi and goldfish electrolytic intake. Electrolytes are critical in building and maintaining a healthy slime coat. Electrolytes such as potassium are essential in wound repair and in times of heavy stress (ie – during water changes or clean-outs). Salt is excellent for mucous production when healing from a wound.
ParaSalt will also help ward off and remove most common protozoan parasites found in koi and goldfish such as: Dactylogyrus, Byrodcytulus, Epistylis, Trichodina and Chilodonella. ParaSalt™ can be used in a salt bath for heavy infestations or as a routine treatment to keep parasites from entering the pond environment.
Do not over apply ParaSalt and follow directions thoroughly for maximum affect. If you are unsure of the bath application please consult your local CrystalClear pond professional.


1 In a large frying pan over medium heat, melt the margarine.
2 Add apples and sauté until tender (about 10 minutes).
3 In a small bowl, mix the sugar, cinnamon, nutmeg and vanilla extract.
4 Pour over the apples and sauté another 3 minutes.
5 Serve hot or cold.


text:
The sexuality of the German Soldiers in WW2.
German camp brothels in World War II.
SS Blood Group Tattoos.
Hans-Georg Henke – 16 Year Old…
Hitler executed 84 German Generals
The Joseph and Magda Goebbels children.
Hitler's dog Blondi
Anneliese Kohlmann who whipped inmates…
Child soldier in the Soviet Union, 1944.…
What did the German soldiers of WWII think…
2 million German women aged 13-70 were…
Ilse Hirsch the female soldier.
Allied war crimes during World War II
The Dachau liberation reprisals: Upon the liberation of Dachau concentration camp, about a dozen guards in the camp were shot by a machine gunner who was guarding them. Other soldiers of the 3rd Battalion, 157th Infantry Regiment, of the US 45th (Thunderbird) Division , under command of Major General Robert Tryon Frederick killed other guards who resisted. In all, about 30 were killed, according to the commanding officer Felix Laurence Sparks, the commander who led the 3rd Battalion of the 157th Infantry Regiment . Later, Colonel Howard Buechner wrote that more than 500 were killed.
Eight weeks past his 90th birthday, Felix L. Sparks died in Colorado from complications due to pneumonia.
Secret wartime files made public only in 2006 reveal that American GIs committed 400 sexual offenses in Europe, including 126 rapes in England, between 1942 and 1945. A study by Robert J. Lilly estimates that a total of 14,000 civilian women in England, France and Germany were raped by American GIs during World War II. It is estimated that there were around 3,500 rapes by American servicemen in France between June 1944 and the end of the war and one historian has claimed that sexual violence against women in liberated France was common.
In the aftermath of the Malmedy massacre, in which 84 American prisoners of war were killed by their German captors near Malmedy, a written order from the HQ of the 328th US Army Infantry Regiment, dated 21 December 1944, stated: No SS troops or paratroopers will be taken prisoner but will be shot on sight. Major-General Raymond Hufft (US Army) gave instructions to his troops not to take prisoners when they crossed the Rhine in 1945. "After the war, when he reflected on the war crimes he authorized, he admitted, 'if the Germans had won, I would have been on trial at Nuremberg instead of them.'" Stephen Ambrose related: "I've interviewed well over 1000 combat veterans. Only one of them said he shot a prisoner … Perhaps as many as one-third of the veterans … however, related incidents in which they saw other GIs shooting unarmed German prisoners who had their hands up."
Oswald Rothaug the director of Nazi "special courts" or "Sondergerichts" at Nuremberg.
Friedrich Kussin, the first German General to be killed during Operation Market Garden.
Goering's Carinhalle.
German Flyer Ace Adolf Galland "Vati".
Jürgen Stroop, the destructor of the Warsaw ghetto.
Child soldier in the Soviet Union, 1944. Military use of children ...


text:
\section*{Introduction}

\paragraph{Disclaimer.} This text is aimed at non-physicists and does not concern itself with the feasibility of building a quantum computer. It treats quantum computation as a purely mathematical model. Conversely, much of the subtleties of knot theory have been omitted as an attempt to streamline the text.

\subsection*{Knot theory}
Knot theory is the mathematical study of an idealized model of knots. It primarily uses algebraic and geometric techniques to study topological objects.  A \emph{knot} is a smooth embedding $\kappa: S^1\hookrightarrow {\mathbb R}^3$, considered up to isotopy (smooth continuous deformations).

Informally, one thinks of a knot as any of the shapes that can be made by a perfectly elastic string which has been tangled in space and whose ends are glued together. We consider two such shapes to be the same knot if we can we can manipulate one in space to get the other without pulling the string through itself. They are represented by  \emph{knot diagrams}, which are curves in the plane with transverse self-intersections called crossings, which are represented as in Figure \ref{diagrams}. Knot diagrams which are related by a finite sequence of the operations in Figure \ref{rms} represent isotopic circle embeddings. From an embedding of a circle, one creates knot diagrams by projecting it to a plane, and from a knot diagram, one recovers a smooth embedding of a circle by resolving the crossings in the direction perpendicular to the plane in which the curve is drawn. Therefore, knot diagrams encode all the information needed to recover an isotopy class.

One of the oldest problems in knot theory is the question of obtaining an exhaustive and non-redundant list of knots. As there are countably infinitely many knots, these lists, called knot tables, are usually listed by the minimal number of crossings in a planar projection of the knot. The first such enumeration was Taits' ``First Seven Orders of Knottiness", which was inspired by Lord Kelvin's theory that atoms were small knotted vertices in aether, and that their properties came from the topology of the knots. While that model was both quite inaccurate, and gathered little attention, there is poetic justice in the way this idea motivated tools which are now used in the study of particle physics. For more historical details, the reader can consult \cite{Ga2016}, and more notably the references therein.

\begin{figure}[htpb]
    \centering
    \includegraphics[width=0.2\textwidth]{kno6.png}  \hspace{0.02\textwidth}
    \includegraphics[width=0.2\textwidth]{kno5.png} \hspace{0.02\textwidth}
    \includegraphics[width=0.2\textwidth]{kno4.png} \\
    \includegraphics[width=0.2\textwidth]{kno3.png} \hspace{0.02\textwidth}
    \includegraphics[width=0.2\textwidth]{kno2.png} \hspace{0.02\textwidth}
    \includegraphics[width=0.2\textwidth]{kno1.jpg}
\caption{Various diagrams of the unknot, from \cite{knotplot}.}
\label{diagrams}
\end{figure}

\subsection*{Quantum computing}
Classical computing can be summarized as encoding information in binary, modifying it using (usually deterministic) rules, and outputting a binary answer.

In contrast, quantum computing stores information as tensor products of elements of $\mathbb{C} \operatorname{P}^1=\{[z_0:z_1)]: z_i\in \mathbb{C}, \text{ and } z_0 \not=0 \text{ or } z_1 \not = 0, \ [z_0:z_1]\sim [\lambda z_0: \lambda z_1] \ \forall \ \lambda \in \mathbb{C}^*\}$. The smallest unit of information for a quantum computer is the \emph{qubit}. It is assigned an element of $\mathbb{C} \operatorname{P}^1$ called its \emph{state}, which is traditionally written using Dirac's bra-ket notation for ease of manipulation by \emph{gates} encoded as projective unitary matrices. Finally, the output is given by projecting to an orthonormal basis in a process called \emph{measurement}.

\paragraph{Example.} A qubit in the state $[\alpha:\beta]$ is written $\alpha \ket 0+ \beta \ket 1$. It measure to $\ket i$ with probability $|(\alpha \bra 0 + \beta \bra 1 ) \ket i|^2$. An example of a unitary transformation is the Hadamard gate, $H=\frac{1}{\sqrt 2}\left[\begin{matrix}1 & 1 \\ 1 & 1\end{matrix}\right] $. It acts on a single qubit, such as $H \ket 0 = \frac{1}{\sqrt 2} (\ket 0 + \ket 1)$.

Theoretically, a qubit is just a point on the projective line. Practically, a qubit is a transistor which can encode a state $\alpha \ket 0 + \beta \ket 1$ where $|\alpha|^2 + |\beta|^2 = 1$. A quantum circuit is then a sequence of physical forces acting on a collection of qubits. Qubits whose states are non-trivial tensor products are said to be \emph{entangled}. They are obtained by multiplying two unentangled qubits by some $4\times 4$ matrices.

\subsection*{Structure of the paper} In Section \ref{braid}, the algebraic background needed to understand the applications of knot theory in regards to quantum computing is presented. This consists of an introduction to knot invariants from the study of unitary representations of braid groups. Then, Section \ref{computer} explains the basics of a model of perturbation-resistant quantum computer and surveys the work that has been done to emulate how such a computer would implement a quantum circuit. In Section \ref{complex}, the converse interaction between knot theory and quantum computing is explored by comparing the classical and the quantum computational complexity of some knot invariants. Section \ref{conclusion} concludes with some open problems.

\section{Braid group representation} \label{braid}
\begin{quotation} \raggedleft
  \emph{God created the knots, \\ all else in topology is the work of mortals.}\\
    -- Dror Bar-Natan, modified from Leopold Kronecker.
\end{quotation}

A powerful source of information about the isotopy class of a knot diagrams is representation theory: the study of ways to associate a matrix to each element of a group. This gives the first interaction between knots and quantum computing, as knots can be associated to unitary matrices, although in a highly non-unique way.

\subsection{Braid notation}

A formal and authoritative source of information on knot theory is the frequently revised book by Burde and Ziechang, \cite{BZ2013}. The following draws from that text.

\subsubsection{Alexander's theorem} \label{sect - Alexander's theorem}

Braids are a convenient notation for knots and links. For our purpose, consider a \emph{braid diagram} on $n$ strands to be a collection of $n$ curves in the plane, oriented monotonically in the $x$-direction and crossing each other transversely. A braid is the equivalence class generated by a braid diagram up to the bottom two moves in Figure \ref{rms}.

\begin{thm}[Alexander, 1923]
Any knot can be represented as the closure of a braid.
\end{thm}

Here, the closure is the operation that is realised by gluing the thin lines in Figure \ref{closure} to the bold braid diagram. The knot or link obtained by closing $\beta\in B_n$ in such a way is called $\hat \beta$. By Vogel's algorithm \cite{Vo1990}, a knot diagram can be put into a braid-like diagram in quadratic time.

\begin{figure}[ht]
    \centering
    \includegraphics[width=0.7\textwidth]{braid.png}
   \caption{The braid $\sigma_1 \sigma_2^{-1}\sigma_1 \sigma_2^{-1}\sigma_2\sigma_1^{-1}\sigma_2\in B_3$ closing to a link.}
   \label{closure}
\end{figure}

\subsubsection{Braid groups}

Fix $n\in \mathbb{N}$, $n\ge3$. The braid group on $n$-strands, denoted $B_n$ is defined as the set of finite words in the alphabet $\{\sigma_1^{\pm1}, \ldots \sigma_{n-1}^{\pm 1}\}$, subject to the relations:

\begin{enumerate}
      \item Invertibility, $\sigma_i\sigma_i^{-1}= \sigma_i^{-1}\sigma_i=1$, where $1$ is also written as the empty word.
    \item Far commutativity, $\sigma_i^\epsilon\sigma_j^\eta=\sigma_j^\eta\sigma_i^\epsilon$ for all $|i-j|>2$, and $\eta, \epsilon \in \{-1, +1\}$;
    \item Yang-Baxter relation, $\sigma_i\sigma_{i+1}\sigma_i= \sigma_{i+1}\sigma_i\sigma_{i+1}$.

\end{enumerate}

The first relation justifies the use of the name `group' for this object. The generator $\sigma_i$ correspond to the $i$th strand from the top crossing on top of the $i+1$st strand. Its inverse is the move where the $i$th strand crosses behind the next. A word in that alphabet is read from left to right, follows the orders of the crossings in a braid diagram also from the left to the right.

Making the generators their own inverses yields the map $ B_n\to S_n$, which maps the braid group on $n$ strands to the symmetric group on $n$-elements, also known as the group of permutations. A braid $\beta \in B_n$ such that $\operatorname{ab}(\beta)=e$ is a \emph{pure braid}. By this definition as the kernel of a group homomorphism, the set of pure braids, $P_n$, also forms a group.

\subsubsection{Markov's theorem}

Braids are helpful for enumerating knots because the braid group admits orderings. However, even braid words which do not represent the same group element can have isomorphic closure.

\begin{thm}[Markov]
Let $\alpha\in B_n$ and $\beta\in B_m$, $n\le m$ be braids such that $\hat \alpha =\hat \beta$. Then, $\alpha$ and $\beta$ are related by a finite sequence of the following moves:
\begin{enumerate}
    \item Right stabilization, $\alpha\mapsto \alpha \sigma_n\in B_{n+1}$, and
    \item Conjugation, $\beta \mapsto \gamma \beta \gamma^{-1}$ for some $\gamma\in B_m$.
\end{enumerate}
\end{thm}

This explains why checking whether two braids represent the same knot is heuristically harder than a word isomorphism problem in a finitely generated group. It is well-known that a general word isomorphism problem in a fixed group is not solvable by a deterministic algorithm in polynomial time. Because of the stabilization operation, braids can only be compared as elements of a formal closure of the braid groups, $B_*=\cup_{n=2}^\infty B_n$.

\subsection{Invariants}
A function on knot diagrams which assigns the same value to all representatives of a knot is called a \emph{knot invariant}. Knot theorists say that some invariant $f$ dominates $g$ if there exists a pair of knots $K_1$ and $K_2$ such that $g(K_1)=g(K_2)$, but $f(K_1)\not=f(K_2)$. This inequality is proof that $K_1$ and $K_2$ are not isomorphic, and this is how knot invariants are used. The strongest possible knot invariant is one which takes a different value for each knot. It is rewarded with the title of \emph{classifying invariant}, but from a computational point of view, either distinguishing or computing the values of such an invariant has to be at least as hard as distinguishing knots themselves. Therefore, one has to settle for knot invariants which are computable and which take values that are easily distinguishable, such as complex numbers or Laurent polynomials.

\iffalse
\subsubsection{Knot group}
Knots have a classifying invariant called the knot group and peripheral structure pair. This means that the two knots are isomorphic if and only if this invariant takes the same value on each of them. The peripheral structure is a word in the knot group, while the knot group is the fundamental group of the complement of a neighbourhood of the knot.

This result follows from the Gordon-Lueke Theorem. Writing presentations of the knot group and the peripheral structure can be done in linear time with the crossing number of the diagram, and the fact that it is a classifying invariant means that it contains all the information needed to recover the knot, while presenting it in a form to which abstract algebraic techniques can be applied. In particular, work of Markov and Novikov from the 1950 shows that for groups that arise as knot groups, the word isomorphism problem is solvable, but the group isomorphism problem is not.

The word isomorphism problem is a classic example from complexity theory, but not one that the current state of even theoretical quantum computing is well-equipped to handle. Instead, let's focus on invariants that are less strong, that is, which can take the same value on knots which are not isomorphic, but which output numbers.
\fi

\subsubsection{Skein formulas}

Some knot invariants are computed from an embedding in ${\mathbb R}^3$. Here, let's focus on computing from a knot diagram. Given as input one representative of a knot or link, it is possible to check that the function is invariant over the isotopy class by applying Reidemeister's theorem.

\begin{thm}[Reidemeister]
Two oriented link diagrams represent isomorphic links if and only if they are related by a finite sequence of the moves depicted in Figure \ref{rms}.
\end{thm}

\begin{figure}[htbp]
    \centering
    \includegraphics[width=0.5\textwidth]{RMs.png}
    \caption{The three types of Reidemeister moves.}
    \label{rms}
\end{figure}

To construct a knot invariant, look at the diagram as the sum of its parts. That is, define a function $f$ on the set of knot diagrams to be such that

$$ Af(K_+)+ Bf(K_-)=Cf(K_0)+Df(K_\infty),$$

where the diagrams $K_+, K_-, K_0$, and $K_\infty$ are diagrams which agree everywhere except for the neighbourhood of one crossing in which they look like the sub-diagrams of Figure \ref{skein}. Then, choose the values of $A, B, C, D$ such that the function $f$ is invariant under those moves. \label{polyinv}

One such solution is the homflypt polynomial, which is given by the following skein relation:
$$ aP(K_+)|_{(a,z)}-a\-P(K_-)|_{(a,z)}=zP(K_0)|_{(a,z)},$$
with the condition that if $U$ denotes the unknot (the knot which admits a planar diagram with no crossings), then $P(U)=1$. Except for some special values of $(a,z)$, computing this invariant requires considering $2^c$ diagrams when starting with a knot that has $c$ crossings. This is an exponential time algorithm, far slower than the theoretical computer science ideal of \emph{efficient}, a label only applied to polynomial time algorithms. A quicker way to obtain information about the homflypt polynomial of a knot is explained in Section \ref{vertigan}.

\begin{figure}[ht]
    \centering
    \includegraphics[width=0.75\textwidth]{skein.png}
   \caption{The different ways to connect four nearby points in a knot diagram.}  \label{skein}
\end{figure}

\subsubsection{Coloured Jones polynomials}

The Jones polynomial is a 1-variable specialisations of the homflypt polynomial. It has other generalizations called the coloured Jones polynomials which were originally defined by computing the invariant of a link formed by replacing the knotted curves with $n$ parallel copies of them, yielding the \emph{cable} of the link. Recently, \cite{HL2018} gave an extensive analysis of an algorithm which computes the coloured Jones polynomials from the original knot. They found that the computation time grew both with the number of crossings and the number of colours.

\subsubsection{Gassner matrices}

A group representation is a homomorphism $\Phi$ from a group $G$ to the automorphism group of a vector space, $\operatorname{Aut}(V)$. This means in particular that for any $g, h\in G$, $v\in V$, $\Phi(gh)(v)=\Phi(g)\Phi(h)(v)$. Given a basis, automorphisms of finite vector spaces are usually written as matrices. A representation is said to be \emph{unitary} if it maps every element of the group to a unitary matrix, that is, one whose inverse is its own conjugate transpose. The usual Jones polynomial is computable as a trace of a unitary representation of the pure braid group. More details about this constructions are found in \cite{BN2014}. For technical reasons, it can only be called a representation for pure braids, but the corrections for the general braid group are computationally inexpensive and theoretically un-illuminating. This representation is defined first on generators by mapping $\sigma_i \in P_n$ by
$$\sigma_i\longmapsto I_{i-1} \oplus\left(\begin{matrix}1-t & t \\ 1 & 0\end{matrix}\right)\oplus I_{n-i-1}\in \operatorname{Aut} (\mathbb{C}^n).$$

Then we can extend this map to the entire braid group by sending any word $\sigma_{i_1}\sigma_{i_2} \dots \sigma_{i_k} \in B_n$ to the product of the matrices assigned to its generators. Then to compute the Jones polynomial of any knot, we can first represent it as a braid as described in section \ref{sect - Alexander's theorem}, compute the representation of this braid, and then compute a certain trace of this matrix. In \cite{AJL2006}, it is shown that such a computation is efficiently implementable as a quantum circuit.

\section{Topological quantum computers} \label{computer}

\begin{quotation} \raggedleft
\emph{The final test of every new mathematical theory is its success\\ in answering pre-existent questions that the theory was not designed to answer.\\}
-- David Hilbert, 1926.
\end{quotation}

Topological quantum computation is a fault-tolerant model of quantum computation which seeks to encode the state of a computation in topological data of a system as opposed to local data, which makes it naturally resistant to error caused by perturbation. It uses theoretical 2D quasi-particles called non-abelian anyons (which are believed to exist \cite{FKLW2003}) which have the property that exchanging them in space can cause arbitrary unitary transformations to be applied to their states, in contrast with fundamental 3D particles such as fermions or bosons which only experience a phase shift of -1 or 1 respectively when exchanged. Interestingly this model is connected to braids and the Jones polynomial.  In this section we describe a version of topological quantum computation which allows one to implement algorithms designed for the traditional quantum circuit model. We follow the approaches found in \cite{FS2018} and \cite{FKLW2003}, and more details can before found in each of these texts.

\subsection{Initialization}

A topological quantum computation is initialised by creating pairs of Fibonacci anyons (a certain kind of non-abelian anyon) from the vacuum. When two Fibonacci anyons -- from now, on simply anyons -- are fused they have the chance to either annihilate to the vacuum or combine into one new anyon. However the net charge of a system of anyons is always conserved, which has the consequence that a pair of anyons created from the vacuum will always annihilate when fused. During the computation we will exchange the position of these particles in space which will cause their states to evolve by a unitary operation and hence other fusion outcomes become possible. To mimic the quantum circuit model we will further group the pairs of anyons into groups of four (containing two pairs) which will represent one qubit. At the end of our computation we will fuse a fixed pair of anyons in each qubit to determine the result of our computation. In the event that they annihilate we consider the qubit to being measured as a $\ket{0}$, and in the event that they combine we consider it to be a $\ket{1}$. Since initially our anyon pairs will always annihilate, our qubits always start in the  $\ket{0}$ state.

\subsection{Computation}

We now perform a computation by exchanging the positions of the anyons in space. When we do this a unitary operator is applied to their state which can change both the possible outcomes of fusion and the probabilities that each fusion outcome occurs. Swapping adjacent anyons in the plane braids the path of the anyons in 2+1 spacetime as seen in figure \ref{anyons}. Hence performing a sequence of swappings among all the anyons in the system traces out a braid in 2+1 spacetime, where each crossing corresponds to an exchange of anyons and hence an application of a unitary operator. Braids which entangle anyons from two different qubits literally produce entangled quantum states, while braids which act upon anyons within the same qubit correspond to one-qubit operators. It can then be shown \cite{FLW2002} that we can design a braid which approximates any unitary operator to arbitrary precision, in particular the common quantum gates used to form a universal gate set in the circuit model. Thus we can implement any quantum circuit by composing the braids corresponding to the gates used in the circuit in the order that they are applied.

\begin{figure}[ht]
    \centering
    \includegraphics[width=0.5\textwidth]{anyons.png}
    \caption{Swapping two particles in the plane and the corresponding braid in 2+1 spacetime.}
    \label{anyons}
\end{figure}

Since a topological quantum computation is solely dependent on the topology of the braid, the computation will be unaffected by local perturbations of the system, which is in contrast to other proposed implementations of quantum computation where data is stored locally, and hence is very sensitive to local changes.

\subsection{Measurement}
Once the computation is performed we measure the states of the anyons by fusing them together to determine the result of the computation. Fibonacci anyons are called  anyons because the amount of possible fusion outcomes in a system of $n$ anyons is given by the $n$th Fibonacci number. But when we are implementing a quantum circuit only some of these outcomes will correspond to basis states in the quantum circuit model, which we will call computational states. Hence we will want to be careful to design braids which only lead to fusion outcomes that correspond to one of these states (alternatively we could allow for error). When we have this guarantee we can measure the value of a qubit simply by fusing a fixed pair of anyons within the qubit. If the pair of anyons annihilate then we consider the qubit to have a value of $\ket{0}$ and if the pair of anyons combine we consider the qubit to have a value of $\ket{1}$. After measuring each of the qubits we will have a string of bits which we will take to be the result of the computation.

\begin{figure}[ht]
    \centering
    \includegraphics[width=0.6\textwidth]{qcircuit.png}
    \caption{An example of a quantum circuit on 2 qubits acting by braiding together two quartets of anyons. The merging on the right hand side denotes fusion.}
\end{figure}

When the braids are designed properly, every individual qubit will have always have a net charge of $0$ meaning that it will annihilate if all four anyons in the qubit are fused. But pairs of anyons do not have to maintain this property so that fusing two anyons can result in them annihilating or combining. This is why only one pair of anyons has to be fused in order to determine the fusion outcome in each qubit, because the fusion outcome of the other pair will be entirely determined by the first. If the first pair annihilated then the second pair must annihilate. If the first pair combined into an anyon, then the second pair must do so as well, and when these two new anyons are fused they will annihilate. But because of this dependence, braiding the anyons from the second pair in a qubit will still effect the fusion outcomes of the system despite not being directly measured.

\subsection{Relationship with the Jones Polynomial}
Given a braid implementing a certain topological quantum computation, it turns out that a formula for computing the probability that the computation returns the all $0$ string is equivalent to an evaluation of the Jones polynomial of knot which is a certain closure of this braid. This is described in detail in \cite{FS2018}. This has implications for quantum complexity theory and the complexity theory of knot invariants. Since we believe calculating the exact probability that a quantum circuit outputs a certain value is a hard problem, this is further evidence that exact evaluations of the Jones polynomial is very hard. Since we believe even approximating this probability should be difficult for classical computers, this suggests that approximating evaluations of the Jones polynomial is a candidate for a problem which can only be solved efficiently by quantum computers.

\iffalse
\subsection{Universal gate set}

Realisations of quantum gates for this model of topological quantum computing have been found using exhaustive search algorithms. A mathematician may want to think of this as a physical instance of an automorphism group, while a physicist would enjoy looking at this as a mathematical model for the physical system. \note{References from each approach}

\subsubsection{Another model of topological quantum computer}

To give an explicit result which uses the representation presented above, consider the result from \cite{FLW2002} that there exists a representation of $B_{2n}$ which is dense in $\operatorname{PSU}(H)$ for $n\ge 3$, where $H$ is a 2$n$-dimensional Hilbert space which can be interpreted as the register of a quantum computer. The restriction to the values of $r$ is due to the other numbers corresponding to roots of unity which do not generate a dense set in $\mathbb{C}$. The group $\operatorname{PSU}(H)$ is the set of unitary matrices with determinant $\pm 1$, modulo multiplication by scalar multiples of the identity matrix.

\subsubsection{The one-clean qubit model}
\cite{JW2009} \problem{This was mentioned above.}
\fi
\section{Computational complexity of the homflypt polynomial} \label{complex}

\begin{quotation} \raggedleft
   \emph{ Using this exponentially large computational space, it is possible, at least in principle, for quantum computers to efficiently solve classically difficult problems. }\\
-- Bernard Field and Tapio Simula, 2018.
\end{quotation}
Recall the homflypt polynomial-valued invariant defined in Section \ref{polyinv} and that the (2-coloured) Jones polynomial of a knot $K$, is determined by $P(K)$. It is shown in \cite{JVW1990} that the Jones polynomial is essentially as difficult to compute as the homflypt polynomial. Throughout this section, the computation time is considered to be a function of the crossing number.

\subsection{Classical computation}
There is a subtle difference between the existence of a mathematical formula for a quantity and the existence of an algorithm to compute it. Without going into the subtleties of works mentioned, this section reviews some of the work that has been done about the computational complexity of some polynomial knot invariants.

\subsubsection{Vertigan's algorithm} \label{vertigan}

As computing the entire homflypt polynomial is slow, we can compute individual coefficients efficiently and classically. Such invariants are said to be of \emph{finite type} since they can be computed on knots with some finite amount of information missing, up to a point at which they vanish.

In this case, write the homflypt polynomial as a polynomial in $z$ with coefficients depending on $a$. If $P(K)|_z= \sum_i c_i(a) z^i$. Then, there is an algorithm to compute $c_i$, that is presented in \cite{Pr2017} and attributed to Vertigan that yields the following result.

\begin{thm}
The (classical) time complexity of computing the coefficient $z^{2i+1-k}$ of the homflypt polynomial of a $k$-component link is bounded by a polynomial in the number of crossings of the link of degree linear in $i$.
\end{thm}

Recursive formulas for the coefficients allow us to consider a table of only $n^2$ knots with decreasing complexity, but we may need to use the homflypt polynomial of these knots exponentially many times. Saving those values to be re-used requires a polynomial amount of memory. See \cite{Le2018} for a Mathematica program which is based on this algorithm.

\subsubsection{Classical computational complexity}
Since the definition of the homflypt polynomial fits on a single line, it could be expected that there is a fast algorithm to compute it that nobody has just been clever enough to find. However, its computational complexity is bounded below by that of the Jones polynomial.

\begin{thm} [Jaeger, Vertigan, Welsh, 1990]
Determining the Jones polynomial of an alternating link is \#P-hard.
\end{thm}

This result is significantly more general than it sounds, because not only roughly half of the links admit an alternating diagram (that is, a diagram in which travelling along any component, one crosses crossings in an alternating over-then-under fashion), but the computation of invariants using skein formulas is simpler on alternating diagrams.

\begin{thm}[Kuperberg, 2009]
Fix a link diagram $L$, a principal root of unity $t=e^{2\pi i/k}$, $k>6$ or $k=5$, and $0<a<b$. Given that $|V(L)|_t|<a$ or $|V(L)|_t|>b$, it is \#P-hard to decide which inequality holds.
\end{thm}

\#P is the class of enumeration problems associated with NP. This problem is reduced to an enumeration problem is by an algorithm which considers only using paths in the skein tree which contribute non-trivially to the final polynomial.

\subsection{Quantum computation}

The quantum algorithms that compute the coloured Jones polynomials do so only at specific values since quantum circuits can only encode matrices with entries in $\mathbb{C}$, and not with entries in the more general ring $\mathbb Z [q^{-1/2}, q^{1/2}]$. To get an idea of how far quantum computing does have a chance to go, one should think of the quantum circuits described as sequences of unitary transformations as comparable to describing classical computing as a Turing machine acting on a strip of symbols. It is well knows that this is equivalent to algorithms in natural languages, but creating a machine that works exactly like Turing's theoretical model is tedious.  More discussion of the limitations of the quantum circuit model can be found in \cite{BBBV1997}. This yields hope that there is much room for improvement in this field of research, but unfortunately muddies attempts to compare the algorithms written for a computer algebra system with those written for a quantum computer. Moreover, a quantum computer cannot be asked to output the exact numerical answer with probability 1. The best it can do is provide an approximate answer, or in the case of decision problem,  yield a correct answer with high probability.

\subsubsection{Additive approximation}

Given a function $f: \mathbb{C}\to [0,1]$, a quantum algorithm $A$ gives an \emph{additive approximation} of $f$ if there exists $\epsilon >0$ such that for any $z\in \mathbb{C}$, $|f(z)-A(z)|<\epsilon$ with high probability.

\begin{thm}[Aharonov, Jones, Landau, 2006] There exists a quantum algorithm which, for a braid $\beta\in n$ of length $m$, gives an additive approximation to $V(\hat \beta)|_{e^{2\pi i/k}}$.
\end{thm}

The additive approximation can be used to distinguish knots if the values can be bounded away from each other. The computation can be halted as soon as the polynomials are shown to differ at at least one point. This is something which may be useful when dealing with very large knots, where a precise analysis is beyond the memory resources of current computers.

For example, if two quantum circuits $C_1$ and $C_2$ are claimed to output the same measurement, the likeliness of this statement being true can be tested by evaluating the Jones polynomial of the braids obtained by representing the two circuits as the braids, respectively $b_1$ and $b_2$, that would be created by the anyons in a topological computer running those circuits. If the braids are isomorphic, then the outputs have to agree, and so do the Jones polynomials $V(\hat b_1)$ and $V(\hat b_2)$.

\subsubsection{Quantum complexity of computing the Jones polynomial}

According to \cite{Wa}, the possibility that NP is contained in BQP is a motivation for research in quantum computing. The complexity class {BQP} (bounded error quantum polynomial time) contains problems that can be solved efficiently on a quantum computer in polynomial time, and correctly with probability $2/3$.

In evaluating the polynomial a quantum computer creates uncertainty and needs to be run multiple times. Since the Jones polynomial is a meromorphic function, the whole polynomial is determined by its value at a sufficient large number of primitive roots of unity. Moreover, knowing that its coefficients are integers compensates for the error introduced by the approximation.

It turns out that estimating even the regular Jones polynomial is a rather general problem for quantum computing. A common theoretical construct used to analyse the relationship between complexity classes is the \emph{oracle}. It is a single gate which computes a function without the computer or the mathematician needing to know how this function is defined.

\begin{thm}[Bordewich, Freedman, Lovasz, Welsh, 2005]
Let $A(\beta,z)$ be an oracle that computed the Jones polynomial of a braid $\beta$ at $z$, then \emph{BQP} $\subset \operatorname{P}^A$.
\end{thm}

In other words, giving an additive approximation of the Jones polynomial is a BQP-complete problem. For more information about the kind of problems that are in BQP, see \cite{Wa}.

\section{Conclusion} \label{conclusion}

\begin{quotation} \raggedleft
   \emph{Slowly, the implications of the idea began to be understood. To begin with it had been too stark, too crazy, [...] then some phrases like `Interactive Subjectivity Frameworks' were invented, and everybody was able to relax and get on with it.} \\
   -- Douglas Adams, in \emph{Life, The Universe And Everything}, 1982.
\end{quotation}

Knot theory and quantum computing intersect in many ways that were beyond the scope of this introductory paper. It is only fair to a reader who made it this far to at least mention them. There is the result of \cite{WY2008} that a promise problem, choosing between an upper bound and a lower bound for the magnitude of the Jones polynomial, is QCMA-complete (the complexity class QCMA is denoted MQA in \cite{Wa}). The One Clean Qubit computation model, as explored in \cite{JW2009}, also employs braid representation, and finally, topological quantum field theory entangles quantum computing and knot invariants in a natural way. A concise reference for that last topic is \cite{FLW2002}. Let us now state, as promised, some open problems in quantum computing coming from knot theory.

\paragraph{1. Planarity of intersection sequences.} Given a knot diagram, assign to each crossing a number, and, travelling along the knot, write down the numbers as they are encountered and how (under of over) the crossing is crossed. The result is the intersection sequence, also known as Gauss code, of the knot. In general, words that look like intersection sequences do not come from knot diagrams. The planarity problem is to determine if a given sequence is the intersection sequence of a knot. There are many algorithms which yield a non-deterministic solution to the planarity problem. Is this problem in NP? What is its quantum computational complexity?

\paragraph{2. Quantum algorithms for finite type invariants.} Coefficients of the homflpt polynomial are not the only kind of finite type invariants. There appears to be a gap in the literature around quantum algorithms for other finite type knot invariants.

\paragraph{3. Geometry of quantum processors.} The model of topological quantum computer presented here, like many other quantum computers assumes that qubits are forced to live in processors consisting of a piece of plane. This reduces the number of elementary interactions between them. This can be changed by instead placing the qubits on a surface of a higher genus. The corresponding mathematical object is the fundamental group of the configuration space of $n$ points on a surface. Could such a computer be built? What kind of time savings can be done by augmenting the number of direct neighbours a qubit has?\\

\textit{Acknowledgements. } We would like to thank Dror Bar-Natan and Hans Boden for their continual support and the many energizing conversations. This work was financed by the National Science and Engineering Research Council of Canada, and completed as part of course work for \emph{Quantum Computing: Foundations to Frontier} given by Henry Yuen at the University of Toronto in the Fall of 2018.

redpajama_set_name: RedPajamaArXiv


Gilvanov Bulat was born in 1972 in Elabuga. From 1980 to 1987 studied in Elabuga to artistic school the name of I. I. Shishkin. In 1991 made off the artistic separation of Chelny of school of arts. In 1997 made off the graphic faculty of the Saint Petersburg state academic institute of painting, sculptures and architectures the name of I.E. Repin.


Harry Kewell's farewell from professional football proved a bittersweet occasion as Western Sydney Wanderers secured a dramatic 3-2 win in Melbourne Heart's final match of the Hyundai A-League 2013-14 season.
Harry Kewell-s farewell from professional football proved a bittersweet occasion as Western Sydney Wanderers secured a dramatic 3-2 win in Melbourne Heart-s final match of the Hyundai A-League 2013-14 season.
But Kewell, 35, demonstrated his touch, awareness and class - which made him a household name in Australia and abroad - still remained with him in his final professional match.
Western Sydney Wanderers set out to spoil Kewell-s farewell, opening the scoring via the head of captain Nikolai Topor-Stanley. But Melbourne Heart hit back through an incredible strike from marquee Orlando Engelaar just before the break.
Melbourne Heart created a number of fantastic chances but the goalkeeping heroics of Ante Covic kept the scores level, before Jason Hoffman emerged in the 72nd minute and dispatched a deflected strike to give Melbourne the lead.
But two late goals - one from substitute Brendon Santalab in the 81st minute and a goal from Youssouf Hersi in the 86th - gave the visiting Wanderers all three points.
The result proved bittersweet for Kewell, who played the full 90 minutes, was instrumental in Engelaar-s goal and received a glowing reception and final applause - from a crowd of 10,003, including a boisterous travelling party of over 500 Wanderers supporters.
As he walked onto the pitch for the final time prior to kick-off, flanked by his four young kids and a guard of honour formed by both his Melbourne Heart teammates and the Wanderers, there was a collective sense of the magnitude of Kewell-s achievements and the legacy he has left on Australian football.
Despite not playing in Melbourne Heart-s previous two matches, Kewell looked at home once again on the pitch in his swansong, controlling the tempo of the match with each touch, but also illustrating the delicate flicks and flair that made him Australia-s golden boy of the Golden Generation.
In a fast-paced - and controversial - encounter, Kewell-s side looked to take the initiative early, as Stefan Mauk and fired in a shot before Jason Hoffman and Mate Dugandzic linked well down the left to create three early chances in the first 15 minutes.
Tomi Juric had the Wanderers- best chance of a frantic early spell, turning his marker and delivering a low shot, but Tando Velaphi saved well in the Melbourne Heart goal.
Jerome Polenz then struck an effort over the bar; before Kewell - the star of the show - illustrated his intelligence, 'dummying- a fantastic Robbie Wielaert pass all the way through to Dugandzic, only for the winger to skew a good chance wide in the 20th minute.
With tackles flying in from both teams, Hoffman was controversially penalised for a seemingly legitimate tackle in the 27th minute on Adam D-Apuzzo, and Wanderers marquee Shinji Ono curled in the resulting free-kick for Topor-Stanley to header home, against the run of play.
Velaphi was then forced to tip out a shot from distance from Juric, but it was Melbourne-s marquee who responded with the next goal.
Kewell rolled a quick free kick into the path of Engelaar, who unleashed an unstoppable drive off the post with Ante Covic beaten in the 34th minute. Engelaar ran straight to Kewell to dedicate it to his outgoing captain as the pair embraced.
Wanderers threatened again, but some expert defending from Wielaert, who squeezed in between the ball and Hersi in the box, denied the visitors a second goal.
Matthew Spiranovic was then forced to clear Jonatan Germano-s header off the line as the teams went into the break after an extremely entertaining half locked at 1-1.
A switch at the break saw Aziz Behich enter the fray for David Williams and it was Behich who nearly handed Kewell a goal in his finale.
Attacking down the left flank, Behich went on a stunning run before cutting back to Kewell whose effort required an incredible stop from Covic in the Wanderers goal.
Covic then bettered his first effort, tipping out a header from Germano from the resulting corner.
Engelaar tried to replicate his first-half effort with a powerful dipping strike from distance which skimmed the top of the net, but there was further controversy as Wanderers won a penalty when Mateo Poljak appeared to be sandwiched by Wielaert and Germano.
Ono struck his penalty onto the top of the Melbourne Heart cross-bar and in a dramatic turnaround, Hoffman broke down the right two minutes later and handed Heart the lead through a deflected effort in the 72nd minute.
But a fairytale ending was not to be for Kewell, as Wanderers claimed two late goals.
In an engaging and dramatic final chapter of Kewell-s incredible career, the number 10 still managed a broad smile as he walked around AAMI Park one final time to a touching reception from both sets of fans.


text:
@interface MHLoginBaseViewController ()

@end

@implementation MHLoginBaseViewController

- (void)viewWillAppear:(BOOL)animated{
    [super viewWillAppear:animated];
    /// 设置颜色
    [self.navigationController.navigationBar setBarTintColor:MH_MAIN_NAVIGATIONBAR_BACKGROUNDCOLOR_3];
}

- (void)viewWillDisappear:(BOOL)animated{
    [super viewWillDisappear:animated];
    /// 设置颜色
    [self.navigationController.navigationBar setBarTintColor:MH_MAIN_NAVIGATIONBAR_BACKGROUNDCOLOR_1];
}

- (void)viewDidLoad {
    [super viewDidLoad];
    self.view.backgroundColor = MHColorFromHexString(@"#F3F3F3");
}

- (UIStatusBarStyle)preferredStatusBarStyle{
    return UIStatusBarStyleDefault;
}

@end


text:
Los tiburones vaca o tiburones de seis y siete branquias son una familia de tiburones del orden  de los Hexanchiformes, caracterizados por presentar un par adicional de branquias. Están considerados como los tiburones más primitivos, dado que su esqueleto conserva algunas características ya extintas, con algunas adaptaciones. Pueden medir entre 1,4 y 5,5 metros.

Especies
Cuenta con unas cuantas especies:

 Género Heptranchias
 Heptranchias perlo, Tiburón de siete branquias (Bonnaterre, 1788)
 Género Hexanchus
 Hexanchus griseus, Tiburón de seis branquias gris (Bonnaterre, 1788)
 Hexanchus nakamurai, Cañabota de ojos grandes Teng, 1962
 Género Notorynchus
 Notorynchus cepedianus, Tiburón siete branquias de nariz corta Poey, 1861
 Género Paraheptranchias † PFEIL, 1981
 Paraheptranchias repens † (Probst, 1879)
 Paranotidanus "Eonotidanus" contrarius † (Munster, 1843)
 Paranotidanus intermedius † (Wagner, 1861)
 Paranotidanus munsteri † (Agassiz, 1843)
 Paranotidanus serratus † (Fraas, 1855)
 Notidanoides † Maisey 1986
 Género Notidanodon † Cappetta, 1975
 Notidanodon antarcti † Grande & Chatterjee, 1987
 Notidanodon brotzeni † Siverson, 1995
 Notidanodon dentatus † (Woodward, 1886)
 Notidanodon lanceolatus † (Woodward, 1886)
 Notidanodon loozi † (Vincent, 1876)
 Notidanodon pectinatus † (Agassiz, 1843)
 Género Pseudonotidanus † Underwood & Ward, 2004
 Pseudonotidanus semirugosus † Underwood & Ward, 2004
 Género Weltonia † Ward, 1979
 Weltonia ancistrodon † (Arambourg, 1952)
 Weltonia burnhamensis † Ward, 1979
 Familia ?Mcmurdodontidae
 Género Mcmurdodus † White, 1968
 Mcmurdodus featherensis † White, 1968
 Mcmurdodus whitei † Turner, & Young, 1987

Imágenes

Véase también
 Anexo:Taxonomía de los tiburones
 Chlamydoselachidae

Referencias

Allen, Thomas B. The Shark Almanac.  New York:  The Lyons Press, 1999.  ISBN 1-55821-582-4

Enlaces externos