LEADER 01552nam 2200505 450 001 9910479910503321 005 20170822123139.0 010 $a1-64055-079-8 010 $a1-56793-646-6 035 $a(CKB)3710000000378849 035 $a(SSID)ssj0001583170 035 $a(PQKBManifestationID)16260221 035 $a(PQKBTitleCode)TC0001583170 035 $a(PQKBWorkID)14861664 035 $a(PQKB)11498272 035 $a(MiAaPQ)EBC5909642 035 $a(EXLCZ)993710000000378849 100 $a20191015d2014 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aHealthcare marketing $ea case study approach /$fLeigh W. Cellucci, Carla Wiggins, and Tracy J. Farnsworth 210 1$aChicago, Illinois ;$aArlington, Virginia :$cHealth Administration Press :$cAUPHA Press,$d[2014] 210 4$d©2014 215 $a1 online resource (xxii, 227 pages) 300 $aIncludes index. 311 $a1-56793-605-9 606 $aHealth services administration$vCase studies 606 $aMedical care$xMarketing$vCase studies 608 $aElectronic books. 615 0$aHealth services administration 615 0$aMedical care$xMarketing 676 $a362.1068/8 700 $aCellucci$b Leigh W.$0961564 702 $aFarnsworth$b Tracy J. 702 $aWiggins$b Carla 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910479910503321 996 $aHealthcare marketing$92180069 997 $aUNINA LEADER 07130nam 22007335 450 001 996465857803316 005 20200705110959.0 010 $a3-540-47159-6 024 7 $a10.1007/BFb0032016 035 $a(CKB)1000000000233544 035 $a(SSID)ssj0000321499 035 $a(PQKBManifestationID)11246811 035 $a(PQKBTitleCode)TC0000321499 035 $a(PQKBWorkID)10262910 035 $a(PQKB)11119951 035 $a(DE-He213)978-3-540-47159-2 035 $a(PPN)155215868 035 $a(EXLCZ)991000000000233544 100 $a20121227d1990 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e17th International Colloquium, Warwick University, England, July 16-20, 1990, Proceedings /$fedited by Michael S. Paterson 205 $a1st ed. 1990. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1990. 215 $a1 online resource (XII, 788 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v443 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-52826-1 327 $aLEDA: A library of efficient data types and algorithms -- A new universal class of hash functions and dynamic hashing in real time -- A complete and decidable proof system for call-by-value equalities -- Static correctness of hierarchical procedures -- Generic terms having no polymorphic types -- A complete system of B-rational identities -- On non-counting regular classes -- Two-way automata with multiplicity -- ?-Continuous semirings, algebraic systems and pushdown automata -- Nondeterministic computations in sublogarithmic space and space constructibility -- Normalizing and accelerating RAM computations and the problem of reasonable space measures -- A formal study of learning via queries -- Language learning by a ?team? -- Functions as processes -- A domain-theoretic model for a higher-order process calculus -- Concurrency, automata and domains -- A theory of communicating processes with value-passing -- Analytic variations on the common subexpression problem -- Can a maximum flow be computed in o(nm) time? -- On the distributional complexity of disjointness -- Computing boolean functions on anonymous networks -- On the composition of zero-knowledge proof systems -- Additional queries to random and pseudorandom oracles -- Communication among relations -- Stability and sequentiality in dataflow networks -- Automata for modeling real-time systems -- Markov decision processes and regular events -- Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond -- Nonoblivious normalization algorithms for nonlinear rewrite systems -- Algebraic properties of idempotent substitutions -- Determining the separation of preprocessed polyhedra ? A unified approach -- Randomized incremental construction of delaunay and Voronoi diagrams -- Merging free trees in parallel for efficient voronoi diagram construction -- Local optimization and the Traveling Salesman Problem -- Polynomial-time approximation algorithms for the ising model -- On parallelizing graph-partitioning heuristics -- Iterated substitutions and locally catenative systems: a decidability result in the binary case -- Decomposition of partial commutations -- Boolean closure and unambiguity of rational sets -- Compositionality through an operational semantics of contexts -- Structural and behavioural equivalences of networks -- Proving partial order liveness properties -- A proof system for the parallel object-oriented language POOL -- A new approach to maximum matching in general graphs -- On-line graph algorithms with SPQR-trees -- On the bit-complexity of discrete solutions of PDEs: Compact multigrid -- An efficient algorithm for branching bisimulation and stuttering equivalence -- Partial evaluation, self-application and types -- Provable computable functions on abstract data types -- Equational formulas in order-sorted algebras -- An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal -- Approximation of convex polygons -- On the rectilinear art gallery problem -- On parallel hashing and integer sorting -- The parallel simplicity of compaction and chaining -- The importance of the left merge operator in process algebras -- Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming. 330 $aThis volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics. This volume contains five invited papers and 52 papers selected from 250 submitted. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v443 606 $aComputers 606 $aMathematical logic 606 $aData structures (Computer science) 606 $aCombinatorics 606 $aAlgorithms 606 $aArtificial intelligence 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aComputers. 615 0$aMathematical logic. 615 0$aData structures (Computer science). 615 0$aCombinatorics. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 14$aTheory of Computation. 615 24$aMathematical Logic and Formal Languages. 615 24$aData Structures. 615 24$aCombinatorics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aArtificial Intelligence. 676 $a004.0151 702 $aPaterson$b Michael S$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465857803316 996 $aAutomata, languages and programming$9339738 997 $aUNISA LEADER 01475nam 2200397 a 450 001 996395671703316 005 20200824120434.0 035 $a(CKB)3810000000014285 035 $a(EEBO)2240932092 035 $a(UnM)ocm99893022e 035 $a(UnM)99893022 035 $a(EXLCZ)993810000000014285 100 $a19990322d1637 uy 0 101 0 $aeng 135 $aurbn||||a|bb| 200 10$aClark 1637$b[electronic resource] $eAn almanack and prognostication for this yeare, being the first after bissextile or leap-yeare, and from our Saviours passion 1603. Calculated properly for the famous town of Ipswich, but may indifferently serve for any other place within this kingdome 210 $a[Cambridge] $cPrinted by the printers to the Vniversitie of Cambridge$d[1637] 215 $a[1]+ p 300 $aPlace and date of publication suggested by STC (2nd ed.). 300 $aTitle within ornamental border. 300 $aFragment; consists of t.p. only. 300 $aReproduction of original in: British Library. 330 $aeebo-0018 606 $aAlmanacs, English$vEarly works to 1800 606 $aEphemerides$vEarly works to 1800 606 $aAstrology$vEarly works to 1800 615 0$aAlmanacs, English 615 0$aEphemerides 615 0$aAstrology 700 $a[Clark]$0370476 801 0$bCu-RivES 801 1$bCu-RivES 906 $aBOOK 912 $a996395671703316 996 $aClark 1637$92416518 997 $aUNISA LEADER 01046nam a22002411i 4500 001 991001386679707536 005 20031106181605.0 008 040407s1968 xxua||||||||||||||||eng 035 $ab12762404-39ule_inst 035 $aARCHE-074203$9ExL 040 $aDip.to Scienze Storiche$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a945.3107 100 1 $aBouwsma, William James$0211429 245 10$aVenice and the defense of republican liberty :$brenaissance values in the age of the Counter Reformation /$cby William J. Bouwsma 260 $aBerkeley ;$aLos Angeles :$bUniversity of California,$c1968 300 $a1 v. :$bill. ;$c24 cm 650 4$aControriforma$xVenezia $ySec. 16. 907 $a.b12762404$b02-04-14$c16-04-04 912 $a991001386679707536 945 $aLE009 STOR.61-8$g1$i2009000215955$lle009$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i13303429$z16-04-04 996 $aVenice and the defense of republican liberty$937390 997 $aUNISALENTO 998 $ale009$b16-04-04$cm$da $e-$feng$gxxu$h0$i1