аЯрЁБс;ўџ ?ўџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџ§џџџџџџџ= ;ўџџџ !"#$%&'()*+,-./0123456789:ўџџџ<>ўџџџўџџџ@ABCDўџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџRoot Entryџџџџџџџџџџџџўџџџџџџџџџџџџџџџўџџџџџџџџџџџџџџџўџџџџџџџџџџџџџџџўџџџўџџџўџџџўџџџ ўџџџўџџџўџџџ !"#$%&ўџџџўџџџ)*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdeўџџџghijўџџџўџџџўџџџўџџџopqrstuvwxyz{ўџџџўџџџ~€ўџ џџџџбљ ТЎ…бЊД`—кVTextStarWriter 5.0з А 4= j\Ё­-&J^WЁa­0\—ЪтF TASK,0,1,H32,0,100,1,4765;11878;100;2280;10800;13350;16620;0;0Mд6СЉ"ьetљZуjŸЕжPибЌЭьв~оD ЊЅ SW5HDR.0ЌW1;€!u Internet linkBullet SymbolsFootnote Symbol Footnote anchorџџ 302729951џџ 303054791џџOutline0 #RС  n+.StarBats•хўџџ n+.StarBats•6хўџџ n+.StarBats•Qхўџџ n+.StarBats•lхўџџ n+.StarBats•‡хўџџ n+.StarBats•Ђхўџџ n+.StarBats•Нхўџџ n+.StarBats•ихўџџ n+.StarBats•ѓ хўџџ n+.StarBats• хўџџ RС  n+.StarBats•хўџџ n+.StarBats•6хўџџ n+.StarBats•Qхўџџ n+.StarBats•lхўџџ n+.StarBats•‡хўџџ n+.StarBats•Ђхўџџ n+.StarBats•Нхўџџ n+.StarBats•ихўџџ n+.StarBats•ѓ хўџџ n+.StarBats• хўџџ ZSBX sb Zџ Standard StarBASICSBX ARSBX AR SBX AR2c%bqq€>p‚3 Obj0012ECFC@цЕџо…б‰а€)фАБ†ш0*&4ь@ SfxDocumentInfo Brendan Kidwell 7W1ь:П ЌW10€Brendan Kidwell :W1nTщ Info 0 Info 1 Info 2 Info 3 7W1­:Пr&<44‘Standard LIBIMBEDDED LIBIMBEDDEDЛЛџџЏSWG, A<  #$%&'()*./0123456789:;<=>?@ABCDGHK  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFQRSTUŒ›0 !'@y€€€X%'@š:eX'O@э StarBatsArial Courier NewXX!X1'l@UДd d Bs @d вK Шd №d XXX"X,X6X@XJ' @ŒX'@ЋX'@ЪX1'#@я–ШX+'$@X'(1@H. H. $. XX@'1}@Хrdrddrdddddхўdмdddмdd іd XX!X4XGXZA'2z@Cddrdrd№dxdhdhdxdxdd<ddxdXXX&X2X>XJXV7S;"@…XX8S<4@СXXX"9S=(@љXX('@Q@ZU€€€€XR'D@yXJJ@œX4UА(Gf…ЊЪD„И4бPБ$' '(а.  . p. @ . . р. А. €. P. . №. Р!. $. `'. 0*. -. а/.  2. p5. @8. ;. р=. А@. 6')О†2x г Internet link Internet link@џџ!''ЩBullet SymbolsBullet Symbolsџџ''ЩFootnote SymbolFootnote SymbolџџЩFootnote anchorFootnote anchorџџ%' ЩOLEOLEџџ2A';7S<8S=9S>>џџ ЩGraphicsGraphicsџџ;7S<8S=9S>>џџ ЩFrameFrameџџ1@'2A';7S<8S=9S>>џџ@(' ЩFormulaFormula@џџ1@'<8S>>џџ ЩStandardStandard@џџЩHeadingStandard Text body@џџ''2A'DR' Щ Text bodyStandard Text body@џџ#1'2A'Щ Heading 1Heading Text body@џџ''  Heading 2Heading Text body@џџ' '' Contents HeadingHeadingContents Headingџџ''1@'JJ Щ Heading 10Heading Text bodyџџ'' CaptionStandardCaptionџџ' '2A'JJЩ IllustrationCaption Illustrationџџ ЩTable Contents Text bodyTable ContentsџџJJЩ Table HeadingTable Contents Table Headingџџ ''$+'JJЩ small text Text body small textРџџ'2A'џ‹ЩSenderStandardSenderџџ2A'JJЩPreformatted TextStandardPreformatted Textџџ''2A'0ЩFootnoteStandardFootnote@џџ'1@'JJ Щ Heading 3Heading Text body@џџ''  Marginalia Text body Marginaliaџџ1@'Щ List Indent Text body List Indentџџ('1@'ЩList Text bodyListџџЩList 1ListList 1џџ1@'2A'ЩFooterStandardFooter@џџ('JJЩR˜д`ЎN|ЪSœљ=‰ЦmДђL”зaЪўџр…ŸђљOhЋ‘+'Гй0 h t € Œ ˜ЄАШдрьј38@ю™@€ї‹Нв!С@€/щЖDС@Z­xaС Brendan Kidwellўџ џџџџ@цЕџо…б‰а€)фАБFormula StarMath 5.0†SfxDocumentInfo  7W1Љ— ЌW1+€ SW5HDR.0ЌW1;€!'џџ Frameformatџџ ZeichenformatџџTextformatvorlageStandard Heading Text body  Heading 1  Heading 2 Contents Heading Heading 10Caption  IllustrationTable Contents Table Headingџ‹ small textSender0Preformatted Text Footnote  Heading 3 Marginalia List IndentListList 1Footer Internet linkBullet SymbolsFootnote Symbol Footnote anchor OLE Graphics Frame FormulaџџRoot 33џџ Object1 34џџ GPSDesc 35Standard Table TextDrawingY  .Y $.Y %.Y &.qC н GeneralGeneraldNC#,##0.00#ћџ,љџ##0ћџ.њџ00ћџSystemNC #,##0.00 CCC#ћџ,љџ##0ћџ.њџ00ћџ џџCCCNC$#,##0.--;[RED]($#,##0.--) $џџ#ћџ,љџ##0ћџ.њџ--ћџ($џџ#ћџ,љџ##0ћџ.њџ--ћџ)џџREDNC$ MM/DD/YYYYMM/џџDD/џџYYYY def/SystemNC%MM/DD/YYMM/џџDD/џџYY def/SystemNC&NNNNMMMM DD, YYYYNNNNMMMM  џџDD, џџYYYYSystemNC' MMM D, YYMMM џџD, џџYY def/SystemNC. [HH]:MM:SS.00 [ўџHH ]ўџ:џџMM:џџSS .џџ00ћџNC3MM/DD/YYYY HH:MM:SS MM/џџDD/џџYYYY џџHH :џџMM:џџSS  NCK MMM D, YYYYMMM џџD, џџYYYY def/SystemNCL MMMM D, YYYYMMMM  џџD, џџYYYY def/SystemNCM NN, MMM D, YYNN, џџMMM џџD, џџYY def/SystemNCNNN, MMMM D, YYYYNN, џџMMMM  џџD, џџYYYY def/SystemNCONNNNMMMM D, YYYYNNNNMMMM  џџD, џџYYYY def/SystemNCP D. MMM. YYYYD. џџMMM. џџYYYYDIN 5008 (EN 28601)NCQ D. MMMM YYYYD. џџMMMM  џџYYYYDIN 5008 (EN 28601)NCRMM-DDMM-џџDDDIN 5008 (EN 28601)NCSYY-MM-DDYY-џџMM-џџDDDIN 5008 (EN 28601)NCT YYYY-MM-DDYYYY-џџMM-џџDDDIN 5008 (EN 28601)NCUWWWWNCџџџџŠBXo‡‘Т‹›Џ‘“ЃŸœœ†”˜eP<p5 ##Уџџ2$99 €SРAPа/р=AP d dd AP d dA PAu Prk…ўџџџ FooterSYAPddADPN;T2ўџџSA @A0SAAPа/р=AP d dd AP d dZыєѓ7ъЅђAщщ№ ш№ичЅя€ш"яѓшyю5щэЩщмыTъ‰ъŸъ=щaъшЫщ‹ч7щFцЦшŽфШчфц†у х,ушушс™сЊр§оЅп№мЋо6лћн­й`нšи9нызназ7ньзомЋиЃмњй“м•л,м˜нмпˆмЖрРмЊтђмЙуŒн‚фјнwхvпцОрцГр–ццрчерЄчЧржшgсvщтЈъDуSьф;эћуюафЇяЉц”№щЈё,ыџёšы4ёtыn№“ыЪяtыю2ъœььшыЉчїш§х:ч^ф~хуНфLу_фууф]фSW5HDR.0ЌW1;€C(569a(Build:5169)(SV569)]D!Address Book Fileџaddress!'џџ Frameformatџџ ZeichenformatџџTextformatvorlageStandard Heading Text body  Heading 1  Heading 2 Contents Heading Heading 10Caption  IllustrationTable Contents Table Headingџ‹ small textSender0Preformatted Text Footnote  Heading 3 Marginalia List IndentListList 1Footer Internet linkBullet SymbolsFootnote Symbol Footnote anchor OLE Graphics Frame FormulaџџRoot 33џџ Object1 34џџ GPSDesc 35Standard Table TextDrawingd9C+1џџџџ4 џџџџџџ5*џџjK standard.dicџ soffice.dicџXsun.dicџ@ IgnoreAllListџY  .Y $.Y %.Y &.6FNM1/T3ўџ(Predicting Transit Vehicle Arrival TimesTpўџeBrendan Kidwell GeoGraphics Laboratory Bridgewater State College, Bridgewater, MA, USA 10 August 2001T ўџTўџAbstractTўџThis paper presents a computer algorithm for predicting the arrival times of public fixed-route buses at their stops, based on real-time observations of the vehicles’ geographic positions. The algorithm works by dividing each route into zones, and recording the time it takes to pass through each zone. Predictions are based on the most recent observation of a bus passing through each zone. The output of the algorithm can be displayed publicly to users of the system as the Estimated Time of Arrival of the next bus.Tўџ IntroductionTєўџщBus schedules tell users of a public bus system when buses are supposed to leave terminals and when they might arrive at important stops, but actual departure and arrival times can vary from the scheduled times. Traffic jams, traffic lights, and large numbers of people boarding and alighting a bus all affect the timing of buses running their routes. Besides having access to schedules, users like to be informed of the real situation so they can plan around deviations from the schedule.TKўџ@Some transportation systems in this country have Automatic Vehicle Location (AVL) systems installed. AVL systems relay information about the vehicles (position, speed and heading, etc.) to a central office. From there, computer software can analyze that information and distribute it to dispatchers and/or to the public.TЦўџЛNeedless to say, there is much demand from bus users who want to know how far away the next bus is from their stop. Using data from an AVL system, software can be built to fill this need.TьўџсThe goal of this project was to create an Estimated Time of Arrival (ETA) computer algorithm for fixed-route public transit vehicles. This Bus ETA algorithm can be used to publicly display real-time predictions of wait times.TўџPossible ApproachesT—ўџŒTo gather data for a computer program that will predict the ETA of a bus at a stop, the bus system must have some sort of AVL system installed. An AVL system might have some sort of location sensing electronics installed in the vehicles and a means of relaying data back to an operations center, or it might have electronic tags in the vehicles and sensing equipment in the roads along the route.TkўџKIn a paperџ, Dailey describes how a statistical model can be created to model the motion of buses along their routes. His model assumes that the position data for the buses are expressed in terms of a linear distance from the start of the route. This approach works well with a sign-post-based AVL system, where the electronics in the street sense, perhaps via radio tags on the vehicles, when the vehicles pass a certain point. The computer that receives the AVL data can easily map a sign-post to a definite linear distance by looking up that information in a table of known distances.A0 NTњўџпD. J. Dailey, S. D. Maclean, F. W. Cathey, S. R. Wall. “Transit Vehicle Arrival Prediction: An Algorithm and a Large Scale Implementation.” Transportation Research Board, 80th Annual Meeting, January 2001, Washington, D. C.A8­Џ:eTQўџFSome AVL systems, however, sense their location using Global Positioning System (GPS). GPS units in the vehicles receive a radio signal from GPS satellites in orbit around the Earth and use physics and trigonometry to find their exact three-dimensional position on the surface of the Earth, which is expressed as latitude, longitude, and altitude. Finding the linear distance along a bus route from a bus’ known latitude and longitude is a complicated process that is prone to error, so Dailey’s algorithm would be difficult to implement on bus systems with this type of AVL system.TџўџцOne possible work-around for this problem is to create artificial sign-posts inside the computer software. The software could watch the GPS data and set off a flag when the bus moved close enough to a special point, whose linear distance along the route is known. This would be difficult to implement in the real world because GPS data from the AVL system is available so far apart in time—positions are reported in one- to five-minute intervals—that a sign-post could easily be missed.A8 7ATўџ„For this project, a different kind of algorithm was developed that involves partitioning a route into zones. The algorithm tracks a bus’ entrance into and exit from a zone, and how much time it spent in the zone. The transit time through a zone is stored in a table, and it can later be used to predict how long it will take an individual bus to get from where it is to a particular stop.Tўџ AssumptionsTQўџFThe algorithm presented in this paper makes the following assumptions:TCўџўThere are GPS units in fixed-route buses out on the road, and at regular intervals of at most a couple of minutes, the following information is transmitted to an operations center and relayed to the algorithm in real-time, possibly along with other data:S2APddхўdA @ 302729951џџ3Eб# fKўџџџ"S@APіAP dz dd APLШBfўџџџSA PtK@f-ўџџџS$APЄA P7NTўџBusIDt_@f-ўџџџS$APOA P7N-T$ўџunique ID of this vehicleLbdt#bNTўџDateTimet6bN/T&ўџdate and time of the recordLrdt$bNTўџ RouteNametEbN>T5ўџ*Which route is this bus running right now?L}dt#bNTўџLatitudetQbNJTAўџ6North-South position coordinate on the Earth’s surfaceLedt$bNTўџ Longitudet8bN1T(ўџWest-East position coordinateT˜ўџSThe buses follow simple routes from a starting point, to an ending point, and back.S2APddхўdA @ 303054791џџ3T"ўџHow the Algorithm WorksTИўџ­Each route is divided into a series of zones. (See Illustration 1.) Each zone is arbitrarily drawn to approximate how far a bus will likely travel in about 1Н to 3 minutes.TњўџбTransit times, ti, through each zone in the route are stored in a table in the computer’s memory. Every time a bus passes through a zone, the length of time spent in that zone is used to update the time table.A8 A8:›џT—ўџСA prediction time for a particular bus can be calculated as follows: џ where ttotal is the time left before the bus arrives, t1 through tn are the most recently observed transit times through each zone involved, from the zone the bus is currently in through the zone for which the prediction is being made. The first and last zones are counted 50% because, on average, the bus’ and the target’s geographical position will be half-way through a zone.Aq0Elf:џџ!SWAPЃ IA%PNO Obj0012ECFCAPмўџџA PEA8 MSA8NS:›џA8 }A8~:›џA8 ˆŠA8‰Š:›џT?ўџ4Creating Software to Implement the Bus ETA AlgorithmT~ўџsA combination of Microsoft Visual Basic and Maptitude were used to build a software implantation of the prediction algorithm. Maptitude is an inexpensive Geographic Information Systems application program from Caliper Corporation for Windows computers. While it is usually used interactively by an operator, its functionality can also be incorporated into other software.TэўџтA Visual Basic class module was created called cRouteModel. (See listing “cRouteModel.cls” and related files.) A parent Bus ETA program for the algorithm creates one instance of the RouteModel object for each bus route it tracks. Incoming GPS data from our prototype site, Cape Cod Regional Transit Authority (CCRTA), is sorted by RouteName and then sent to Maptitude to determine which zone the records belong to. Then each record is passed on to its appropriate RouteModel object.TљўџюFollowing the method previously described, each RouteModel object keeps a table of zone times, and when queried, produces a prediction as a sequence of time values. To make a prediction, the RouteModel object takes an imaginary walk from the hypothetical user’s position (where he would like to be picked up) back along the route to each bus that is currently being tracked. How far away each bus is, in time, is noted and passed on to the parent Bus ETA program for presentation to the public.TіўџыThroughout the process, the Bus ETA software takes care to note the direction of the movement of the buses through the zones, and the direction a user would like to travel if he is picked up. Transit times through a zone in one direction are recorded separately from times through the same zone in the opposite direction. This feature helps the Bus ETA software to allow for phenomena, such as rush hour traffic, that cause buses to move faster in one direction along a route than the other.T'ўџUses of the Bus ETA SoftwareTўџPublic web siteT ўџKThe Cape Cod Advanced Travel Planner web site (www.e-transit.org/cape_cod) already shows the Cape Cod bus routes. (See Illustration 2.) and the current positions of all the buses. The software that draws the buses’ positions on the web site’s map can be extended to use this algorithm to publish ETA information on a same web site.A<8 /I!http://www.e-transit.org/cape_codџџџџA8 /IT0ўџ%Wireless phones and palmtop computersT{ўџpWith the growing popularity of so-called “wireless Internet” services, the next logical step for the Bus ETA software is to make its predictions available to users of small wireless Internet devices. Such devices are generally capable of using the Wireless Application Protocol (WAP), and adding WAP capability to an existing old-fashioned web site is relatively easy.TўџElectronic signsT|ўџqIf an electronic sign is capable of being connected to the Internet via radio or telephone, it could be programmed to receive ETA data for its location from the Bus ETA software running on a web server. Such signs could be installed at bus stops and bus terminals where there is heavy traffic, keeping even the most casual users informed of the state of the bus system.T.ўџ#Quality control / quality assuranceT№ўџхDispatchers and administrators of a bus system could use the Bus ETA software to keep an eye on their system. By comparing the ETA data to the printed schedules, they can tell at a glance whether or not buses are running on time.Tўџ ConclusionT0ўџ%The predictions made by this algorithm are more accurate than the published schedules because they are based on where the bus is right now, and how long it took to cross the distance between the user and the bus on the last run of the route. The algorithm has been tested and proven valid by feeding it a few hours’ worth of historical data and then testing its predictions against later data which was not given to the algorithm. A live demonstration of the Bus ETA software is being developed using only the Provincetown Shuttle route on Cape Cod.TўџSome issues still need to be worked on. The communications link between CCRTA Operations and the GeoGrahpics Laboratory, which relays GPS data to the Bus ETA software, goes down often, causing the software to lose track of buses. Because of technical issues at CCRTA Operations, the RouteName field in GPS data coming into the Laboratory doesn’t reliably represent which route the record belongs to; until this is fixed, the Bus ETA program can’t sort all the data to the correct route, and much of it gets discarded.T ўџЕAfter the problems have been addressed, the software will be deployed on all of the Cape Cod routes, and its output will be accessible via the web site (www.e-transit.org/cape_cod).A<8 ™Г!http://www.e-transit.org/cape_codџџџџA8 ™ГT ўџTўџAcknowledgmentsTўџtThis project was made possible by a grant from the Bridgewater Undergraduate Research Opportunities Program (BUROP).TўџThanks to: Dr. Uma Shama, advisor; Mr. Larry Harman; GeoGrahpics Laboratory at BSC; Cape Cod Regional Transit Authority; Dr. Edward Brush and Dr. Andrew Harris, co-directors of the BUROP program; BSC Honors Program; BSC Academic Affairs; Bridgewater Foundation.J›–џџEpson DFX-8000Epson DFX-8000мь і3TNWEpson DFX-8000”@fўx@MSUDEpson DFX-8000„d7 UЯ зШ ЏV88а/Ьx?џџа6а/р=U  $ 2P#€#ТьU  $0?ўџ и‡B$hи‡Bh$ўh$–…и‡Bf$lh$†и‡Bв $žh$6‡и‡Bp $ h$Ђи‡Bz$žh$6Žи‡B$„h$“и‡Bœ"$ўh$–—и‡Bš)$ђh$Š ™Ц,‡U !6$$F#и‡@$а/ќ>а/р=U  $ 2p#€#ТЃU  $q-?ўџи‡B$ œиЧB$žh$6 и‡BЎ$„h$ ЂиЧB2$ h$Ђ @ЈиЧB<$ h$ЂЎи‡BF#$ h$ЂДУ@‡U 3$|$”?ўџЮ%QЧ|$”?ўџ и‡P$”Ц,‡U !6$$F#и‡@$аФј}а/р=U  $ 2P#€#ТxU  $0?ўџ и‡B$–Ии‡B–$žh$6Йи‡B4$lh$Ки‡B  $xh$НдN‡$кU hіr?"ђp‡U hіJ?џџу-ЄJU776м?џџи‡FU776му/EЄRJU77фм?џџи‡FU77фмђp‡U ВіJ?џџу-ЄJU776м?џџи‡FU776му/EЄRJU77фм?џџи‡FU77фмђp‡U ќіJ?џџу-ЄJU776м?џџи‡FU776му/EЄRJU77фм?џџи‡FU77фмђp‡U FіJ?џџу-ЄJU776м?џџи‡FU776му/EЄRJU77фм?џџи‡FU77фмђp‡U іJ?џџу-ЄJU776м?џџи‡FU776му/EЄRJU77фм?џџи‡FU77фмиЧBђ$lh$4ОиЧB^$žh$65Пи‡Bќ$ђh$Š6РAиЧBю $xh$7РDиU/‡Bf&$хh$}8РHЩ8ŸeJЦЏЃ I?!мўџџJъАЧ ‡Ѓ IЦ,‡U !6$$F#и‡@$аљ%єМа/р=U  $ 2p#€#ТЌU  $0?ўџиСЧB$Š8РJиЧBŠ$žh$69РKи‡B($„h$:РPиЧBЌ $ h$Ђ;РVиЧBЖ$ h$Ђ<Р\и‡BР!$„h$=РaЦ,‡U !6$$F#и‡@$аx%№ћа/р=U  $ 2P#€#Т+U  $0?ўџ иЧB$6>Рbи‡B6$ў№$?Рcи‡B4$ўh$–@РgиЧB2 $vh$AРhи‡BЈ $ўh$–BРlиЧBІ$vh$CРmи‡B$ўh$–DРqиЧB$vh$EРrи‡B$xh$FРuиЧB%$žh$6GРvи‡BІ'$„h$HР{Ц,‡U !6$$F#и‡@$а%ь:а/р=U  $ 2p#€#ТЦU  $0?ўџиСЧB$HхР|и‡B$ h$ЂIР‚и‡B $ђh$ŠJР„иЧB$lh$KР…иЧBl$žh$6LР†иЧB $ђh$ŠMРˆи‡Bќ$xh$NР‹Ц,‡U !6$$F#и‡@$ZЖ_ є !.Я!<Ў"Š#КJ$?д$Œ6%Ѓ%У%уѕ$уџ#сч" ж!wЮ 1ч) !cм!Й"+Ї#qg$–Ц$lД$L$›Ž#“"Вž!ŠЁ Œ‡ВdqХг]4Ќ^ЬqЛ„pаwЩ'œСЋ‚ Ј}-јёЬ/‰ёOм-Ащoƒучt­x œ'ьl ` - KŠ М>ЈaэйPmŸє ІоУѕ%Ё-ƒ­ЊњР.ы]Ш4{Иe;>п.ИD­ r– жƒ ˜Љ ’% “№ œэ Ћ: Юя #Ф Žt Шж Ўх tЪ \š †O цъ Mk Ќл = „” ј ~е;зіпxСЖqАщVЗЬћ‹H:ЋУџ uKє Info 0 Info 1 Info 2 Info 3 7W1Љ—‘'<ўџр…ŸђљOhЋ‘+'Гй0ј h t € Œ ˜ЄАМШдрь2@жЗ@ ‡!@ўџџџƒ„…†‡ўџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџџ€/щЖDС@€\ƒі…С 0304TCt_total = t_1 over 2 + t_2 + t_3 + dotsaxis + t_{n-1} + t_n over 2F ddd<dd<Times New RomanTimes New RomanTimes New RomanTimes New RomanTimes New Roman HelveticaCourier  2SunknownRoot Entryџџџџџџџџбљ ТЎ…бЊД`—кV"Obj0012ECFC@цЕџо…б‰а€)фАБўџџџCompObjџџџџ<Ole џџџџџџџџџџџџStarBASICџџџџўџџџSfxWindowsџџџџџџџџCSwNumRulesџџџџџџџџџџџџ:Standardџџџџџџџџџџџџjpersist elements" џџџџXSfxDocumentInfo  џџџџџџџџuBasicManager2џџџџ џџџџ'4SfxStyleSheetsџџџџџџџџџџџџ(GSummaryInformation( џџџџџџџџf4SwPageStyleSheets$џџџџџџџџ§StarWriterDocument&џџџџџџџџџџџџ=@CompObjџџџџk=Ole џџџџџџџџџџџџlpersist elements"џџџџmSfxDocumentInfo џџџџџџџџnuSfxWindowsџџџџџџџџџџџџ|SummaryInformation(џџџџџџџџ}(StarMathDocument"џџџџџџџџџџџџ‚qџџџџџџџџџџџџўџџџџџџџџџџџџџџџўџџџ