Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:37911 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.85) (envelope-from ) id 1ZCjVP-0002l1-UM; Wed, 08 Jul 2015 00:11:00 -0700 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Wed, 08 Jul 2015 00:10:55 -0700 From: "Apache" Date: Wed, 08 Jul 2015 00:10:55 -0700 To: webmaster@lojban.org, curtis289@att.net Subject: [jvsw] Definition Edited At Word tcanaba -- By krtisfranks Bcc: jbovlaste-admin@lojban.org Message-ID: <559cccff.7NQ2l7UXaQlr22Lv%webmaster@lojban.org> User-Agent: Heirloom mailx 12.5 7/5/10 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: quoted-printable X-Spam-Score: 0.5 (/) X-Spam_score: 0.5 X-Spam_score_int: 5 X-Spam_bar: / X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org", has NOT identified this incoming email as spam. The original message has been attached to this so you can view it or label similar future email. If you have any questions, see the administrator of that system for details. Content preview: In jbovlaste, the user krtisfranks has edited a definition of "tcanaba" in the language "English". Differences: 2,2c2,2 < $x_1$ (node/vertex/station) is forward of/along from $x_2$ in oriented graph $x_3$ (graph with orientation) using oriented edge path $x_4$ (ordered sequence of ordered pairs). --- > $x_1$ (node/vertex/station) is forward of/along from $x_2$ in oriented graph $x_3$ (graph with orientation) using oriented edge path $x_4$ (ordered sequence of ordered pairs). The path from $x_2$ to $x_1$ runs along/is coparallel with/downstream of the orientation on $x_3$ along path $x_4$. 5,5c5,5 < Orientation is given from/by x3, so only an edge need be submitted if x3 is fully specified; if x3 is not fully specified, x4 can take the burden of specifying the orientation and subgraph of particular interest (namely, the two vertices x1 and x2, intervening vertices along the path, and the orientation of the given edges connecting them). Note that on an unoriented edge or along a cycle, x1 and x2 might be able to exchange places and/or be equal one another. x4 is an ordered sequence of ordered pairs; the first entry of each pair is the origin node, the second pair is the destination node; the path should probably be connected (so that the destination node of one pair is the origin node of the next, except possibly if it is the last such pair). x1 is not necessarily next (id est: forward adjacent of/from) x2, but it can be. Useful for pages, webpages, fa mily relationships, utterances, etc. See also: {grafu}, {tcanaca}, {tcanapu}. --- > Orientation is given from/by x3, so only an edge need be submitted if x3 is fully specified; if x3 is not fully specified, x4 can take the burden of specifying the orientation and subgraph of particular interest (namely, the two vertices x1 and x2, intervening vertices along the path, and the orientation of the given edges connecting them). Note that on an unoriented edge or along a cycle, x1 and x2 might be able to exchange places and/or be equal one another. x4 is an ordered sequence of ordered pairs; the first entry of each pair is the origin node, the second pair is the destination node; [...] Content analysis details: (0.5 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked. See http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block for more information. [URIs: lojban.org] 1.4 RCVD_IN_BRBL_LASTEXT RBL: No description available. [173.13.139.235 listed in bb.barracudacentral.org] -1.9 BAYES_00 BODY: Bayes spam probability is 0 to 1% [score: 0.0000] 1.0 RDNS_DYNAMIC Delivered to internal network by host with dynamic-looking rDNS In jbovlaste, the user krtisfranks has edited a definition of "tcanaba" in the language "English". Differences: 2,2c2,2 < =09=09$x_1$ (node/vertex/station) is forward of/along from $x_2$ in o= riented graph $x_3$ (graph with orientation) using oriented edge path $= x_4$ (ordered sequence of ordered pairs). --- > =09=09$x_1$ (node/vertex/station) is forward of/along from $x_2$ in o= riented graph $x_3$ (graph with orientation) using oriented edge path $= x_4$ (ordered sequence of ordered pairs). The path from $x_2$ to $x_1$ = runs along/is coparallel with/downstream of the orientation on $x_3$ al= ong path $x_4$.=20 5,5c5,5 < =09=09Orientation is given from/by x3, so only an edge need be submit= ted if x3 is fully specified; if x3 is not fully specified, x4 can take= the burden of specifying the orientation and subgraph of particular in= terest (namely, the two vertices x1 and x2, intervening vertices along = the path, and the orientation of the given edges connecting them). Note= that on an unoriented edge or along a cycle, x1 and x2 might be able t= o exchange places and/or be equal one another. x4 is an ordered sequenc= e of ordered pairs; the first entry of each pair is the origin node, th= e second pair is the destination node; the path should probably be conn= ected (so that the destination node of one pair is the origin node of t= he next, except possibly if it is the last such pair). x1 is not necess= arily next (id est: forward adjacent of/from) x2, but it can be. Useful= for pages, webpages, fa mily relationships, utterances, etc. See also:= {grafu}, {tcanaca}, {tcanapu}. --- > =09=09Orientation is given from/by x3, so only an edge need be submit= ted if x3 is fully specified; if x3 is not fully specified, x4 can take= the burden of specifying the orientation and subgraph of particular in= terest (namely, the two vertices x1 and x2, intervening vertices along = the path, and the orientation of the given edges connecting them). Note= that on an unoriented edge or along a cycle, x1 and x2 might be able t= o exchange places and/or be equal one another. x4 is an ordered sequenc= e of ordered pairs; the first entry of each pair is the origin node, th= e second pair is the destination node; the path should probably be conn= ected (so that the destination node of one pair is the origin node of t= he next, except possibly if it is the last such pair). x1 is not necess= arily next (id est: forward adjacent of/from) x2, but it can be. Useful= for pages, webpages, family relationships, utterances, etc. See also: = {grafu}, {tcanaca}, {tcanapu}. Old Data: =09Definition: =09=09$x_1$ (node/vertex/station) is forward of/along from $x_2$ in ori= ented graph $x_3$ (graph with orientation) using oriented edge path $x_= 4$ (ordered sequence of ordered pairs). =09Notes: =09=09Orientation is given from/by x3, so only an edge need be submitte= d if x3 is fully specified; if x3 is not fully specified, x4 can take t= he burden of specifying the orientation and subgraph of particular inte= rest (namely, the two vertices x1 and x2, intervening vertices along th= e path, and the orientation of the given edges connecting them). Note t= hat on an unoriented edge or along a cycle, x1 and x2 might be able to = exchange places and/or be equal one another. x4 is an ordered sequence = of ordered pairs; the first entry of each pair is the origin node, the = second pair is the destination node; the path should probably be connec= ted (so that the destination node of one pair is the origin node of the= next, except possibly if it is the last such pair). x1 is not necessar= ily next (id est: forward adjacent of/from) x2, but it can be. Useful f= or pages, webpages, fa mily relationships, utterances, etc. See also: {= grafu}, {tcanaca}, {tcanapu}. =09Jargon: =09=09 =09Gloss Keywords: =09=09Word: forward in graph, In Sense:=20 =09=09Word: forward in network, In Sense:=20 =09Place Keywords: New Data: =09Definition: =09=09$x_1$ (node/vertex/station) is forward of/along from $x_2$ in ori= ented graph $x_3$ (graph with orientation) using oriented edge path $x_= 4$ (ordered sequence of ordered pairs). The path from $x_2$ to $x_1$ ru= ns along/is coparallel with/downstream of the orientation on $x_3$ alon= g path $x_4$.=20 =09Notes: =09=09Orientation is given from/by x3, so only an edge need be submitte= d if x3 is fully specified; if x3 is not fully specified, x4 can take t= he burden of specifying the orientation and subgraph of particular inte= rest (namely, the two vertices x1 and x2, intervening vertices along th= e path, and the orientation of the given edges connecting them). Note t= hat on an unoriented edge or along a cycle, x1 and x2 might be able to = exchange places and/or be equal one another. x4 is an ordered sequence = of ordered pairs; the first entry of each pair is the origin node, the = second pair is the destination node; the path should probably be connec= ted (so that the destination node of one pair is the origin node of the= next, except possibly if it is the last such pair). x1 is not necessar= ily next (id est: forward adjacent of/from) x2, but it can be. Useful f= or pages, webpages, family relationships, utterances, etc. See also: {g= rafu}, {tcanaca}, {tcanapu}. =09Jargon: =09=09 =09Gloss Keywords: =09=09Word: forward in graph, In Sense:=20 =09=09Word: forward in network, In Sense:=20 =09Place Keywords: You can go to to see it.