<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / narky / tag / university</title>
<link>http://netvouz.com/narky/tag/university?feed=rss&amp;pg=1</link>
<description>narky&#39;s bookmarks tagged &quot;university&quot; on Netvouz</description>
<item><title>Bijection - wikipedia</title>
<link>http://en.wikipedia.org/wiki/Bijection</link>
<description>In mathematics, a bijection, or a bijective function is a function f from a set X to a set Y with the property that, for every y in Y, there is exactly one x in X such that f(x) = y. Alternatively, f is bijective if it is a one-to-one correspondence between those sets; i.e., both one-to-one (injective) and onto (surjective).[1] (See also Bijection, injection and surjection.)</description>
<category domain="http://netvouz.com/narky?category=2161227471742930965">Educational &gt; Mathematics &gt; Ideas/Explanations/Wiki or Mathworld lookups</category>
<author>narky</author>
<pubDate>Mon, 30 Apr 2007 02:38:51 GMT</pubDate>
</item><item><title>Bijection, injection and surjection - Wikipedia</title>
<link>http://en.wikipedia.org/wiki/Bijection%2C_injection_and_surjection</link>
<description>In mathematics, injections, surjections and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and images (output expressions from the codomain) are related or mapped to each other.</description>
<category domain="http://netvouz.com/narky?category=2161227471742930965">Educational &gt; Mathematics &gt; Ideas/Explanations/Wiki or Mathworld lookups</category>
<author>narky</author>
<pubDate>Tue, 01 May 2007 02:47:52 GMT</pubDate>
</item><item><title>Burkard Polster</title>
<link>http://www.maths.monash.edu.au/~bpolster/</link>
<description>Department of Mathematics and Statistics, Monash University. Areas of interest: -finite and topological geometry -combinatorial designs -group theory -history of mathematics -classical interpolation theory -computer visualisation -mathematics education and outreach -any kind of fun mathematics</description>
<category domain="http://netvouz.com/narky?category=527911410682122334">Educational &gt; Mathematics &gt; People</category>
<author>narky</author>
<pubDate>Thu, 01 Jun 2006 06:58:31 GMT</pubDate>
</item><item><title>Chemistry department</title>
<link>http://www.latrobe.edu.au/chemistry</link>
<description></description>
<category domain="http://netvouz.com/narky?category=6626684583222253897">Educational &gt; University &gt; LaTrobe &gt; Departments</category>
<author>narky</author>
<pubDate>Sun, 16 Jan 2005 04:57:25 GMT</pubDate>
</item><item><title>Chemistry; Notes, labs, prac tests, exam papers</title>
<link>http://www.latrobe.edu.au/chemistry</link>
<description></description>
<category domain="http://netvouz.com/narky?category=6658009721143417136">Educational &gt; University &gt; LaTrobe</category>
<author>narky</author>
<pubDate>Sun, 16 Jan 2005 04:57:25 GMT</pubDate>
</item><item><title>Endnote</title>
<link>http://www.endnote.com/</link>
<description>Software tool for publishing and managing bibliographies. EndNote will search online bibliographic databases, organize references, images and PDFs in any language, and create bibliographies and figure lists instantly. Integrates the following tasks into one program:     * Search bibliographic databases on the Internet     * Organize references, images and PDFs     * Construct your paper with built-in manuscript templates     * Watch the bibliography and figure list appear as you write!</description>
<category domain="http://netvouz.com/narky?category=1302166621358345221">Computing &gt; Software</category>
<author>narky</author>
<pubDate>Tue, 01 May 2007 08:47:13 GMT</pubDate>
</item><item><title>English department</title>
<link>http://www.latrobe.edu.au/english/</link>
<description></description>
<category domain="http://netvouz.com/narky?category=6626684583222253897">Educational &gt; University &gt; LaTrobe &gt; Departments</category>
<author>narky</author>
<pubDate>Sun, 16 Jan 2005 04:57:25 GMT</pubDate>
</item><item><title>Fixed point property - Wikipedia</title>
<link>http://en.wikipedia.org/wiki/Fixed_point_property</link>
<description>In mathematics, a topological space X has the fixed point property if all continuous mappings from X to X have a fixed point.</description>
<category domain="http://netvouz.com/narky?category=2161227471742930965">Educational &gt; Mathematics &gt; Ideas/Explanations/Wiki or Mathworld lookups</category>
<author>narky</author>
<pubDate>Tue, 01 May 2007 02:50:22 GMT</pubDate>
</item><item><title>Fixed-point theorem - Wikipedia</title>
<link>http://en.wikipedia.org/wiki/Fixed-point_theorem</link>
<description>In mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F that can be stated in general terms. Results of this kind are amongst the most generally useful in mathematics. The Banach fixed point theorem gives a general criterion guaranteeing that, if it is satisfied, the procedure of iterating a function yields a fixed point. By contrast, the Brouwer fixed point theorem is a non-constructive result: it says that any continuous function from the closed unit ball in n-dimensional Euclidean space to itself must have a fixed point, but it doesn&#39;t describe how to find the fixed point (See also Sperner&#39;s lemma).</description>
<category domain="http://netvouz.com/narky?category=2161227471742930965">Educational &gt; Mathematics &gt; Ideas/Explanations/Wiki or Mathworld lookups</category>
<author>narky</author>
<pubDate>Tue, 01 May 2007 02:51:32 GMT</pubDate>
</item><item><title>History Department</title>
<link>http://www.latrobe.edu.au/history/</link>
<description></description>
<category domain="http://netvouz.com/narky?category=6626684583222253897">Educational &gt; University &gt; LaTrobe &gt; Departments</category>
<author>narky</author>
<pubDate>Sun, 16 Jan 2005 04:57:25 GMT</pubDate>
</item></channel></rss>