Search Results for "archiving work flow"

FCSalyzer is a free program for analysing flow cytometry data. It is programmed in Java and should therefore work on many different operating systems. FCSalyzer offers an easy What-you-see-is-what-you get interface and provides the standard analysing tools - dot plots, histograms, complex gating strategies and associated statistics. Impressum / Legal Notice Sven Mostböck Wien Austria e-mail: sven_mostboeck@users.sourceforge.net second contact option: use the open discussion on the FCSalyzer sourceforge page: http://sourceforge.net/p/fcsalyzer/discussion/

...See developer guide for HOWTO. * example project.mat and calib.mat use abs path will not work for you directly. pl. rebuild yours according to my youtube tutorial

EduLB is a small and easy to handle lattice Boltzmann code for channel flow. Main objective is to give interested people the opportunity to play around and see how things work. For feedback, leave a review, leave a comment on the discussion page or send me a private mail.

HanNanum is a Korean Morphological Analyzer and POS Tagger. A plug-in component-based architecture is adapted to the new Java version for flexible use. You can find the work flow for morphological analysis, POS tagging, noun extraction, etc. Contact: kschoi@kaist.ac.kr hjjeong@world.kaist.ac.kr

JFlux is a java library and graphical user interface to work with flow cytometry data. In particular, it is adapted to the COPAS biosorter and can analyze expression profiles.

PyramidWorkshop is an image-compression System based upon the scientific work of John Robinson (inventor of BTPC) about image-compression with adaptive linear predictors and is in average more efficient than PNG/JPEG2000.

iDocs is a intellectual document work flow with text mining options project.

The purpose of the E-Remise system will be to facilitate the proper evaluation of large numbers of electronic assignements. Another prupose of E-Remise is the archiving of source code and other work done by students. It is useful for pedagocial reasons.

Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.