LEADER 04414nam 22007455 450 001 996465417203316 005 20230406034137.0 010 $a3-642-02011-9 024 7 $a10.1007/978-3-642-02011-7 035 $a(CKB)1000000000753971 035 $a(SSID)ssj0000317598 035 $a(PQKBManifestationID)11240612 035 $a(PQKBTitleCode)TC0000317598 035 $a(PQKBWorkID)10293990 035 $a(PQKB)10372122 035 $a(DE-He213)978-3-642-02011-7 035 $a(MiAaPQ)EBC3064247 035 $a(PPN)136306454 035 $a(EXLCZ)991000000000753971 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental Algorithms$b[electronic resource] $e8th International Symposium SEA 2009, Dortmund, Germany, June 4-6, 2009, Proceedings /$fedited by Jan Vahrenhold 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (X, 293 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5526 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-02010-0 320 $aIncludes bibliographical references and index. 327 $aParallelism in Current and Future Processors ? Challenges and Support for Designing Optimal Algorithms -- From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering -- Experimental Comparisons of Derivative Free Optimization Algorithms -- On Computational Models for Flash Memory Devices -- Competitive Buffer Management with Stochastic Packet Arrivals -- Fast and Accurate Bounds on Linear Programs -- Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study -- Rotated-Box Trees: A Lightweight c-Oriented Bounding-Volume Hierarchy -- psort, Yet Another Fast Stable Sorting Software -- A Heuristic for Fair Correlation-Aware Resource Placement -- Measuring the Similarity of Geometric Graphs -- A Heuristic Strong Connectivity Algorithm for Large Graphs -- Pareto Paths with SHARC -- An Application of Self-organizing Data Structures to Compression -- Scheduling Additional Trains on Dense Corridors -- Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays -- Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games -- Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching -- Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow -- Univariate Algebraic Kernel and Application to Arrangements -- Fast Algorithm for Graph Isomorphism Testing -- Algorithms and Experiments for Clique Relaxations?Finding Maximum s-Plexes -- A Design-for-Yield Algorithm to Assess and Improve the Structural and Energetic Robustness of Proteins and Drugs -- Multi-level Algorithms for Modularity Clustering -- Bulk-Insertion Sort: Towards Composite Measures of Presortedness -- Computing Elevation Maxima by Searching the Gauss Sphere. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5526 606 $aComputer science?Mathematics 606 $aArtificial intelligence?Data processing 606 $aMathematical models 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aMathematics of Computing 606 $aData Science 606 $aMathematical Modeling and Industrial Mathematics 606 $aAlgorithms 606 $aData Structures and Information Theory 615 0$aComputer science?Mathematics. 615 0$aArtificial intelligence?Data processing. 615 0$aMathematical models. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 14$aMathematics of Computing. 615 24$aData Science. 615 24$aMathematical Modeling and Industrial Mathematics. 615 24$aAlgorithms. 615 24$aData Structures and Information Theory. 676 $a005.0151 686 $aDAT 530f$2stub 686 $aSS 4800$2rvk 702 $aVahrenhold$b Jan$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465417203316 996 $aExperimental Algorithms$9772547 997 $aUNISA LEADER 03867nam 2200817Ia 450 001 9910962823203321 005 20200520144314.0 010 $a9780791485248 010 $a0791485242 010 $a9781423739470 010 $a1423739477 035 $a(CKB)1000000000458351 035 $a(OCoLC)62739309 035 $a(CaPaEBR)ebrary10594775 035 $a(SSID)ssj0000267777 035 $a(PQKBManifestationID)11218412 035 $a(PQKBTitleCode)TC0000267777 035 $a(PQKBWorkID)10212982 035 $a(PQKB)11545332 035 $a(OCoLC)62364739 035 $a(MdBmJHUP)muse6137 035 $a(Au-PeEL)EBL3408448 035 $a(CaPaEBR)ebr10594775 035 $a(DE-B1597)681606 035 $a(DE-B1597)9780791485248 035 $a(MiAaPQ)EBC3408448 035 $a(Perlego)2672546 035 $a(EXLCZ)991000000000458351 100 $a20030716d2004 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aVirtual peer review $eteaching and learning about writing in online environments /$fLee-Ann Kastman Breuch 205 $a1st ed. 210 $aAlbany $cState University of New York Press$dc2004 215 $a1 online resource (198 p.) 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9780791460504 311 08$a0791460509 311 08$a9780791460498 311 08$a0791460495 320 $aIncludes bibliographical references (p. 163-175) and index. 327 $tFront Matter -- $tContents -- $tAcknowledgments -- $tTables -- $tFigures -- $tIntroduction -- $tVirtual Peer Review as ?Remediation? -- $tCharacteristics of Virtual Peer Review -- $tVirtual Peer Review as Abnormal Discourse -- $tChallenges of Virtual Peer Review -- $tVirtual Peer Review and Technological Flexibility -- $tImplications of Virtual Peer Review for the Writing Classroom and Beyond -- $tPeer Review and Technology Instructions -- $tConsent Form -- $tNotes -- $tWorks Cited -- $tIndex 330 $aIn a reassessment of peer review practices, Lee-Ann Kastman Breuch explores how computer technology changes our understanding of this activity. She defines "virtual peer review" as the use of computer technology to exchange and respond to one another's writing in order to improve it. Arguing that peer review goes through a remediation when conducted in virtual environments, the author suggests that virtual peer review highlights a unique intersection of social theories of language and technological literacy. 606 $aEnglish language$xRhetoric$xStudy and teaching$xData processing 606 $aEnglish language$xComposition and exercises$xComputer-assisted instruction 606 $aEnglish language$xComposition and exercises$xData processing 606 $aEnglish language$xRhetoric$xComputer-assisted instruction 606 $aReport writing$xStudy and teaching$xData processing 606 $aReport writing$xComputer-assisted instruction 606 $aOnline data processing 606 $aPeer review 615 0$aEnglish language$xRhetoric$xStudy and teaching$xData processing. 615 0$aEnglish language$xComposition and exercises$xComputer-assisted instruction. 615 0$aEnglish language$xComposition and exercises$xData processing. 615 0$aEnglish language$xRhetoric$xComputer-assisted instruction. 615 0$aReport writing$xStudy and teaching$xData processing. 615 0$aReport writing$xComputer-assisted instruction. 615 0$aOnline data processing. 615 0$aPeer review. 676 $a808/.042/0285 700 $aBreuch$b Lee-Ann Kastman$f1970-$01805640 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910962823203321 996 $aVirtual peer review$94354354 997 $aUNINA