DP Tool Club 12

home *** CD-ROM | disk | FTP | other *** search

/ DP Tool Club 12 / CD_ASCQ_12_0294.iso / vrac / ztree14.zip / CT.DOC < prev next >

Wrap

Text File | 1994-01-20 | 83KB | 2,311 lines

THE CALLING TREE (TM) Copyright 1993 IN/QUEST, LLC. All rights reserved IN/QUEST, LLC 3140 S.Peoria St., #K-200 Aurora, CO 80014-3155 (303)671-0800 CIS:70505,531 AOL:inquest Fido 1:104/555 jim.turner@boardwatch.com ┌───────┐ ┌────┴──┐ │ (R) ──│ │ │─────────────────── │ ┌────┴──┐ │ Association of │ │ ├─┘ Shareware └──┤ o │ Professionals ─────│ │ │───────────────────── └───┴───┘ MEMBER THE CALLING TREE D O C U M E N T A T I O N Table of Contents Disclaimer Agreement ..................................... 1 What is Shareware? ....................................... 2 The Association of Shareware Professionals (ASP) Ombudsman ..................... 3 THE CALLING TREE Introduction ............................ 4 System Requirements ...................................... 7 Installation / Upgrade.................................... 7 System Start-Up .......................................... 8 Add/Edit/Retrieve Operation Instructions.................. 9 View Tree List ........................................... 17 Setup and Configuration .................................. 19 Printing Reports/Labels .................................. 26 Upgrading from an older version .......................... 28 Registration (Why/What do you get)........................ 29 How to contact IN/QUEST .................................. 30 Other Programs From IN/QUEST ............................. 33 Separate files.... Warranty Sysop Instructions Vendor Instructions Registration Form Packing List Site License - i - ┌────────────────────────────────────────────────────────────┐ │ │ │ DISCLAIMER - AGREEMENT │ └────────────────────────────────────────────────────────────┘ THE CALLING TREE is released into the shareware distribution network under the following terms and conditions. Users of THE CALLING TREE must accept this disclaimer of warranty: "THE CALLING TREE is supplied as is. The author disclaims all warranties, expressed or implied, including, without limitation, the warranties of merchantability and of fitness for any purpose. The author assumes no liability for damages, direct or consequential, which may result from the use of THE CALLING TREE." THE CALLING TREE is a "shareware program" and is provided at no charge to the user for evaluation. Feel free to share it with your friends, but please do not give it away altered or as part of another system. The essence of "user-supported" software is to provide personal computer users with quality software without high prices, and yet to provide incentive for programmers to continue to develop new products. If you find this program useful and find that you are using THE CALLING TREE and continue to use THE CALLING TREE after a 30 day trial period, you must make a registration payment of $39 to IN/QUEST,LLC. The $39 registration fee will license one copy for use on any one computer at any one time. You must treat this software just like a book. An example is that this software may be used by any number of people and may be freely moved from one computer location to another, so long as there is no possibility of it being used at one location while it's being used at another. Just as a book cannot be read by two different persons at the same time. Commercial users of THE CALLING TREE must register and pay for their copies of THE CALLING TREE within 30 days of first use or their license is withdrawn. Site-License arrangements may be made by contacting IN/QUEST,LLC. Anyone distributing THE CALLING TREE for any kind of remuneration must first contact IN/QUEST,LLC. at the address below for authorization. This authorization will be automatically granted to distributors recognized by the (ASP) as adhering to its guidelines for shareware distributors, and such distributors may begin offering THE CALLING TREE immediately (However IN/QUEST,LLC. must still be advised so that the distributor can be kept up-to-date with the latest version of THE CALLING TREE). You are encouraged to pass a copy of THE CALLING TREE along to your friends for evaluation. Please encourage them to register their copy if they find that they can use it. All registered users will receive a copy of the latest version of THE CALLING TREE system. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 1 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ WHAT IS SHAREWARE? │ └────────────────────────────────────────────────────────────┘ ** Please disregard if you have registered your version of THE CALLING TREE. ** Although you may not have paid anything to get this copy of THE CALLING TREE, it is not a free program. It is distributed on a "shareware" basis. What's that? Shareware is a form of distribution which gives user a chance to try software before buying it. If you try a Shareware program and continue to use it, you are expected to register. Individual programs differ on details -- some request registration while others require it, some specify a maximum trial period. With registration, you get anything from the simple right to continue using the software to an updated program with printed manual. Copyright laws apply to both Shareware and commercial software, and the copyright holder retains all rights, with a few specific exceptions as stated below. Shareware authors are accomplished programmers, just like commercial authors, and the programs are of comparable quality. (In both cases, there are good programs and bad ones!) The main difference is in the method of distribution. The author specifically grants the right to copy and distribute the software, either to everyone, or to a specific group. For example, some authors require written permission before a commercial disk vendor may copy their Shareware. Shareware is a distribution method, not a type of software. You should find software that suits your needs and pocketbook, whether it's commercial or Shareware. The Shareware system makes fitting your needs easier, because you can try before you buy. And because the overhead is low, prices are low also. Shareware has the ultimate money-back guarantee -- if you don't use the product, you don't pay for it. THE CALLING TREE is a "shareware program" and is provided at no charge to you for your evaluation. Feel free to share it with your friends, but please do not give it away altered or as part of another system. The essence of "user-supported" software is to provide ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 2 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ The Association of Shareware Professionals (ASP) Ombudsman │ └────────────────────────────────────────────────────────────┘ THE CALLING TREE is produced by Jim Turner, dba, IN/QUEST, LLC, a member of the Association of Shareware Professionals (ASP). ASP wants to make sure that the shareware principle works for you. If you are unable to resolve a shareware-related problem with an ASP member by contacting the member directly, ASP may be able to help. The ASP Ombudsman can help you resolve a dispute or problem with an ASP member, but does not provide technical support for members' products. Please write to the ASP Ombudsman at 545 Grover Road, Muskegon, MI 49442-9427 or send a Compuserve message via CompuServe Mail to ASP Ombudsman 70007,3536" ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 3 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ THE CALLING TREE INTRODUCTION │ └────────────────────────────────────────────────────────────┘ THE CALLING TREE is a database aimed at helping and organization that needs to track its members in a hierarchical manner. Meaning... At the very top there is one person who is the beginning of an organization of some nature or another. He/She has some function or responsibility where they have to contact one or more people directly and those people then have a function or responsibility to contact others directly under them. And so on down through the tree. It might be an emergency calling system for some emergency response effort, or some simple contact tree to keep club members up to date on meeting changes, or for a large network marketing organization wanting to track all the people downline from them. The Calling Tree supports... 1) The Calling Tree supports system capacities up to 1 million people which can be up to 1 thousand levels from the top of the tree with up to 10,000 people per immediate Family Queue. 2) It can automatically assign members to the next available Family Queue. 3) Delete anyone (Any associated downline will automatically compress up to the next level. 4) Move any member to any other member's Family Queue. (If a member has a downline, Optionally move the their downline with them or let their downline compress up to the next level) 5) Track up to 6 phone numbers (Day, Night, Cellular, Fax, Voice Mail, Pager) 6) Track up to 4 dates 6) Several print out options, including ability to print out multiple layers of Family Queues for maximum contact capability 7) Dial any phone number directly from the screen (See notes on separate program) 8) Search for and retrieve tree members using phrases or key words. 9) Quick Key views of whole database, member's Family Queue. 10) Quick Key step up/down through tree. 11) Print outs are to a default printer (Epson Compatible) 12) Look at and work on database subsets 13) Quasi contact management features. A quick course on THE CALLING TREE structure..... ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 4 ────────────────────────────────────────────────────────────────── ----[ GLOSSARY OF TERMS ]---- FAMILY QUEUE (Frontline) Number of people (tree members) directly below you in the tree (could be hundreds). This could be your immediate downline if you are in network marketing. FAMILY QUEUE PARENT (Upline) Person directly above you in the tree (will be only one). This might be your sponsor if you are using this in network marketing. LEVEL This is how many people are between you and the top of the tree. If you are Bob and you started this program and then added Sue to your family queue, you would be level zero and Sue would be level 1. If you added John to your family queue, John would also be level 1, but if you added John to Sue's family queue, John would be level 2. DOWNLINE A tree member's downline consists of all those people in the member's immediate/direct contact group and all the people in those contact groups. When you have a tree organization, every member of the tree is related to someone else in an hierarchical fashion. A simple tree might look like this. Level -0- BOB │ ┌───────────┬─┴─────────┬─────────────┐ │ │ │ │ -1- SUE MARY JACK LARRY │ │ │ ┌──────┬┴────┐ ┌─────┬┴───┐ ┌─┴─────┐ │ │ │ │ │ │ │ │ -2- IVAN HARRY MO RICK AL PAUL TED ALICE │ ┌───┴───┐ │ │ -3- FRICK FRACK Note: It was possible, for illustration purposes, to draw this tree from left to right rather than from top down. I chose from top down. So, consequently, all references in the documentation text are 'up' or 'down' or 'upline' or 'downline'. Example: Frick and Frack are downline from Mo. Frick, Frack, Mo, Harry, Ivan are downline from Sue. Sue is their upline. When building and maintaining a tree it is important to have a handy means to recognize those relationships. THE CALLING TREE does this ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 5 ────────────────────────────────────────────────────────────────── with a constant reference to Level and Queue Nbr. The 'Level' refers to the steps removed a member is from the top of the tree and the Queue Nbr refers to how many people are in a member personal downline family queue. Notice in the example above, that Mo is level 2 (2 steps from the top) and has 2 people in his family queue (Frick and Frack). Sue is level 1 (1 step from the top) and has 3 people in her family queue (Ivan, Harry and Mo). You may at sometime want to move someone closer to the beginning of the tree. Just reassign them to a queue at a lower level. It is that easy. General Information.... Pressing F1 from many places or screens in the system will give you a context sensitive help screen with information relative to where you are at the moment. The exception to this is the few times that you may be in a scrolling list screen. In those instances the F1 key will give you 'Quick Position' window. This window allows you to enter a key word in order to jump to another part of the list. The key word is only relative to the index key. If the list is keyed on the last name then entering the last name will help you jump directly to the area of the list with a last name similar to what you typed. If the list is indexed (sorted) on the date field then the F1 key will not work because I have sorted the database on the julian date (005234) not the actual date. The 'ESC' key will in most cases cancel and back you out of where you are. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 6 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ SYSTEM REQUIREMENTS:....... │ └────────────────────────────────────────────────────────────┘ THE CALLING TREE, requires an MS-DOS Compatible computer with a hard disk and 450K of RAM. It requires MS-DOS version 3.30 or better to run. ┌────────────────────────────────────────────────────────────┐ │ │ │ INSTALLATION │ └────────────────────────────────────────────────────────────┘ Copy the distribution file 'ZTREE*.*' to a new directory on your hard drive. If the file is an executable file (.EXE) type ZTREExx <Return> to have it automatically self extract from its compressed distribution file. If the file is a ZIPped file (.ZIP) first use PKUNZIP v2.04g to unzip or uncompress the file by typing PKUNZIP ZTREExx <Return>. UPGRADING from an older version... If this is an upgrade to an earlier version then follow these steps. First. Rename all the ???.FID files to ???NEW.FID. You can do this quickly with one DOS command. First log into the NEW CT directory then type 'REN ???.FID ???NEW.FID'. Once this has been completed then copy all the files to the previous calling tree directory. WARNING. It is always useful to have a complete backup of your files before you do any copying just in case something goes wrong. Now. To activate the conversion start up THE CALLING TREE by typing CT /C. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 7 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ START-UP ....... │ └────────────────────────────────────────────────────────────┘ To start type 'CT' then Enter. The Calling Tree will take you directly to the 'Setup/Configuration' screen. While in the configuration screen, you might take a moment to make sure your Auto Assign is set to your liking. If you set it to 'Y' it will automatically assign new members for you. (You may always manually assign someone using the [F4]key. Manually assigned people will override the Automatic Assign function.) Other option s here are 'N' for manual assignment of upline family queues or 'G' for the system to take a smart guess at a family queue assignment. Please read the section of Setup and Configuration below for a more thorough description of the various options here. Once you have completed this step, press the ESC key to get to the Main Menu. From there just start entering (Option 1)) your family tree members. The calling tree offers the ability to automatically build a tree as you are adding new members or will optionally offer you the ability to manually assign new members to a family queue at any time. You may move members (and optionally, their entire downline family queue) at will whenever you want. The program will automatically keep track of the number of levels everyone is away from the top of the tree (how may levels or calls removed they are from the source). To automatically build the tree as you are adding new members, the program will need to know the maximum family queue size to work with. Then if you opt to use the Automatic Assign feature the each new member will be added to the next available family queue, thus building a balanced tree. The program also wants to know if you want to manually assign all new members or wish to enable the Automatic Assign feature while adding new member. Next the program wants to know how many levels (1,2 or 3) above to print while printing a individual's family queue. It is conceivable that you will want to know who it is that is calling you if it is other than the person you where expecting. This option will let you who is upline from you. Next the program wants to know how many levels (1,2 or 3) below to print while printing a family queue. It is conceivable that you will want to know who each member of your family in turn has in their individual family queue and maybe even in each of their family queues, in order to facilitate the contacting process. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 8 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ OPERATING INSTRUCTIONS - ADD/EDIT/RETRIEVE │ └────────────────────────────────────────────────────────────┘ THE CALLING TREE is fairly straight forward in its operation. Once it is set up and configured you will be at the main menu. You merely chose to ADD, EDIT or RETRIEVE (A,E,R) option and begin. The other options from the main menu are View All, Printing, System Information, Setup/Configuration and Quit. In Add, Edit, and Retrieve Mode you will be working off of the same screen. The mode will be the only aspect that is different. Look for the mode setting indication in the upper right portion of the screen under today's date. Look over the Entry/Edit Screen. Notice that there are 5 sections to the screen. Section #1: {Top: Upper Left}. The date the member's record was first added to the system along with the member's person system supplied ID number. Section #2: {Top: Lower Left}. The Upline or Family Queue Parent Name along with the Upline Identification (ID) Number. This information is supplied by either picking a name from the assignment list or having the system supply a name. You may not key in a name in this area of the screen. Section #3: {Top: Upper Right}. Today's date (from the system date) along with the number of people in the tree's database and the current system mode (ADD, EDIT or RETRIEVE) Section #4: {Top: Lower Left}. The number levels this particular member is removed from the top of the tree and the number of people they have assigned to their personal family queue (or frontline for network marketing types). Section #5: {Bottom: Center}. The main portion of the screen provides the fields where you Enter, Edit or Retrieve a member's information. While you are in this screen, the available functions at the member screen are as follows... [F1] Help The F1 key is active through out and brings up context sensitive help in a help window. It will explain everything there is to explain at this point. [F2] ListALL (ListSUB) ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 9 ────────────────────────────────────────────────────────────────── * ALL - Pressing this F2 key will give the user a window with an alphabetical listing of all the members of the tree starting with A selected from the full tree database. * SUB - If you have done a Key Word or Phrase search and are consequently looking at a subset of the tree database then pressing the F2 key will give you a list of only the people in the subset. [F3] ShowC Show comments in a full window. The comments field on the member edit screen is only part of the whole field. The whole field is 250 characters long. To view the whole field press F3 [F4] Assign Press the F4 key if you want to assign this member (new or old) to a new upline family queue parent. Pressing this key will give you a window listing all the other members in the tree who are available to have as a parent. Choosing the same parent will yield no change. If you chose a parent who is currently in this person's downline then you will notified of such a case and will not be allowed to move this person's downline with them when they are moved. Their downline in that instance will compress up to their previous parent. Note: If you configured THE CALLING TREE for automatic assign then you will not have to assign new members. The program will automatically pick out the next available member closest to the root of the tree to assign the new member to. Using the Automatic Assign feature assures that you will have a locally balanced tree with everyone getting calls as efficiently as possible. [F5] Dial THE CALLING TREE uses a shareware program by the name of EASYDIAL written by Patri-Soft Inc. If you intend to use this feature, you first must unarchive the file 'ED45.EXE' that was distributed with this program by typing 'ED45'. Now, place the cursor in a phone number field with a phone number entry in it. Then press the F5 key to dial that number. This process may only take place if you have the file 'ED.EXE' in the CT directory and there is a phone number to dial. You will see the Patri-Soft screen in the process of dialing the number. When the number has been dialed you hit any other key. This will return you to the member screen. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 10 ────────────────────────────────────────────────────────────────── Note: EASYDIAL only uses standard IRQ's 2,3,4. If you have a modem attached to IRQ 5 or more than you will have to contact Patri-Soft to see if they have finished testing version 4.6 that deals with this problem. Also, EASYDIAL will occasionally fail to set the modem correctly for dialing. I have found if you press the F5 key again it usually will work fine. If you press the F5 key with the cursor anywhere else on the screen except in a phone number field the cursor will move to the first phone number field with a phone number in it. If this is the correct number to dial merely press the F5 key again. If it is not then tab or cursor over to the correct field then press F5. [F6] Print Press the F6 key to print members to screen, disk or printer. You must have a Member of the Tree currently displayed on the window to print it. You will be notified if you do not have a member displayed. This key will bring up the standard Print Options Screen with the particular individual's ID placed in the ID field. When you have entered and run a database (full tree) search that produces 1 or more matches (hits) - (See 'Search' below), then the system places these records in a file which is a Sub Set of the whole database. This allows you to Print out a much smaller file (SubSet) instead of the whole database. All of the standard keys work, but now they work on just the SubSet file. Pressing the F6 key will give you the following printing options from a 'FULL TREE' or a 'TREE SUBSET': Full Family Queue Sheets, Mailing Labels (for those with an address) or Member Lists for All Members, Members with a Family Queue of at least one person, Members without any Family Queue, Key word search of any member, or and individual member. [F7] Options You have several options here. Using this key you may in the middle of entering a member's information switch to 'ADD a NEW member record', 'Edit/Change a member record', 'Retrieve a member record', 'Delete a Member' or 'Search Database'. ADD: ------ If you have a record on the screen when you select this option the screen will be cleared and the mode will have changed to ADD MODE. If you had set the Automatic Assign feature in ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 11 ────────────────────────────────────────────────────────────────── Setup and Configuration to 'G' for Guess, then the name of the person who was on the screen will appear in the Family Queue Parent field. You may only ADD new members to your tree using this mode. The ADD mode may be selected from the Main Menu or here. If selected from the Main Menu then Guess feature will not work. EDIT: ------- If you have a record on the screen when you select this option the record will remain and the mode will change to EDIT MODE. You may only update an existing record using the EDIT MODE. RETRIEVE: --------- Here you have the ability to retrieve records based on three basic search criteria. The Retrieve option can be by NAME, DATE, PHONE. Place the cursor in the appropriate field and enter the information you are looking for. Then press the F8 key. [Name:] If you are looking for a name a select window will appear with the closest matching records in alphabetical order displayed. You may use the double period to designate a range of names. Examples: 'a..n' will yield a match of all records with last names from AAA to NNN. '..RUSH' will yield all matching records with the last name from AAA to RUSH. 'HALL..' will yield all records with the last name from HALL to ZZZZ. [Phone:] If you are looking for a phone number then if one record appears in the tree with that number that record will be displayed. If there is more than one occurrence of the phone number in the tree a select window will appear listing all the members with that number. The phone number retrieval is irrespective of field. Enter a phone number and it brings looks at ALL phone number regardless of Day, Nite, Fax etc. [Date:] If you are looking for a date the program will look for exact date matches in the field you had the cursor in. The date searches are therefore field specific. So only Date A dates will be searched if you place the search date in Date A field. The date format it 'MM/DD/YY'. If one record is found that member will be displayed. If more than one record is found then the select will appear displaying all records that match that exact date. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 12 ────────────────────────────────────────────────────────────────── SEARCH: ------- The search database option is far more powerful than a simple retrieve. The Name and Phone Number selections will place you back on the EDIT Screen in the appropriate field. [Date:] The 'Date' selection will give you a new window from which you may select all members based on a range of dates in a specific date field with an ascending 'A' or descending 'D' sort. So if you want to look up all people who have a date in Date C between 09/01/93 and 10/01/93 put a 'C' in the date field and place the first date in the BEGIN (FROM) field and the second date in the END (TO) field. Indicate which order you want the list sorted by and then hit enter. If you press Enter in an empty BEGIN (FROM) DATE field the date '01/01/50' will be used as the default from date. If you press Enter in an empty END (TO) field the system date for today will be used as the default END (TO) date. Now, pressing Enter in the Begin Search field will produce a select window listing all the members satisfying that date search specification. If you place a question mark ('?') in the FROM date field the program will look for all member records which have no date at all in the specified date field. The window presenting the list will be sorted by last name then first name. Quick Date Sort View: The [PgDn] and [PgUp] function keys from the member ADD/EDIT screen is modified to make this process go a little faster. Date Option: If you are in Retrieve or Edit Mode and place the cursor in one of the date fields and then press the [PgDn] key, you will be presented with a window, with a listing ALL the members of the tree's database with a date in that field sorted in DESCENDING chronological order starting with the newest date. If you press the [PgUp] key, you will be presented with the same information as before, but in ASCENDING chronological order starting with the oldest date. Example: If you have records with dates in the 'C' field such as 01/03/89 and 03/13/95, then with the cursor in the 'C' field you press PgDn will give you the 95 date first and 89 second. If you press PgUp you get the 89 date first and the 95 second ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 13 ────────────────────────────────────────────────────────────────── You may select all member records with NO date in a specified date field by placing a "?" in the field by itself then press [PgDn] or [PgUp]. You will be presented with a window listing all members in the database sorted by last name then first name that do not have a date in the indicated field. Comments Option: If you are in the Retrieve or Edit Mode and place the cursor in the 'Comments' field and press [PgDn] it will function like the F3 key. The effort here was to make as much of the system's information available as possible just by running one's fingers over the few keys (arrow, PgUp and PgDn, etc) grouped in the right center area of the 101 keyboards. This date option will only look for dates in the date fields. [Key Word/Phrase Search:] As a final option you can select to search the entire tree one record at a time looking for the occurrence or non-occurence of a key word or phrase. To look for the occurence of a word just enter it here and press Enter. If the Key Word or Phrase occurs anywhere in the tree it will be found. This search is case insensitive. That means it does not matter what the capitalization is. Looking for an 'a' will find 'a' and 'A' and visa versa. It also does not matter about part or whole word. Looking for 'pass' will find 'passenger' and 'bypass'. You can look for dates in the comments field this way. To look for the non-occurence or absence of a key word or phrase then preface the word or phase with the double slash '//'. You will retrieve all records that DO NOT have the search word or phase. DELETE { member last name }: ------- You may use this option to delete or erase a member from the system. If you delete a member who has a family queue below them (one or more members in their assigned queue) the program will prompt you as to whether you really want to do this and notify you that their queue will be compressed ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 14 ────────────────────────────────────────────────────────────────── (moved) upward to their parent. Example: If Bob calls Dick and Dick calls Sue and Mary. If you delete Dick then Dick's queue (Sue and Mary) will now be assigned to Bob's queue. [F8] Save The Action Key. Press the F8 key to Save, Accept, Start an operation. [F9] PrevA (PrevS) Pressing the F9 key will give you the previous record on file. If you were just about to ADD a NEW member then this operation will be canceled and the previous record on file will be placed on the screen in edit mode. If you are currently working on the full tree database you will see 'PrevA'. If you are working on a subset of the tree's database you will see 'PrevS'. [F10] NxtA (NxtS) Same as F9 key, but pressing the F10 key will give you the NEXT record on current full or subset file. [PgDn]Queue This key has several possible functions. Option A {Member Information} While in Edit Mode with a tree member's record on the screen. If the cursor is in the upper portion screen (above the date fields) then it will list the member's individual family queue - if they have one. Option B {Date Fields} If you are in Retrieve or Edit Mode and place the cursor in one of the date fields and then press the [PgDn] or [PgUp] function key, you will be presented with a window, listing ALL the members of the tree's database with a date in that field sorted in chronological order. The sort order is PgDn {Descending}=Newest to Oldest Date, PgUp {Ascending}=Oldest to Newest Date. Option C {Comments} If you are in the Retrieve or Edit Mode and place the cursor in the 'Comments' field and press [PgDn] it will function like the F3 key and produce a small window showing all of the comments on this individual. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 15 ────────────────────────────────────────────────────────────────── Note: The effort here was to make as much of the system's information available as possible just by running one's fingers over the few keys (arrow, PgUp and PgDn, etc) grouped in the right center area of the 101 keyboards. [PgUp]Upline Page up through the tree by pressing the PgUp key. [Ctrl/F1] Automatically will append the system date to the end of the information in the field the cursor is located in. If the field is empty then you will now see the date. Date format is "MM/DD/YY". [ESC]Menu Press the ESC key just about anywhere, including here, and you will back up to the previous screen, in this case the Main Menu The Main Menu will give you other options as mentioned earlier. The other options are Viewing, Printing, Setup/Configuration, and Information. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 16 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ VIEW TREE LIST │ └────────────────────────────────────────────────────────────┘ Viewing is a quick way to jump into your database. Pressing 'V' on your keyboard or arrow down till cursor is on the 'View Tree List' line then press Enter or Return. A window will appear that will give you a quick view of the first 11 people in your database starting from the beginning of the alphabet. This is called a Select Window. In this type of window and all other select windows you as the user get an abbreviated view of each record in a list format. It allows for rapid location of records in your database. You will see a screen with the following headings... ┌───────────────────────────────────────────────────────────────┐ │ Last Name Full Name Queue Parent Level Queue Nbr │ └──────────── ─────────────── ─────────────── ─────── ──────────┘ The Level and Queue Nbr are handy reference numbers to understand where the person is in the tree and their relationship to others. Movement around the database or tree and location of the desired record may happen in several ways. You may use the method that seems most expedient to you. Let me explain the options here. Select Window Options:.. One option of moving about the database through this type window is to move the cursor line up and down with the arrow keys, page up and page down keys, home and end keys till you find the desired member data line. Pressing Enter will display the member's full record on the Edit Screen. Another option is to press the letter on the keyboard that refers to the first letter of the last name field. Let me explain. If you are trying to find someone with the last name of Turner. Press the 'T' on your keyboard. The window will instantly redisplay with the cursor line on the first occurrence of someone with their last name starting with the letter 'T'. If you have thousands of people in your database and the first view you get is Ab... through At..., then rather than paging down repeatedly, just press the 'T' key to jump directly to the portion of the tree's database that starts with the letter 'T'. Then if 'Turner' is not there you need only page down a few times to get to the area of the database with 'Turner'. Another option is to press F1 and enter a more complete description ('Turner' in this example) of what you are looking for in the tree's database. Then press Enter. The database will jump directly to the first occurrence of the name 'Turner'. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 17 ────────────────────────────────────────────────────────────────── If at any time you desire to make no selection from this select window or any select window then press Escape to return to what you were doing. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 18 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ SETUP/CONFIGURATION │ └────────────────────────────────────────────────────────────┘ The Setup and Configuration options were covered briefly earlier in system startup. In this section we will go in to more depth on the system options. SETTING SYSTEM OPTIONS..... While in the Setup and Configuration screen, you might take a moment to make sure your Automatic Assign is set to your liking. The three options for assignment of an upline family queue parent are Automatic, Manual or Guess. Automatic: If you set it to 'Y' it will automatically assign new members for you. When you have chosen to Add a New member to the tree you will notice that the system has grabbed the next logical person in the tree an assigned them as your Family Queue Parent. Note: You may always manually override this assignment using the [F4] key. Any manually assigned people will override the Automatic Assign function. Manual: If you set it to 'N' then no attempt is made by the system to assign the new entry to anyone's family queue. You will have to manually make the assignment each time using the {F4] key. Guess: If you set it to 'G' and if you are on someone's screen when you select the ADD NEW option it will place that person's name in the family queue box and clear the rest of the screen for entry of a new member. At no time may you 'key in' the name of the upline family queue parent. The assignment must always come from one of the three options above. Maximum Family Size: In the instance where you have selected Automatic Assign to be Yes ['Y'], then the program will need to know the maximum family queue size to work with. So, in the process of building a tree the tree can automatically remain balanced. Everyone having the same size family to be responsible for. The key elements in making this decision are Level and Queue Size. The program will build up everyone's queue to the same size on one level before it moves to the next level. The program will pick new family queue assignments according to the following scheme. If the maximum size is three then it would go like this.... ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 19 ────────────────────────────────────────────────────────────────── ┌───────────────────────────────────────┐ │ Suppose our simple tree looked │ │ like this at the beginning │ │ │ │ Member Name Level Queue Size │ │ ----------- ----- ---------- │ │ John 1 1 │ │ Bob 1 1 │ │ Nancy 2 0 │ │ Dick 2 0 │ └───────────────────────────────────────┘ ┌───────────────────────────────────────┐ │* Now, add Sam as a New Member │ │ Member Name Level Queue Size │ │ ----------- ----- ---------- │ │ John 1 2 │ │ Bob 1 1 │ │ Nancy 2 0 │ │ Dick 2 0 │ │ Sam 2 0 │ └───────────────────────────────────────┘ ┌───────────────────────────────────────┐ │* Now, add Helen as a New Member │ │ Member Name Level Queue Size │ │ ----------- ----- ---------- │ │ John 1 2 │ │ Bob 1 2 │ │ Nancy 2 0 │ │ Dick 2 0 │ │ Sam 2 0 │ │ Helen 2 0 │ └───────────────────────────────────────┘ ┌───────────────────────────────────────┐ │* Finally, add Larry as a New Member │ │ Member Name Level Queue Size │ │ ----------- ----- ---------- │ │ John 1 3 │ │ Bob 1 2 │ │ Nancy 2 0 │ │ Dick 2 0 │ │ Sam 2 0 │ │ Helen 2 0 │ │ Larry 2 0 │ └───────────────────────────────────────┘ And so on. When all the members on level 1 each have three people to call in this example then the first alphabetical person in level 2 is picked when the next new member is added. The last system option is the option to receive a prompt, confirming ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 20 ────────────────────────────────────────────────────────────────── your desire to quit the system, when you select 'QUIT' from the main menu. Place a 'Y' here if you want to have a prompt, place a 'N' here if you do not wish a prompt. An 'N' will stop the program immediately. SETTING PRINT OUT OPTIONS....... Upline: During printing the program wants to know from your setup how many levels (1,2 or 3) above to print a individual's upline contacts. It is conceivable that you will want to know who it is that is calling you if it is other than the person you where expecting. This option will let you who is upline from you. Example: Bob call Dick who in turn call Mary, who in turn calls Adam The print out sheet header will look as follows for 1, 2 and 3 options ┌───────────────────────────────────────────────────────┐ │ Adam's Level (1) option will print as follows.. │ │ │ │ Upline is Mary (Phone Number) │ │ ADAM'S SHEETS │ └───────────────────────────────────────────────────────┘ ┌───────────────────────────────────────────────────────┐ │ Adam's Level (2) option will print as follows.. │ │ │ │ Upline is Mary (Phone number) │ │ - Back one is Dick (Phone number) │ │ ADAM'S SHEETS │ └───────────────────────────────────────────────────────┘ ┌───────────────────────────────────────────────────────┐ │ Adam's Level (3) option will print as follows.. │ │ │ │ Upline is Mary (Phone number) │ │ - Back one is Dick (Phone number) │ │ - Back two is Bob (Phone number) │ │ ADAM'S SHEETS │ └───────────────────────────────────────────────────────┘ Downline: While printing the program needs to know how many levels (1,2 or 3) below to print while printing a family queue. It is conceivable that you will want to know who each member of your family in turn ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 21 ────────────────────────────────────────────────────────────────── has in their individual family queue and maybe even in each of their family queues, in order to facilitate the contacting process. Example: Bob will call Dick and Sue. Dick will call Joe and Louise, Sue will call Harold and Maud. Joe will call Ted and Alice, Maud will call Frick and Frack. ┌───────────────────────────────────────────────────────┐ │* Bob's Level (1) option will print as follows.. │ │ │ │ BOB'S SHEETS │ │ │ │ 1 Dick (Phone Numbers) │ │ 2 Sue (Phone Numbers) │ └───────────────────────────────────────────────────────┘ ┌───────────────────────────────────────────────────────┐ │* Bob's Level (2) option will print as follows.. │ │ │ │ BOB'S SHEETS │ │ │ │ 1 Dick (Phone Numbers) │ │ - Dicks Family Queue [Ln/Qn] │ │ ------------------------------ │ │ 1 Joe (Phone Numbers) │ │ 2 Louise (Phone Numbers) │ │ 2 Sue (Phone Numbers) │ │ - Sue's Family Queue [Ln/Qn] │ │ ------------------------------ │ │ 1 Harold (Phone Numbers) │ │ 2 Maud (Phone Numbers │ └───────────────────────────────────────────────────────┘ ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 22 ────────────────────────────────────────────────────────────────── Sample Print Out formats (continued) ┌───────────────────────────────────────────────────────┐ │* Bob's Level (3) option will print as follows.. │ │ │ │ BOB'S SHEETS │ │ │ │ 1 Dick (Phone Numbers) │ │ - Dicks Family Queue [Ln/Qn] │ │ ------------------------------ │ │ 1 Joe (Phone Numbers) │ │ -Joe's Family Queue [Ln/Qn] │ │ ------------------------------- │ │ 1 Ted (Phone Numbers) │ │ 2 Alice (Phone Numbers) │ │ 2 Louise (Phone Numbers) │ │ 2 Sue (Phone Numbers) │ │ - Sue's Family Queue [Ln/Qn] │ │ ------------------------------ │ │ 1 Harold (Phone Numbers) │ │ 2 Maud (Phone Numbers │ │ -Maud's Family Queue [Ln/Qn] │ │ ------------------------------- │ │ 1 Frick (Phone Numbers) │ │ 2 Frack (Phone Numbers) │ └───────────────────────────────────────────────────────┘ As you can see the level (3) option can be some what involved to look at and use, so use it advisedly. The Page and Label Size.. Enter the number of printable lines that are on the paper you are using for sheets or labels. Sheets: The program will subtract 6 from the size of the page to use as margins. If the bottom margin is reached or if the end of a member's family queue is reached then a page feed will be issued, to move the printer to the top of the next page. Labels: The program will print one blank line then print the three line address (only if the address field is not empty), then print the country name/abbreviation if it is different than the system country name/abbreviation, and then print the rest of the lines here blank, then repeat the process. It will not issue a page feed. It just issues line feeds. Your system is now set up and ready to go...... WORKING WITH THE SYSTEM OPERATOR INFORMATION..... The primary member of the tree (the first person to start the ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 23 ────────────────────────────────────────────────────────────────── system) will have their information on this screen. From this screen the following keys can be used.... [F1] Help Receive context sensitive help just by pressing the F1 key here or anywhere in the system. In most cases it will give you information about where you are in the system and what your options are. [F2] ListAll Press the F2 key here will present you with a list of all the members of your calling tree sorted by last name, first name. [PgDn] Family Queue Pressing the PgDn key will give you a window with a list of all the members of your primary family queue sorted by last name, first name. [F6] Print Pressing the F6 key will give you the opportunity to print the primary family queue information. [F7] AddNew Pressing the F7 key will bring up a new Member Add/Edit screen with the system operator's name information already filled in the Upline window. If the new member is not going to be in the primary family queue then just press F4 to reassign to a different member. [F8] Save Pressing the F8 key will save any new information from this screen [ALT-F1] ASCII output. You may dump the entire database to a delimited ASCII file on disk by pressing ALT-F1. The file fields will be as follows:... 1) ID NUMBER 14) DAY PHONE 2) UPLINE ID NUMBER 15) NIGHT PHONE 3) UPLINE NAME 16) FAX PHONE 4) NUMBER IN QUEUE 17) PAGER PHONE 5) NUMBER LEVELS FROM TOP 18) VMAIL PHONE 6) FIRST NAME 19) CELLULAR PHONE ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 24 ────────────────────────────────────────────────────────────────── 7) LAST NAME 20) EMAIL ADDRESS 8) SPOUSE NAME 21) DATE ADDED TO SYSTEM 9) ADDRESS 22) DATE A 10) CITY 23) DATE B 11) STATE 24) DATE C 12) ZIP+4 CODE 25) DATE D 13) COUNTRY 25) COMMENTS ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 25 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ PRINTING REPORTS & LABELS │ └────────────────────────────────────────────────────────────┘ You have several printing options. All print out formats include a tree members full name (and spouse) with all their contact phone numbers. refer to the Setup/Configuration section above to get an idea of what the print outs might look like in the various UP/DOWN options. The print out options are: 1) [S] Family Queue Sheets. Will print out member's family queue sheet. [M] Mailing Labels. Will print labels if address field is not blank. [L] Member Lists. Will list member names (optionally with queues). [F] Full Member Record. Will print out a the member's record only. 2) [F] Everyone with a Family Queue size of 1 or more [N] Everyone without a Family Queue (size = 0) [B] Both [E] and [N] above. If printing out sheets then the printing will do all 'E's first then do all 'N's next. If printing out labels then ALL labels will be printed alphabetically. [K] Key Word or Phrase search. Print out all members (sheet or labels) regardless of the size of their family queue if the member's record contains a matching string to the key string entered here. Note: The key string 'pass' will find 'Passenger', 'bypass', and 'PASSING'. Note: You may preface the search word or phrase with a double slash '//' if you want to locate records that DO NOT have this word or phrase. If the key word was 'pass' you would type '//pass' to locate all records excluding 'pass'. [I] Individual sheet or label. By indicating the member ID number one particular tree member will be printed out. The mailing label option will only work if the individual has an address. 3) Print to Device: [COM1, COM2, LPT1, LPT1, LPT2, DISK {file name}, SCREEN] 4) Print Up Level (mentioned earlier in Setup). You may ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 26 ────────────────────────────────────────────────────────────────── print out from 1 to 3 up levels. This will permit the display of the individuals who are the most immediate upline to this member. 5) Print Down Level (mentioned earlier in Setup). You may print out from {0} 1 to 3 down levels. This will permit the display of the individuals below the primary downline or frontline to this individual. The '0' down level is only recognized when printing Lists. 6) Number of print lines to a page. The program will reserve 4 lines for top and bottom margins and then print the page. When it gets to the bottom margin it will issue a form feed to the printer. 7) Number of print lines to a printed label. The program will print one line of white (space) then the remainder of the label in lines. i.e. A 6 line label would be one line of white, three lines of address, optionally one line for country name/abbreviation, and then one or two lines of white then repeat the process. There are no form feeds given in printing of labels. 8) Special printer codes. The default code that is sent to the printer is ESC @. If your printer requires some other initialization code then place the appropriate code hear. The program will send the code to the printer at the beginning of printing operation. No Printing: You may press the ESC key at any point and return to the previous screen (Main Menu or The Entry/Edit screen). Begin Printing: With the cursor in the bottom action field you may press the 'P' or the ENTER/RETURN key to begin printing. Cancel Printing: If you are printing to disk or printer then you may press the CTRL/F10 key to cancel printing. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 27 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ UPGRADING FROM OLDER VERSION │ └────────────────────────────────────────────────────────────┘ YOU MUST PLACE THE NEW VERSION IN A COMPLETELY NEW (TEMPORARY) DIRECTORY Now, rename all the files with a '.FID' ending to *NEW.FID". You can do this with one simple DOS command. Type: REN ???.FID ???NEW.FID then press <ENTER> This should rename NAM.FID to NAMNEW.FID, etc. If you do a directory listing the files will now have been renamed with the 'NEW' in their names. Next copy all the new version files in this new directory to the directory where your old version is located (i.e 'COPY *.* C:\CTOLD'). (It wouldn't hurt to have made a copy of the old version before this. In case something goes wrong you can always recover.) Next change to the old directory and type: CT /C then press <ENTER> This will convert all your old data to the new version. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 28 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ REGISTRATION... (Why/What do I get?) │ └────────────────────────────────────────────────────────────┘ Here are some reasons why you should register: - You receive the latest release of the program, fresh from the author's computer. - You get unlimited technical support for 90 days via surface mail or electronic mail. - If you find any major bugs in the software that inhibits basic value I will correct these bugs for you and send you the most recent version free of charge. - You have the author's ear when it comes to suggesting new features and capabilities. You may also be able to beta-test new versions of the software before they are released to the general public. - You help increase competition in the software industry by keeping prices low (shareware doesn't rely on expensive advertising). - Finally, you can be proud of the honesty and integrity you've shown in registering the program and having participated in the shareware revolution. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 29 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ HOW TO CONTACT IN/QUEST │ └────────────────────────────────────────────────────────────┘ All correspondence, payments and registration should be mailed to:... All payments should be to "J.Q.Turner" Jim Turner IN/QUEST, LLC. 3140-K South Peoria Street, # 200 Aurora, CO 80014-3155 Notice: The registered version of THE CALLING TREE is accompanied by another shareware program called 'EASYDIAL'(tm). EASYDIAL or 'ED' allows THE CALLING TREE to dial any selected phone number field by pressing the F5 key. This is a separate shareware program and if you end up using this feature you must register this program separately and directly with Patri-Soft Inc. Locate their documentation enclosed with this distribution in their EASYDIAL.ZIP file. If you have any problems using EASYDIAL please contact Patri-Soft for support. IN/QUEST is only supporting THE CALLING TREE. Questions answered at:...................... Voice: (303)671-0800 Fax: (303)671-0559 E-Mail:................. America Online "INQUEST" (Internet: inquest@aol.com) CompuServe 70505,531 (Internet: 70505.531@compuserve.com ) Fidonet 1:104/555 ( jim.turner@boardwatch.com) ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 30 ────────────────────────────────────────────────────────────────── The most current version of THE CALLING TREE can usually be found through... A. CompuServe (go IBMAPP) IBM Applications forum (Business App's #6 Library) File Name ZTREE.ZIP B. Any SDN node and AOL look for ZTREExx.ZIP (xx=Latest version number) C. GEnie services. Look for ZTREExx.ZIP (xx=Latest version number) in IBM/PC APplications area. D. The Internet via Anonymous FTP at cscns.com. Ask for ZTREE*.ZIP E. Every attempt will be made to keep the most current copy on the ASP Hub Network systems (AHN). The following boards are the AHN BBS's. In an effort to make it easier for you to obtain your favorite software, the latest updates of many ASP authored programs can be found on the BBS's listed below. These BBS's are members of the ASP Hub Network (AHN). File Name ZTREEXX.ZIP Zone 1 - East Coast USA North-East Coast Mid-East Coast [Site #1] [Site #2] The Consultant BBS The Break RBBS <East> Jay Caplan Bruce Jackson P.O. Box 8571 4660 Whitaker PL New York NY 10116-4655 Dale City, VA 22193-3011 Data1) 718-837-3236 Data1) 703-680-9269 Data2) Data2) 703-551-0000 Zone 2 - North Mid-USA Zone 3 - Southern Mid-USA [Site #3] [Site #4] The Twilight Zone The DataExchange BBS John Hrusovszky Don Morris 1119 E. Main St 119 Herring St. Auburndale, WI 54412 Leesville, LA 71446 Data1) 715-652-2758 Data1) 318-239-2122 Data2) Data2) Zone 4 - West Coast USA [Site #5] [Site #6] Attention to Details BBS Space BBS Clint Bradford Owen Hawkins 5085 Trail Canyon Dr PO Box X Mira Loma CA 91752 Menlo Park, CA 94026 ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 31 ────────────────────────────────────────────────────────────────── Data1) 909-681-6221 Data1) 415-323-4398 (ASP Files) Data2) Data2) 415-323-4193 (Other Files) Zone 5 - Canada [Site #7] Knightec BBS Phil Knight 35 Robb Blvd #6 Orangeville, ONT L9W 3L1 Data1) 519-940-0007 Data2) These BBSs are bound by special agreement with the ASP. In the case of a dispute contact the ASP Ombudsman. ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 32 ────────────────────────────────────────────────────────────────── ┌────────────────────────────────────────────────────────────┐ │ │ │ OTHER PROGRAMS AVAILABLE FROM IN/QUEST │ └────────────────────────────────────────────────────────────┘ Other Products of IN/QUEST, LLC: 'SHOWLOGO' (tm), 'SHOWTIME' (tm) and 'PUBLIC ACCESS' (tm) SHOWLOGO (tm) is designed to specifically show any text file in a setting where the information has to be more-or-less persistent without burning or damaging the screen. Thus, SHOWLOGO is offered as a screen saver. SHOWLOGO registration is $10 per computer and full documentation is available from the same systems as above under the name SHOWL.ZIP and SL123.ZIP respectively. Site licenses are available. A PCX file may be displayed as one of the random video effects. SHOWTIME (tm) is an enhancement of SHOWLOGO with the addition of a scheduler that will display any text (ASCII) up to a full screen for a period of time designated in a scheduler. At the end of the designated period of time, SHOWTIME will check the scheduler file and display the next scheduled text file. SHOWTIME keeps the text message persistent on the screen, with various video effects to prevent any damage to the screen. A PCX file may be displayed as one of the random video effects. PUBLIC ACCESS (tm) keeps track of computer usage for public sites such as public libraries, copy centers, hotels, airports, etc. Any place where they rent their computers to the public and they need to control the use of, access to, and track what the public did so they can be charged accordingly. Supports FREE, CASH, and CREDIT CARDS use. Supports public usage of and access to any APPLICATION program any ONLINE DATA COMMUNICATIONS service (via modem). ────────────────────────────────────────────────────────────────── THE CALLING TREE (TM) Copyright (c) 1993 IN/QUEST,LLC Page 33 ──────────────────────────────────────────────────────────────────