LEADER 07370nam 22008175 450 001 996465662203316 005 20200703055714.0 010 $a1-280-38791-2 010 $a9786613565839 010 $a3-642-14355-5 024 7 $a10.1007/978-3-642-14355-7 035 $a(CKB)2670000000028913 035 $a(SSID)ssj0000446285 035 $a(PQKBManifestationID)11282002 035 $a(PQKBTitleCode)TC0000446285 035 $a(PQKBWorkID)10496192 035 $a(PQKB)11482485 035 $a(DE-He213)978-3-642-14355-7 035 $a(MiAaPQ)EBC3065439 035 $a(PPN)149064438 035 $a(EXLCZ)992670000000028913 100 $a20100626d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic Aspects in Information and Management$b[electronic resource] $e6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings /$fedited by Bo Chen 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XI, 336 p. 51 illus.) 225 1 $aInformation Systems and Applications, incl. Internet/Web, and HCI ;$v6124 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-14354-7 320 $aIncludes bibliographical references and index. 327 $aComparison of Two Algorithms for Computing Page Importance -- The Invisible Hand for Risk Averse Investment in Electricity Generation -- Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data -- The (K,k)-Capacitated Spanning Tree Problem -- Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier -- Synthetic Road Networks -- Computing Exact and Approximate Nash Equilibria in 2-Player Games -- Where Would Refinancing Preferences Go? -- Approximating Maximum Edge 2-Coloring in Simple Graphs -- A Linear Kernel for Co-Path/Cycle Packing -- A VaR Algorithm for Warrants Portfolio -- Some Results on Incremental Vertex Cover Problem -- Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction -- Point Location in the Continuous-Time Moving Network -- Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints -- Inverse 1-median Problem on Trees under Weighted l ??? Norm -- On the Approximability of the Vertex Cover and Related Problems -- Feasibility Testing for Dial-a-Ride Problems -- Indexing Similar DNA Sequences -- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint -- A New Smoothing Newton Method for Symmetric Cone Complementarity Problems -- Approximation Algorithms for Scheduling with a Variable Machine Maintenance -- Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines -- Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles -- Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive -- A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem -- Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision -- Varieties of Regularities in Weighted Sequences -- Online Uniformly Inserting Points on Grid -- Kernelization for Cycle Transversal Problems -- Online Splitting Interval Scheduling on m Identical Machines -- Extended Tabu Search on Fuzzy Traveling Salesman Problem in Multi-criteria Analysis -- Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery. 330 $aWhile the areas of information management and management science are full of algorithmic challenges, the proliferation of data has called for the design of e?cient and e?ective algorithms and data structures for their management and processing. The International Conference on Algorithmic Aspects in Information and Management(AAIM) is intended for originalalgorithmicresearchon immediate applications and/or fundamental problems pertinent to information mana- ment and management science to be broadly construed. The conference aims at bringing together researchers in computer science, operations research, applied mathematics, economics, and related disciplines. This volume contains papers presented at AAIM 2010: the 6th International Conference on Algorithmic Aspects in Information and Management, which was held during July 19-21, 2010, in Weihai, China. We received a total of 50 s- missions.Eachsubmissionwasreviewedbythreemembersof the ProgramC- mittee or their deputies on the quality, originality, soundness, and signi?cance of its contribution. The committee decided to accept 31 papers. The program also included two invited keynote talks. The success of the conference resulted from the input of many people. We would like ?rst of all to thank all the members of the Program Committee for their expert evaluation of the submissions. The local organizers in the School of Computer Science and Technology, Shandong University, did an extraordinary job, for which we are very grateful. We thank the National Natural Science Foundation of China, Montana State University (USA), University of Warwick (UK), and Shandong University (China) for their sponsorship. 410 0$aInformation Systems and Applications, incl. Internet/Web, and HCI ;$v6124 606 $aSoftware engineering 606 $aComputer programming 606 $aComputers 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aManagement information systems 606 $aComputer science 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aManagement of Computing and Information Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I24067 615 0$aSoftware engineering. 615 0$aComputer programming. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aManagement information systems. 615 0$aComputer science. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aProgramming Techniques. 615 24$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aManagement of Computing and Information Systems. 676 $a005.1 702 $aChen$b Bo$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aAAIM 2010 906 $aBOOK 912 $a996465662203316 996 $aAlgorithmic Aspects in Information and Management$9771920 997 $aUNISA LEADER 01474nam 2200385Ia 450 001 996384091703316 005 20200824132520.0 035 $a(CKB)1000000000599966 035 $a(EEBO)2240898862 035 $a(OCoLC)ocm52211834e 035 $a(OCoLC)52211834 035 $a(EXLCZ)991000000000599966 100 $a20030509d1695 uy 0 101 0 $aeng 135 $aurbn||||a|bb| 200 10$aInstructions for the whole year$hPart II$iFor Sundays$b[electronic resource] $ebeing practical thoughts on the Epistles of all the Sundays and moveable feasts from the Octave of Easter to Quinquagesima Sunday 210 $a[London $cs.n.]$dPrinted in the year 1695 215 $a[24], 383, [1] p 300 $aAttributed to John Gother by Wing. 300 $aPlace of publication suggested by Wing. 300 $aNumerous errors in pagination. 300 $a"Dr. Baylie's challenge" (p. 381-383) has caption title. 300 $aReproduction of the original in the University of Texas, Austin Library. 330 $aeebo-0179 606 $aChurch year meditations$vEarly works to 1800 606 $aDevotional calendars$xCatholic Church$vEarly works to 1800 615 0$aChurch year meditations 615 0$aDevotional calendars$xCatholic Church 700 $aGother$b John$fd. 1704.$0821390 801 0$bEAE 801 1$bEAE 906 $aBOOK 912 $a996384091703316 996 $aInstructions for the whole year$92337133 997 $aUNISA