About DAS:

 

I have been doing plant identifiers for almost 20 years now starting with my Amiga in the 1980’s.  After having written many I realized the program really shouldn’t care what the item is being examined whether it is botanical, animal, fungi, geological or autoparts the problem of identification is simply uniting the data with the selected character traits to the program.

 < xml="true" ns="urn:schemas-microsoft-com:office:office" prefix="o" namespace="">

The search is done synoptically simply searching each data record for all selected traits.  In computer terms this is easy to do with two nested “ for each “ loops. One “for each” of the records in the data file and one “ for each” of the traits in the current user selection. This can be accomplished even for very large datasets in seconds.

 

Here is a section of the data file from our fern identifier which shows the data name, alternate search words, and a list of character traits.

 

Adiantum pedatum, Maidenhair Fern Maiden-hair @Af

Asplenium bradleyi, Bradley's Spleenwort Bradley Spleenwort  @Bb @Bc @Bd @Ca @Db @Eb @Fe @Ga @Gb @Gc @Gd @Hb @Hc @Hd @He @Ia @Ib @Ja @Jb @Jc @Kb @Kd @Ke @La @Lb @Mb @Na @Nb @Ob @Pb @Pc @Qa @Qb @Qc @Qd @Ra @Sa @Sb @Sc @Ta @Tb @Tc @Ua @Ub

Asplenium montanum, Mountain Spleenwort  @Bc @Bd @Be @Ca @Db @Eb @Fe @Ga @Gb @Gc @Hc @Hd @He @Ia @Ib @Ja @Kb @Ke @La @Lb @Ma @Mb @Nb @Ob @Pa @Pb @Pc @Qa @Qd @Ra @Rb @Sa @Sb @Sc @Ta @Tb @Tc @Td @Te @Ua @Ub

Asplenium pinnatifidum, Lobed Spleenwort Asplenosorus Pinnatifid Spleenwort  @Ba @Bb @Ca @Cb @Da @Db @Eb @Fe @Ga @Gb @Hd @Ia @Ib @Ja @Jb @Jc @Ka @Kb @Kd @Ke @Lb @Lc @Ma @Mb @Na @Nb @Ob @Pa @Pb @Pc @Qa @Qc @Qd @Ra @Rb @Sa @Sb @Sc @Ta @Tb @Tc @Td @Ua @Ub

Asplenium platyneuron, Ebony Spleenwort  @Bb @Ca @Cb @Ce @Db @Eb @Fe @Gc @Gd @Ge @Gf @Ha @Hb @Hc @Ia @Jb @Jc @Ka @Kb @Kd @Ke @Lb @Lc @Ma @Na @Nb @Oa @Ob @Pb @Pc @Qa @Qc @Qd @Ra @Sa @Sb @Sc @Sd @Ta @Ua @Ub @Uc

 

Upon making a selection of character traits the program searches for all files containing the selected trait(s).  All data, name entries, with matching traits are displayed to a list.  Upon clicking on a name in the list a display of that record is made. This can presently be a BMP, JPG, TIF, PNG, BMP, AVI, MPG, MP3.  These presentation can easily copied to CD for distribution. 

 

http://electricfarm.googlepages.com/nefernidentifier

< xml="true" ns="urn:schemas-microsoft-com:office:office" prefix="o" namespace="">

 

After having written several plant identifiers I have found that this activity is common to many projects.  Plants, Auto Parts, Insects …….it doesn’t make any difference you have an item with several character traits.  The idea is to select the character traits and show the data that matches the traits.

 

This is simple enough project for a programmer with a specific data set but what about someone with no knowledge of programming.  For example a person wanting to identify birds knows what the important character traits are but transferring their knowledge to a computer program and some programming language is fraught with a heavy learning curve.

 

This is what DAS is used for.  It allows a data author to create a program and related files to do plant identifiers,  auto parts identifier,  geological identifiers, data makes no difference to the program.   Our “Fern Identifier”, “Orchid Identifier”, or any other data set could be easily imported to DAS.exe.  Even merchandise catalogs can be set up for CD presentations.  I set up an inventory (catalog) for several parts dealers and this also could have been done with a universal identifier like DAS.  The first write of this was in “C” and there have been numerous rewrites in C++.  Version 7.0 is written in C# with the .NET framework 2.0  I am tired of writing the same code again and again to accomplish similar tasks for dedicated programs and hopefully DAS 7.0 will put that activity to bed.

 

 

                                      This picture is DAS 7.0 which has been loaded with my planting guide data as a demo.

The main choice screen has 8 buttons at the top, which controls the program.  There is also a set of 26 choice buttons.  These buttons are invisible until the author enters text onto the button.  Each button can have a set of subordinate choices which is actually the same buttons being used to create a second level of choices.  Unlike my previous identifiers you can also create successive choice screens for 3rd 4th ……etc. levels. 

 

Each time a choice is made the program looks to see if there is another subordinate level of choices.  If subordinate choices do not exist the program enters the current choice to the searchCommand, searches the data file for matching characters, and displays a list of found files.   If a subordinate choice exists the program resets the buttons for the new choice screen by showing and renaming the appropriate buttons.  Also a search is made for the graphic for the choice screen. ( I am presently working on a routine that will allow authors to relocate the buttons on their graphic.)  The graphic should be a 1000x680 .jpg file.  Since the graphic is not embedded in the program someone with no programming knowledge can easily edit it.

 

On the authoring level the program can be used to create subordinate choice screens.  Edit button names, and locations.  Most importantly it has function to record user selection data, and associate the selection to a specific display file (presently jpg, bmp, tif, mpg, mp3 or avi).  There is also a feature to insert meta tags for alternative names for word searches.

 

When a presentation is completed the folder containing the program, screen files,  screen backgrounds,  data file, and graphics is simply copied to a CD-DVD and it is freely distributable.  It is a complete stand-alone presentation that does not have to be installed.  The only limitation on the freely distributable program is that the authoring features (the authoring button) is only available on the registered copy.  This enables the author at any time to distribute the most current version. 

 

I have a parts dealer that updates their data on a daily basis burning a current disk whenever needed.  This has a distinct advantage over producing disks by thousands to get a price break and then being stuck with a whole lot of undistributed disks because they are out of date.

 

I am presently incorporating my data set for my planting guide into DAS7 as a demonstration and anyone desiring a beta demonstration disk let me know.