---

%PDF-1.4 %���� 5 0 obj << /S /GoTo /D (chapter*.1) >> endobj 8 0 obj (Acknowledgments) endobj 9 0 obj << /S /GoTo /D (chapter*.2) >> endobj 12 0 obj (Thesis Statement) endobj 13 0 obj << /S /GoTo /D (chapter*.3) >> endobj 16 0 obj (Abstract) endobj 17 0 obj << /S /GoTo /D (section*.4) >> endobj 20 0 obj (Contents) endobj 21 0 obj << /S /GoTo /D (section*.5) >> endobj 24 0 obj (List of Figures) endobj 25 0 obj << /S /GoTo /D (chapter*.6) >> endobj 28 0 obj (Outline of Contributions) endobj 29 0 obj << /S /GoTo /D (chapter.1) >> endobj 32 0 obj (Motivation and Scope) endobj 33 0 obj << /S /GoTo /D (section.1.1) >> endobj 36 0 obj (Verification problems) endobj 37 0 obj << /S /GoTo /D (section.1.2) >> endobj 40 0 obj (Explicit-state vs. alternatives) endobj 41 0 obj << /S /GoTo /D (section.1.3) >> endobj 44 0 obj (State enumeration) endobj 45 0 obj << /S /GoTo /D (section.1.4) >> endobj 48 0 obj (Out-of-core storage and caching) endobj 49 0 obj << /S /GoTo /D (section.1.5) >> endobj 52 0 obj (Heuristic storage) endobj 53 0 obj << /S /GoTo /D (section.1.6) >> endobj 56 0 obj (Non-heuristic, potentially over-approximate storage) endobj 57 0 obj << /S /GoTo /D (section.1.7) >> endobj 60 0 obj (Hash functions) endobj 61 0 obj << /S /GoTo /D (chapter.2) >> endobj 64 0 obj (Overview of Dissertation) endobj 65 0 obj << /S /GoTo /D (section.2.1) >> endobj 68 0 obj (Understanding the problem) endobj 69 0 obj << /S /GoTo /D (section.2.2) >> endobj 72 0 obj (Bloom filters \(bitstate hashing\)) endobj 73 0 obj << /S /GoTo /D (subsection.2.2.1) >> endobj 76 0 obj (Optimization) endobj 77 0 obj << /S /GoTo /D (subsection.2.2.2) >> endobj 80 0 obj (Speed) endobj 81 0 obj << /S /GoTo /D (subsection.2.2.3) >> endobj 84 0 obj (k= 3 usefulness) endobj 85 0 obj << /S /GoTo /D (subsection.2.2.4) >> endobj 88 0 obj (Usefulness of other configurations) endobj 89 0 obj << /S /GoTo /D (section.2.3) >> endobj 92 0 obj (Compacted hash tables \(hash compaction\)) endobj 93 0 obj << /S /GoTo /D (section.2.4) >> endobj 96 0 obj (Adaptive Cleary tables) endobj 97 0 obj << /S /GoTo /D (subsection.2.4.1) >> endobj 100 0 obj (Exact reduction) endobj 101 0 obj << /S /GoTo /D (subsection.2.4.2) >> endobj 104 0 obj (Cleary tables) endobj 105 0 obj << /S /GoTo /D (subsection.2.4.3) >> endobj 108 0 obj (Adaptation) endobj 109 0 obj << /S /GoTo /D (subsection.2.4.4) >> endobj 112 0 obj (Designs) endobj 113 0 obj << /S /GoTo /D (subsection.2.4.5) >> endobj 116 0 obj (Active state matching) endobj 117 0 obj << /S /GoTo /D (chapter.3) >> endobj 120 0 obj (The State Storage Problem) endobj 121 0 obj << /S /GoTo /D (section.3.1) >> endobj 124 0 obj (Definition) endobj 125 0 obj << /S /GoTo /D (section.3.2) >> endobj 128 0 obj (Usage patterns) endobj 129 0 obj << /S /GoTo /D (section.3.3) >> endobj 132 0 obj (Single case performance dimensions) endobj 133 0 obj << /S /GoTo /D (section.3.4) >> endobj 136 0 obj (Single configuration performance) endobj 137 0 obj << /S /GoTo /D (section.3.5) >> endobj 140 0 obj (Data structure performance) endobj 141 0 obj << /S /GoTo /D (section.3.6) >> endobj 144 0 obj (Accuracy details) endobj 145 0 obj << /S /GoTo /D (subsection.3.6.1) >> endobj 148 0 obj (False positive rate) endobj 149 0 obj << /S /GoTo /D (subsection.3.6.2) >> endobj 152 0 obj (Omissions) endobj 153 0 obj << /S /GoTo /D (subsection.3.6.3) >> endobj 156 0 obj (The Transitive Omission Problem) endobj 157 0 obj << /S /GoTo /D (subsection.3.6.4) >> endobj 160 0 obj (Error omission bound) endobj 161 0 obj << /S /GoTo /D (subsection.3.6.5) >> endobj 164 0 obj (Accuracy optimization criteria) endobj 165 0 obj << /S /GoTo /D (subsection.3.6.6) >> endobj 168 0 obj (More definitions and analysis) endobj 169 0 obj << /S /GoTo /D (chapter.4) >> endobj 172 0 obj (Lower Bounds for State Storage) endobj 173 0 obj << /S /GoTo /D (section.4.1) >> endobj 176 0 obj (Most cases) endobj 177 0 obj << /S /GoTo /D (section.4.2) >> endobj 180 0 obj (Various magnitudes) endobj 181 0 obj << /S /GoTo /D (section.4.3) >> endobj 184 0 obj (Simpler bounds) endobj 185 0 obj << /S /GoTo /D (section.4.4) >> endobj 188 0 obj (``Asymptotically compact'' litmus test) endobj 189 0 obj << /S /GoTo /D (section.4.5) >> endobj 192 0 obj (Exact representation, infinite universe) endobj 193 0 obj << /S /GoTo /D (chapter.5) >> endobj 196 0 obj (Classical Solutions) endobj 197 0 obj << /S /GoTo /D (section.5.1) >> endobj 200 0 obj (Open-addressed table) endobj 201 0 obj << /S /GoTo /D (section.5.2) >> endobj 204 0 obj (Bit table) endobj 205 0 obj << /S /GoTo /D (section.5.3) >> endobj 208 0 obj (Compacted chaining) endobj 209 0 obj << /S /GoTo /D (subsection.5.3.1) >> endobj 212 0 obj (Description) endobj 213 0 obj << /S /GoTo /D (subsection.5.3.2) >> endobj 216 0 obj (Analysis) endobj 217 0 obj << /S /GoTo /D (subsection.5.3.3) >> endobj 220 0 obj (A clever design: 2/3rds chaining) endobj 221 0 obj << /S /GoTo /D (section.5.4) >> endobj 224 0 obj (Summary) endobj 225 0 obj << /S /GoTo /D (chapter.6) >> endobj 228 0 obj (Bloom filters \(Bitstate hashing\)) endobj 229 0 obj << /S /GoTo /D (section.6.1) >> endobj 232 0 obj (Introduction) endobj 233 0 obj << /S /GoTo /D (section.6.2) >> endobj 236 0 obj (Accuracy analysis) endobj 237 0 obj << /S /GoTo /D (section.6.3) >> endobj 240 0 obj (Optimization) endobj 241 0 obj << /S /GoTo /D (subsection.6.3.1) >> endobj 244 0 obj (False positive rate, known v and m) endobj 245 0 obj << /S /GoTo /D (subsection.6.3.2) >> endobj 248 0 obj (Expected hash omissions, known v and m) endobj 249 0 obj << /S /GoTo /D (subsection.6.3.3) >> endobj 252 0 obj (Unknown v) endobj 253 0 obj << /S /GoTo /D (section.6.4) >> endobj 256 0 obj (Speed and fingerprinting) endobj 257 0 obj << /S /GoTo /D (subsection.6.4.1) >> endobj 260 0 obj (History) endobj 261 0 obj << /S /GoTo /D (subsection.6.4.2) >> endobj 264 0 obj (Fingerprinting Bloom filter) endobj 265 0 obj << /S /GoTo /D (subsection.6.4.3) >> endobj 268 0 obj (Hash-extending Bloom filter) endobj 269 0 obj << /S /GoTo /D (subsection.6.4.4) >> endobj 272 0 obj (Hash-reusing Bloom filter) endobj 273 0 obj << /S /GoTo /D (subsection.6.4.5) >> endobj 276 0 obj (Empirical validation) endobj 277 0 obj << /S /GoTo /D (section.6.5) >> endobj 280 0 obj (Fast index computation) endobj 281 0 obj << /S /GoTo /D (subsection.6.5.1) >> endobj 284 0 obj (Double hashing) endobj 285 0 obj << /S /GoTo /D (subsection.6.5.2) >> endobj 288 0 obj (Triple hashing) endobj 289 0 obj << /S /GoTo /D (subsection.6.5.3) >> endobj 292 0 obj (Improved double hashing) endobj 293 0 obj << /S /GoTo /D (subsection.6.5.4) >> endobj 296 0 obj (Enhanced double hashing) endobj 297 0 obj << /S /GoTo /D (subsection.6.5.5) >> endobj 300 0 obj (Related work: exponential double hashing) endobj 301 0 obj << /S /GoTo /D (subsection.6.5.6) >> endobj 304 0 obj (Empirical validation) endobj 305 0 obj << /S /GoTo /D (subsection.6.5.7) >> endobj 308 0 obj (In practice and future work) endobj 309 0 obj << /S /GoTo /D (section.6.6) >> endobj 312 0 obj (Summary) endobj 313 0 obj << /S /GoTo /D (chapter.7) >> endobj 316 0 obj (Compacted tables \(Hash compaction\)) endobj 317 0 obj << /S /GoTo /D (section.7.1) >> endobj 320 0 obj (Description) endobj 321 0 obj << /S /GoTo /D (subsection.7.1.1) >> endobj 324 0 obj (Basics) endobj 325 0 obj << /S /GoTo /D (subsection.7.1.2) >> endobj 328 0 obj (Collision resolution) endobj 329 0 obj << /S /GoTo /D (subsection.7.1.3) >> endobj 332 0 obj (Ordered hashing) endobj 333 0 obj << /S /GoTo /D (subsection.7.1.4) >> endobj 336 0 obj (Implementation notes) endobj 337 0 obj << /S /GoTo /D (subsection.7.1.5) >> endobj 340 0 obj (Maximum occupancy and configuration) endobj 341 0 obj << /S /GoTo /D (section.7.2) >> endobj 344 0 obj (Accuracy analysis and validation) endobj 345 0 obj << /S /GoTo /D (subsection.7.2.1) >> endobj 348 0 obj (By collisions) endobj 349 0 obj << /S /GoTo /D (subsection.7.2.2) >> endobj 352 0 obj (Unordered) endobj 353 0 obj << /S /GoTo /D (subsection.7.2.3) >> endobj 356 0 obj (Ordered, false positive rate) endobj 357 0 obj << /S /GoTo /D (subsection.7.2.4) >> endobj 360 0 obj (Ordered, collisions) endobj 361 0 obj << /S /GoTo /D (subsection.7.2.5) >> endobj 364 0 obj (Asymptotics) endobj 365 0 obj << /S /GoTo /D (subsection.7.2.6) >> endobj 368 0 obj (Negative result: reordered hashing) endobj 369 0 obj << /S /GoTo /D (section.7.3) >> endobj 372 0 obj (Summary) endobj 373 0 obj << /S /GoTo /D (chapter.8) >> endobj 376 0 obj (Inexact Storage Using Exact Storage) endobj 377 0 obj << /S /GoTo /D (section.8.1) >> endobj 380 0 obj (Introduction) endobj 381 0 obj << /S /GoTo /D (section.8.2) >> endobj 384 0 obj (``Balls and bins'' partitioning) endobj 385 0 obj << /S /GoTo /D (section.8.3) >> endobj 388 0 obj (``Even'' partitioning) endobj 389 0 obj << /S /GoTo /D (section.8.4) >> endobj 392 0 obj (Comparison) endobj 393 0 obj << /S /GoTo /D (section.8.5) >> endobj 396 0 obj (Summary) endobj 397 0 obj << /S /GoTo /D (chapter.9) >> endobj 400 0 obj (Cleary tables) endobj 401 0 obj << /S /GoTo /D (section.9.1) >> endobj 404 0 obj (Description) endobj 405 0 obj << /S /GoTo /D (subsection.9.1.1) >> endobj 408 0 obj (Representation) endobj 409 0 obj << /S /GoTo /D (subsection.9.1.2) >> endobj 412 0 obj (Random access) endobj 413 0 obj << /S /GoTo /D (subsection.9.1.3) >> endobj 416 0 obj (An optimization) endobj 417 0 obj << /S /GoTo /D (section.9.2) >> endobj 420 0 obj (add algorithm) endobj 421 0 obj << /S /GoTo /D (section.9.3) >> endobj 424 0 obj (Analysis) endobj 425 0 obj << /S /GoTo /D (section.9.4) >> endobj 428 0 obj (Validation) endobj 429 0 obj << /S /GoTo /D (subsection.9.4.1) >> endobj 432 0 obj (Speed) endobj 433 0 obj << /S /GoTo /D (subsection.9.4.2) >> endobj 436 0 obj (Compactness) endobj 437 0 obj << /S /GoTo /D (section.9.5) >> endobj 440 0 obj (Variations) endobj 441 0 obj << /S /GoTo /D (subsection.9.5.1) >> endobj 444 0 obj (Mini-pointers \(sometimes useful\)) endobj 445 0 obj << /S /GoTo /D (subsection.9.5.2) >> endobj 448 0 obj (Non-power-of-two number of cells \(sometimes useful\)) endobj 449 0 obj << /S /GoTo /D (subsection.9.5.3) >> endobj 452 0 obj (Different number of cells and home addresses \(sometimes useful\)) endobj 453 0 obj << /S /GoTo /D (subsection.9.5.4) >> endobj 456 0 obj (Edge extension or edge wrapping \(marginal benefit\)) endobj 457 0 obj << /S /GoTo /D (subsection.9.5.5) >> endobj 460 0 obj (Correcting directional favor \(marginal benefit\)) endobj 461 0 obj << /S /GoTo /D (subsection.9.5.6) >> endobj 464 0 obj (Unidirectional \(not recommended\)) endobj 465 0 obj << /S /GoTo /D (subsection.9.5.7) >> endobj 468 0 obj (Summary of Variations) endobj 469 0 obj << /S /GoTo /D (section.9.6) >> endobj 472 0 obj (Summary) endobj 473 0 obj << /S /GoTo /D (chapter.10) >> endobj 476 0 obj (Dynamic adaptation of Cleary tables) endobj 477 0 obj << /S /GoTo /D (section.10.1) >> endobj 480 0 obj (Understanding fast adaptation) endobj 481 0 obj << /S /GoTo /D (section.10.2) >> endobj 484 0 obj (Closer-first traversal) endobj 485 0 obj << /S /GoTo /D (subsection.10.2.1) >> endobj 488 0 obj (Description) endobj 489 0 obj << /S /GoTo /D (subsection.10.2.2) >> endobj 492 0 obj (Algorithm) endobj 493 0 obj << /S /GoTo /D (section.10.3) >> endobj 496 0 obj (1-to-2 adaptation) endobj 497 0 obj << /S /GoTo /D (section.10.4) >> endobj 500 0 obj (2-to-3 and 3-to-4 adaptation) endobj 501 0 obj << /S /GoTo /D (subsection.10.4.1) >> endobj 504 0 obj (3-in-4 design) endobj 505 0 obj << /S /GoTo /D (subsection.10.4.2) >> endobj 508 0 obj (Algorithm changes for 3-in-4 add) endobj 509 0 obj << /S /GoTo /D (subsection.10.4.3) >> endobj 512 0 obj (Algorithm changes for 2-to-3 and 3-to-4 adaptation) endobj 513 0 obj << /S /GoTo /D (section.10.5) >> endobj 516 0 obj (Post-adaptation access times) endobj 517 0 obj << /S /GoTo /D (section.10.6) >> endobj 520 0 obj (Adaptation to Bloom filter) endobj 521 0 obj << /S /GoTo /D (subsection.10.6.1) >> endobj 524 0 obj (k= 1) endobj 525 0 obj << /S /GoTo /D (subsection.10.6.2) >> endobj 528 0 obj (Hash-reusing k= 2) endobj 529 0 obj << /S /GoTo /D (section.10.7) >> endobj 532 0 obj (Summary) endobj 533 0 obj << /S /GoTo /D (chapter.11) >> endobj 536 0 obj (Adaptive storage scheme) endobj 537 0 obj << /S /GoTo /D (section.11.1) >> endobj 540 0 obj (Near optimal accuracy by design) endobj 541 0 obj << /S /GoTo /D (subsection.11.1.1) >> endobj 544 0 obj (Utility of the theorem) endobj 545 0 obj << /S /GoTo /D (subsection.11.1.2) >> endobj 548 0 obj (Design) endobj 549 0 obj << /S /GoTo /D (subsection.11.1.3) >> endobj 552 0 obj (Exact storage case) endobj 553 0 obj << /S /GoTo /D (subsection.11.1.4) >> endobj 556 0 obj (Inexact storage case) endobj 557 0 obj << /S /GoTo /D (subsection.11.1.5) >> endobj 560 0 obj (Final notes on the theoretical bound) endobj 561 0 obj << /S /GoTo /D (section.11.2) >> endobj 564 0 obj (Near optimal speed and accuracy in practice) endobj 565 0 obj << /S /GoTo /D (subsection.11.2.1) >> endobj 568 0 obj (Practical problems with full design) endobj 569 0 obj << /S /GoTo /D (subsection.11.2.2) >> endobj 572 0 obj (Practical implementation) endobj 573 0 obj << /S /GoTo /D (subsection.11.2.3) >> endobj 576 0 obj (Active state matching) endobj 577 0 obj << /S /GoTo /D (subsection.11.2.4) >> endobj 580 0 obj (Practical speed) endobj 581 0 obj << /S /GoTo /D (subsection.11.2.5) >> endobj 584 0 obj (Practical accuracy) endobj 585 0 obj << /S /GoTo /D (section.11.3) >> endobj 588 0 obj (Parallel model checking, etc.) endobj 589 0 obj << /S /GoTo /D (subsection.11.3.1) >> endobj 592 0 obj (Message-passing parallel) endobj 593 0 obj << /S /GoTo /D (subsection.11.3.2) >> endobj 596 0 obj (Shared memory parallel) endobj 597 0 obj << /S /GoTo /D (subsection.11.3.3) >> endobj 600 0 obj (Independent parallel) endobj 601 0 obj << /S /GoTo /D (subsection.11.3.4) >> endobj 604 0 obj (Summary) endobj 605 0 obj << /S /GoTo /D (chapter.12) >> endobj 608 0 obj (Other Related Work) endobj 609 0 obj << /S /GoTo /D (section.12.1) >> endobj 612 0 obj (Golomb-compressed sequence) endobj 613 0 obj << /S /GoTo /D (section.12.2) >> endobj 616 0 obj (Cuckoo hashing) endobj 617 0 obj << /S /GoTo /D (section.12.3) >> endobj 620 0 obj (Multilevel hashing) endobj 621 0 obj << /S /GoTo /D (section.12.4) >> endobj 624 0 obj (Summary) endobj 625 0 obj << /S /GoTo /D (section*.8) >> endobj 628 0 obj (Bibliography) endobj 629 0 obj << /S /GoTo /D [630 0 R /Fit ] >> endobj 632 0 obj << /Length 430 /Filter /FlateDecode >> stream xڍS�n� ��Sp�J5�>&�&j�V��=�={�F��\5o_\�Mv��zF3���u��� ���z�y��%fTp�? *kLx�$����[�-�j��/�欬��ir��TX���:������+�DEq-[���%a(�8. �2%�V{.�j;������M�ǧ��I\�uČ�K��[!3�����F��.�/"�aQ��HP���Я~o�e��f6�)���Ωv~Χ�5#ʋ �E�rF��u"x5���@��;;L�?Cj\C�8�^���hHt�czB���*�2�q��wB�1C� W~������)��zZ�<+_D�Z�����6�8{�ﵱ�N�k�K,��n�X���������u^��(������v|��?+�U��B4u�����,�9��2(�� �%>�7A�� endstream endobj 630 0 obj << /Type /Page /Contents 632 0 R /Resources 631 0 R /MediaBox [0 0 612 792] /Parent 636 0 R >> endobj 633 0 obj << /D [630 0 R /XYZ 114.839 720 null] >> endobj 634 0 obj << /D [630 0 R /XYZ 114.839 710.037 null] >> endobj 631 0 obj << /Font << /F20 635 0 R >> /ProcSet [ /PDF /Text ] >> endobj 639 0 obj << /Length 19 /Filter /FlateDecode >> stream x�3PHW0Pp�2�Ac(� endstream endobj 638 0 obj << /Type /Page /Contents 639 0 R /Resources 637 0 R /MediaBox [0 0 612 792] /Parent 636 0 R >> endobj 640 0 obj << /D [638 0 R /XYZ 101.888 720 null] >> endobj 637 0 obj << /ProcSet [ /PDF ] >> endobj 643 0 obj << /Length 1567 /Filter /FlateDecode >> stream x�uWɒ�6��+tU5R���x�c{\I��([�9`HHD��Y��(il�������l?�g�^��Y_o_��6�gi�,�4�mw�4-��f=+b���l[���u�V��N�>���~�sI�,�<�s�$Y-7��lQ$�<)���|��7Q�,ζg�����;YeL��e���Q�Z(�u�t'�xU�c�{c��&0��Y��'e�D�g�zYf�l�&�𫮫U�pԕ
μ���R�� �ϓ$��*�����m�xD3# A9�&������s�ZB<+D@F}�${ ��
i+��g���`!4y%M�?Ѱp� =K�>��Rm�$��i]�W�,����2&.�k iq4���%0o�H���.��}��Jy=��S�λ�|������ �D �'�YRp��H�7����C��1�x���3�Сj�}U��x���1T.�K����𲭍��~�oѕ{4�fM6���j���l&�
��W��.T�,s~�P�=$��Vr}S�p7V�o{��1��n �^� jGL5��@u�b��sh�� J/�Uy>���0M'�T�a�b1��l4�_L�L���DIp�d��QRi'@#��Jp�L��=B ���m��yl���tA�oz�T��=�3����>�4�dI�ؐ��ƫ��!d�7i�3܁���Ơ��h�*�Iވ�A�1C�ƴrj<�ƞ��,./��F0Y ��=k�(��*"��""��[�����_j�oZ��'���MM�)��GϪ�/ƺB����,RƂ�:�2� {X`���v/�Y1yS��x����ȓ�o4������S0���0<���i�AS���޵�����KN%���k�G웓�7�a��(�ױ|Ɓ7�:0��9��2�#��?�G#��!�A�fw����1yс�5�5�sB-�,�"zT�w�VR�d���4���_X�N�� �� � ��/����1m���������H�� H��d� -fk���B����>���Zy�̫u��D��;1�v �m臚��hw���R����e(�r"РUڊ���PkE%��c4Pf�J\~�2�i�8}q��Ȉ�%@��Cۿ�Pe1��i��L�m�Ϣ���
'e���w9K�|�ÿ��)7Q޼��i�����w endstream endobj 642 0 obj << /Type /Page /Contents 643 0 R /Resources 641 0 R /MediaBox [0 0 612 792] /Parent 636 0 R >> endobj 6 0 obj << /D [642 0 R /XYZ 114.839 710.037 null] >> endobj 641 0 obj << /Font << /F20 635 0 R >> /ProcSet [ /PDF /Text ] >> endobj 647 0 obj << /Length 1979 /Filter /FlateDecode >> stream x�uXIw�8��Whn�{�M�tt;���N&���Lw 1" 5HZ����UH��P�� UE��,�]���p��S��8�,����q�Z\�VI�i6{��~����p��S���L�(L�1���绯�~��������=I�}|8��,�w�7�:�gE}���l��;mֳsֳ,��lIr����g��Ս�8\�׳|��u"�|P�6�E�%�gm��Mp��kK�I��4�I�j��{��S��������y�M(�W�z����nL-�J��~G�C�E�y��nU��i��f_v�L�%�|2;A2m����G��TZ�X�j��k��=w�Qw�u�Vm�]���~�K��:g���.�����UcF뿓��Vb�g���m�=�N����Ѡ=�?����W�+SU�y�Y����~�r��=� ���M������M@�̳7�f�
����C�u\����N�*sЂdO�!��*m�+Q Y]���I�Ŕb���<��<�vB����I�)lU��u���Bt�—m��a�"͢�������K�x�k��՜ůO*M;��w��Z0��
�6֣r�)�J9�^�>���w�� Z��M���~܎��J�����B�Z:{� 5.iOʧQ.V��*xҝ`��P�Cg�G�;�)���닮w����i�>#'j�ʆ�����cOO�S��3]YS��*�JY�-���V�\�ִ��7j�u�. ���q��gQE�ӑT=.�c_1�Ǎ٪Ŕ6'����pT#� &��i���1XK��9����5Ӷ�u��w��j���qSΡ��]{$�D^�}�dQ̻gQ��xAQ�����ժ�P=/F�������TK�����MX� ި��q�V��8c3�0WJl$ْ�t�f������^�1Zɒp� y_�)M-8$��ic��Ht�`�ɘ�:m�)�f�֎���<�B��

---