<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://www.ormfoundation.org/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>ORM 2007 : FCO-IM</title><link>http://www.ormfoundation.org/files/folders/orm_2007/tags/FCO-IM/default.aspx</link><description>Tags: FCO-IM</description><dc:language>en</dc:language><generator>CommunityServer 2007.1 (Build: 20917.1142)</generator><item><title>P13: Demonstration of the tool CaseTalk</title><link>http://www.ormfoundation.org/files/folders/orm_2007/entry95.aspx</link><pubDate>Tue, 18 Dec 2007 19:14:43 GMT</pubDate><guid isPermaLink="false">9d039735-a311-4a8d-9c49-a0bb2572af9e:95</guid><dc:creator>admin</dc:creator><slash:comments>0</slash:comments><description>&lt;p&gt;This presentation was used to support the demonstration of the CaseTalk tool that supports FCO-IM.&lt;/p&gt;
&lt;p&gt;&amp;nbsp;&lt;/p&gt;</description><enclosure url="http://www.ormfoundation.org/files/folders/95/download.aspx" length="600576" type="application/vnd.ms-powerpoint" /></item><item><title>P08: Advances in FCO-IM (2): A Shorter Algorithm for Determining Intra Fact Type Uniqueness Constraints </title><link>http://www.ormfoundation.org/files/folders/orm_2007/entry94.aspx</link><pubDate>Tue, 18 Dec 2007 19:02:24 GMT</pubDate><guid isPermaLink="false">9d039735-a311-4a8d-9c49-a0bb2572af9e:94</guid><dc:creator>admin</dc:creator><slash:comments>0</slash:comments><description>&lt;b&gt;&lt;font face="Times-Bold" size="1"&gt;
&lt;p align="left"&gt;Abstract. &lt;/b&gt;&lt;/font&gt;&lt;font face="Times-Roman" size="1"&gt;We present a general algorithm for determining all intra fact type uniqueness constraints in a fact type with n roles. For Fact Oriented Methods of information modeling that work with elementary fact types, a top-down approach is shorter than a bottom-up approach for fact types with more than two roles. The algorithm is shorter (in terms of the number of tests to be performed) than the one published earlier in &lt;em&gt;&lt;strong&gt;our book on FCO-IM&lt;/strong&gt;&lt;/em&gt;. For its most important steps, we prove that no shorter algorithm exists.&lt;/font&gt;&lt;/p&gt;
&lt;p align="left"&gt;&lt;font face="Times-Roman" size="1"&gt;&lt;strong&gt;Note:&lt;/strong&gt; You can download the &lt;strong&gt;&lt;em&gt;book on FCO-IM&lt;/em&gt;&lt;/strong&gt; from the Library.&lt;/font&gt;&lt;/p&gt;
&lt;p align="left"&gt;&lt;font face="Times-Roman" size="1"&gt;&lt;strong&gt;Authors: &lt;/strong&gt;&lt;font face="Times-Roman" size="1"&gt;Jan Pieter Zwart and Guido Bakema,&amp;nbsp;&amp;nbsp; &lt;br /&gt;&lt;font face="Times-Roman" size="1"&gt;Research and Competence Group Data Architectures &amp;amp; Metadata Management Academy of Communication and Information Technology HAN University of Applied Science , Ruitenberglaan 26, 6826 CC Arnhem, The Netherlands&amp;nbsp; &lt;/font&gt;&lt;font face="Courier" size="1"&gt;&lt;a href="mailto:janpieter.zwart@han.nl"&gt;janpieter.zwart@han.nl&lt;/a&gt;, &lt;a href="mailto:guido.bakema@han.nl"&gt;guido.bakema@han.nl&lt;/a&gt;&lt;/font&gt;&lt;/font&gt;&lt;/font&gt;&lt;/p&gt;&lt;font face="Times-Roman" size="1"&gt;&lt;font face="Times-Roman" size="1"&gt;&lt;font size="1"&gt;
&lt;p align="left"&gt;&lt;font face="Times-Roman" size="1"&gt;The original paper is available from Springer-Verlag Lecture Notes in Computer Science LNCS 4805, November 2007&amp;nbsp; &lt;/font&gt;&lt;/p&gt;
&lt;p align="left"&gt;&lt;font face="Times-Roman" size="1"&gt;&amp;nbsp;&lt;/p&gt;&lt;/font&gt;&lt;/font&gt;&lt;/font&gt;&lt;/font&gt;&lt;font face="Courier" size="1"&gt;&lt;/font&gt;</description><enclosure url="http://www.ormfoundation.org/files/folders/94/download.aspx" length="1029120" type="application/vnd.ms-powerpoint" /></item></channel></rss>