text:
Talk:Public International Law/Human Rights Law/Human Rights Protection/United Nations Human Rights System

Review: 8 June 2023
Dear Grażyna and Thamil,

Thanks also form my side, I think this is a great overview, but the chapter needs a final brush. I left only few additional comments.

Best, Raffaela --129.132.99.74 (discuss) 12:52, 8 June 2023 (UTC)

Review: 5 June 2023
Dear Grażyna and Thamil,

I like that your chapter provides students with a good overview of the different elements of the UN Human Rights system and that it also contextualises this system. I have also added some comments regarding details and fully endorse everything Max has written.

Warmly Sué

Review: May 25, 2023
Your chapter provides a good and easily understandable overview of the UN human rights system. By presenting the key events in its evolution in a concise yet informative manner, you have successfully laid the foundation for understanding the evolution of human rights. What sets your approach apart is the critical lens through which you examine these events. It is refreshing to see a balanced perspective that acknowledges both progress and shortcomings in the realm of human rights. You also have effectively captured the essence of the procedural mechanisms, providing students with a clear understanding of how human rights are protected, enforced, and monitored in the UN system. This comprehensive representation enhances the overall quality of your chapter.

While your chapter provides a solid foundation, I would like to suggest incorporating a few more sources to further enrich the content.

You will also find some comments in your chapter in which I elaborate on something more specific. To view these comments, open your chapter page and click "Edit" in the top-right menu bar.

Some minor things: that I have made some linguistic improvements to the text
 * Note that the following parts are still missing: required knowledge, learning objectives, conclusion
 * There are some issues with the formatting of the footnotes, which are not consistent with the OSCOLA citation style. To ensure the chapter is fully compliant with OSCOLA, you should review the formatting of the footnotes and make the necessary corrections.
 * You could add some links to other chapters of the textbook.
 * Note

--Max Milas (discuss • contribs) 14:58, 25 May 2023 (UTC)

Review: 26 August 2021
Dear Thamil & Grażyna,

Thank you for this first outline! As this outline seems to be work in progress, a feedback regarding content is difficult. I love your idea to have section about complementarity!

I would suggest to adjust your structure a bit. You could start with briefly describing substantive human rights of the UN system (esp. UDHR, ICCPR & ICESCR). Afterwards you could describe the institutional system beginning with Charter based system (esp. non-judicial mechanisms) and treaty based systems.

Technically, following "Author" at the beginning of your chapter you can link to your user page (see, for example, my chapter on Case Analysis).

Thank you very much for your work and keep it up!

--Max Milas (discuss • contribs) 15:05, 26 August 2021 (UTC)

Review
Dear Authors

Thank you for sharing the outline of the chapter.

Considering this chapter gives an introduction to international human rights law, a few sub-topics can be valuable additions.

For instance, a sub-section on Special procedures/Rapporteurs and the UPR mechanism. Also, a sub-section on the nature/kind of obligations endorsed by the UN (protect, promote, provide, cooperate/coordinate) would be great.

Thanks once again for sharing your work. Deepa Kansra

Review: Andrés Rousset
1. The text is very good. It is clear and easy to read, which is important to talk about such a complex issue as the UN protection system.

2. Some technical modifications that would be necessary for a manual of international law.

2.1:

Instead of:

it should be read:

2.2:

Another recommendation for the table of treaties and treaty bodies.

When speaking of treaty bodies, both in practice and in the academy, it is common to use their abbreviations.

These are:

Committee on the Elimination of Racial Discrimination (CERD)

Committee on Economic, Social and Cultural Rights (CESCR)

Human Rights Committee (CCPR)

Committee on the Elimination of Discrimination against Women (CEDAW)

Committee against Torture (CAT)

Committee on the Rights of the Child (CRC)

Committee on Migrant Workers (CMW)

Subcommittee on the Prevention of Torture and other Cruel, Inhuman or Degrading Treatment or Punishment (SPT)

Committee on the Rights of Persons with Disabilities (CRPD)

Committee on Enforced Disappearances (CED)

You could be added in the second column

2.3:

In section C. "Charter based system", it is essential that the specials procedures are developed (even in a sub-chapter), all the information on the geographic and thematic mandates can be extracted from this link of the OHCHR: https://www.ohchr.org/en/special-procedures-human-rights-council

The special procedures are the most valuable tool of the United Nations, because they allow for the protection of human rights in countries that have not ratified the treaty or the competence of the Committee Max Milas (discuss • contribs) 16:50, 26 January 2023 (UTC)


text:
Talk:Public International Law/Human Rights Law/Human Rights Protection/European Human Rights System

Review: 9 June 2023
Dear Jens,

Thanks and congratulations also from my side - fantastic chapter, I added only some minor points.

Best,

Raffaela --Raffaela Kunz (discuss • contribs) 09:19, 9 June 2023 (UTC)

Review: 6 June 2023
Dear Jens,

Thank you for this amazing chapter! I have added very few comments on details, but, in general, I think this chapter is good to go.

Herzlich

Sué

Sué González Hauck (discuss • contribs) 10:47, 6 June 2023 (UTC)

Review: May 26, 2023
Your chapter provides a clear and concise overview, allowing students to gain a solid understanding of the subject matter while delving into important details. The chapter covers essential aspects of the European human rights system, allowing students to grasp its structure, key institutions, and legal framework. I also greatly appreciate the inclusion of critical perspectives in your chapter. The manner in which you introduce and define technical terms before incorporating them into the text is highly effective. This practice ensures that students, including those without prior knowledge of the subject, can follow the content with ease.

You will also find some comments in your chapter in which I elaborate on something more specific. To view these comments, open your chapter page and click "Edit" in the top-right menu bar.

Note that I have made some linguistic improvements to the text.

--Max Milas (discuss • contribs) 07:54, 26 May 2023 (UTC)

Review: 26 August 2021
Dear Jens,

Thank you for submitting this outline. I enjoyed reviewing it and I'm really looking forward to read the hole chapter in a few months. This looks like an amazing chapter that is really helpful for students. Regarding content I have nothing to add so far.

Technically, you could insert a link to your user page on wikibooks next to "Author" at the beginning of this page (see, for example, my chapter on Case Analysis).

Thank you very much for your work and keep it up!

--Max Milas (discuss • contribs) 15:12, 26 August 2021 (UTC)

comments on current draft
Hi Jens. Thanks for this. It reads well! A few comments below:

1) inter-State applications seem to have regained some relevance the last few years. Perhaps it is worthwhile noting this in a sentence.

2) the significant disadvantage requirement could perhaps also be mentioned when referring to the admissibility criteria (under ECtHR + procedures section)

3) On the issue of "backlash" and responses by States with AP, I take it that you will refer to the principle of subsidiarity?

4) Perhaps a couple of sentences to be added on the enforcement/monitoring of the implementation of ECtHR's judgments by the Council of Ministers?

5) In footnotes or weblinks you could refer to some of the resources available on the ECtHR's website? :)

Cheers! Mando

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/


text:
Talk:Public International Law/Human Rights Law/Human Rights Protection/Inter-American Human Rights System

Review: 12 June 2023
Dear authors,

Thanks also from my side, and I agree with Max & Sué that this is an important and nice chapter that, however, still needs a bit of work as the chapter remains a bit superficial and technical to date. I added some suggestions and possible references in the text, mainly relating to:

- Clarification of the relationship between Court & Commission; highlighting gatekeeping function of the Commission in the system and the fact that individuals cannot directly apply to the Court; - The part on the Commission is quite technical and imo the important role this body plays does not come out quite properly; - Reparations: important to add some additional references and case-law; - Conventionality control: I think its very important to explain how the court doctrinally construes this instrument which is quite emblematic for the rather "monist" perspective the Court takes. Form a European perspective, this is quite unique; I added some possible references.

Best, Raffaela --Raffaela Kunz (discuss • contribs) 13:57, 12 June 2023 (UTC)

Review: 6 June 2023
Dear Verena, Walter, and Andrés,

This chapter is a particularly important addition to our textbook and one the many things that sets it apart from other existing textbooks. Unfortunately, I think there is still quite some work to be done to make this chapter publishable. Apart from the aspects Max highlighted already, namely length and lack of footnotes, I would also highlight the need for more cohesiveness both within the sub-chapter and in relation to the sub-chapters on other regional human rights systems and on recurring themes in international human rights law. Please keep this cohesiveness in mind when revising the chapter. I have also added some comments on details and made some linguistic changes.

With best wishes,

Sué

Sué González Hauck (discuss • contribs) 19:09, 6 June 2023 (UTC)

Review: May 26, 2023
Your chapter offers a detailed introduction that covers important developments, rules, and institutions within the system. As it currently stands, the chapter exceeds the desired word count. To align with the overall structure of the textbook, I suggest reducing the length by approximately half, aiming for around 3,000 words. I understand that this may require significant revision and restructuring. I recommend reviewing the other chapters in the textbook that focus on specific human rights systems, which all adhere to a maximum word count of 3,700 words. You could consider my proposed suggestions for truncating certain sections. Alternatively, we could explore the option of including advanced text boxes on the Wikibooks platform to preserve the complete content, while omitting some of them in the printed version to adhere to the desired length.

I noticed that the second part authored by Walter and Andres lacks sufficient footnotes.

You will also find some comments in your chapter in which I elaborate on something more specific. To view these comments, open your chapter page and click "Edit" in the top-right menu bar.

Some parts of the chapter are still missing. It would be great if you could finish the chapter by the end of May at the latest. The sooner you finish, the better we can review your chapter and the more time you have to use our comments to improve the chapter. Be prepared to edit your chapter at very short notice if you hand it in late.

Some minor things:
 * Note that the following parts are still missing: required knowledge, learning objectives, conclusion
 * There are some issues with the formatting of the footnotes, which are not always consistent with the OSCOLA citation style. To ensure the chapter is fully compliant with OSCOLA, you should review the formatting of the footnotes and make the necessary corrections.
 * You could add some links to other chapters of the textbook.
 * Note that I have made some linguistic improvements to the text

--Max Milas (discuss • contribs) 10:32, 26 May 2023 (UTC)

Review: 26 August 2021
Dear Verena,

Thank you for submitting this outline. I enjoyed reviewing it and I'm really looking forward to read the hole chapter in a few months. This looks like a great chapter for the IACHR system. Regarding content I have nothing to add so far.

Technically, you could insert a link to your (en.wikibooks) user page next to "Author" at the beginning of this page (see, for example, my chapter on Case Analysis).

Thank you very much for your work and keep it up!

--Max Milas (discuss • contribs) 15:16, 26 August 2021 (UTC)

Outline Review 3 November
Dear Verena,

Thanks also from my side and I also don't have much to add at this stage. I think it would be great if some of the characteristic features of the IA system in comparison to the other human rights bodies would be discussed in the chapter, an example perhaps being the rather innovative and at times brave stance the IACtHR at times takes. Maybe this could already be reflected in one of the headings?

Best, Raffaela --Raffaela Kunz (discuss • contribs) 15:44, 3 November 2021 (UTC)


text:
Mario Kart: Double Dash!!/Shortcuts

In many tracks there are various shortcuts to take to avoid getting beaten or to set a new time trial record. Below are some:

 * Luigi Circuit: Shortly past the starting line there is a Chain Chomp (consider it a big, round dog) guarding a path off to the right. If you get a boost off the start line and "mini-turbo" into the shortcut, you should have no trouble getting by him. Executed properly, it'll save you about a second per lap.
 * Peach Beach: 1) There will be a separate route in the beach area that goes over water. 2) After starting the course there will be a sharp turn. If the player head left instead of right, the player will be sent through a pipe and back the way he/she came (this shortcut is a big time waster and should only be used to get items). 3) When finishing the race, a set of items can be obtained by driving behind the plaza statue, giving generally the team's special item and a blue shell.
 * Baby Park: The only trick with this course to to pull off extremely tight turns.
 * Dry Dry Desert: Don't get sucked into the tornado or quick sand pit.
 * Mushroom Bridge: 1) Halfway through the course will be a hill off to the right. Go up and over it to cut across the track, however, the ground isn't very good to drive on and will take approximately the same amount of time as driving on the road. This effect is removed while under the influence of a mushroom or star. 2) When a player gets to the bridge he/she can go to either the left railing or right railing and use accelerators to boost themselves to the top of the bridge, however, it is very easy to fall off, which would cause a loss of time greater than simply driving on the bridge, so many players avoid the rails. 3) In the very beginning, off to the right is a passage that leads the player in two 90 degree angles and through a warp pipe. It is a time waster but if the player is in 8th usually the player will get good items.
 * Mushroom City: After going around the first curve, go straight past the fork in the road. Off to the right about 30 feet afterwards, there is a pink(?) alley spliting between two buildings with several boost pads. It will cut a lot of time off your total.
 * Mario Circuit: No data at this point.
 * Daisy Cruiser: About 3/4 of the way through the course will be a hole, which leads to an underground chamber. In the chamber is a pipe that will suck the player out and back onto the course. This shortcut will not shave off much time, though it will let you access some good items.
 * Waluigi Stadium: No data at this point.
 * Yoshi Circuit: 1) In the beginning there will be a shortcut ramp going over water. You can only go across it by using a mushroom or a star. 2) About halfway through the course will be an underground shortcut below the track and off to the side. If a player wants to use it the player must drive off a cliff and land on the edge of the shortcut (which is only possible with a Golden mushroom or star).
 * Dino Dino Jungle: 1) After leaving the cave that leads to the bridges you can turn right, there's a alternative bridge with boosters. 2) In the cave part of the course is a ramp going over a cliff. The player can only get across it using a mushroom or a star.
 * Bowser's Castle: In the part of the course where fireballs are being shot at you there is a hair-pin turn. When done correctly, a player can cut across the turn by going over lava, however, it is very easy to go flying off the other edge of the lower road or simply not make it to that road.
 * DK Mountain: 1) After being shot up the mountain you enter the grassy section below, after the first full 180 turn you can turn sharply to the right and jump over the abyss (this takes a little practice). 2) Whilst coming down the mountain, driving on the off-road ashy section will not reduce the kart's speed, avoiding the time-losing bumps and getting a better angle for the next turn.

title: Mario Kart: Double Dash!!/Shortcuts


text:
Talk:Mechanics of Materials

Hello, I am surprised this page was deleted. I was just attempting to return to editing it. If there is anyway to recover the previous outline, I would appreciate it. Admazzeo (discuss • contribs) 17:58, 26 August 2021 (UTC)
 * It's not deleted. It's here User:Admazzeo/Mechanics of Materials. QuiteUnusual (discuss • contribs) 21:48, 26 August 2021 (UTC)

title: Talk:Mechanics of Materials


text: User talk:72.34.1.216

title: User talk:72.34.1.216


text:
User:TheveshMoo

Background

Interests

Wikibooks projects:

title: User:TheveshMoo


text:
Exercise as it relates to Disease/The effects of aerobic exercise during pregnancy on infant neuromotor skills

This is a critical analysis of the journal article from Medicine and Science in Sports and Exercise: "Effects of Aerobic Exercise during Pregnancy on One-Month Infant Neuromotor Skills" by McMillan AG, May LE, Gaines GG, Isler C, Kuehn D (2019).

What is the background to this research?
The purpose of this article is to determine the effects of exercise during pregnancy on the development of infant neuromotor skills at one-months old. The prevalence of childhood obesity continues to increase as nearly one third of children aged 2-19 years in the United States meet the criteria for overweight or obese. Increased childhood obesity is linked to decreased physical activity levels and poor motor skill performance within early childhood. Studies of maternal obesity also report infant motor skills to be delayed and linked to long term consequences of cognitive function. Therefore, the earliest intervention to decrease this trend occurs within the prenatal period. This study hypothesised that aerobic exercise during pregnancy would be associated with higher neuromotor scores in infants at one month of age, based on standard paediatric assessments of motor skills which include reflexes, stationary and locomotion. The link between infancy and motor competence is important to understand as motor competent children are more likely to enjoy movement and therefore participate more in physical activities. Children are also more likely to have a decreased risk of obesity and other chronic diseases such as cardiovascular disease and diabetes when they obtain a positive association with movement.

Where is the research from?
This is an American study, conducted at the East Carolina University in Greenville, North Carolina. Dr Amy Gross McMillan is the leading researcher for the study as she obtains extensive background knowledge and specialises within the field of paediatric obesity. The study was funded by the American Heart Association and by the East Carolina University, these organisations held no influence to the study design, interpretation of data or writing and submission of the manuscript. This study was published within the Journal of Medicine and Science in Sports and Exercise in February 2019.

What kind of research was this?
The research conducted was a Randomised Control Trial (RCT). This study design is the most precise way to determine the effectiveness of whether a cause-effect relationship exists between the intervention and the outcome. Participants were randomly assigned to either a supervised exercise group or a non-exercise group where the outcome of the intervention was determined through the performance of infant neuromotor skills at one month old.

What did the research involve?
Seventy-one healthy pregnant women aged between 18-35 years with a pre-pregnancy BMI between 18.5-34.9 kg/m2 and all pregnant with a single foetus were selected for this study. All women were healthy, not using any current medications, non-smokers and had no history of alcohol or drug use during their pregnancy. Participants who also obtained any other contraindications to exercise during pregnancy such as diabetes mellitus, cardiovascular disease, hypertension or any other factors known to effect foetal wellbeing were excluded from the study. These women were randomly assigned to either an aerobic exercise intervention or a non-exercise group. Participants assigned to the exercise group performed 50 minutes of moderate-intensity, supervised aerobic exercise three times per week, whilst the participants in the non-exercise group maintained their usual activities. Infant neuromotor skills were measured at one month of age using the second edition of the Peabody Developmental Motor Scales (PDMS-2). This study focused on implementing a supervised exercise intervention. The use of this method enhanced the compliance of participants with roughly 89% of pregnant women performing three 50-minute sessions of aerobic activity per week.

Although there was high compliance this study did have some limitations. The sample size was relatively small for this intervention and although a diverse population of healthy women pregnant with a single child participated, results cannot be generalised for all pregnant women, especially those considered high risk due to multiple gestations or co-morbidities. This intervention didn’t control for factors such as diet, sleep, sedentary behaviour, occupation and postnatal infant stimulation and environment which could also influence the development of their nervous system and neuromotor control. Another limitation is that this study only focused on the performance of motor skills at one month, there was no later check-in to assess neuromotor ability at another milestone age. Finally, this study only focused on the effects of aerobic exercise rather than other forms of exercise (i.e., resistance or circuit) and their potential benefits on infancy motor skills.

What were the basic results?
Infants of women within the exercise group obtained higher PDMS-2 scores in comparison to infants of mothers in the non-exercise group; females also had higher scores compared to male infants. These results were interpreted by researchers as the findings confirmed their hypothesis that; infants of mothers who exercised during pregnancy scored higher on stationary, locomotive and reflex motor skills in relation to infants of mothers who did not exercise during their pregnancy. Exercise during pregnancy has therefore been proven to positively impact the infants developing systems allowing for improved neuromotor development, ultimately leading to the outcome of infants who are more proficient with movement and more likely to be active. It is also possible that women who exercised during pregnancy are more likely to provide a stimulating postnatal environment to enhance their child's development.

What conclusions can we take from this research?
The findings of this study are consistent with other research within this field, reporting positive outcomes of exercise during pregnancy on neuromotor behaviour and development of newborns. Increased maternal exercise for both the mother and child are shown to positively affect the incidence of many diseases and alleviate the risk of childhood obesity. This study only identified the effects of one form of activity and obtained a relatively small selection of participants. Future areas of research, could demonstrate the effects of further exercise interventions across a more diverse population of pregnant women.

Practical advice
Excessive gestational weight gain (GWG) can increase complications during pregnancy for both the mother and her child. Complications for the mother include gestational diabetes, hypertension, pre-eclampsia and obesity; whilst complications for the unborn child include the risk of respiratory syndromes, diabetes, cardiovascular disease and obesity. Therefore, staying active during pregnancy has many benefits for the health of both the mother and child, Australian Physical Activity Guidelines during pregnancy outline a total of either 2.5 to 5 hours of moderate intensity activity, 1.25 to 2.5 hours of vigorous intensity activity or a combination of both moderate and vigorous physical activity as well as strengthening activities performed at least 2 days per week. Physical activity during pregnancy doesn’t have to be vigorous to be beneficial; examples for aerobic and resistance exercises include walking, cycling, swimming and light resistance activities. As pregnancy progresses, it is important to modify physical activities and limit or avoid certain activities; consulting with a doctor is the best way to determine what type of activity would better suit the mother and the unborn child.

For healthy infant development from birth to one year, the Australian Physical Activity Guidelines address that physical activity should be supervised and predominantly floor based. Activities and movement help the infant to keep their minds active, develop senses of sight, touch and hearing, build strength, balance and posture as well as encourage the development of self-confidence and independence. The promotion of movement activities for infants are important as capabilities of motor control in early ages of their development link to physically active behaviours in adolescence and adulthood.

Further information/resources

 * Australian Physical Activity Guidelines for Pregnancy: https://www.health.gov.au/health-topics/physical-activity-and-exercise/pregnancy
 * Australian Physical Activity Guidelines for Birth to 1 Year: https://www1.health.gov.au/internet/publications/publishing.nsf/Content/gug-indig-hb~phys-0-1
 * Exercise Modifications During Pregnancy: https://www.pelvicfloorfirst.org.au/pages/exercise-modifications-during-pregnancy.html
 * Development of Infancy Motor Skills: https://www.pregnancybirthbaby.org.au/toddler-development-motor-skills
 * World Health Organisation Obesity and Overweight Fact Sheet: https://www.who.int/news-room/fact-sheets/detail/obesity-and-overweight


text:
Talk:Public International Law/Methodology/Case Analysis

Review 20 May 2023
Dear Max,

Thank you so much for writing this great chapter! I wish such a concise and easy to understand guide with ample sources would have existed when I was a student. I agree with Raffaela on switching the Approaches and Methodology parts, as we already discussed, and also on the general suggestion of using less 'hierarchical' language. Here are some extra pointers on what you could include in the part on engaging critically with cases:
 * The 'feminist judgments' movement rewrites existing cases from a feminist perspective. Here is the collection of feminist judgments in international law and here is the introductory post of a blog symposium we had at Völkerrechtsblog on this project.
 * Ntina Tzouvala explains on pp. 9 et seq of 'Capitalism as Civilization' how she uses Bennett Capers' method of 'Reading Back, Reading Black'
 * 'Trashing' is another classical CLS method of analysing cases

Herzlich Sué González Hauck (discuss • contribs) 17:02, 20 May 2023 (UTC)

Review 16 May 2023
Dear Max, This is a great chapter and I think it's extremely useful to have it in the book. I added some comments directly in the text. Some overall feedback/thoughts:

1) Since you refer a lot to critical approaches and the difference between critical/doctrinal and the students have not yet been introduced to these concepts, it might make sense to move the entire methodology section after the approaches section. 2) Please also bear in mind that in the sources chapter, we have an entire chapter on international and domestic decisions and their role. Maybe there is a need to coordinate with Lucas. Lima on this. 3) The "Übergang" from the general considerations to concrete/hands-on suggestions for students could be smoother. Maybe add in the intro part what exactly the aim is/that the aim is really to give practical advise for assignments etc.? 4) I find the language a bit too much "top down"; rather than saying students should etc., I would phrase it more inclusively and also more tempatively, addressing students directly "you might consider" etc. Also explain better why this makes sense because this makes it more understandable and convincing for students.

Best, Raffaela --Raffaela Kunz (discuss • contribs) 09:29, 16 May 2023 (UTC)

Review, 27 August 2021: Jens
Hi Max,

I think the outline looks great so far and I continue to think this is a really cool and helpfully pragmatic chapter to include in the textbook.

I just wanted to highlight early on two aspects which stand out to me whenever I teach international law and especially international case-law:

1. The age of some of the judgments. Students from common law jurisdictions might be more used to this but in Germany it always raises some eyebrows and needs a little contextualisation.

2. More importantly: the difficulty many students have in approaching judgments critically. Again this may be different in other countries where legal education in general might be less doctrinal (and whenever I've taught students from other disciplines than law it's been less of an issue) but in my experience, students often take whatever a judgment says as given, struggle to identify internal contradictions or other problematic elements, and seem very reluctant to question judicial pronouncements in general. At least in my view, overcoming that reluctance is an important part of teaching case-law.

If you wanted to include either of these points, I don't think it would necessarily have to be reflected in the outline, e.g. the prior point probably fits nicely under "A. Relevance of Cases". For the latter point it might be a good option to include an additional subsection either under C.I. (since it relates to the role and objective of reading cases) or as C.II.4. (since critical assessment could be considered part of understanding the relevance of the case). But of course that's entirely up to you, I just figured I'd draw attention to the issue in case you agree that it's an important point to mention in this chapter.

(Hopefully this is the right place to leave the review, I'm still figuring out how things work on here...)

--Jens Theilen (discuss • contribs) 11:37, 27 August 2021 (UTC)

Review: Walter
Dear Max, the chapter “Cases in Int Law” is a very engaging and practical contribution to the book. The structure is simple and is easy to understand the aim of the section, and the subtitles deepen the titles in a clear, connected way. I would only suggest this points: -I think consultative opinions should have a role in this section, sometimes they are referred as cases (under the notion of “case law”), and even if we know they are not contentious cases and their authority is different, they are largely used for the same reasons as cases: i.e to find the established law by a court. Maybe you can make a small entry about their nature below “2. Quasi-judicial Decisions”.

 * Below the section case analysis for moot courts, or mentioned somewhere along, should be the explanation of the key elements about using a case for litigation, even if mooters and students are our main goal, we wish some people to use this guide for litigation too, and that should present.
 * For some students is really hard at the beginning to understand that in international law a case can be like a 3 chapter movie (It has happened in ICJ, PCA, ICSID): a case is divided in a “case” or judgment for jurisdiction, a judgment for the merits and a judgment for reparations (is it the same case? Are they different cases? Are they stages of the same case?), that should be a point to teach. It might not appear in the index, but it totally should be explored in your teachings about how to do cases.
 * A group of concepts I use when I teach case analysis (distinguishing cases is a very good idea in your index) is to divide and analyze case law by the parties: are they interstate cases (ITLOS ICJ PCA)? Individual vs. State cases (ECTHR, IATCHR)? Investor vs State (ICSID UNCITRAL)? Prosecutor vs Individual cases (ICC)? This teaches a lot about who and why can have a case.
 * A very relevant and used source for case analysis is the separate opinions of judged involved in the case, they are common in international and domestic law and fundamental for the analysis of a decision, they should be included somehow.

Great index, is one of the most comprehensive ones I have seen in the project, I hope some of this mere suggestions help. Best. Walter Arévalo.

Summary: 1st Draft
In this first draft, I have attempted to write a first introduction to case analysis in international law and to incorporate the comments of Jens and Walter. My goal was to write a simple but useful introduction for students on how to deal with cases in international law. In the next step, I would like to resolve ambiguities and explain in more detail in some places. I am also considering whether it might be helpful for students to read how cases can be presented orally and in writing. Here, however, it is difficult for me to make general statements. I am very grateful for any hints and criticism!

--Max Milas (discuss • contribs) 17:15, 7 February 2022 (UTC)


text:
Solutions To Mathematics Textbooks/Algebra (9780132413770)/Chapter 4

Exercise 1.1
Let $$f(M): F^{m \times n} \rightarrow F^{l \times p}$$ such that $$f(M) = AMB$$ where $$A \in F^{l \times m}, B \in F^{n \times p}$$. Then for $$M, N \in F^{m \times n}$$ and $$\alpha, \beta \in F$$ it holds $$f(\alpha M + \beta N) = A(\alpha M + \beta N)B = \alpha AMB + \beta ANB = \alpha f(M) + \beta f(N) $$, so $$f$$ is a linear transformation.

Exercise 1.3
The matrix $$A \in F^{m \times n}$$ is a linear mapping $$A: F^n \rightarrow F^m$$. Let $$\mathsf{B} = \{v_1,\ldots,v_n\}$$ be a basis for $$F^n$$. Then the space $$\textrm{im}~ A = \textrm{Span }(A(v_1),\ldots,A(v_n))$$ has dimension at most $$\min(n,m)$$. Then, using the dimension formula we have $$\dim (\textrm{im}~ A) + \dim (\ker A) = \dim F^n = n$$, so rearranging we get $$\dim (\ker A) = n - \dim (\textrm{im}~ A) \geq n-\min(m,n) \geq n-m$$.

Exercise 1.4
Let $$A \in F^{m \times n}$$ be a matrix of rank 1. Then, the image of $$A$$ is a space spanned by a single vector, say $$v \in F^n$$, and $$Av = w$$ for some nonzero $$w \in F^m$$. We can assume that $$v = (1,0,\ldots,0)$$, since the vector is unique up to a scaling and change of basis. Then, the kernel of $$A$$ is given by the vectors $$e_i$$ for $$i = 2,\ldots,n$$. Next, consider the matrix $$B = \frac{1}{v^tv}wv^t$$, so that $$Bv = w$$ as well, and $$Be_i = 0, i = 2,\ldots,n$$. It is easy to see that $$A$$ and $$B$$ describe the same linear transformation, so they are equal as matrices. The representation of $$B$$ is not unique, since we could scale one of the vectors $$v$$ and $$w $$ arbitrarily as long as we scale the other accordingly.

Exercise 1.5
a) It is very easy to see that performing the vector space operations coordinate-wise preserves the vector space structure in the product space.

b) Let $$T(u, v) = u + v$$. Then we have $$T(u_1 + u_2, v_1 + v_2) = u_1 + v_1 + u_2 + v_2 = T(u_1, v_1) + T(u_2, v_1) $$ and $$T(au, av) = au + av = aT(u,v)$$, so $$T$$ is a linear operator.

c) We have $$\dim (\textrm{im}~ T) + \dim (\ker T) = \dim (U \times W)$$ where $$\ker T = \{(u, w) \in U \times W : u = -w\} = \{(v, -v) : v \in U \cap W\} $$ so $$\dim (\ker T) = \dim (U \cap W)$$. Furthermore, we have by definition that $$\textrm{im}~ T = U \oplus W $$, and $$\dim (U \times W) = \dim U + \dim W$$. Therefore, the dimension formula has the form $$\dim (U \cap W) + \dim (U \oplus W) = \dim U + \dim W$$.

Exercise 2.1
We can write $$A = a_{11}e_{11} + a_{12}e_{12} + a_{21}e_{21} + a_{22}e_{22}$$, $$B = b_{11}e_{11} + b_{12}e_{12} + b_{21}e_{21} + b_{22}e_{22}$$ and $$M = m_{11}e_{11} + m_{12}e_{12} + m_{21}e_{21} + m_{22}e_{22}$$. We have the following multiplication table where the first element of a column denotes the matrix that is multiplied from the right by the first element of a given row. Then, $$AM = (a_{11}m_{11} + a_{21}m_{12})e_{11} + (a_{12}m_{11} + a_{22}m_{12})e_{12} + (a_{11}m_{21} + a_{21}m_{22})e_{21} + (a_{12}m_{21} + a_{22}m_{22})e_{22}$$. For $$AMB$$ we have then in the given basis the form

$$\begin{pmatrix} a_{11}m_{11}b_{11} + a_{21}m_{12}b_{11} + a_{11}m_{21}b_{12} + a_{21}m_{22}b_{12} \\ a_{12}m_{11}b_{11} + a_{22}m_{12}b_{11} + a_{12}m_{21}b_{12} + a_{22}m_{22}b_{12} \\ a_{11}m_{11}b_{21} + a_{21}m_{12}b_{21} + a_{11}m_{21}b_{22} + a_{21}m_{22}b_{22} \\ a_{12}m_{11}b_{21} + a_{22}m_{12}b_{21} + a_{12}m_{21}b_{22} + a_{22}m_{22}b_{22} \end{pmatrix}$$.

Exercise 2.3
The matrix with the given property satisfies the equation $$\begin{pmatrix} a & b \\ c & d \end{pmatrix}\begin{pmatrix} x \\ x \end{pmatrix} = \begin{pmatrix} x \\ 3x \end{pmatrix}$$. Solving this yields that the matrix has to have the form $$\begin{pmatrix} a & 1-a \\ c & 3-c \end{pmatrix}$$ for any $$a,c \in \mathbb{R}.$$


text:
User:Owittnan/sandbox/A Little Hy Primer

Welcome to A Little Hy Primer. Much like A Little C Primer, this is a novice introduction to the Hy programming language. This text will assume some familiarity with Python and at least a basic level of familiarity with a Lisp.

Installation
To install Hy, you first need Python and Pip installed. There are many guides online about how to do this.

Once you have Python and Pip installed, run. This will install hy from the PyPI package repository.

You can also use the online interpreter.

With that, let's get started.

Hello world
The first program you run in any programming language is the "Hello world" program. So let's do just that. Open up a file and type this in: Make sure to save the file with the .hy extension (not needed in the interpreter). If using the interpreter, click the Run button in the top right of the editor. If not, open a console in the same directory as your .hy file and run, replacing   with the name of the .hy file.

You should see  printed in the console/output box.

Basic operations
Hy can do arithmetic operations. It uses the prefix notation: It also has the standard if conditional operator, but with a more lispy syntax: The above is the same as if-else in Python. To have elifs you use the cond macro: and to execute more than one statement in an if you need a do-block: There are also macros for if you only want the true or false statement:


text: A Traveler's Guide to the World of Pokémon/Johto/New Bark Town


text:
Cornish/Cornish alphabet

Cornish alphabet
A a

B b

Ch ch

D d

E e

F f

G g

H h

I i

J j

K k

L l

M m

N n

O o

P p

R r

S s

T t

U u

V v

W w

Y y

title: Cornish/Cornish alphabet


text: Shelf:History of Computation

title: Shelf:History of Computation


text: Category:Shelf:History of Computation/all books


text: Shelf:History of Computation/ancestry

title: Shelf:History of Computation/ancestry


text: Category:Shelf:History of Computation

title: Category:Shelf:History of Computation


text: Category:Subject:History of Computation

title: Category:Subject:History of Computation


text: Subject:History of Computation

title: Subject:History of Computation


text: Category:Subject:History of Computation/all books


text:
Private Bodies of Water/Activities

There are a variety of activities that privately owned bodies of water may be used for.

Productive

 * Fishing
 * Amenity for cattle.
 * Water retention.
 * Fire management.

Recreational

 * Swimming
 * Boating
 * Property Beautification

title: Private Bodies of Water/Activities


text:
Private Bodies of Water/Locations

There are a variety of locations that privately owned bodies of water may be found.

Industrial
Small basins are often used to have a reservoir as part of a fire management strategy.

Commercial
Some commercial properties use small bodies of water for beautification, making their properties stand out.

Agricultural
Small ponds are sometimes used in meadows as an amenity for livestock.

Recreational
Large properties may have ponds or small lakes for recreational and hobby purposes.

title: Private Bodies of Water/Locations


text:
Cataloging and Classification/Bibliographic control

Conceptual levels of cataloguing
Even before we begin learning the basics, it is useful to understand that library cataloging is a subject which conceptually deals with information at various levels, which is explained in brief here, and will be explained in detail later in the textbook.

Overall, the top-most level of cataloguing is the Functional Requirements for Bibliographic Records (FRBR), which tells us how information should be organised and modeled. The FRBR provides a conceptual model of the entities involved in library cataloguing and their relationships.

The second conceptual level is the content cataloguing standard which decides what information is to be recorded and how. They build on the conceptual framework provided by the FRBR. Examples of such standards are the Resource Description and Access (RDA), the International Standard Bibliographic Description (ISBD), and the Anglo-American Cataloguing Rules (AACR) (which is now defunct).

The third conceptual level is that of the communication formats, i.e., the code used by computers to convey bibliographic information. Examples of these are Machine-Readable Cataloging (MARC) and Extensible Markup Language (XML).

The lowest conceptual level is that of metadata, index terms, and controlled vocabularies — standards involving these include Dublin Core Metadata Element Set (commonly referred to as just Dublin Core) and the Library of Congress Subject Headings (LCSH).


text:
User:AshLin/sandbox

Hello, Biblioworld

title: User:AshLin/sandbox


text:
Oberon/ETH Oberon/Tutorial/big.index

Master index

[ A | B | C | D | E | F | G | H | I | K | L | M | N | O | P | R | S | T | U | V | W | Z | \ ]

A absolute positioning (Mouse) activator macro # (GadgetsUse) active area (GadgetsIntro) Adaptive (GadgetsProg) alias (GadgetsUse) Analyzer.Analyze (Compiler) Analyzer.Tool (Compiler) ancestor (GadgetsIntro) Applications (Applic) archive* (Watson) archive (Compress) area selection (Rembrandt) ASCII table (Applic) AsciiCoder.CodeFiles (Compress) AsciiCoder.CodeText (Compress) AsciiCoder.DecodeFiles (Compress) AsciiCoder.DecodeText (Compress) AsciiCoder.Tool (Compress) AsciiCoder (Compress) ASCIITab.NewFrame (Applic) attributes (GadgetsUse)

B

base line (FontEditor) Base64.Decode (Compress) Base64.Encode (Compress) Base64 (Compress) BasicGadgets.SetValue (GadgetsOberon) Boolean (GadgetsUse) Browser.ShowDef (Watson) Browser.ShowObj (Watson) Browser.Tool (Watson) browser (Internet) browser (Watson) Builder.ClearErrors (Compiler) Builder.Compile (Compiler) Builder.Free (Compiler) Builder.InsertHierarchy (Compiler) Builder.MarkErrors (Compiler) Builder.NextError (Compiler) Builder.Tool (Compiler) Button (GadgetsIntro) Button (GadgetsUse)

C

Calc.Char (Applic) Calc.Dec (Applic) Calc.Hex (Applic) Calc.List (Applic) Calc.Real (Applic) Calc.Reset (Applic) Calc.Set (Applic) calculator: desktop (Applic) calculator: HP (Applic) Calendar (GadgetsUse) call Attribute Profiler, cAP (Profiler) cancel (Mouse) Caption (GadgetsUse) card game: writing your own one (Games) card games (Games) caret focus (Mouse) caret (GadgetsProg) caret (Mouse) caret (Mouse) caret (Mouse) changing your password (Internet) character metrics (FontEditor) check box (GadgetsIntro) CheckBox (GadgetsUse) Circle (GadgetsUse) circle (Rembrandt) clicking (Mouse) clipboard (Rembrandt) Clock (GadgetsUse) clone (Rembrandt) Cmd attribute (GadgetsUse) color attribute (GadgetsUse) ColorPicker (GadgetsUse) color (Rembrandt) Columbus.AddObj (Columbus) Columbus.FreeObj (Columbus) Columbus.GetObj (Columbus) Columbus.Inspect (Columbus) Columbus.InspectLink (Columbus) Columbus.RenameObj (Columbus) Columbus.ShowObjs (Columbus) Columbus (Columbus) Compiler.Compile (Compiler) Compiler.Panel (Compiler) Compiler.SetDestPath (Compiler) Compiler.Tool (Compiler) complex gadget (GadgetsIntro) Complex.Mod (GadgetsProg) Complex (GadgetsUse) composition tool (GadgetsUse) compress (Unix) (Compress) Compress.Add (Compress) Compress.Delete (Compress) Compress.Directory (Compress) Compress.ExtractAll (Compress) Compress.Extract (Compress) Compress.Open (Compress) Compress.Tool (Compress) compress (Compress) concatenation (GadgetsUse) consume operation (GadgetsIntro) ConsumeCmd attribute (GadgetsUse) container (GadgetsIntro) context (GadgetsIntro) control area (GadgetsIntro) copy attributes (Mouse) copy selection over to caret (Mouse) copy selection to caret (Mouse) copy selection (GadgetsIntro) copy-and-paste (Mouse) copy (Rembrandt) CurrentDirectory (GadgetsUse) CurrentLoad (GadgetsUse) cut (Rembrandt)

D

deep copy (GadgetsUse) definition module (Watson) Definitions.Arc (Compress) Definitions.Arc (Watson) delete selection (GadgetsIntro) delete selection (Mouse) descendant (GadgetsIntro) Desktops.ChangeBackdrop (GadgetsIntro) Desktops.Close (GadgetsIntro) Desktops.Copy (GadgetsIntro) Desktops.Grow (GadgetsIntro) Desktops.InsertDoc (GadgetsIntro) Desktops.OpenDoc (GadgetsIntro) Desktops.OpenDoc (GadgetsIntro) Desktops.OpenDoc (GadgetsIntro) Desktops.Open (GadgetsIntro) Desktops.PrintDoc (GadgetsIntro) Desktops.Recall (GadgetsIntro) Desktops.ReplaceDoc (GadgetsIntro) Desktops.ShowDoc (GadgetsOberon) Desktops.StoreDoc (GadgetsIntro) desktop (GadgetsIntro) Desktops.Store (GadgetsIntro) destination frame (GadgetsProg) DigitalClock (GadgetsUse) Display.ControlMsg (GadgetsOberon) Display.DisplayMsg (GadgetsOberon) Display.DisplayMsg (GadgetsProg) Display.FrameMsg (GadgetsProg) Display.LocateMsg (GadgetsOberon) Display.ModifyMsg (GadgetsOberon) Display.PrintMsg (GadgetsProg) Display.SelectMsg (GadgetsOberon) Display3.Mask (GadgetsProg) document locator (Internet) document New procedure (GadgetsIntro) document (GadgetsIntro) Documents.DocumentDesc (GadgetsProg) Documents.Init (GadgetsOberon) Documents.Open (GadgetsOberon) DocumentSkeleton.Mod (GadgetsProg) dot file (Unix) (Internet) double attribute (Rembrandt) drag-and-drop (GadgetsIntro) drag-and-drop (GadgetsIntro) dragging (Mouse)

E

edit picture (Rembrandt) editing (Mouse) EditTools.OpenAscii (DataConverter) EditTools.OpenUnix (DataConverter) EditTools.StoreAscii (DataConverter) EditTools.StoreUnix (DataConverter) RembrandtFrame (GadgetsUse) encode/decode (Compress) end-user objects (GadgetsIntro) erase color (Rembrandt) erase (Rembrandt) error marker (Compiler) Esc key (Mouse) Esc key (Mouse) EventTimer (GadgetsUse) execute (Mouse)

F

F1 key (Mouse) F2 key (Mouse) F2 key (Mouse) FAQ (Internet) fill attribute (Rembrandt) fill (Rembrandt) Finder (GadgetsUse) finger (Unix) (Internet) Finger.Finger (Internet) flip selection horizontally (FontEditor) flip selection vertically (FontEditor) focus viewer (Mouse) font editor panel (FontEditor) font editor (FontEditor) font metrics (FontEditor) font resource (Win) (FontEditor) FontEditor.Panel (FontEditor) font (FontEditor) FontRes.Convert (FontEditor) FontRes.Tool (FontEditor) forwarding mail (Internet) Freecell (Games) freehand selection (Rembrandt) FTPTool.ChangeDir (Internet) FTPTool.Close (Internet) FTPTool.CompactDir (Internet) FTPTool.CurDir (Internet) FTPTool.DeleteFiles (Internet) FTPTool.Dir (Internet) FTPTool.GetFiles (Internet) FTPTool.GetTexts (Internet) FTPTool.MakeDir (Internet) FTPTool.Open (Internet) FTPTool.PutFiles (Internet) FTPTool.PutTexts (Internet) FTPTool.RmDir (Internet)

G

gadget composition (GadgetsUse) gadget instance (GadgetsUse) Gadgets.Change (GadgetsUse) Gadgets.ChangeAttr (GadgetsUse) Gadgets.context (GadgetsOberon) Gadgets.Copy (GadgetsUse) Gadgets.CreateObject (GadgetsOberon) Gadgets.CreateViewModel (GadgetsOberon) Gadgets.Execute (GadgetsOberon) Gadgets.ExecuteAttr (GadgetsOberon) Gadgets.executorObj (GadgetsOberon) Gadgets.FindObj (GadgetsOberon) Gadgets.FindPublicObj (GadgetsOberon) Gadgets.FrameDesc (GadgetsProg) Gadgets.GetObjName (GadgetsOberon) Gadgets.Insert (GadgetsUse) Gadgets.Insert (GadgetsUse) Gadgets.Integrate (GadgetsOberon) Gadgets.Link (GadgetsUse) Gadgets.NameObj (GadgetsOberon) Gadgets.ObjDesc (GadgetsProg) Gadgets.receiverObj (GadgetsOberon) Gadgets.senderObj (GadgetsOberon) Gadgets.Set (GadgetsUse) Gadgets.ThisFrame (GadgetsOberon) Gadgets.Update (GadgetsOberon) gadgets (GadgetsIntro) games (Applic) Gen attribute (GadgetsProg) Gen attribute (GadgetsUse) generator (GadgetsUse) Gopher (Internet) graphical user interface (GadgetsIntro) grid snap attribute (GadgetsUse) grid (FontEditor) GUI (GadgetsUse)

H

handler (GadgetsProg) Hex.Open (DataConversion) hot list (Internet) HP calculator (Applic) HPCalc.Panel (Applic) HTML tag (Tutorials) HTMLDocs.SwitchIMG (Internet) HTTPDocs panel (Internet) HTTPDocs.AddToHotList (Internet) HTTPDocs.History (Internet) HTTPDocs.ReloadDoc (Internet) HTTPDocs.ShowHotList (Internet) HTTPLinks panel (Internet) hypertext (Internet)

I

Icon (GadgetsProg) Icon (GadgetsUse) Iconizer (GadgetsUse) initiator macro ! (GadgetsUse) insertion point (Mouse) Integer (GadgetsUse) interclicking (Mouse)

K

keyboard input (GadgetsProg)

L

left mouse key (Mouse) library inspector (Columbus) Line (GadgetsUse) line (Rembrandt) link (GadgetsIntro) list (GadgetsIntro) List (GadgetsUse) LoadDoc (GadgetsProg) lock (GadgetsIntro) locked attribute (GadgetsUse) lookup macro & (GadgetsUse) LPRPrinter.BannerPage (Applic) LPRPrinter.Install (Applic) LPRPrinter.MailBack (Applic) LPRPrinter.PrintPSFile (Applic) LPRPrinter.RemoveJobs (Applic) LPRPrinter.ShowJobs (Applic)

M

macro (GadgetsUse) MacTCP (Internet) Mail.Panel (Internet) Mail.Send (Internet) mail (Internet) mailbox (Internet) make icon (Rembrandt) marked viewer (Mouse) marker focus (Mouse) marker (Mouse) MemoryUsed (GadgetsUse) menu bar (GadgetsIntro) Menu (GadgetsProg) message (GadgetsProg) middle mouse key (Mouse) MineSweeper (Games) mirror attribute (Rembrandt) mirror horizontally (Rembrandt) mirror vertically (Rembrandt) model gadget (GadgetsIntro) Model-Viewer-Controller (GadgetsIntro) Model-View (GadgetsUse) module public view (Watson) most recent selection (Mouse) mouse actions (Mouse) mouse cursor (Mouse) mouse focus (Mouse) mouse key actions (GadgetsIntro) mouse tracking (GadgetsProg) move (GadgetsIntro) move (Rembrandt) moving picture (FontEditor) moving picture (Rembrandt) MVC (GadgetsIntro)

N

Name attribute (GadgetsUse) NamePlate (GadgetsUse) native object files (Compiler) Navigator (GadgetsUse) NetTools.ClearCache (Internet) NetTools.DownLoadDoc (Internet) NetTools.Get EMail (Internet) NetTools.Get NNTPHost (Internet) NetTools.Set EMail (Internet) NetTools.Set NNTPHost (Internet) New document (GadgetsOberon) New procedure (GadgetsProg) New procedure (GadgetsUse) NewDoc (GadgetsProg) News.FollowupArticle (Internet) News.PostArticle (Internet) News.ShowAllGroups (Internet) News.ShowNewGroups (Internet) News.StoreInitText (Internet) News.SubGroup (Internet) News.SubscribedGroups (Internet) News.UnsubGroup (Internet) NoteBook (GadgetsUse)

O

Oberon.ControlMsg (GadgetsProg) Oberon.InputMsg (GadgetsProg) Oberon.Par.frame (GadgetsOberon) Oberon.Par.obj (GadgetsOberon) OberonErrors.Text (Compiler) object inspector (Columbus) object selection (Rembrandt) Objects.AttrMsg (GadgetsOberon) Objects.AttrMsg (GadgetsProg) Objects.CopyMsg (GadgetsProg) Objects.FileMsg (GadgetsProg) Objects.NewObj (GadgetsOberon) Organizer (GadgetsUse) Outline (GadgetsUse)

P

panel (GadgetsIntro) Panel (GadgetsUse) PanelDoc (GadgetsUse) paste (Rembrandt) pen (Rembrandt) performance measurement (Profiler) pick color (Rembrandt) Picture (GadgetsUse) point (Mouse) Poly.Panel (Applic) polygon (Rembrandt) PolyWorlds (Applic) POP (Internet) position mark (Mouse) Post Office Protocol (Internet) preview string (FontEditor) preview (FontEditor) print character picture (FontEditor) print picture (Rembrandt) Procedures (GadgetsOberon) Procedures (GadgetsOberon) processor macros {, }, | (GadgetsUse) Profiler.Compile (Profiler) Profiler.Reset (Profiler) Profiler.Show (Profiler) Profiler.ShowCode (Profiler) Profiler.ShowMem (Profiler) Profiler.Tool (Profiler) ProgressMeter (GadgetsUse) PS converter (Applic) PS.PictToPost (Applic) PS.Tool (Applic)

R

radio button (GadgetsIntro) radio button (GadgetsIntro) Real (GadgetsUse) Rectangle3D (GadgetsUse) Rectangle (GadgetsUse) rectangle (Rembrandt) reference point (FontEditor) Reference (GadgetsUse) RefFrame (GadgetsUse) relative positioning (Mouse) Rembrandt panel (Rembrandt) RembrandtDoc (GadgetsUse) Remote printing (Applic) resize (GadgetsIntro) retouch character picture (FontEditor) retouch picture (Rembrandt) right mouse key (Mouse) rotate selection (FontEditor) rotate (Rembrandt)

S

sample module (Watson) scale (Rembrandt) Scope (GadgetsUse) Scramble (Games) scroll backward (Mouse) scroll bar (Mouse) scroll forward (Mouse) scroll to bottom (Mouse) scroll to top (Mouse) scrolling (Mouse) ScrollView (GadgetsUse) selection macro ^ (GadgetsUse) selection method (Rembrandt) selection (FontEditor) selection (Mouse) selection (Rembrandt) SetFrame (GadgetsUse) Set (GadgetsUse) shallow copy (GadgetsUse) Sisiphus (GadgetsUse) Skeleton.Mod (GadgetsProg) slider (GadgetsIntro) Slider (GadgetsUse) slim binaries (Compiler) Smalltalk (GadgetsIntro) smear attribute (Rembrandt) smear (Rembrandt) SMTP (Internet) Snapshot.Document (Applic) Snapshot.Gadget (Applic) Snapshot.InsertDocument (Applic) Snapshot.InsertGadget (Applic) Snapshot.InsertViewer (Applic) Snapshot.Screen2 (Applic) Snapshot.Screen (Applic) Snapshot.Viewer (Applic) snapshot (Applic) Sokoban (Games) Solitaire (Games) Sort.Sort (Applic) Sort.Tool (Applic) Spider (Games) Spline (GadgetsUse) spray attribute (Rembrandt) spray (Rembrandt) stamp (Rembrandt) StoreDoc (GadgetsProg) String (GadgetsUse)

T

tar (Unix) (Compress) target frame (GadgetsProg) TelnetGadgets.CloseCon (Internet) TelnetGadgets.OpenLog (Internet) Tetris (Games) text conversion (DataConverter) text field (GadgetsIntro) text lines sorter (Applic) Text2HTML.Compile (Tutorials) TextDoc (GadgetsUse) TextField (GadgetsUse) TextGadget (GadgetsUse) TextHyperlink (GadgetsUse) TextNote (GadgetsUse) TextStyle (GadgetsUse) Text (GadgetsUse) TimeStamp (GadgetsUse) tracking lines (Mouse) tracking the caret (Mouse) tracking the selection (Mouse) tracking words (Mouse) trap viewer (Compiler) Trumpet (Internet) tutorial authoring commands (Tutorials)

U

undo (Rembrandt) Uniform Resource Location (Internet) unload module (Compiler) URL (Internet) User agent (Internet) user interfaces (GadgetsUse) uudecode (Unix) (Compress) UUDecoder.Decode (Compress) UUDecoder.Tool (Compress) uudecode (Internet) uuencode (Internet)

V

Veronica (Internet) vertical offset (FontEditor) view (GadgetsIntro) view (GadgetsIntro) View (GadgetsUse) visual gadget (GadgetsIntro) visual reference gadget (Columbus)

W

Watson commands (Watson) Watson setup (Watson) Watson.Check (Watson) Watson.ConvertDefs (Watson) Watson.Lib (Watson) Watson.MakeDefs (Watson) Watson.Panel (Watson) Watson.ShowDef (Watson) Watson.ShowExports (Watson) Watson.ShowImports (Watson) Watson.ShowObj (Watson) who (Unix) (Internet) width attribute (Rembrandt) WinSocket (Internet) Write To Script (Applic) WTS.Convert (Applic) WTS.Tool (Applic) WTS (Applic) WWW (Internet)

Z

zoom (FontEditor) zoom (Rembrandt)

\

\Book (Tutorials) \Call (Tutorials) \Chapter (Tutorials) \Index (Tutorials) \Label (Tutorials) \Link (Tutorials) \\ (Tutorials)

title: Oberon/ETH Oberon/Tutorial/big.index


text:
Talk:Public International Law/Nature and Purpose of International Law

Dear Sué and all authors of this part, I wonder whether in this very preliminary and introductory chapter it would also be useful to mention the very basic notions of international law as decentralized and horizontal system. Some later parts of the book might come back to this, for example my chapter on interactions between int. and domestic law. Furthermore, some fundamental boundary discussions could be mentioned here - is international law an autonomous legal body at all? Is it law at all? Where is the boundary between the legal and the political? Best, Raffaela


text:
User:Quel2324

Hi! This is my User page I guess. I'm a 17yo teenager and therefore I have quite a lot of free time (not as much as I'd like, but quite a lot). I think I can do something better than spending my hours on social media so instead, I'll try to help others and learn about what others have written about.

I'm not a native English speaker so I may come and go, usually to Spanish or Catalan Wikibooks pages and Wikipedia.

I'm really interested in arts (painting, music, literature), science and history. One of the places all these things overlap is worldbuilding and the creation of Conworlds, so I'll probably write there and inside its many subbooks.

I don't know what else to say here

title: User:Quel2324


text:
LMIs in Control/Print version

= Basic Matrix Theory =

= Notion of Matrix Positivity =

= KYP Lemma (Bounded Real Lemma) =

= Positive Real Lemma =

= KYP Lemma for QSR Dissipative Systems =

= KYP Lemma witout Feedthrough =

= KYP Lemma for Descriptor Systems =

= Generealized KYP (GKYP) Lemma for conic Sectors =

= Discrete time Bounded Real Lemma =

= Discrete Time KYP Lemma for QSR Dissipative System =

= Discrete Time KYP Lemma with Feedthrough =

= Schur Complement =

= LMI for Eigenvalue Minimization =

= LMI for Matrix Norm Minimization =

= LMI for Generalized Eigenvalue Problem =

= LMI for Linear Programming =

= LMI for Feasibility Problem =

= Structured Singular Value =

= Eigenvalue Problem =

= LMI for Minimizing Condition Number of Positive Definite Matrix =

= Continuous Quadratic Stability =

= Exterior Conic Sector Lemma =

= Modified Exterior Conic Sector Lemma =

= DC Gain of a Transfer Matrix =

= Discrete Time H2 Norm =

= Discrete Time Minimum Gain Lemma =

= Modified Discrete Time Minimum Gain Lemma =

= Discrete-Time Algebraic Riccati Equation =

= Deduced LMI Conditions for H-infinity Index =

= Deduced LMI Conditions for H2 Index =

= Dissipativity of Systems =

= D-Stabilization =

= H-Stabilization =

= H-2 Norm of the System =

= Algebraic Riccati Equation =

= System Zeros without feedthrough =

= System zeros with feedthrough =

= Negative Imaginary Lemma =

= Small Gain Theorem =

= Tangential Nevanlinna-Pick Interpolation =

= Nevanlinna-Pick Interpolation with Scaling =

= Generalized $$ H_{2} $$ Norm =

= Passivity and Positive Realness =

= Non-expansivity and Bounded Realness =

= Change of Subject =

= Congruence Transformation =

= Finsler's Lemma =

= D-Stability =

= Time-Delay Systems =

= Parametric, Norm-Bounded Uncertain System Quadratic Stability =

= Stability of Structured, Norm-Bounded Uncertainty =

= Stability under Arbitrary Switching =

= Quadratic Stability Margins =

= Stability of Linear Delayed Differential Equations =

= H infinity Norm for Affine Parametric Varying Systems =

= Entropy Bond for Affine Parametric Varying Systems =

= Dissipativity of Affine Parametric Varying Systems =

= Hankel Norm of Affine Parameter Varying Systems =

= Positive Orthant Stabilizability =

= LMI For Stabilization Condition for Systems With Unsymmetrical Saturated Control =

= LMI Condition For Exponential Stability of Linear Systems With Interval Time-Varying Delays =

= Conic Sector Lemma =

= Polytopic Quadratic Stability =

= Mu Analysis =

= Optimization Over Affine Family of Linear Systems =

= Hurwitz Stabilizability =

= Quadratic Hurwitz Stabilization for Polytopic Systems =

= Discrete-Time Lyapunov Stability =

= LMI for Schur Stabilization =

= L2-Gain of Systems with Multiplicative noise =

= Discrete-Time Quadratic Stability =

= Stability of Lure's Systems =

= L2 Gain of Lure's Systems =

= Output Energy Bound for Lure's Systems =

= Stability of Quadratic Constrained Systems =

= Conic Sector Lemma =

= State Feedback =

= D-Stability =

= Optimal State Feedback =

= Output Feedback =

= Static Output Feedback =

= Optimal Output Feedback =

= Stabilizability LMI =

= LMI for the Controllability Grammian =

= LMI for Decentralized Feedback Control =

= LMI for Mixed $$H_{2}/H_{\infty}$$ Output Feedback Controller =

= Quadratically Stabilizing Controllers with Parametric Norm-Bounded Uncertainty =

= H-inf Optimal Quadratically Stabilizing Controllers with Parametric Norm-Bounded Uncertainty =

= Stabilizing State-Feedback Controllers with Structured Norm-Bounded Uncertainty =

= Optimal State-Feedback Controllers with Structured Norm-Bounded Uncertainty =

= $$H_\infty$$ Optimal Output Controllability for Systems With Transients =

= Quadratic Polytopic Stabilization =

= Quadratic D-Stabilization =

= Quadratic Polytopic Full State Feedback Optimal $$H_{\infty}$$ Control =

= Quadratic Polytopic Full State Feedback Optimal $$H_2$$ Control =

= Continuous-Time Static Output Feedback Stabilizability =

= Multi-Criterion LQG =

= Inverse Problem of Optimal Control =

= Nonconvex Multi-Criterion Quadratic Problems =

= Static-State Feedback Problem =

= Mixed H2 Hinf with desired pole location control =

= Mixed H2 Hinf with desired pole location control for perturbed systems =

= Robust H2 State Feedback Control =

= LQ Regulation via H2 control =

= State Feedback =

= Optimal State Feedback =

= Output Feedback =

= Static Output Feedback =

= Optimal Output Feedback =

= Optimal Dynamic Output Feedback =

= Discrete Time Stabilizability =

= Quadratic Schur Stabilization =

= Generic Insensitive Strip Region Design =

= Generic Insensitive Disk Region Design =

= Design for Insensitive Strip Region =

= Design for Insensitive Disk Region =

= Quadratic Stability =

= Apkarian Filter and State Feedback =

= Minimum Decay Rate in State Feedback =

= Maximum Natural Frequency in State Feedback =

= Optimal Observer and State Estimation = {{:LMIs in Control/Observer Synthesis/Continuous Time/Optimal Observer and State Estimation} = Detectability LMI =

= LMI for the Observability Grammian =

= H-infinity filtering =

= H2 filtering =

= H2 Optimal Observer =

= HInf Optimal Observer =

= Mixed H2 HInf Optimal Observer =

= H2 Optimal Filter =

= HInf Optimal Filter =

= FDI Filter Design For Systems With Sensor Faults: an LMI =

= H2 Optimal State estimation =

= Hurwitz Detectability =

= Full-Order State Observer =

= Full-Order H-infinity State Observer =

= Reduced-Order State Observer =

= Optimal Observer; Mixed =

= Optimal Observer; H2 =

= Optimal Observer; Hinf =

= Discrete Time Detectability =

= Schur Detectability =

= Robust Stabilization of Second-Order Systems =

= Robust Stabilization of $$ H{\infty} $$ Optimal State Feedback Control =

= Robust H inf State Feedback Control =

= LMI for Time-Delay system on delay Independent Condition =

= LMI for Time-Delay system on delay Dependent Condition =

= LMI for Stability of Retarded Differential Equation with Slowly-Varying Delay =

= LMI for Robust Stability of Retarded Differential Equation with Norm-Bounded Uncertainty =

= Bounded Real Lemma under Slowly-Varying Delay =

= LMI for L2-Optimal State-Feedback Control under Time-Varying Input Delay =

= Discrete Time =

= LMI for Attitude Control of Nonrotating Missiles, Pitch Channel =

= LMI for Attitude Control of Nonrotating Missiles, Yaw/Roll Channel =

= LMI for H2/Hinf Polytopic Controller for Robot Arm on a Quadrotor =

= An LMI for the Kalman Filter =

= Hinf Optimal Model Reduction =

= An LMI for Multi-Robot Systems =

= Helicopter Inner Loop LMI =

= Hinf LMI Satellite Attitude Control =

= H2 LMI Satellite Attitude Control =

= Problem of Space Rendezvous and LMI Approaches =

= Template =

title: LMIs in Control/Print version


text:
User:Qucchia

Hi, I'm qucchia, a 16-year-old male Brit living in Spain. Some of my interests include reading, playing chess, writing, mathematics, programming, astronomy and nature. I'm new to Wikibooks and I'm hoping to stay a while!

title: User:Qucchia


text:
Talk:Roblox Game Development

Hi, I think it's quite strange and unnecessary to begin the book with 'Roblox (not "ROBLOX", which is incorrect, although very common)'. I think it's better to just have 'Roblox' without that sudden statement. Qucchia (discuss • contribs) 13:38, 29 August 2021 (UTC)

 * I've just noticed that in the entire book ROBLOX is used instead of Roblox... which makes this statement ironic as well... Qucchia (discuss • contribs) 13:41, 29 August 2021 (UTC)

title: Talk:Roblox Game Development


text:
Exercise as it relates to Disease/Nintendo Wii training as a method for improving postural balance and lower body strength in community-dwelling older adults

This wiki-book aims to critique the research study 'Efficacy of Nintendo Wii Training on Mechanical Leg Muscle Function and Postural Balance in Community-Dwelling Older Adults: A Randomized Controlled Trial' by Martin G. Jorgensen et al.

This article critique is conducted for assessment for the "Health, Disease and Exercise (8340)" unit at the University of Canberra.

What is the background to this research?
Falls in older populations pose one of the greatest threats to overall health and the ability to perform activities of daily living. The performance of regular physical activity provides one of the greatest modes in prevention of falls due to the associated health benefits. As the physical activity guidelines in older adults are very similar to younger adults, many elderly struggle to achieve the recommended threshold. Biofeedback technology has shown to improve development of similar performance measures, and may enable this population to perform increased physical activity with greater improvements, reducing falls risks and subsequent injuries.

The aforementioned article aimed to address issues related to falls risk, i.e., lower body strength and postural balance, with the utilisation of biofeedback by means of a Nintendo Wii. This research provides an insight into a new mechanism for promoting physical activity in an older population, whilst providing an opportunity to build upon research aiming to address issues related to mortality and morbidity in older populations.

Where is the research from?
The research team behind the study resides in Denmark, a country which provides largely free healthcare, and who’s population has more than 20% of individuals aged 65 and over. This information indicates an older population, providing insight into the prerequisite for this research. The researchers have no affiliation with the technology used in the project and should not in this way be subject to bias. Each member of the research team has an extensive investigative background, particularly Per Aagaard, with a focus on health as it relates to ageing.

What kind of research was this?
The study was a randomised control trial, an experimental research method which allocates a population into either a control or intervention group at random. This research method provides the greatest ability to infer cause and effect relationships regarding the outcome of the experiment. This helps solidify the results of the study, which would not be possible when utilising a method such as a survey. The study was performed with the control group receiving a placebo via EVA insoles, and included observer-blinding, meaning the researchers did not know which group each individual was assigned to. This helps remove another possible ground for observer bias.

What did the research involve?

 * A total of 58 participants; 30 in the control group and 28 in the Wii group.
 * An experimental period of 10 weeks.
 * Participants recruited via newspapers, senior clubs and organisations.
 * Participants required a poor to average self-reported balance and an age of 65 or above.
 * The Wii group performed two sessions a week, each session totalling 70 minutes ±10 minutes, with two thirds of the session focusing on balance control, and one third of the session focused on lower body strength. Participants were able to pick the postural control exercise from five options, whereas the strength exercise was predetermined.
 * The control group was told to wear EVA insoles for the entirety of the 10 weeks, with a phone check-up every three weeks to identify any concerns.

Limitations
Although this study does measure appropriate performance measures in the Wii group, the efficacy of this training method in comparison to traditional strength and balance training for older adults cannot be concluded. Additionally, the short length of the study does not provide the opportunity to see the long-term effects of this training method, and if barriers to progression may surface. Finally, the sample size of 58 participants diminishes the study's generalisability, especially as the cohort chosen for this study were presumably quite healthy.

What were the basic results?
The baseline for each group was much the same. The Wii group saw an 82% compliance rate, however, with some parts of the program missed. Despite this, the Wii group saw an improvement of leg press maximum voluntary contraction of 17%, as the control group saw a decrease of 1%. The measure for postural control, centre of pressure velocity moment, saw a decrease of 7% in the Wii group and 8% in the control group. Additionally, we also see a statistically significant between group improvement to the following testing parameters: rate of force development, the timed up and go test, the shortened Falls Efficacy Scale-International and the 30-s Chair Stand test.

What did the researchers conclude?
The researcher's conclusions are fairly logical, promoting the use of this technology as a mode for increasing lower body strength in this population. Recognition of the lack of development for postural balance is also made. Despite no improvements to postural control, the post-experimental tests identified advancements in the Wii group, and some improvements in the control group. The researchers fail to acknowledge that the efficacy of this program in comparison to traditional training is not identified. The lack of improvement for postural balance in this cohort is hypothesised to be a result of ceiling effects, which seems plausible given the participants baseline.

What conclusions can we take from this research?
This study provides evidence suggesting that biofeedback technology, such as the Wii, provides a great opportunity for promoting physical activity in this population. A common barrier to physical activity is motivation, and the use of the Wii allows for something that may seem monotonous to become more enjoyable. A literature review on the use of the Wii in older populations further expresses how biofeedback can be used to improve exercise motivation. This review does not provide information on lower body power and focuses on physical activity promotion and balance. A systematic review of the literature implies that this technology can improve postural balance, but its long term efficacy is still debatable. Regardless, these articles highlight the effectiveness of biofeedback, identifying that the Wii can be used for increasing the amount and quality of physical activity performed in this population.

Practical advice

 * The device used in this study did not result in any injuries or illnesses, deeming it safe for use in this population. Consequently, practitioners and caretakers should look to use the Wii and similar technologies such as virtual reality headsets to decrease sedentary behaviour in this population.
 * The population in this study was healthy, as those with recent injury or illnesses were excluded. In populations with morbidities, the technology needs to be used with caution. However, literature indicates that this technology can provide effective methods of rehabilitation in other populations.
 * Putting aside the contradictive findings, health practitioners should use the Wii and similar technologies as they show high compliance and motivation results, whilst remaining mindful of the potential ceiling effects of the technology.

Further information/resources

 * 1) Top 10 Wii Games for Seniors:
 * 2) Games for a better life: effects of playing Wii games on the well-being of seniors in a long-term care facility.
 * 3) Physical activity and exercise guidelines for all Australians.


text:
Ada Programming/Libraries/Ada.Containers.Bounded Doubly Linked Lists

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Element_Type "" Left Right Element_Type Boolean PureBounded_Doubly_Linked_Lists Remote_TypesBounded_Doubly_Linked_Lists List Capacity Count_Type Constant_Indexing Constant_Reference Variable_Indexing Reference Default_Iterator  Iterate Iterator_Element  Element_Type Preelaborable_InitializationList Cursor Preelaborable_InitializationCursor Empty_List  List No_Element  Cursor Has_Element Position Cursor  Boolean List_Iterator_Interfaces AdaIterator_Interfaces Cursor Has_Element "" Left Right List  Boolean Length Container List  Count_Type Is_Empty Container List  Boolean Clear Container   List Element Position Cursor Element_Type Replace_Element Container   List Position       Cursor New_Item       Element_Type Query_Element Position  Cursor Process      Element   Element_Type Update_Element Container   List Position       Cursor Process Element   Element_Type Constant_Reference_Type Element     Element_Type Implicit_Dereference Element Reference_Type Element    Element_Type Implicit_Dereference Element Constant_Reference Container   List Position   Cursor Constant_Reference_Type Reference Container    List Position   Cursor Reference_Type Assign Target   List Source   List Copy Source List Capacity  Count_Type  0 List Move Target   List Source   List Insert Container   List Before         Cursor New_Item       Element_Type Count          Count_Type  1 Insert Container   List Before         Cursor New_Item       Element_Type Position      Cursor Count          Count_Type  1 Insert Container   List Before         Cursor Position      Cursor Count          Count_Type  1 Prepend Container   List New_Item       Element_Type Count          Count_Type  1 Append Container   List New_Item       Element_Type Count          Count_Type  1 Delete Container   List Position    Cursor Count          Count_Type  1 Delete_First Container   List Count          Count_Type  1 Delete_Last Container   List Count          Count_Type  1 Reverse_Elements Container   List Swap Container   List I J           Cursor Swap_Links Container   List I J           Cursor Splice Target     List Before        Cursor Source     List Splice Target     List Before        Cursor Source     List Position   Cursor Splice Container  List Before        Cursor Position      Cursor First Container List  Cursor First_Element Container List Element_Type Last Container List  Cursor Last_Element Container List Element_Type Next Position Cursor  Cursor Previous Position Cursor  Cursor Next Position   Cursor Previous Position   Cursor Find Container List Item      Element_Type Position  Cursor  No_Element Cursor Reverse_Find Container List Item      Element_Type Position  Cursor  No_Element Cursor Contains Container List Item      Element_Type  Boolean Iterate Container  List Process       Position   Cursor Reverse_Iterate Container  List Process       Position   Cursor Iterate Container  List List_Iterator_InterfacesReversible_Iterator Iterate Container  List Start   Cursor List_Iterator_InterfacesReversible_Iterator "" Left Right Element_Type Boolean Generic_Sorting Is_Sorted Container List  Boolean Sort Container   List Merge Target    List Source    List Generic_Sorting AdaContainersBounded_Doubly_Linked_Lists

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers


text:
Ada Programming/Libraries/Ada.Containers.Bounded Hashed Maps

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Key_Type Element_Type Hash Key Key_Type  Hash_Type Equivalent_Keys Left Right Key_Type Boolean "" Left Right Element_Type Boolean PreelaborateBounded_Hashed_Maps Remote_TypesBounded_Hashed_Maps Map Capacity Count_Type Modulus  Hash_Type Constant_Indexing Constant_Reference Variable_Indexing Reference Default_Iterator  Iterate Iterator_Element  Element_Type Preelaborable_InitializationMap Cursor Preelaborable_InitializationCursor Empty_Map  Map No_Element  Cursor Has_Element Position Cursor  Boolean Map_Iterator_Interfaces AdaIterator_Interfaces Cursor Has_Element "" Left Right Map  Boolean Capacity Container Map  Count_Type Reserve_Capacity Container   Map Capacity       Count_Type Default_Modulus Capacity Count_Type  Hash_Type Length Container Map  Count_Type Is_Empty Container Map  Boolean Clear Container   Map Key Position Cursor  Key_Type Element Position Cursor  Element_Type Replace_Element Container   Map Position       Cursor New_Item       Element_Type Query_Element Position  Cursor Process      Key       Key_Type Element  Element_Type Update_Element Container   Map Position       Cursor Process Key          Key_Type Element   Element_Type Constant_Reference_Type Element     Element_Type Implicit_Dereference Element Reference_Type Element    Element_Type Implicit_Dereference Element Constant_Reference Container   Map Position   Cursor Constant_Reference_Type Reference Container    Map Position   Cursor Reference_Type Constant_Reference Container   Map Key        Key_Type Constant_Reference_Type Reference Container    Map Key        Key_Type Reference_Type Assign Target   Map Source   Map Copy Source   Map Capacity Count_Type  0 Modulus  Hash_Type  0  Map Move Target   Map Source   Map Insert Container   Map Key            Key_Type New_Item       Element_Type Position      Cursor Inserted      Boolean Insert Container   Map Key            Key_Type Position      Cursor Inserted      Boolean Insert Container   Map Key            Key_Type New_Item       Element_Type Include Container   Map Key            Key_Type New_Item       Element_Type Replace Container   Map Key            Key_Type New_Item       Element_Type Exclude Container   Map Key            Key_Type Delete Container   Map Key            Key_Type Delete Container   Map Position    Cursor First Container Map Cursor Next Position  Cursor  Cursor Next Position    Cursor Find Container Map Key       Key_Type Cursor Element Container Map Key       Key_Type Element_Type Contains Container Map Key       Key_Type  Boolean Equivalent_Keys Left Right Cursor Boolean Equivalent_Keys Left  Cursor Right Key_Type Boolean Equivalent_Keys Left  Key_Type Right Cursor Boolean Iterate Container  Map Process       Position   Cursor Iterate Container  Map Map_Iterator_InterfacesForward_Iterator AdaContainersBounded_Hashed_Maps

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers


text:
Ada Programming/Libraries/Ada.Containers.Bounded Hashed Sets

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Element_Type Hash Element Element_Type  Hash_Type Equivalent_Elements Left Right Element_Type Boolean "" Left Right Element_Type  Boolean PreelaborateBounded_Hashed_Sets Remote_TypesBounded_Hashed_Sets Set Capacity Count_Type Modulus  Hash_Type Constant_Indexing Constant_Reference Default_Iterator  Iterate Iterator_Element  Element_Type Preelaborable_InitializationSet Cursor Preelaborable_InitializationCursor Empty_Set  Set No_Element  Cursor Has_Element Position Cursor  Boolean Set_Iterator_Interfaces AdaIterator_Interfaces Cursor Has_Element "" Left Right Set  Boolean Equivalent_Sets Left Right Set  Boolean To_Set New_Item Element_Type  Set Capacity Container Set  Count_Type Reserve_Capacity Container   Set Capacity       Count_Type Default_Modulus Capacity Count_Type  Hash_Type Length Container Set  Count_Type Is_Empty Container Set  Boolean Clear Container   Set Element Position Cursor  Element_Type Replace_Element Container   Set Position       Cursor New_Item       Element_Type Query_Element Position  Cursor Process      Element   Element_Type Constant_Reference_Type Element     Element_Type Implicit_Dereference Element Constant_Reference Container   Set Position   Cursor Constant_Reference_Type Assign Target   Set Source   Set Copy Source   Set Capacity Count_Type  0 Modulus  Hash_Type  0  Set Move Target   Set Source   Set Insert Container   Set New_Item       Element_Type Position      Cursor Inserted      Boolean Insert Container   Set New_Item       Element_Type Include Container   Set New_Item       Element_Type Replace Container   Set New_Item       Element_Type Exclude Container   Set Item           Element_Type Delete Container   Set Item           Element_Type Delete Container   Set Position    Cursor Union Target   Set Source      Set Union Left Right Set  Set "" Left Right Set  Set  Union Intersection Target   Set Source      Set Intersection Left Right Set  Set "" Left Right Set  Set  Intersection Difference Target   Set Source      Set Difference Left Right Set  Set "" Left Right Set  Set  Difference Symmetric_Difference Target   Set Source      Set Symmetric_Difference Left Right Set  Set "" Left Right Set  Set Symmetric_Difference Overlap Left Right Set  Boolean Is_Subset Subset Set Of_Set Set  Boolean First Container Set  Cursor Next Position Cursor  Cursor Next Position   Cursor Find Container Set Item      Element_Type  Cursor Contains Container Set Item      Element_Type  Boolean Equivalent_Elements Left Right Cursor Boolean Equivalent_Elements Left  Cursor Right Element_Type Boolean Equivalent_Elements Left  Element_Type Right Cursor Boolean Iterate Container  Set Process       Position   Cursor Iterate Container  Set Set_Iterator_InterfacesForward_Iterator Key_Type Key Element Element_Type  Key_Type Hash Key Key_Type  Hash_Type Equivalent_Keys Left Right Key_Type Boolean Generic_Keys Key Position Cursor  Key_Type Element Container Set Key       Key_Type Element_Type Replace Container   Set Key            Key_Type New_Item       Element_Type Exclude Container   Set Key            Key_Type Delete Container   Set Key            Key_Type Find Container Set Key       Key_Type Cursor Contains Container Set Key       Key_Type Boolean Update_Element_Preserving_Key Container   Set Position       Cursor Process Element   Element_Type Reference_Type Element    Element_Type Implicit_Dereference Element Reference_Preserving_Key Container    Set Position   Cursor Reference_Type Constant_Reference Container   Set Key        Key_Type Constant_Reference_Type Reference_Preserving_Key Container    Set Key        Key_Type Reference_Type Generic_Keys AdaContainersBounded_Hashed_Sets

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers


text:
Ada Programming/Libraries/Ada.Containers.Bounded Multiway Trees

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Element_Type "" Left Right Element_Type  Boolean PureBounded_Multiway_Trees Remote_TypesBounded_Multiway_Trees Tree Capacity Count_Type Constant_Indexing Constant_Reference Variable_Indexing Reference Default_Iterator  Iterate Iterator_Element  Element_Type Preelaborable_InitializationTree Cursor Preelaborable_InitializationCursor Empty_Tree  Tree No_Element  Cursor Has_Element Position Cursor  Boolean Tree_Iterator_Interfaces AdaIterator_Interfaces Cursor Has_Element Equal_Subtree Left_Position Cursor Right_Position Cursor Boolean "" Left Right Tree  Boolean Is_Empty Container Tree  Boolean Node_Count Container Tree  Count_Type Subtree_Node_Count Position Cursor  Count_Type Depth Position Cursor  Count_Type Is_Root Position Cursor  Boolean Is_Leaf Position Cursor  Boolean Root Container Tree  Cursor Clear Container   Tree Element Position Cursor  Element_Type Replace_Element Container   Tree Position       Cursor New_Item       Element_Type Query_Element Position  Cursor Process      Element   Element_Type Update_Element Container   Tree Position       Cursor Process Element   Element_Type Constant_Reference_Type Element     Element_Type Implicit_Dereference Element Reference_Type Element    Element_Type Implicit_Dereference Element Constant_Reference Container   Tree Position   Cursor Constant_Reference_Type Reference Container    Tree Position   Cursor Reference_Type Assign Target   Tree Source   Tree Copy Source Tree Capacity  Count_Type  0 Tree Move Target   Tree Source   Tree Delete_Leaf Container   Tree Position    Cursor Delete_Subtree Container   Tree Position    Cursor Swap Container   Tree I J           Cursor Find Container Tree Item      Element_Type Cursor Find_In_Subtree Position Cursor Item     Element_Type Cursor Ancestor_Find Position Cursor Item     Element_Type Cursor Contains Container Tree Item      Element_Type  Boolean Iterate Container  Tree Process       Position   Cursor Iterate_Subtree Position   Cursor Process       Position   Cursor Iterate Container  Tree Tree_Iterator_InterfacesForward_Iterator Iterate_Subtree Position  Cursor Tree_Iterator_InterfacesForward_Iterator Child_Count Parent Cursor  Count_Type Child_Depth Parent Child Cursor  Count_Type Insert_Child Container   Tree Parent         Cursor Before         Cursor New_Item       Element_Type Count          Count_Type  1 Insert_Child Container   Tree Parent         Cursor Before         Cursor New_Item       Element_Type Position      Cursor Count          Count_Type  1 Insert_Child Container   Tree Parent         Cursor Before         Cursor Position      Cursor Count          Count_Type  1 Prepend_Child Container   Tree Parent         Cursor New_Item       Element_Type Count          Count_Type  1 Append_Child Container   Tree Parent         Cursor New_Item       Element_Type Count          Count_Type  1 Delete_Children Container   Tree Parent         Cursor Copy_Subtree Target     Tree Parent        Cursor Before        Cursor Source        Cursor Splice_Subtree Target     Tree Parent        Cursor Before        Cursor Source     Tree Position   Cursor Splice_Subtree Container  Tree Parent        Cursor Before        Cursor Position      Cursor Splice_Children Target            Tree Target_Parent        Cursor Before               Cursor Source            Tree Source_Parent        Cursor Splice_Children Container         Tree Target_Parent        Cursor Before               Cursor Source_Parent        Cursor Parent Position Cursor  Cursor First_Child Parent Cursor  Cursor First_Child_Element Parent Cursor  Element_Type Last_Child Parent Cursor  Cursor Last_Child_Element Parent Cursor  Element_Type Next_Sibling Position Cursor  Cursor Previous_Sibling Position Cursor  Cursor Next_Sibling Position   Cursor Previous_Sibling Position   Cursor Iterate_Children Parent   Cursor Process     Position   Cursor Reverse_Iterate_Children Parent   Cursor Process     Position   Cursor Iterate_Children Container  Tree Parent   Cursor Tree_Iterator_InterfacesReversible_Iterator AdaContainersBounded_Multiway_Trees

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers


text:
Ada Programming/Libraries/Ada.Containers.Bounded Ordered Maps

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Key_Type Element_Type "" Left Right Key_Type  Boolean "" Left Right Element_Type  Boolean PureBounded_Ordered_Maps Remote_TypesBounded_Ordered_Maps Equivalent_Keys Left Right Key_Type  Boolean Map Capacity Count_Type Constant_Indexing Constant_Reference Variable_Indexing Reference Default_Iterator  Iterate Iterator_Element  Element_Type Preelaborable_InitializationMap Cursor Preelaborable_InitializationCursor Empty_Map  Map No_Element  Cursor Has_Element Position Cursor  Boolean Map_Iterator_Interfaces AdaIterator_Interfaces Cursor Has_Element "" Left Right Map  Boolean Length Container Map  Count_Type Is_Empty Container Map  Boolean Clear Container   Map Key Position Cursor  Key_Type Element Position Cursor  Element_Type Replace_Element Container   Map Position       Cursor New_Item       Element_Type Query_Element Position  Cursor Process      Key       Key_Type Element  Element_Type Update_Element Container   Map Position       Cursor Process Key          Key_Type Element   Element_Type Constant_Reference_Type Element     Element_Type Implicit_Dereference Element Reference_Type Element    Element_Type Implicit_Dereference Element Constant_Reference Container   Map Position   Cursor Constant_Reference_Type Reference Container    Map Position   Cursor Reference_Type Constant_Reference Container   Map Key        Key_Type Constant_Reference_Type Reference Container    Map Key        Key_Type Reference_Type Assign Target   Map Source   Map Copy Source   Map Capacity Count_Type  0  Map Move Target   Map Source   Map Insert Container   Map Key            Key_Type New_Item       Element_Type Position      Cursor Inserted      Boolean Insert Container   Map Key            Key_Type Position      Cursor Inserted      Boolean Insert Container   Map Key            Key_Type New_Item       Element_Type Include Container   Map Key            Key_Type New_Item       Element_Type Replace Container   Map Key            Key_Type New_Item       Element_Type Exclude Container   Map Key            Key_Type Delete Container   Map Key            Key_Type Delete Container   Map Position    Cursor Delete_First Container   Map Delete_Last Container   Map First Container Map  Cursor First_Element Container Map  Element_Type First_Key Container Map  Key_Type Last Container Map  Cursor Last_Element Container Map  Element_Type Last_Key Container Map  Key_Type Next Position Cursor  Cursor Next Position   Cursor Previous Position Cursor  Cursor Previous Position   Cursor Find Container Map Key       Key_Type  Cursor Element Container Map Key       Key_Type  Element_Type Floor Container Map Key       Key_Type  Cursor Ceiling Container Map Key       Key_Type  Cursor Contains Container Map Key       Key_Type  Boolean "" Left Right Cursor  Boolean "" Left Right Cursor  Boolean "" Left Cursor Right  Key_Type  Boolean "" Left Cursor Right  Key_Type  Boolean "" Left Key_Type Right  Cursor  Boolean "" Left Key_Type Right  Cursor  Boolean Iterate Container  Map Process       Position   Cursor Reverse_Iterate Container  Map Process       Position   Cursor Iterate Container  Map Map_Iterator_InterfacesReversible_Iterator Iterate Container  Map Start   Cursor Map_Iterator_InterfacesReversible_Iterator AdaContainersBounded_Ordered_Maps

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers


text:
Ada Programming/Libraries/Ada.Containers.Bounded Ordered Sets

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Element_Type "" Left Right Element_Type  Boolean "" Left Right Element_Type  Boolean PureBounded_Ordered_Sets Remote_TypesBounded_Ordered_Sets Equivalent_Elements Left Right Element_Type  Boolean Set Capacity Count_Type Constant_Indexing Constant_Reference Default_Iterator  Iterate Iterator_Element  Element_Type Preelaborable_InitializationSet Cursor Preelaborable_InitializationCursor Empty_Set  Set No_Element  Cursor Has_Element Position Cursor  Boolean Set_Iterator_Interfaces AdaIterator_Interfaces Cursor Has_Element "" Left Right Set  Boolean Equivalent_Sets Left Right Set  Boolean To_Set New_Item Element_Type  Set Length Container Set  Count_Type Is_Empty Container Set  Boolean Clear Container   Set Element Position Cursor  Element_Type Replace_Element Container   Set Position       Cursor New_Item       Element_Type Query_Element Position  Cursor Process      Element   Element_Type Constant_Reference_Type Element     Element_Type Implicit_Dereference Element Constant_Reference Container   Set Position   Cursor Constant_Reference_Type Assign Target   Set Source   Set Copy Source   Set Capacity Count_Type  0  Set Move Target   Set Source   Set Insert Container   Set New_Item       Element_Type Position      Cursor Inserted      Boolean Insert Container   Set New_Item       Element_Type Include Container   Set New_Item       Element_Type Replace Container   Set New_Item       Element_Type Exclude Container   Set Item           Element_Type Delete Container   Set Item           Element_Type Delete Container   Set Position    Cursor Delete_First Container   Set Delete_Last Container   Set Union Target   Set Source      Set Union Left Right Set  Set "" Left Right Set  Set  Union Intersection Target   Set Source      Set Intersection Left Right Set  Set "" Left Right Set  Set  Intersection Difference Target   Set Source      Set Difference Left Right Set  Set "" Left Right Set  Set  Difference Symmetric_Difference Target   Set Source      Set Symmetric_Difference Left Right Set  Set "" Left Right Set  Set Symmetric_Difference Overlap Left Right Set  Boolean Is_Subset Subset Set Of_Set Set  Boolean First Container Set  Cursor First_Element Container Set  Element_Type Last Container Set  Cursor Last_Element Container Set  Element_Type Next Position Cursor  Cursor Next Position   Cursor Previous Position Cursor  Cursor Previous Position   Cursor Find Container Set Item      Element_Type Cursor Floor Container Set Item      Element_Type Cursor Ceiling Container Set Item      Element_Type Cursor Contains Container Set Item      Element_Type  Boolean "" Left Right Cursor  Boolean "" Left Right Cursor  Boolean "" Left Cursor Right  Element_Type Boolean "" Left Cursor Right  Element_Type Boolean "" Left Element_Type Right  Cursor Boolean "" Left Element_Type Right  Cursor Boolean Iterate Container  Set Process       Position   Cursor Reverse_Iterate Container  Set Process       Position   Cursor Iterate Container  Set Set_Iterator_InterfacesReversible_Iterator Iterate Container  Set Start   Cursor Set_Iterator_InterfacesReversible_Iterator Key_Type Key Element Element_Type  Key_Type "" Left Right Key_Type Boolean Generic_Keys Equivalent_Keys Left Right Key_Type Boolean Key Position Cursor  Key_Type Element Container Set Key       Key_Type Element_Type Replace Container   Set Key            Key_Type New_Item       Element_Type Exclude Container   Set Key            Key_Type Delete Container   Set Key            Key_Type Find Container Set Key       Key_Type Cursor Floor Container Set Key       Key_Type Cursor Ceiling Container Set Key       Key_Type Cursor Contains Container Set Key       Key_Type  Boolean Update_Element_Preserving_Key Container   Set Position       Cursor Process Element   Element_Type Reference_Type Element    Element_Type Implicit_Dereference Element Reference_Preserving_Key Container    Set Position   Cursor Reference_Type Constant_Reference Container   Set Key        Key_Type Constant_Reference_Type Reference_Preserving_Key Container    Set Key        Key_Type Reference_Type Generic_Keys AdaContainersBounded_Ordered_Sets

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers


text:
Ada Programming/Libraries/Ada.Containers.Bounded Priority Queues

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Queue_Interfaces  AdaContainersSynchronized_Queue_Interfaces Queue_Priority Get_Priority Element Queue_InterfacesElement_Type  Queue_Priority Before Left Right Queue_Priority  Boolean Default_Capacity Count_Type Default_Ceiling  SystemAny_Priority  SystemPriority PreelaborateBounded_Priority_Queues Implementation Implementation Queue Capacity Count_Type  Default_Capacity Ceiling  SystemAny_Priority  Default_Ceiling Priority Ceiling Queue_InterfacesQueue Enqueue New_Item  Queue_InterfacesElement_Type Dequeue Element  Queue_InterfacesElement_Type Dequeue_Only_High_Priority At_Least      Queue_Priority Element    Queue_InterfacesElement_Type Success      Boolean Current_Use Count_Type Peak_Use Count_Type Queue AdaContainersBounded_Priority_Queues

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers


text:
Ada Programming/Libraries/Ada.Containers.Bounded Synchronized Queues

is a unit of the Predefined Language Environment since Ada 2012.

Specification
Queue_Interfaces  AdaContainersSynchronized_Queue_Interfaces Default_Capacity Count_Type Default_Ceiling  SystemAny_Priority  SystemPriority PreelaborateBounded_Synchronized_Queues Implementation Implementation Queue Capacity Count_Type  Default_Capacity Ceiling  SystemAny_Priority  Default_Ceiling Priority Ceiling Queue_InterfacesQueue Enqueue New_Item  Queue_InterfacesElement_Type Dequeue Element  Queue_InterfacesElement_Type Current_Use Count_Type Peak_Use Count_Type Queue AdaContainersBounded_Synchronized_Queues

Wikibook

 * Ada Programming/Libraries/Ada
 * Ada Programming/Libraries/Ada.Containers