<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Kommentare für FaKod&#039;s Blog</title>
	<atom:link href="http://blog.fakod.eu/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.fakod.eu</link>
	<description></description>
	<lastBuildDate>Wed, 02 Nov 2011 20:49:20 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
	<item>
		<title>Kommentar zu Cross Cutting Concerns in Scala von Nick</title>
		<link>http://blog.fakod.eu/2010/07/26/cross-cutting-concerns-in-scala/comment-page-1/#comment-159</link>
		<dc:creator>Nick</dc:creator>
		<pubDate>Wed, 02 Nov 2011 20:49:20 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1121#comment-159</guid>
		<description>Good introduction to using @Aspect in Scala. I was struggling over this today until I found that a for-loop in my advice method was causing a method parameter &quot;command&quot; to get compiled as &quot;command$1&quot;, so that iacj couldn&#039;t match it up with the pointcut! Something to watch out for when weaving fails.</description>
		<content:encoded><![CDATA[<p>Good introduction to using @Aspect in Scala. I was struggling over this today until I found that a for-loop in my advice method was causing a method parameter &#8220;command&#8221; to get compiled as &#8220;command$1&#8243;, so that iacj couldn&#8217;t match it up with the pointcut! Something to watch out for when weaving fails.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Yet Another Try: A REST Client with Jersey and Scala von Trav</title>
		<link>http://blog.fakod.eu/2010/12/10/yet-another-trya-rest-client-with-jersey-and-scala/comment-page-1/#comment-151</link>
		<dc:creator>Trav</dc:creator>
		<pubDate>Fri, 30 Sep 2011 15:02:42 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1413#comment-151</guid>
		<description>Ran across this project the other day, not sure if it is of interest to you. https://github.com/codahale/jersey-scala</description>
		<content:encoded><![CDATA[<p>Ran across this project the other day, not sure if it is of interest to you. <a href="https://github.com/codahale/jersey-scala" rel="nofollow">https://github.com/codahale/jersey-scala</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Cross Cutting Concerns in Scala von fakod</title>
		<link>http://blog.fakod.eu/2010/07/26/cross-cutting-concerns-in-scala/comment-page-1/#comment-137</link>
		<dc:creator>fakod</dc:creator>
		<pubDate>Mon, 15 Aug 2011 04:56:03 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1121#comment-137</guid>
		<description>Mainly because you can write Aspects in Scala.</description>
		<content:encoded><![CDATA[<p>Mainly because you can write Aspects in Scala.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Cross Cutting Concerns in Scala von Jaime Metcher</title>
		<link>http://blog.fakod.eu/2010/07/26/cross-cutting-concerns-in-scala/comment-page-1/#comment-130</link>
		<dc:creator>Jaime Metcher</dc:creator>
		<pubDate>Tue, 02 Aug 2011 23:02:54 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1121#comment-130</guid>
		<description>I agree that the factory/proxy mechanism is not satisfactory.  AspectJ&#039;s strength is precisely that it works without needing to control object creation at the source code level.

Just to check my understanding: you advocate the use of AspectJ annotations because:
1) it means you don&#039;t need the ajc compiler, and
2) therefore you can write aspects in Scala
Correct?</description>
		<content:encoded><![CDATA[<p>I agree that the factory/proxy mechanism is not satisfactory.  AspectJ&#8217;s strength is precisely that it works without needing to control object creation at the source code level.</p>
<p>Just to check my understanding: you advocate the use of AspectJ annotations because:<br />
1) it means you don&#8217;t need the ajc compiler, and<br />
2) therefore you can write aspects in Scala<br />
Correct?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Spatial Lucene Example in Scala von Ismet</title>
		<link>http://blog.fakod.eu/2010/11/02/spatial-lucene-example-in-scala/comment-page-1/#comment-127</link>
		<dc:creator>Ismet</dc:creator>
		<pubDate>Mon, 04 Jul 2011 17:40:15 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1223#comment-127</guid>
		<description>nevermind i find the problem, forgot to close writer before search</description>
		<content:encoded><![CDATA[<p>nevermind i find the problem, forgot to close writer before search</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Spatial Lucene Example in Scala von Ismet</title>
		<link>http://blog.fakod.eu/2010/11/02/spatial-lucene-example-in-scala/comment-page-1/#comment-126</link>
		<dc:creator>Ismet</dc:creator>
		<pubDate>Mon, 04 Jul 2011 17:25:30 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1223#comment-126</guid>
		<description>I implemented a exact java version with lucene 2.9.3 and it&#039;s not working any idea why here is code


import java.io.IOException;
import java.util.List;

import org.apache.lucene.analysis.standard.StandardAnalyzer;
import org.apache.lucene.index.CorruptIndexException;
import org.apache.lucene.index.IndexWriter;
import org.apache.lucene.index.IndexWriter.MaxFieldLength;
import org.apache.lucene.store.Directory;
import org.apache.lucene.store.LockObtainFailedException;
import org.apache.lucene.store.RAMDirectory;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		SpacialLuceneExample s = new SpacialLuceneExample();
		
		Directory dir = null;
		IndexWriter writer = null;
		
		dir = new RAMDirectory();
		try {
			writer = new IndexWriter(dir, new StandardAnalyzer(),
					MaxFieldLength.UNLIMITED);
			s.fill(writer);
			List findNear = s.findNear(dir, null, 38.9956000, -77.5258000, 1000.0);
			for (SearchResult searchResult : findNear) {
				System.out.println(searchResult.toString());
			}
		} catch (CorruptIndexException e) {
			e.printStackTrace();
		} catch (LockObtainFailedException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}		
	}

}




import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;

import org.apache.lucene.document.Document;
import org.apache.lucene.document.Field;
import org.apache.lucene.index.CorruptIndexException;
import org.apache.lucene.index.IndexWriter;
import org.apache.lucene.index.Term;
import org.apache.lucene.search.IndexSearcher;
import org.apache.lucene.search.Query;
import org.apache.lucene.search.Sort;
import org.apache.lucene.search.SortField;
import org.apache.lucene.search.TermQuery;
import org.apache.lucene.search.TopDocs;
import org.apache.lucene.spatial.tier.DistanceFieldComparatorSource;
import org.apache.lucene.spatial.tier.DistanceQueryBuilder;
import org.apache.lucene.spatial.tier.projections.CartesianTierPlotter;
import org.apache.lucene.spatial.tier.projections.IProjector;
import org.apache.lucene.spatial.tier.projections.SinusoidalProjector;
import org.apache.lucene.store.Directory;
import org.apache.lucene.util.NumericUtils;

public class SpacialLuceneExample {
	private final String latField = &quot;lat&quot;;
	private final String lngField = &quot;lon&quot;;
	private final String tierPrefix = &quot;_localTier&quot;;

	public SpacialLuceneExample() {
		super();
	}

	public void fill(IndexWriter writer) {
		add(&quot;Jimmy&#039;s Old Town Tavern&quot;, 38.9690000, -77.862000, writer);
		add(&quot;Ned Devine&#039;s&quot;, 38.9510000, -77.4107000, writer);
		add(&quot;Old Brogue Irish Pub&quot;, 38.9955000, -77.2884000, writer);
		add(&quot;Alf Laylah Wa Laylah&quot;, 38.8956000, -77.4258000, writer);
		add(&quot;Sully&#039;s Restaurant &amp; Supper&quot;, 38.9003000, -77.4467000, writer);
		add(&quot;TGIFriday&quot;, 38.8725000, -77.3829000, writer);
		add(&quot;Potomac Swing Dance Club&quot;, 38.9027000, -77.2639000, writer);
		add(&quot;White Tiger Restaurant&quot;, 38.9027000, -77.2638000, writer);
		add(&quot;Jammin&#039; Java&quot;, 38.9039000, -77.2622000, writer);
		add(&quot;Potomac Swing Dance Club&quot;, 38.9027000, -77.2639000, writer);
		add(&quot;WiseAcres Comedy Club&quot;, 38.9248000, -77.2344000, writer);
		add(&quot;Glen Echo Spanish Ballroom&quot;, 38.9691000, -77.1400000, writer);
		add(&quot;Whitlow&#039;s on Wilson&quot;, 38.8889000, -77.0926000, writer);
		add(&quot;Iota Club and Cafe&quot;, 38.8890000, -77.0923000, writer);
		add(&quot;Hilton Washington Embassy Row&quot;, 38.9103000, -77.0451000, writer);
		add(&quot;HorseFeathers, Bar &amp; Grill&quot;, 39.01220000000001, -77.3942, writer);
		add(&quot;Marshall Island Airfield&quot;, 7.06, 171.2, writer);
		add(&quot;Wonga Wongue Reserve, Gabon&quot;, -0.546562, 9.459229, writer);
		add(&quot;Midway Island&quot;, 25.7, -171.7, writer);
		add(&quot;North Pole Way&quot;, 55.0, 4.0, writer);
	}

	private void add(String name, double lat, double lng, IndexWriter writer) {
		Document doc = new Document();

		doc.add(new Field(&quot;name&quot;, name, Field.Store.YES, Field.Index.ANALYZED));
		doc.add(new Field(latField, NumericUtils.doubleToPrefixCoded(lat),
				Field.Store.YES, Field.Index.NOT_ANALYZED));
		doc.add(new Field(lngField, NumericUtils.doubleToPrefixCoded(lng),
				Field.Store.YES, Field.Index.NOT_ANALYZED));
		doc.add(new Field(&quot;metafile&quot;, &quot;doc&quot;, Field.Store.YES,
				Field.Index.ANALYZED));
		IProjector projector = new SinusoidalProjector();

		int maxMiles = 40000;
		int minMiles = 1;

		CartesianTierPlotter ctp = new CartesianTierPlotter(0, projector,
				tierPrefix);
		int startTier = ctp.bestFit(maxMiles);
		int endTier = ctp.bestFit(minMiles);

		for (int tier = startTier; tier &lt;= endTier; tier++) {
			CartesianTierPlotter ctp2 = new CartesianTierPlotter(tier,
					projector, tierPrefix);
			double boxId = ctp2.getTierBoxId(lat, lng);
			doc.add(new Field(ctp2.getTierFieldName(), NumericUtils
					.doubleToPrefixCoded(boxId), Field.Store.YES,
					Field.Index.NOT_ANALYZED_NO_NORMS));
		}
		try {
			writer.addDocument(doc);
		} catch (CorruptIndexException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

	public List findNear(Directory dir, String what,
			double latitude, double longitude, double radius) {
		List result = new ArrayList();
		try {
			IndexSearcher searcher = new IndexSearcher(dir);
			DistanceQueryBuilder dq = new DistanceQueryBuilder(latitude,
					longitude, radius, latField, lngField, tierPrefix, true);
			Query tq = null;
			if(what !=null)
				tq = new TermQuery(new Term(&quot;name&quot;,what));
			else
				tq = new TermQuery(new Term(&quot;metafile&quot;, &quot;doc&quot;));
			
			DistanceFieldComparatorSource dsort = new DistanceFieldComparatorSource(dq.getDistanceFilter());
			Sort sort = new Sort(new SortField(&quot;foo&quot;,dsort,false));
			
			TopDocs hits = searcher.search(tq, dq.getFilter(),10,sort);
			int numResults = hits.totalHits;
			
			Map distances = dq.getDistanceFilter().getDistances();
			
			for (int i = 0; i &lt; numResults; i++) {
				int docID = hits.scoreDocs[i].doc;
				Document d = searcher.doc(docID);
				double rsLat = NumericUtils.prefixCodedToDouble(d.get(latField));
				double rsLng = NumericUtils.prefixCodedToDouble(d.get(lngField));
				double geo_distance = distances.get(docID);
				SearchResult sr = new SearchResult(d, rsLat, rsLng, geo_distance);
				result.add(sr);
			}
			
		} catch (CorruptIndexException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}

		return result;
	}
}</description>
		<content:encoded><![CDATA[<p>I implemented a exact java version with lucene 2.9.3 and it&#8217;s not working any idea why here is code</p>
<p>import java.io.IOException;<br />
import java.util.List;</p>
<p>import org.apache.lucene.analysis.standard.StandardAnalyzer;<br />
import org.apache.lucene.index.CorruptIndexException;<br />
import org.apache.lucene.index.IndexWriter;<br />
import org.apache.lucene.index.IndexWriter.MaxFieldLength;<br />
import org.apache.lucene.store.Directory;<br />
import org.apache.lucene.store.LockObtainFailedException;<br />
import org.apache.lucene.store.RAMDirectory;</p>
<p>public class Main {</p>
<p>	/**<br />
	 * @param args<br />
	 */<br />
	public static void main(String[] args) {<br />
		SpacialLuceneExample s = new SpacialLuceneExample();</p>
<p>		Directory dir = null;<br />
		IndexWriter writer = null;</p>
<p>		dir = new RAMDirectory();<br />
		try {<br />
			writer = new IndexWriter(dir, new StandardAnalyzer(),<br />
					MaxFieldLength.UNLIMITED);<br />
			s.fill(writer);<br />
			List findNear = s.findNear(dir, null, 38.9956000, -77.5258000, 1000.0);<br />
			for (SearchResult searchResult : findNear) {<br />
				System.out.println(searchResult.toString());<br />
			}<br />
		} catch (CorruptIndexException e) {<br />
			e.printStackTrace();<br />
		} catch (LockObtainFailedException e) {<br />
			e.printStackTrace();<br />
		} catch (IOException e) {<br />
			e.printStackTrace();<br />
		}<br />
	}</p>
<p>}</p>
<p>import java.io.IOException;<br />
import java.util.ArrayList;<br />
import java.util.List;<br />
import java.util.Map;</p>
<p>import org.apache.lucene.document.Document;<br />
import org.apache.lucene.document.Field;<br />
import org.apache.lucene.index.CorruptIndexException;<br />
import org.apache.lucene.index.IndexWriter;<br />
import org.apache.lucene.index.Term;<br />
import org.apache.lucene.search.IndexSearcher;<br />
import org.apache.lucene.search.Query;<br />
import org.apache.lucene.search.Sort;<br />
import org.apache.lucene.search.SortField;<br />
import org.apache.lucene.search.TermQuery;<br />
import org.apache.lucene.search.TopDocs;<br />
import org.apache.lucene.spatial.tier.DistanceFieldComparatorSource;<br />
import org.apache.lucene.spatial.tier.DistanceQueryBuilder;<br />
import org.apache.lucene.spatial.tier.projections.CartesianTierPlotter;<br />
import org.apache.lucene.spatial.tier.projections.IProjector;<br />
import org.apache.lucene.spatial.tier.projections.SinusoidalProjector;<br />
import org.apache.lucene.store.Directory;<br />
import org.apache.lucene.util.NumericUtils;</p>
<p>public class SpacialLuceneExample {<br />
	private final String latField = &#8220;lat&#8221;;<br />
	private final String lngField = &#8220;lon&#8221;;<br />
	private final String tierPrefix = &#8220;_localTier&#8221;;</p>
<p>	public SpacialLuceneExample() {<br />
		super();<br />
	}</p>
<p>	public void fill(IndexWriter writer) {<br />
		add(&#8220;Jimmy&#8217;s Old Town Tavern&#8221;, 38.9690000, -77.862000, writer);<br />
		add(&#8220;Ned Devine&#8217;s&#8221;, 38.9510000, -77.4107000, writer);<br />
		add(&#8220;Old Brogue Irish Pub&#8221;, 38.9955000, -77.2884000, writer);<br />
		add(&#8220;Alf Laylah Wa Laylah&#8221;, 38.8956000, -77.4258000, writer);<br />
		add(&#8220;Sully&#8217;s Restaurant &amp; Supper&#8221;, 38.9003000, -77.4467000, writer);<br />
		add(&#8220;TGIFriday&#8221;, 38.8725000, -77.3829000, writer);<br />
		add(&#8220;Potomac Swing Dance Club&#8221;, 38.9027000, -77.2639000, writer);<br />
		add(&#8220;White Tiger Restaurant&#8221;, 38.9027000, -77.2638000, writer);<br />
		add(&#8220;Jammin&#8217; Java&#8221;, 38.9039000, -77.2622000, writer);<br />
		add(&#8220;Potomac Swing Dance Club&#8221;, 38.9027000, -77.2639000, writer);<br />
		add(&#8220;WiseAcres Comedy Club&#8221;, 38.9248000, -77.2344000, writer);<br />
		add(&#8220;Glen Echo Spanish Ballroom&#8221;, 38.9691000, -77.1400000, writer);<br />
		add(&#8220;Whitlow&#8217;s on Wilson&#8221;, 38.8889000, -77.0926000, writer);<br />
		add(&#8220;Iota Club and Cafe&#8221;, 38.8890000, -77.0923000, writer);<br />
		add(&#8220;Hilton Washington Embassy Row&#8221;, 38.9103000, -77.0451000, writer);<br />
		add(&#8220;HorseFeathers, Bar &amp; Grill&#8221;, 39.01220000000001, -77.3942, writer);<br />
		add(&#8220;Marshall Island Airfield&#8221;, 7.06, 171.2, writer);<br />
		add(&#8220;Wonga Wongue Reserve, Gabon&#8221;, -0.546562, 9.459229, writer);<br />
		add(&#8220;Midway Island&#8221;, 25.7, -171.7, writer);<br />
		add(&#8220;North Pole Way&#8221;, 55.0, 4.0, writer);<br />
	}</p>
<p>	private void add(String name, double lat, double lng, IndexWriter writer) {<br />
		Document doc = new Document();</p>
<p>		doc.add(new Field(&#8220;name&#8221;, name, Field.Store.YES, Field.Index.ANALYZED));<br />
		doc.add(new Field(latField, NumericUtils.doubleToPrefixCoded(lat),<br />
				Field.Store.YES, Field.Index.NOT_ANALYZED));<br />
		doc.add(new Field(lngField, NumericUtils.doubleToPrefixCoded(lng),<br />
				Field.Store.YES, Field.Index.NOT_ANALYZED));<br />
		doc.add(new Field(&#8220;metafile&#8221;, &#8220;doc&#8221;, Field.Store.YES,<br />
				Field.Index.ANALYZED));<br />
		IProjector projector = new SinusoidalProjector();</p>
<p>		int maxMiles = 40000;<br />
		int minMiles = 1;</p>
<p>		CartesianTierPlotter ctp = new CartesianTierPlotter(0, projector,<br />
				tierPrefix);<br />
		int startTier = ctp.bestFit(maxMiles);<br />
		int endTier = ctp.bestFit(minMiles);</p>
<p>		for (int tier = startTier; tier &lt;= endTier; tier++) {<br />
			CartesianTierPlotter ctp2 = new CartesianTierPlotter(tier,<br />
					projector, tierPrefix);<br />
			double boxId = ctp2.getTierBoxId(lat, lng);<br />
			doc.add(new Field(ctp2.getTierFieldName(), NumericUtils<br />
					.doubleToPrefixCoded(boxId), Field.Store.YES,<br />
					Field.Index.NOT_ANALYZED_NO_NORMS));<br />
		}<br />
		try {<br />
			writer.addDocument(doc);<br />
		} catch (CorruptIndexException e) {<br />
			e.printStackTrace();<br />
		} catch (IOException e) {<br />
			e.printStackTrace();<br />
		}<br />
	}</p>
<p>	public List findNear(Directory dir, String what,<br />
			double latitude, double longitude, double radius) {<br />
		List result = new ArrayList();<br />
		try {<br />
			IndexSearcher searcher = new IndexSearcher(dir);<br />
			DistanceQueryBuilder dq = new DistanceQueryBuilder(latitude,<br />
					longitude, radius, latField, lngField, tierPrefix, true);<br />
			Query tq = null;<br />
			if(what !=null)<br />
				tq = new TermQuery(new Term(&#8220;name&#8221;,what));<br />
			else<br />
				tq = new TermQuery(new Term(&#8220;metafile&#8221;, &#8220;doc&#8221;));</p>
<p>			DistanceFieldComparatorSource dsort = new DistanceFieldComparatorSource(dq.getDistanceFilter());<br />
			Sort sort = new Sort(new SortField(&#8220;foo&#8221;,dsort,false));</p>
<p>			TopDocs hits = searcher.search(tq, dq.getFilter(),10,sort);<br />
			int numResults = hits.totalHits;</p>
<p>			Map distances = dq.getDistanceFilter().getDistances();</p>
<p>			for (int i = 0; i &lt; numResults; i++) {<br />
				int docID = hits.scoreDocs[i].doc;<br />
				Document d = searcher.doc(docID);<br />
				double rsLat = NumericUtils.prefixCodedToDouble(d.get(latField));<br />
				double rsLng = NumericUtils.prefixCodedToDouble(d.get(lngField));<br />
				double geo_distance = distances.get(docID);<br />
				SearchResult sr = new SearchResult(d, rsLat, rsLng, geo_distance);<br />
				result.add(sr);<br />
			}</p>
<p>		} catch (CorruptIndexException e) {<br />
			e.printStackTrace();<br />
		} catch (IOException e) {<br />
			e.printStackTrace();<br />
		}</p>
<p>		return result;<br />
	}<br />
}</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Verteilte Anwendung komplexer Filteroperationen auf große Bilder von fakod</title>
		<link>http://blog.fakod.eu/2011/04/30/verteilte-anwendung-komplexer-filteroperationen-auf-grose-bilder/comment-page-1/#comment-123</link>
		<dc:creator>fakod</dc:creator>
		<pubDate>Sat, 30 Apr 2011 21:00:01 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1514#comment-123</guid>
		<description>Die Kacheln müssen einfach überlappend, also etwas grösser, ausgeschnitten werden. Nach der Berechnung kann man sie dann wieder zurecht schneiden, wenn man möchte.</description>
		<content:encoded><![CDATA[<p>Die Kacheln müssen einfach überlappend, also etwas grösser, ausgeschnitten werden. Nach der Berechnung kann man sie dann wieder zurecht schneiden, wenn man möchte.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Verteilte Anwendung komplexer Filteroperationen auf große Bilder von Konstantin Pribluda</title>
		<link>http://blog.fakod.eu/2011/04/30/verteilte-anwendung-komplexer-filteroperationen-auf-grose-bilder/comment-page-1/#comment-122</link>
		<dc:creator>Konstantin Pribluda</dc:creator>
		<pubDate>Sat, 30 Apr 2011 18:51:54 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1514#comment-122</guid>
		<description>Dieser Ansatz ist  gut für Filter die über einzelne Pixel wirken -  was ist  mit Filtern die auf einen Region basieren ( Median / Gauss / Sauvola etc. )  -  da muss man Überlappung zulassen</description>
		<content:encoded><![CDATA[<p>Dieser Ansatz ist  gut für Filter die über einzelne Pixel wirken &#8211;  was ist  mit Filtern die auf einen Region basieren ( Median / Gauss / Sauvola etc. )  &#8211;  da muss man Überlappung zulassen</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Neo4j REST Server, GWT and JIT Part 3 von Jakob</title>
		<link>http://blog.fakod.eu/2010/11/29/neo4j-rest-server-gwt-and-jit-part-3/comment-page-1/#comment-114</link>
		<dc:creator>Jakob</dc:creator>
		<pubDate>Fri, 03 Dec 2010 20:26:23 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1376#comment-114</guid>
		<description>I played around with JIT TreeMaps - you can easily show trees of 1000 nodes, but more will not be fun. You can dynamically load parts of the graph from a server, but the JIT demos do not include this, and I am not sure whether memory is freed, or whether your application will get slower and slower, the more you click around. In summary, it is possible, but needs some more testing.</description>
		<content:encoded><![CDATA[<p>I played around with JIT TreeMaps &#8211; you can easily show trees of 1000 nodes, but more will not be fun. You can dynamically load parts of the graph from a server, but the JIT demos do not include this, and I am not sure whether memory is freed, or whether your application will get slower and slower, the more you click around. In summary, it is possible, but needs some more testing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Kommentar zu Neo4j REST Server, GWT and JIT Part 3 von fakod</title>
		<link>http://blog.fakod.eu/2010/11/29/neo4j-rest-server-gwt-and-jit-part-3/comment-page-1/#comment-113</link>
		<dc:creator>fakod</dc:creator>
		<pubDate>Thu, 02 Dec 2010 14:27:53 +0000</pubDate>
		<guid isPermaLink="false">http://blog.fakod.eu/?p=1376#comment-113</guid>
		<description>No sorry, I did not test really big amount of data. I just know the examples on the TheJIT page, which are rendered rather fast (depending on the browser you are using) and it can be confusing to see more that 20 nodes and/or relations (on an iPad its not easy to catch the node with a finger). So if you have to visualize big graphs you need to code some click and enhance/reload graph logic. But this should be easy to implement.</description>
		<content:encoded><![CDATA[<p>No sorry, I did not test really big amount of data. I just know the examples on the TheJIT page, which are rendered rather fast (depending on the browser you are using) and it can be confusing to see more that 20 nodes and/or relations (on an iPad its not easy to catch the node with a finger). So if you have to visualize big graphs you need to code some click and enhance/reload graph logic. But this should be easy to implement.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

