text:
Real Time Java

A new, and for my opinion hot, topic. To get a University like start let's discuss on a very restricitve real-time Java system:

Safety Critical Java
Safety critical java is a Java specification request (JSR 302). The idea is to extend the usage of Java even for safety critical applications. that means the application AND the runtime system have to be certified. To achive this at the runtime system (JVM + library) a very simple and restrictive API should be used.

Overview

 * Periodic tasks and sporadic hardware/software events
 * No priorities, just time (period and deadline)
 * Three application phases:
 * Startup (Initialization)
 * Mission
 * Shutdown
 * No garbage collection (should be discussed)
 * Single scoped memory per thread (another discussion point)
 * Simple API, simple implementation
 * Not derived from the RTSJ
 * Implementable on top of the RTSJ

Criticism
Nokia voted Yes on the proposal but added the following comments: "Regarding JCP practices and relation to Java ME, it isn't clear if this JSR is proposing a new Java ME Configuration or Profile or is some kind of other specification to be used for possible future Configurations or Profiles. Section 2.6 states that this JSR will not assume the presence of a garbage collector, implying that it is a more limited environment than CLDC, the currently smallest Java ME Configuration."

Intel voted No on the proposal and added the following comments: "While we support the idea of a Java specification for safety critical systems, we believe that it is generally necessary for JSR to be clear about the kind of specification that will be generated, that is, a library, a configuration, or a profile. Therefore, we do not support approving this JSR in its current state.  We would like to see this JSR clarified in this regard and resubmitted."

Proposed API for Safety Critical Real-time Java
The following API is inspired by the Ravenscar profile for ADA and the derived work on Java (see 'missing references to R-ADA, Puschner/Wellings, RJ').

As a like it simple (personal opinion Schoeberl 22:20, 30 November 2006 (UTC)) here are the two classes that make up the API:

RtEvent
We use a single class to express all schedulable entities (periodic time-triggered, software event-triggered, and hardware event-triggered). Your real-time application has to extend this class.

package safetycritical; public abstract class RtEvent { /**    * A periodic real-time event, equivalent to a periodic thread * @param period * @param deadline * @param offset */   public RtEvent(int period, int deadline, int offset) { }   public RtEvent(int period, int deadline) { this(period, deadline, 0); }   public RtEvent(int period) { this(period, period, 0); }   /**     * A sporadic event with a minimum interarrival time * @param event * @param minInterval * @param deadline */   public RtEvent(String event, int minInterval, int deadline) { }   public RtEvent(String event, int minInterval) { this(event, minInterval, 0); }   /**     * The logic for the event. run gets invoked from the * scheduler either periodic, or on a hardware event or    * on a software event (fire): * @return true if ready for termination */   abstract protected boolean run; /**    * Gets invoked in the shutdown phase at the same period as     * run (instead of run). Invoked until return true. * @return true if shutdown is finished. */   protected boolean cleanup { return true; } }

RtSystem
This static class represents the real-time systems (similar to java.lang.System). Static methods provide the change between the different phases of the application.

package safetycritical; public class RtSystem { private RtSystem { // no RtSystem object }   /**     * Starts the real-time system (the mission). * All periodic and sporadic RT-events are scheduled. *    */    public static void start { }   /**     * Stop the real-time system (mission). When the event run method returns * true the cleanup methods are invoked until returning true * for a clean shutdown. *    */    public static void stop { }   /**     * Schedule a software event. * @param event */   public static void fire(String event) { }   /**     * Schedule a software event. * TODO: decide on which version is better: String or RtEvent * @param re    */ public static void fire(RtEvent re) { }   /**     * Return the elapsed time from system startup in micro seconds. * Wraps around all 4295 seconds. *    * @return */   public static int currentTimeMicro { } }

Examples
A few short examples how to use the proposed API:

package safetycritical.examples; import safetycritical.RtEvent; import safetycritical.RtSystem; public class TwoPeriodic { /** 	 * @param args */ 	public static void main(String[] args) { new RtEvent(1000000) { protected boolean run { System.out.println("P1"); return true; }		 		}; 		new MyEvent; RtSystem.start; } } class MyEvent extends RtEvent { int counter; public MyEvent { super(2000000); counter = 0; } 	protected boolean run { System.out.println("P2"); ++counter; if (counter==5) { RtSystem.stop; } 		return true; } 	protected boolean cleanup { System.out.println("cleanup invoked!"); return true; } }

package safetycritical.examples; import safetycritical.RtEvent; import safetycritical.RtSystem; public class PeriodicSporadic { /** 	 * @param args */ 	public static void main(String[] args) { new RtEvent("SWEVENT", 1000000) { protected boolean run { System.out.println("SW event fired"); return true; }		 		}; 		new MyPeriodic; RtSystem.start; } } class MyPeriodic extends RtEvent { int counter; public MyPeriodic { super(1000000); counter = 0; } 	protected boolean run { System.out.println("P2"); ++counter; if (counter%2==1) { RtSystem.fire("SWEVENT"); } 		if (counter==10) { RtSystem.stop; } 		return true; } 	protected boolean cleanup { System.out.println("cleanup invoked!"); return true; } }

Implementation
A prototype of the API is implemented on JOP. You can play around, without any real-time guarantees, with this API on the simulation of JOP (JopSim).

TODO
Discuss following issues:

 * Scoped memory
 * Critical sections (PCP or even interrupt disabling)
 * Shutdown needs probably a two-phase commit

title: Real Time Java


text:
User:Kathleensage/sandbox

Learning how to cite and make footnotes, found an open access book chapter on JSTOR that may be interesting.

Being bold is important to Wikipedia

 Paragraph:  This helps you set the style of the text. For example, a header, or plain paragraph text. You can also use it to offset block quotes.

==Notes==

added bolded text

source: wikimedia

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

title: User:Kathleensage/sandbox


text:
File:Pd 5.jpg

Summary
Self-made. Author, Chris Ott. I, Chris Ott, do hereby give this to the public domain. It can be used, altered, published, posted, or distributed in any way with or without attribution, for any purpose.

title: File:Pd 5.jpg


text:
User:Fahad niha

name:fahad realtionship:single home town:sirajganj year:16+ religion:muslim now study inter 1st my mother is housewife & my father is businessman

title: User:Fahad niha


text:
User:Kennyle78/sandbox

 * Welcome to ROC Party II!**

Diagnostic evaluation

We are using this page to archive the planning emails for the Second ROC Party, running from January to May 2015 with monthly large group, "umbrella" calls. Planning emails will get copied and pasted here, newest on top. Because this is a Wiki, you can make edits to suggest clarifications and add details or reorganize. Please make improvements. :-)

The correspondence from the first ROC Party (May-June 2014) is now in a separate Wiki page -- "ROC Party I".

=
=========================================================

 * January 18, 2015**

 * ROC Party II– Afterparty #1**

Hi, all,

Thanks for joining the call for ROC Party II! This is shaping up to be a big group and a varied, intellectually rich set of projects. We are enthusiastic!

This is a long email. It includes a lot of details. Again, this may be most useful if you print it out and have a hard copy for reference. This email is also reproduced in the https://OSF.IO site, under the Wiki tab, on a page for the instructions for ROC Party II. Putting this on OSF guarantees that we always can find it again, versus getting lost in email. Making it a Wiki also means that everyone can make suggestions for improving the instructions.

 * OVERVIEW**

The bulk of the work happens *in between* our monthly calls, and there are several things that should happen in the coming weeks to get the most out of the party. Following these steps makes it more likely than not that you’ll have both a deeper understanding of the concepts, and also a manuscript with at least the Methods, Results, tables and figures ready to go by mid-May.

 * SUGGESTED MENU OF ACTIVITIES for Month #1**

Here’s a suggested “set menu” of activities and a proposed order. This is intended to provide structure, but also be flexible. Like at a good restaurant, the set menu is designed to be enjoyable and successful, but if you know that you want a different order or entrée, then by all means customize!

 * Week 1.1***

 * Goal for the week* – conceptual grounding in ROC and how it is different from t-test and other traditional statistical methods in the social science.

 * Logistics:* Make sure you are registered on OSF and Peerwise<EMAIL_ADDRESS>is the point person)

 * Activities:* Read Youngstrom (2014) “Ready to ROC” primer from J Pediatric Psych (zip file under Templates in OSF). Post at least one multiple choice question on Peerwise, and answer some of the other questions.

 * Week 1.2***

 * Goal for the week:* Start thinking about what dataset and question you would like to be the focus for your subgroup

 * Logistics:* Post open-ended questions and logistical questions to the “Questions” Wiki Page in OSF. EAY and others will read and answer a couple times a week.

 * Activities:* Play with the sample data from the Youngstrom (2014) primer. The data are included in two formats (SPSS and Excel) in the zip file on OSF, and you also have the syntax, so you can re-run the syntax and see the raw output. This will give you a feel for the methods, and also the types of variables and how to check them for the (few) assumptions involved. Nominate a dataset backchannel and discuss with any collaborators in your own group.

 * Week 1.3***

 * Goal for the week:* Team building; finalize project selection

 * Logistics:* We want to have one experienced ROCer, one content expert, one person familiar with the dataset, and one understudy in each project group. There could be overlap in roles. Minimum suggested group size: 3 people. Maximum: ?? (More than 5 probably hits diminishing returns). We will use email to pair up people and projects. Need to start working through any admin issues for data sharing (deidentifying data set, local data use agreement, any other permissions).

Get feedback from experienced ROCer. Finalize dataset choice and team.
 * Activities:* Complete ROC Planning Canvas if not already done. https://docs.google.com/drawings/d/1Ujx34TogsFHdehqnjiaCOimhV0oVGdm9Q9CErKiE3SQ/edit

 * Week 1.4***

 * Goal for the week:* Be ready to ROC with new data – project team has met; all of team has data

 * Logistics:* complete at least one meeting to “meet and greet” team members; make sure everyone has data and appropriate permissions

 * Activities:* Project team meeting; report in to large group on umbrella call #2 (Friday, 2/13, 1:30-2:30 pm EST).

--

 * The ROC Canvas**

https://docs.google.com/drawings/d/1Ujx34TogsFHdehqnjiaCOimhV0oVGdm9Q9CErKiE3SQ/edit This is a one page worksheet designed to help plan the analysis and evaluate whether a dataset will be appropriate. It is a GoogleDoc. If people have trouble accessing it, we can look at converting to a different format.

One of the subtle but powerful things we’ve seen with using the ROC canvas is that it organizes the variables so that the statistical expert and content expert can work together much more quickly. Having someone who knows the dataset specify the exact variable names, and put them in the appropriate categories, reduces or eliminates the time needed for the stats person to learn the dataset. With a good canvas, the team can be running analyses within 5 minutes, instead of it taking hours or days for people to get familiar with the dataset. The minimum to be able to get started with analyses would be to work through the “Design Triage,” “Criterion Definitions” (referring to the diagnosis), and “Predictor Variables” (what we are using to try to classify cases into the correct diagnosis). Distractor and Moderator variables are optional, but good to think about. We will be talking more about those concepts in month 2, and revisiting them then. Clinical Application, Cost Structure, and “TBA” are concepts we’ll delve into later, too.

 * Big Call Logistics:**

It would be great to have a web solution that would let people have video or desktop sharing, and ideally record the meeting. UNC does *not* appear to have a license for GoToMeeting that we can use. Googlehangouts works well for the small groups, in our experience, but does not scale well to the big call. Gerry offered to have Children’s National host the next call on GoToMeeting on their license. If that offer holds, then we will do a test call in the next 2 weeks to beta-test and see if this will work for the 2/13 call.

 * Any other Questions or Suggestions?**

Eric’s email is<EMAIL_ADDRESS>and cell is<PHONE_NUMBER>. Using the Wiki on OSF.IO also has the power of drawing on the whole group, so it may be faster. :-)

All the best,

Eric & Team

=
========================================================

 * January 15, 2015**

 * ROC Party II -- The Beginning (again)**

Here’s the Join.Me ID: 391-453-639 This is optional, but will let you see my desktop.

Hi, all,

Here are the details for the call tomorrow, and some orientation to the ideas and technology we’ll be using over the course of the semester. This is a long email, doubling as a syllabus of sorts, and an orientation. You’ll want to print this out before the call and have it handy.

Call in information: Phone:<PHONE_NUMBER>, Conference ID: 202921

Video options: We have tried a lot of video options, with mixed results. Skype crashes my computer if it and SPSS are open at the same time (they are both pigs, and the processor overheats). Join.Me works well. Google Hangouts may not accommodate the full group on one hangout, and people need a Gmail account to link. I will host a Join.Me video link (id will come tomorrow morning. Once we have a list with peoples’ Gmails, we can set up a hangout and experiment with that; trying to build a hangout during the call tomorrow would take a huge chunk of the call time.

We have a big group and don’t all know each other. That’s okay – part of the fun of this will be the networking! 

Agenda for Call 1:20 – call line and Join.Me connection will be open, 1:30 – Start call – welcome and 30-60 second group introductions (UNC, Children’s National, Virginia Tech, Lancaster, etc.) 1:35 – Overview of ROC Party format for Spring (10 min + 5 Q & A) 1:45 – Logistics: Access to OSF, Access to Peerwise, contact information (15 min) 2:00 – First draft of small groups and projects Teams typically include at least 3 people – Content Expert, ROC leader, ROC understudy; could have additional students or co-authors 2:20 – Plan for mop-up and next actions 2:30 – Adjourn

That’s a lot to pack into an hour. One of the key concepts is the idea of a flipped classroom – most of the discussion and progress is going to happen in between these calls. The calls are mostly logistics: a report back & organize for the next push. The first ROC party met 4 times, with lots of sidebars and subgroup meetings in between.

The power of the format comes from the combination of a larger timetable, regular goals, and the sharing of resources online. We experimented with a lot of formats and technologies the first time. We have settled on two platforms as core:

 * Open Science Framework (OSF)**

https://osf.io

OSF is where we are sharing a bunch of the templates, source code, and project related materials. If you already have an account, we can link you to the ROC Party project in it. You will need a membership to access all the materials (it is *very* free – you will see that it is designed for us to be able to push things out to the general public on the Web if we wanted).

Peerwise is a teaching tool. It is pretty easy to learn, and we’ll have the advantage of walking into a “class” where the first wave of ROCers already created content. Details about joining below.

We have some things that we have done with Google, but not everyone has a Google address; we can decide backchannel whether we want to use it, too (for Hangouts, or other purposes).

 * Syllabus/Plan for the Semester **

(note that there is a “pre-meeting” set of goals before each group meeting)

We anticipate 4-8 projects for this second run. Let us know if you have any thoughts or suggestions, and definitely let us know if you have a project that you would like to run through the party mechanism. It would be a lot of fun to have you guys involved and sharing in shaping the experience!

 * First Call: Jan 16, 1:30-2:30 pm EST**

Before Next Meeting: Goals: Exposure to ROC concepts and output. Identify viable new dataset for team to work up. All participants read ready to ROC, write a multiple choice question for PEERWISE, answer other questions on PEERWISE; write any discussion questions and circulate 48 hours ahead Facilitators vet dataset through ROC Canvas, discuss feasibility, finalize teams.

(30 min afterparty for the facilitators) – Agenda: Discuss questions from Ready to ROC; meet your dataset
 * Second Call: Fri Feb 13, 1:30-2:30 pm **

Before meeting: try running analyses on variables, make list of questions and save syntax

(30 min afterparty for the facilitators) – Report on initial findings, small group discussion, report back on next steps & questions
 * Third Call: Fri March 20 1:30-2:30 pm**

Before meeting: MONS model – draft results section & tables; circulate drafts 24 hours in advance

(30 min afterparty for the facilitators) – small group: discuss drafts, select and integrate; report back
 * Fourth Call: April 17, 1:30-2:30 pm**

Before meeting: MONS model – draft methods, discussion

(30 min afterparty for the facilitators) – small group: DISCUSS target journals; review drafts, integrate, complete and review AARFS, discuss any other issues prior to submission; review process and make suggestions for the fall ROC party After meeting: finalize drafts
 * Fifth Call: May 15, 1:30pm **

 * Peerwise**

https://peerwise.cs.auckland.ac.nz/at/?unc_edu

Course: MECCAPsych

Course ID: 9159

(You make up the identifier and email it to<EMAIL_ADDRESS>we have to add it to a "white list" and then you will be able to join the class. Please allow 24 hours for us to get you added).

Peerwise is an online resource for you to create and share multiple choice questions. We are experimenting with this as a way to build up a library of questions about bipolar disorder, assessment, and other topics of interest to use to help people learn the material. To create your account, please send Emily Goldman<EMAIL_ADDRESS>the four digit ID you would like to use (I suggest the last four of your SSN or PID, or something else that you can remember easily). We add the ID to an “approve list” for the class, so please email the four digit ID you would like to use. The Course ID is 9159.

 * Expectations: **

Participation is completely voluntary, and we are aiming for the sweet spot that maximizes fun and productivity. We also are coming to play seriously. This is an assertive timetable, but the rewards are big. For people that commit to being faculty, the bump in salary is estimated at $1000/year for early publications. Over the course of your lives and careers, that compounds into significant moola. For people that choose other paths, the standard deviation is bigger, but the slope is always positive. That is Stat Speak for “Do this, and only good things will happen.”

If you sign up, you are agreeing to:

• Make your best effort to participate in all meetings and activities

• Arrive early or on time

• Come prepared!

• You can opt out of any portion, but please do the courtesy of emailing me and your team ahead of time so that we can adjust accordingly

Everyone who participates in the “ROC Party” will gain a deeper understanding of ROC, diagnostic efficiency, and clinical decision-making. We also will hone our chops at making tables, figures, and presenting results. The schedule is designed to have a high probability of resulting in a publishable manuscript, but that is partly contingent on the data cooperating. Even if they don’t, the product should still be sufficient to turn into a presentation at a conference, but the data sets and measures we are picking offer as close to a “sure bet” as occurs in the real world.
 * Products: **

 * The “MONS Model”* is one where everyone on the team individually writes all sections of a project, then the group convenes, compares the drafts, selects one as “primary” and draws in the key modifications from the others. We have done this with posters and found it to work better than carving up pieces for separate authors; this is our first attempt at scaling up to a manuscript level. In terms of authorship, we will use the AARF approach (there is a template file in OSF), with the majority of points for a particular section going to the person whose draft was adopted as the primary version, and remaining points going to others. There will be generous “wingman” points for replication of analyses, given the training goals of the project.

 * “Devil Takes the Laggard” Clause: **

If you don’t have a draft submitted by the deadline, your version of that module doesn’t get considered for inclusion in the final version (unless there are no submitted versions). This is a draconian rule, and we can decide whether or not we want to keep it in the future. This is our time to beta-test it. The intent is to reward a focus on commitments, and to ensure that projects reach completion quickly.

 * Lawyer zone: ***

Signing up to participate is not enough to get authorship; you have to earn that by participating actively and ideally by improving the product. Attempts to game the system will be subject to loss of letter of recommendation, ridicule, both, or worse. Files and content in OSF that are not public should not be made public without the prior consent of the author or owner of the content.

 * Next Actions: **

1) Email Emily Goldman<EMAIL_ADDRESS>your contact information (Name, Preferred email, four digit code for Peerwise, cell & gmail if you want to share, OSF account name if set up)

2) Register for OSF and Peerwise

3) Facilitators: Nominate your project of choice and make sure that the data are accessible

4) Participants: Make sure to have read the “Ready to ROC” paper, pulled down the sample data, and run the sample analyses in SPSS and/or R. Email a PDF of the output as your ticket to enter the party. If you do it in R, then you’ll accrue bonus points, and probably get to skip having to come back as an opossum sometime in the next dozen reincarnations.

5) Technical: Please make sure that you have a good internet connection, a camera (or a good recent picture to send as a surrogate), and a good phone or mic connection. Once we have divvied up into teams, each team is free to decide what works best for them (some options include Google Hangouts, Join.Me, TeamViewer, Skype, etc.). That is another part of the “beta testing” this time around.

Please email me ASAP or call<PHONE_NUMBER>) if you have questions or suggestions.

I think that this is going to kick butt, constructively. Looking forward to tearing it up together!

All the best,

Eric & the ROCing Facilitators (sounds like the name of a band! Serendipity?)

=
========================================================

 * January 14, 2015**
 * Kickoff email**

Hi, all, Thanks for your continued interest in the ROC Party! There’s been a lot percolating in the background. We have two formats that we are planning: One is a “spring semester” format where we have four large group meetings, once a month (Friday 1:30 to 2:30 EST, starting this week) to make introductions, discuss key points. Most of the work will happen in between meetings, when small groups focused on a specific project would meet and move analyses and drafts along. The other will be an intensive “short course” format. We are trying to decide whether to do a two day “workshop” format, a week long (which would be a bigger time commitment, but would allow more downtime) or a 5 week format (most similar to what we did with ROC Party I, last May-June). The initial “interest meeting” and planning call will be this Friday 1:30 to 2:30 EST. If you are interested but can’t make the call, let’s talk backchannel about best options. We have a lot of interest here at UNC, with people who can be “extenders” to help with analyses and logistical support. We ran 6 projects through the first ROC party, and that seemed like a good number. I think that 4-8 would definitely be in the sweet spot to get the benefits of scale and seeing multiple sets of analyses and technical issues, but not be cumbersome. We have enough projects and data to exceed that capacity, so we definitely are interested in doing both a “one semester” and a summer intensive format. With batches, too, there is the possibility of feeding these into a special section proposal for a journal, and there is interest in an edited volume anthologization. If people are interested in those, we can explore further with publishers (Guilford and Oxford editors have both expressed interest in the concept). The advantages of the large group component are having some structure and social support, as well as a set of shared resources. [ ] Sorry, I will miss the call, but I am still interested. Looking forward to it, and best to all, Eric

title: User:Kennyle78/sandbox


text:
Talk:High School Mathematics Extensions/Mathematical Proofs

Could anybody prove that $$n-m = -1*(m-n)$$? r3m0t 14:44, 13 Dec 2003 (UTC)

comment 1
Uhhh... Take the right hand side and expand
 * -m - (-1)n

which is equivalent to
 * -m+(-1)(-1)n

which is
 * -m+1n
 * n-m

which is the desired result.

Dysprosia 00:03, 14 Dec 2003 (UTC)

 * *grin* Cool. Now I really know it's true! ;) r3m0t 00:32, 14 Dec 2003 (UTC)

I found a good example for the visual proofs section - prove that the series $$1^2+2^2+...+n^2$$ multiplies by 4 and adds 1 when n is increased by one. No idea? Think about how many squares there are on a 16×16 grid. <IP_ADDRESS> 08:29, 5 Jan 2004 (UTC) (r3m0t)

 * Okay, good work. Let me think why it is so... Xiaodai 09:49, 5 Jan 2004 (UTC)
 * Whoops. Never even tried it out on paper, I was so convinced. No, that isn't even true *grins*. Ah well, in which case, a good recursion exercise is finding out how many squares (of any size) there are on a 16×16 grid. The answer happens to be 1,496 (or aleph-one, depending on how you interpret the question...) I will however try and investigate how to fix that times 4 and plus 1 rule, but chances are the outcome will be pretty complicated. r3m0t 19:11, 5 Jan 2004 (UTC)

Is the following line correct, it would seem more logical to prove v=w instead of v = u: 2. Prove using only the axioms if u + v = u + w then v = u (subtracting u from both sides is not accepted as a solution) I can't find the solution to this problem, so it would be great if you could give me a hint Problemset nr 1 seems to be wrong as well, the greater than sign should be turned around, otherwise simply trying n=2 will show you that it's not trueMmartin 19 july 2004
 * Thanks I corrected the error. As an hint to this type of problems, we always use 0 e.g. a = a + 0. If you are still scratching your head, the solutions is as follows:

\begin{matrix} v &=& v + 0\\ &=& v + (u - u)\\ &=& (v + u) - u\\ &=& (w + u) - u\\ &=& w + (u - u)\\ &=& w + 0 \\ &=& w \end{matrix} $$
 * as required. Thank you very much for you question. I love getting questions, it assures me that somebody out there is reading my work. Xiaodai 08:42, 20 Jul 2004 (UTC)

Hum??
I've trouble on doing question 3 of the first exercise. Can you give me some hints? (Also it seems the question itself has some minor typing mistakes) -lemontea

 * Thanks for pointing it out lemontea, fixed. Xiaodai 04:11, 18 Dec 2004 (UTC)

 * Now I'm completely stucked. I tried doing binomial expansion of that (i-1)^k and cancel out the highest power i^k, leaving only smaller power behind so I can employ induction, but this method failed. How did you do it? (Though I have an idea on making use of the generating function, but them this can expand to a project which the size is comparable to the project in the first chapter) Lemontea 18:11, 26 Dec 2004 (GMT+8)

 * I hope you dont mind, i will write out the complete solution here. You may have been confused by the questions. Anyway..

 * It's clear that 11 + 21 + ... = (n+1)n/2. So we can start the induction from there.
 * Suppose that
 * $$\sum_{i=1}^ni^j$$
 * has an explicit formula in terms of n for all j < k (**), we aim to prove that
 * $$\sum_{i=1}^ni^k$$
 * also has an explicit formula.

 * Indeed, consider
 * $$\sum_{i=1}^n[i^{k+1} - (i-1)^{k+1}] = n^{k+1}$$
 * I think you may have consider ^k instead of ^(k+1). Also, looking at it from another way
 * $$\sum_{i=1}^n[i^{k+1} - (i-1)^k] = \sum_{i=1}^n[i^{k+1} - i^{k+1} + i^k - i^{k-1} + ... \ 1]$$
 * as you have mentioned the ik+1 cancels, leaving smaller powers, rearraging to get
 * $$\sum_{i=1}^ni^k$$
 * on the left hand side and using the induction hypothesis (**) then we are done. Hope this has been helpful. Xiaodai 00:13, 28 Dec 2004 (UTC)

Thanks! That helped. (Oh no, I found I was just a few steps away from the end of the solution, a ghost must have covered my eyes, ahhhhhhhhh...) However, it seems the ending part could be written more clearly, and the above did contain some minor error... $$\sum_{i=1}^n[i^{k+1} - (i-1)^{k(??)}]$$ $$ = \sum_{i=1}^n[i^{k+1} - i^{k+1} + i^k - i^{k-1} + ... \ 1]$$(Shouldn't there be some binomial coefficient when expanding out?)

I thought the principle would be like the below: $$\sum_{i=1}^n[i^{k+1} - (i-1)^{k+1}] = n^{k+1}$$ $$\sum_{i=1}^n[i^{k+1} - \sum_{j=0}^{k+1} {k+1 \choose j} i^j] = n^{k+1}$$ $$\sum_{i=1}^n[i^{k+1} - {k+1 \choose k+1} i^{k+1} - \sum_{j=0}^k {k+1 \choose j} i^j] = n^{k+1}$$ $$\sum_{i=1}^n[\sum_{j=0}^k {k+1 \choose j} i^j] = n^{k+1}$$ $$\sum_{j=0}^k[\sum_{i=1}^n {k+1 \choose j} i^j] = n^{k+1}$$(Huh, I think I'll have to write another sub-chapter on the nested/2-dimensional sum notation operation...) $$\sum_{j=0}^k[{k+1 \choose j} \sum_{i=1}^n i^j] = n^{k+1}$$ I think things should be clear now :)

However, after doing this question I feel the urge to feedback my strong opinion on this solution. The exsistence of a formula is usually to help people do calculation faster and easier, but like above, the result is that the formula relies on combining all of the pervious formula in that series, although the formula is still a finite calculation, but when k increases to somewhere like 10, the so called "formula" will become so complex that it lost its elegence, and that it doesn't serve the function of reliefing difficulties in calculations anymore. Lemontea 10:37, 28 Dec 2004 (GMT+8)
 * You are right about the coefficient, i just forgot. Good wook. You comment about the solution is correct, may i remind you that the point of the question is to test induction skills, although you are absolutely right about the deficiency of the question. Thanks. Xiaodai 03:01, 28 Dec 2004 (UTC)

I know that for mathematicians, it is considered an art to say just enough....to find a balance between not giving every single step, but yet making the point clear to a fellow mathematician. However, non-mathematicians don't necessarily think this way. I know we want the reader to think and ask, but we don't also want them to think they're stupid and give up. It seems that one of the beauties of this sort of media is that perhaps we can provide the extra explanation, yet bury it with hyperlinks, etc. The above discussion is one such example.Lizmaemom (discuss • contribs) 23:56, 3 July 2011 (UTC)

M5?
M5:for every a there exist b such that ab=1

What about 0? Does a inverse of 0 exist? --Lemontea 13:42, 1 Mar 2005 (UTC)

 * See, that's what I mean about messy (I don't mean the omission, that's an easy mistake to make, but the way the thing was structured). There's a better way of saying this (which I'll just say now, so you'll see what I mean). Dysprosia 22:25, 1 Mar 2005 (UTC)

Incorrect Proof
A lot can be learned by being asked to find the mistaken logic in an incorrect proof, of which many can be found online. One is as follows for Goldbach's conjecture:
 * step 1: Any even number >=6 can be described by 6Q +b, b={-2,0,+2}

(thus any even number is either 2 behind, 2 ahead, or coincident with, a multiple of 6) Thus, we can write E = 6Q +b
 * step 2: a recognized required (but not sufficient) condition for any prime>=5 is that they are of the form 6N +/1 (it is 1 ahead or behind a multiple of 6)

 * step 3: rewrite step 1 as  (any) even = 6L+/-1 + 6M +/-1

We can substitute step 2 into step 3 and get:
 * step 4: (any >3) even  = prime1 + prime2

the above essentially "proves" GC - where is the mistake in the proof?--Billymac00 (talk) 02:41, 10 March 2008 (UTC)

Feedback
This section is fascinating. I hope you can improve it. Some examples are tough to understand and I hope you can explain them better. --<IP_ADDRESS> (talk) 01:08, 5 May 2010 (UTC)

Shouldn't math mode be used for writing mathematical statements? --ranade

Additive Inverse ?
Here is axiom three in the Axioms and inference section : A3: For every a, there exist b (written -a), such that a + b = 0 (existence of an additive inverse) Not that I am mathematician or anything but I think inverse is not the right word, -a is the opposit of a, right?

Would you have a place for this approach? A scientific approach to mathematics - Observation of patterns then proving them

Mathematics is a hobby of mine and on more than one occasion, I've reinvented the wheel. This paper is one such example. Therefore, even though it is original work for me, Bernoulli was the first to use this approach. At least that is what a Washington University professor told me. This also means that it can be published on Wiki without violating the policy against original work. It also means that I am free to offer it as public domain. I have solved problems that only the greats in mathematics are given credit, but I lack a formal education in mathematics, so I would never be able to convince any journal to publish my work. Yet, I've been able to impress others with my knowledge and ability to invent new approaches to solve problems. Being in a position without the credentials, I always provide irrefutable evidence that my approaches are correct. Most Ph.D professors can't say the same. I don't need credit for any of my work in math nor do I need any money. I'm making a comfortable living using my mind in the sciences. But, I would be greatly rewarded if I could share some of my understanding with young people. I'd like to get other people to think outside the box. The traditional lessons are important, but I would also like to see young people learn the value of creativity. Mathematics is also tainted with an image of logic and theory instead of as a true science. The paper that I'm offering here is a good example of how a problem can be solved by starting with observation.


text:
OpenOffice.org/Performance Tips

If you want to OpenOffice.org startup even faster, try these speed boosting tricks.

 * Upgrade to the latest stable version.
 * Upgrade your RAM, OpenOffice.org alone needs at least 256 Mb, but it will be a lot happier with more. Refer to recommended (not minimum) RAM requirements of your operating system and desktop environment.
 * Use native file formats, converting to other formats takes time.

General settings

 * Visual
 * In Tools > Options > View:
 * Switch off showing icons in menus
 * Disable showing previews of fonts
 * Disable anti-aliasing (where the option exists), if you don't require this or if your desktop environment does the anti-aliasing job itself;
 * Consider using the Classic icon style or one that matches your desktop environment (the latter may be pre-set if you use a distribution geared towards a specific desktop environment).

 * Languages, spelling and grammar
 * Disable spelling and grammar extensions for languages you don't use (disabling some may require superuser rights);
 * Disable automatic spelling and grammar checking inTools > Options > Language Settings > Writing Aids > Options subsection —
 * Uncheck the following options:
 * "Check spelling as you type";
 * "Check grammar as you type".

System-specific information

 * Windows
 * Use the quickstarter for faster application start-up. Note that Using the QuickStarter may increase the time for system initialisation.

 * Linux
 * Have you run prelink?[Prelink]
 * If you are using Linux, use your distribution's packages, they are typically more optimized than the plain ones.

 * If you try renaming a folder containing a new OO document, you may get an error message saying the folder can't be renamed because it's being used--even if you've closed the document. Here's a workaround: Just move the document out of that folder, rename the folder and move the document back in.

Version 2.0
In 2006, there were some benchmarks which showed that OOo-2.0 still used a lot of memory and was slower than MS-Office, but OOo developers promised that they were working on improvements.

This version branch requires at least 128 Mb of RAM to run properly.Running OO.o 2.x off a LiveCD (such as Knoppix) without swap space requires 2–4 times as much, depending on whither window manager (such as IceWM) or desktop enviornment (like KDE/GNOME) you use.
 * System requirements

By default, OpenOffice.org 2.x and earlier include a number of writing aids (dictionaries and thesauri). By version 2.4, the amount of these is extensive, with writing aids for approximately 25 languages and language variants, and all are loaded into memory when starting OO.o.
 * Disabling writing aids

For everyday use, most languages' and some of their variants' dictionaries can be turned off throughTools > Options > Language settings > Writing Aids —
 * Click the [Edit...] button next to "Available language modules" section;
 * In "Edit Modules" window, choose all unnecessary languages from the drop-down menu and then uncheck their respective spelling, grammar, hyphenation, and thesaurus modules in the list below. When done, click the Close button to exit the window and then click OK to exit the Options window. Restart OO.o.

Version 1.x
In early versions of OpenOffice.org, before 1.1, it was cursed with a severe speed problem, taking a long time to load, often over a minute. As of May 2004, that issue seems to have been resolved with OO.o 1.1.

This version branch needs at least 64 Mb of RAM to run properly.
 * Requirements

Compiling
If you are compiling OpenOffice.org, make sure you are using the right cflags. A well tuned selection can have a 20% increase. Using the latest version of GCC can also make a big difference.

title: OpenOffice.org/Performance Tips


text:
Dibgashi

Dibgashi (Дибгаши) is a rural locality (a selo) and the administrative centre of Dibgashinsky Selsoviet, Dakhadayevsky District, Republic of Dagestan, Russia. The population was 1,131 as of 2010. There are 3 streets.

Nationalities
Dargins live there.

Geography
Dibgashi is located 9 km east of Urkarakh (the district's administrative centre) by road. Kalkni and Gunakari are the nearest rural localities.

title: Dibgashi


text:
Talk:Deon Kotzé

Move discussion in progress
There is a move discussion in progress on Talk:Bjorn Kotze which affects this page. Please participate on that page and not in this talk page section. Thank you. —RMCD bot 11:35, 17 August 2012 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 1 one external link on Deon Kotzé. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20160304224718/http://www.cricketnamibia.com/index.php/2011-07-25-15-55-33/32-general-information to http://www.cricketnamibia.com/index.php/2011-07-25-15-55-33/32-general-information

Cheers.— InternetArchiveBot  (Report bug) 07:07, 11 December 2016 (UTC)

title: Talk:Deon Kotzé


text:
дабы

Conjunction

 * 1)  in order to, in order that, so that

Usage notes

 * Particularly since the 21st century, this conjunction (stressed as да́бы) has re-entered colloquial usage as a more flavorful or intimate synonym to . This is often seen as improper by older speakers. Historically, дабы became increasingly archaic following the end of the 18th century, but it remains amply attested in literature.

title: дабы


text:
Zaira Bas

Zaira Bas Gomis (born 1994) is a Spanish model and beauty pageant titleholder who captured the crown of Miss Earth Spain 2014 and was a top 8 semifinalist in Miss Earth 2014. Zaira is the second Spanish delegate to finish a Top 8 placement after Adriana Reverón in 2008.

Miss Earth Spain 2014
Zaira joined Miss Earth Spain 2014 and represented the capital city, Madrid. She won the "Best in Swimsuit" round.

At the conclusion of the pageant, Zaira was proclaimed as the winner. Her elemental court (runners-up) is composed of Selena Lugo, who represented Canarias, as Miss Earth Spain - Air, Enerits Peña of País Vasco as Miss Earth Spain - Water and Tamara Moreno from Córdoba was declared as Miss Earth Spain - Fire.

Miss Earth 2014
By winning Miss Earth Spain, Gomis flew to the Philippines in November to compete with almost 100 other candidates to be Alyz Henrich's successor as Miss Earth.

During the entire run of the pre-pageant activities, Zaira was able to capture some awards. Her awards include both gold medal for "Resort Wear Competition" and "Swimsuit Competition" each, a silver medal for "Evening Gown Competition", a bronze medal for "National Costume Competition" for Europe. She was also able to get two awards from Sponsors - "Miss Phoenix Petroleum" and "Miss Ever Bilena" awards.

At the conclusion of the pageant, she finished as one of the Top eight finalists. The Miss Earth 2014 title was won by Jamie Herrell of the Philippines.

title: Zaira Bas


text:
Nils Steen

Nils Steen (19 February 1892 – 29 September 1968) was a Norwegian businessman.

Personal life
He was born in Kristiania as a son of businessperson Christian Strøm Steen (1854–1932) and Lilli Bing (1865–1935). He was thus a brother of Emil Steen, grandson of Peter Emil Steen, nephew of Johan and Emil Steen, and a first cousin of Erling and Fredrik Steen.

In 1925 he married Wencke Mowinckel Wetlesen, daughter of an explosives company executive.

Career
He took commercial education in Norway and abroad, and was hired in the family company Steen & Strøm in 1919. Together with his first cousin Erling Steen and Eyvind Strøm, who both too entered the company in the 1910s, he took over the leadership in the 1930s. Nils Steen became director in 1932. After becoming chief executive in 1960 he retired in 1964, but continued as chairman of the board.

During the occupation of Norway by Nazi Germany, acting chief executive Nils Steen and chairman Erling Steen abide by the trade policies of the occupiers. Erling Steen was imprisoned for a period, and in May 1943 the wholesaling and retailing departments of Steen & Strøm were shut down by the authorities.

He was a supervisory council member of Oslo Sparebank from 1943 to 1953, and in the enterprise organizations he was a board member of Handelens Arbeidsgiverforening from 1938 to 1948, of Oslo Manufakturkjøbmenns Forening from 1946 to 1947 and their representative in Oslo Chamber of Commerce from 1945 to 1951. He resided at Gjettum farm since 1932, and was a member of Bærum municipal council from 1948 to 1951, elected on a joint list of the Conservative and Agrarian parties.

He was decorated with the King's Medal of Merit in gold in 1964. He died in September 1968.

title: Nils Steen


text:
PHP Programming/html output

There are a few different way you can display HTML using PHP. Generally, you will use the echo command to output something. This will be seen by a web browser, and then it will format it.

Breaking PHP for Output
In addition to using functions such as echo and print, you can also end your script, and anything beyond the end of the script will be output as normal HTML to the browser. You can also restart your script whenever you want after you've closed the PHP tag. Confused? It's actually pretty simple.

Let's say you had a for loop to count up to five and output it.

While I would tend to use templates for larger pages that output a lot, we'll get to that later. Remember how all your PHP scripts start with  and end with  ? Those don't have to be the very start and end of your file. In fact, PHP handles ending and restarting scripting just like if everything between the  and   tags were inside of an echo statement.

Thus, you could do something like this:

This is actually a very common method of outputting variables in a script, especially if there is a lot of HTML surrounding the variables. As I said before, I personally rarely ever do this, as in my opinion, using echo for smaller scripts keeps your code cleaner (and I would use templates for larger ones). However, we want to cover most of the language here, so this is another method you could use.

title: PHP Programming/html output


text:
Template:Did you know nominations/Oak Hill Industrial Academy

The result was: promoted by Allen3 talk 12:09, 17 February 2015 (UTC)

Oak Hill Industrial Academy

 * ... that Oak Hill Industrial Academy was a school in Indian Territory for Choctaw freedmen's children?
 * Comment: February is African American History Month. Article speaks to a little known era of African American heritage.
 * Comment: February is African American History Month. Article speaks to a little known era of African American heritage.

Created by SusunW (talk). Self nominated at 18:33, 9 February 2015 (UTC).

 * Symbol question.svg New (8th), long enough, neutral, no copyvio found via spot check (though I had some issues of failed verification in the Flickinger), no QPQ necessary yet. Alumni section is uncited. There may also be issues with the school's notability (does it have dedicated sourcing apart from the book?) but that's outside the DYK purview. Hook doesn't have an immediate ref in article (see 3b). Please ping me if I don't respond. czar ⨹   01:24, 10 February 2015 (UTC)

 * Thanks for the review! I will try to address your comments in order: 1) Not sure what you are referencing with failed verification in Flickinger, please advise and I will correct it. 2) Added page citations to the alumni. As of yet, have not had time to research them further. 3) School is one of the very few freedmen schools that existed in Indian Territory. Since Indian Freedmen situation is fairly unique, there were never many of these schools and few outside of Oklahoma/Indian Territory. As far as my research has shown, it may well be the ONLY one of these schools that offered high school education. There was one college and it was the only college before Langston opened. I have no access to Department of Interior or Presbyterian Mission Board records (I am not in the US), but searches of both databases indicate there is hard copy information available from those sources. It is also listed in several state guidebooks and has a state-erected historical marker. 4) I have changed the reference for in-line citation #18 with the official title of the sub-section of Presbyterian Missions Board "for Freedmen" that was responsible for building this school. The citation on page 103 of Flickinger confirms that it was a Freedman's school and the opening flyleaf for the book confirms the sub-section. If I need to provide other clarifications or information, please advise. Again, I appreciate the input. SusunW (talk) 03:12, 10 February 2015 (UTC)

 * Comment -, if you need access to sources within the USA and can't get them from an international computer, ping me with what you are looking for, i can get to JSTOR and such via my University account.  Montanabw (talk) 18:27, 10 February 2015 (UTC)
 * "Comment': ; I think footnote 13 sources the hook.  As to notability, I'm part of WP Indigenous people of North America, and I'm comfortable that this article is fine; these old historic Indian boarding schools often have mostly offline research sources.  Montanabw (talk) 18:29, 10 February 2015 (UTC)

 * Thanks . I work in obscure areas, history of minorities, so for me, this was a HUGE amount of information to find. These Native American boarding schools are difficult to search, but freedman schools, even harder ... double minority, in the south, in a frontier area. Oklahoma is also unique among the states because a great majority of the information on the state is in federal and not state archives. I was actually really pleased that I found multiple outside references to back up Flickinger, i.e. Department of the Interior report, Presby church archives, and even a state educational report. As for one of the alumni, the doctor, I have verified him with at least 6 outside sources. Don't know if I'll find enough for an article, but an important find. He may well be the first black, or first Muskogee Nation physician after statehood. Those things excite me. Pulling little snippets out of the past that enrich the entire history. Also appreciate your offer of access to sources. Much appreciated. :) SusunW (talk) 21:04, 10 February 2015 (UTC)
 * Have my hands full at the moment, but I wanted to acknowledge that I saw your reply (thank you) and say that I'll take a look at this over the weekend, if that's okay czar ⨹   11:20, 12 February 2015 (UTC)
 * When you can, you can. Not to worry. Real life always takes precedence. SusunW (talk) 14:27, 12 February 2015 (UTC)
 * , looks good—good work! I only brought up the notability as a potential concern, not something I'm after. What matters is not its novelty but whether it was the subject of multiple, reliable, secondary sources. Not to be a nuisance, but 3b says that every fact in the hook needs to be said directly in the article text and have their own direct citations. Can you directly cite one of the mentions that it is in Indian Territory? czar ⨹   03:21, 15 February 2015 (UTC)

 * Flickinger (1914), pp 220-221 (citation #2 in the article) states that Oak Hill was in the Choctaw Nation, it states Indians were located in Indian Territory, and it states that statehood was established in 1907. I don't think I am going to find a source that is clearer than that or that specifically states Oak Hill was in the Indian Territory. Currently the Choctaw Nation is thought of as the tribe, but prior to Oklahoma statehood in 1907 it was a geographical district over which the tribe had jurisdiction in Indian Territory. I would assume like the statement "the capital of France is Paris" WP:SYNTH because of the time frame it is self-evident. Maybe DYK rules are more stringent than Wikipedia on this? I am a relatively new editor on Wikipedia and freely admit I have no idea how most of the rules work. ;) SusunW (talk) 14:14, 15 February 2015 (UTC)
 * Symbol confirmed.svg that works. The idea is just to make the hook's facts as easy to verify as possible when the article runs on the front page. Looking forward to your future work. czar ⨹   14:20, 15 February 2015 (UTC)

authors: ಮಲ್ನಾಡಾಚ್ ಕೊಂಕ್ಣೊ


text:
Alastair Watson

Alastair Watson is the name of:

 * Alastair Watson (soldier) (born 1953), Private Secretary to Prince Andrew, Duke of York
 * Alastair MacDonald Watson (1909–1987), English cricketer

title: Alastair Watson


text:
Portal:Bible translation

Center of Biblical Biblical Translation

Welcome to the Wikiversity Center of Biblical Translation.

Center description
This Center is a Wikiversity content development project where participants create, organize and develop learning resources related to Bible translation.

The Holy Bible is the Christian holy text. While the exact content of this collection of Scripture has been disputed, most American Protestant Bibles contain sixty-six books. Thirty-nine of these books are contained in the Old Testament (typically arranged Genesis-Malachi)and twenty-seven (typically arranged Matthew-Revelation) in the New Testament. Various texts exist outside of this including the Apocrypha and the Gnostic Gospels. Orthodox traitions and the Roman Catholic Church claim the Old Testament Apocrypha as canonical Scripture; the debate of whether or not to include the Apocrypha in the canon of Scripture is a long-standing one which is one the divisions between the Protestant and Catholic-Orthodox traditions.

The translation of the Christian holy texts (Scriptures) into languages which have not previously received them is the subject of this center. Currently there are myriad Bible Translations underway in various world languages. Bible translation has become a focus for the missional outreaches of many evangelical faiths. There are many organizations dedicated to Bible translation as a means to evangelize pre-Christian cultures that work throughout the world. Some notable organizations include:

Pioneer Bible Translators Wycliffe Bible Translators Lutheran Bible Translators

Center news

 * 21 December 2006 - Center founded!

Learning projects
See: Learning Projects and the Learning model.

Learning materials and learning projects are located in the main Wikiversity namespace. Simply make a link to the name of the learning project (learning projects are independent pages in the main namespace) and start writing! We suggest the use of the learning project template (use "subst:Learning project boilerplate" on the new page, inside the double curved brackets – ).

Learning materials and learning projects can be used by multiple departments. Cooperate with other departments that use the same learning resource.
 * Introduction to Bible Translation
 * New Testament Greek - Requires Introductory Ancient Greek Language

English Bible Translations
A Mostly up-to-date list of current translations and languages:

 * American Standard Bible wikisource
 * Amplified Bible
 * Analytical-Literal Translation
 * Bible in Basic English
 * Children's Bible
 * Christian Community Bible
 * Christian Standard Bible (Holman)
 * Contemporary English Version
 * Douay-Rheims Version
 * English Standard Version
 * Geneva Bible
 * God's Word
 * Grail Psalter: The Book of Psalms
 * Jerusalem Bible
 * King James Version wikisource
 * Living Bible
 * Message Bible
 * New American Bible (Catholic)
 * New American Standard Bible
 * New English Translation (NET Bible)
 * New International Version
 * New International Reader's Version
 * New Jerusalem Bible
 * New King James Version
 * New Living Translation
 * New Revised Standard Version
 * New World Translation of the Holy Scriptures
 * Modern King James Bible
 * Revised Standard Version
 * Today's English Version
 * Today's New International Version
 * Young's Literal Translation
 * World English Bible wikisource
 * World English Bible (Hebrew Names Version)
 * Wycliffe New Testament

Other Worldly Languages (Not a complete List)
Albanian Arabic Arabic Armenian (Western) Awadhi Belorussian: Bengali Bosnian Bolivian (Southern) Catalan Chinese Chinese and English Chinese Union Version and English Chamorro Croatian Cuzco Czech Danish Danish Dutch Dutch (Additional) Ecuadorian Shuar Esperanto Estonian Farsi Finnish French Gaelic (Scottish) German German (Deutsche Bibelgesellschaft Stuttgart) Gothic Greek (Ancient including the Septuagint) Greek (Modern) Greek (New Testament) Gujarati Haitian Creole Hebrew Hindi Hungarian Icelandic Bibliuleit Indonesian Indonesian (Alkitab Terjemahan Baru and Bahasa Sehari-hari) Italian

Japanese Japanese (Living Bible Paraphrase) Kannada Korean Kurdish Latin (Vulgate) Latvian (New Testament) Latvian Lithuanian Malayalam Malayalam (Additional) Manx Gaelic Maori Marathi Nepali Norwegian Oriya Portuguese Portuguese (Brazilian) Polish Punjabi Quechua Russian Romanian Slovak Slovenian Spanish (Reina-Valera 1995) Spanish (La Biblia de las Americas�) Swahili Swedish Tagalog Tamil Tamil (Additional) Telugu Thai Turkish Ukrainian Ukrainian(Additional) Urdu Vietnamese Vietnamese (Additional)

Remember, Wikiversity has adopted the "learning by doing" model for education. Lessons should center on learning activities for Wikiversity participants. We learn by doing.

Select a descriptive name for each learning project.

title: Portal:Bible translation


text:
Woodfordia (plant)

Woodfordia is a genus of flowering plant in the family Lythraceae.

Species

 * Woodfordia floribunda (unresolved)
 * Woodfordia fruticosa (L.) Kurz (= W. tomentosa)
 * Woodfordia uniflora (A. Rich.) Koehne

title: Woodfordia (plant)


text:
Chatra (umbrella)

The chatra (from छत्र, meaning "umbrella") is an auspicious symbol in Hinduism, Jainism and Buddhism.

The chatra in various traditions
According to Hindu mythology, it is the emblem of Varuna, also considered an embodiment of kingship. Chatra is also a deity, yidam and ishta-devata. In various Dharmic traditions it is an accoutrement of chakravartin.

A number of deities are depicted with chatra, including Ganesha (especially during Ganesh Chaturthi), Revanta, Surya, and Vishnu (in his Vamana avatar). The chatra is cordoned amongst the symbols that approach universality within the numerous octavalent suites or sets of Ashtamangala, e.g., in the Digambar Jain tradition, and the Vajrayana tradition.

In Dharmic tradition iconography, traditional Tibetan medicine thangkas and Ayurvedic diagrams, the chatra is uniformly represented as the Sahasrara.

In Vajrayana Buddhism, the umbrella or parasol is included in the 'Eight Auspicious Signs' or Ashtamangala.

The chatra shares a similar symbolic value to the baldachin, refer image of Vishvakarman.

In Burmese culture, the hti is considered regalia, and also crowns Burmese pagodas.

The Royal Nine-Tiered Umbrella is one part of the royal regalia of Thailand, and appears in connection with this role in the logo of Royal Umbrella rice.

title: Chatra (umbrella)


text:
Talk:UML

Paragraphic illustration
Before you can draw your first diagram, you must be able to work with primatives. Linguistics (not yet comp-sci) is where you need to get. You must be able to state your problem. Once stated, you have an initial state. This initial Statement decribes in one sentance what your problem is. If you don't have a problem, you don't need a UML diagram.

 * NOTE: a sentance is a linguistic object; a problem is a logical argument. A well-formed statechart or state diagram can be expressed linguistically in the form of a single paragraph. Forget the fancy pictures for now.
 * Think: What is an expression? What is an argument? What Context are you thinking from?

 * Posted by CQ on 23:47, 3 December 2006 (UTC)

title: Talk:UML


text:
Talk:Thom Pain (based on nothing)

Stub
Shouldn't it be a drama stub due to the fact that it is a play? -06:13, 11 August 2006 (UTC)

title: Talk:Thom Pain (based on nothing)


text:
Ostrea angasi

The southern mud oyster, Australian flat oyster, native flat oyster, native mud oyster, or angasi oyster (Ostrea angasi), is endemic to southern Australia, ranging from Western Australia to southeast New South Wales and around Tasmania. Ostrea angasi superficially resembles Ostrea edulis and both species may be referred to with the name "flat oyster". However, the two species do not occur naturally in the same geographic distribution.

Habitat
This species is found in sheltered, silty or sand-bottomed estuaries at depths between 1 and 30 metres.

Diet
Flat oysters, like all other oyster species, are filter feeders, feeding on, and taking in anything small enough to be filtered in their gills. This may include plankton, microalgae or inorganic material.

Predators
Oyster growers at Coffin Bay, South Australia have observed stingrays eating their experimental commercial stocks of Ostrea angasi.

Commercial harvesting
Extensive oyster reefs in southern Australia were largely destroyed by over-exploitation during the 19th and early 20th Centuries. Oysters were dredged directly from the seabed.

Once common, Ostrea angasi became locally extinct, in oyster-producing estuaries on the East Coast north of the Clyde River, as a result of the accidental introduction of the mud worm, Polydora websteri, from New Zealand, in 1888 to 1898. The mudworm and silting ended all sub-tidal oyster production in New South Wales and Southern Queensland, and the oyster industry there became totally dependent upon inter-tidal production of another indigenous oyster, the Sydney rock oyster, Saccostrea glomerata.

In the 21st century, commercial oyster growers in southern Australia have started experimentally farming O. angasi as a means to diversify their businesses. This was prompted by other growers suffering massive stock losses of Crassostrea gigas resulting from outbreaks of Pacific Oyster Mortality Syndrome (POMS).

Port River
The not-for-profit organisation Estuary Care Foundation was established in South Australia to undertake trials growing Ostrea angasi in the Port River and adjacent waters. The organisation is also involved in seagrass monitoring and restoration work within the Port River.

Windara Reef
Windara Reef was constructed in Gulf St Vincent, offshore from Ardrossan, to promote the reestablishment of Ostrea angasi. The reef was also opened to recreational fishers in 2017. As of April 2019, it was the largest shellfish reef restoration project in the southern hemisphere. The Nature Conservancy, the Australian Government, the South Australian Government, the Yorke Peninsula Council, The University of Adelaide and the Ian Potter Foundation have each contributed to funding the project.

Georges River and Botany Bay
It was announced, in 2023, that work would begin on re-establishing three sub-tidal oyster reefs in the Georges River estuary in New South Wales (at Audrey Bay, Coronation Bay and on the eastern side of Taren Point), and another sub-tidal reef downstream in Botany Bay. The reefs will support reintroduced Ostrea angasi—locally extinct in those waters since 1896—and also the now depleted Sydney Rock Oyster. The oyster reefs are expected to increase both water quality and biodiversity, and increase the numbers of fish.

title: Ostrea angasi