LEADER 02910nam 2200649Ia 450 001 9910462088703321 005 20200520144314.0 010 $a9786613926241 010 $a1-283-61379-4 010 $a0-7425-6347-2 035 $a(CKB)2670000000275120 035 $a(EBL)1124489 035 $a(OCoLC)853360275 035 $a(SSID)ssj0000720652 035 $a(PQKBManifestationID)12308673 035 $a(PQKBTitleCode)TC0000720652 035 $a(PQKBWorkID)10668682 035 $a(PQKB)10801418 035 $a(SSID)ssj0000791219 035 $a(PQKBManifestationID)12317595 035 $a(PQKBTitleCode)TC0000791219 035 $a(PQKBWorkID)10757872 035 $a(PQKB)11526720 035 $a(MiAaPQ)EBC1124489 035 $a(Au-PeEL)EBL1124489 035 $a(CaPaEBR)ebr10606757 035 $a(CaONFJC)MIL392624 035 $a(EXLCZ)992670000000275120 100 $a20080423d2009 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 00$aFrom an antique land$b[electronic resource] $ean introduction to ancient Near Eastern literature /$fedited by Carl S. Ehrlich 210 $aLanham, MD $cRowman & Littlefield Publishers$dc2009 215 $a1 online resource (523 p.) 300 $aDescription based upon print version of record. 311 $a0-7425-4335-8 311 $a0-7425-4334-X 320 $aIncludes bibliographical references (p. 445-492) and index. 327 $aCover; Title Page; Copyright Page; Dedication Page; Table of Contents; List of Abbreviations; Preface; Chapter 1: Introduction; Chapter 2: Sumerian Literature; Chapter 3: Egyptian Literature; Chapter 4: Akkadian Literature; Chapter 5: Hittite Literature; Chapter 6: Canaanite Literature; Chapter 7: Hebrew/Israelite Literature; Chapter 8: Aramaic Literature; Bibliography; Index; About the Editor and Contributors 330 $aFrom an Antique Land introduces the various cultures and literatures of the Ancient Near East, including literature originally written in Egyptian, Sumerian, Akkadian, Hittite, Ugaritic, Canaanite, Hebrew, and Aramaic. The timeframe extends from the invention of writing through the conquest of Alexander the Great. Each chapter includes an overview of the culture, a discussion of literary genres, and descriptions and short analyses of the major literary works. 606 $aMiddle Eastern literature$xHistory and criticism 606 $aOriental literature$xHistory and criticism 608 $aElectronic books. 615 0$aMiddle Eastern literature$xHistory and criticism. 615 0$aOriental literature$xHistory and criticism. 676 $a809.56 701 $aEhrlich$b Carl S$0909388 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910462088703321 996 $aFrom an antique land$92034468 997 $aUNINA LEADER 02560oam 2200445zu 450 001 9910872685503321 005 20241212215246.0 024 7 $a10.1109/ISPAN.2004 035 $a(CKB)1000000000021815 035 $a(SSID)ssj0000558648 035 $a(PQKBManifestationID)12250545 035 $a(PQKBTitleCode)TC0000558648 035 $a(PQKBWorkID)10565644 035 $a(PQKB)10674897 035 $a(NjHacI)991000000000021815 035 $a(EXLCZ)991000000000021815 100 $a20160829d2004 uy 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aParallel Architectures, Algorithms and Networks (I-SPAN 2004): Proceedings, 7th International Symposium, Hong Kong, 2004 210 31$a[Place of publication not identified]$cIEEE Computer Society Press$d2004 215 $a1 online resource (xvi, 645 pages) $cillustrations 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9780769521350 311 08$a0769521355 330 $aMobile servers are established to provide services for mobile nodes in an anticipated area. If the distribution of mobile nodes can be foreseen, the location of mobile servers becomes critical to the QoS of wireless systems. Under resource and topology constraints, it is very difficult to figure out a solution, or unable to cover all given mobile nodes within limited number of mobile servers. In this paper, we study the issue of the partial covering problem such that part of mobile nodes to be covered. Several approximation algorithms are proposed to cover the maximum number of elements. For real time systems, such as the battle-field communication system, the proposed algorithms with polynomial-time complexity can be efficiently applied. The algorithm complexity analysis illustrates the improvement made by our algorithms. The experimental results show that the performance of our algorithms is much better than other existing 3-approximation algorithm for the robust k-center problem. 606 $aComputer algorithms$vCongresses 606 $aParallel processing (Electronic computers)$vCongresses 615 0$aComputer algorithms 615 0$aParallel processing (Electronic computers) 676 $a005.1 700 $aHsu$b D. Frank$g(Derbiau Frank),$f1948-$058933 801 0$bPQKB 906 $aPROCEEDING 912 $a9910872685503321 996 $aParallel Architectures, Algorithms and Networks (I-SPAN 2004): Proceedings, 7th International Symposium, Hong Kong, 2004$92378638 997 $aUNINA