08214nam 22007695 450 99646593560331620200703071257.03-540-45678-310.1007/3-540-45678-3(CKB)1000000000211619(SSID)ssj0000321205(PQKBManifestationID)11220352(PQKBTitleCode)TC0000321205(PQKBWorkID)10263722(PQKB)10903997(DE-He213)978-3-540-45678-0(MiAaPQ)EBC3072604(PPN)15521733X(EXLCZ)99100000000021161920121227d2001 u| 0engurnn|008mamaatxtccrAlgorithms and Computation[electronic resource] 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001. Proceedings /edited by Peter Eades, Tadao Takaoka1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (XIV, 790 p.) Lecture Notes in Computer Science,0302-9743 ;2223Bibliographic Level Mode of Issuance: Monograph3-540-42985-9 Includes bibliographical references at the end of each chapters and index.Invited Talk 1 -- Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages -- Combinatorial Generation and Optimization (I) -- Application of M-Convex Submodular Flow Problem to Mathematical Economics -- A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling -- A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times -- Semi-normal Schedulings: Improvement on Goemans’ Algorithm -- Parallel and Distributed Algorithms (I) -- Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness -- Broadcasting with Universal Lists Revisited: Using Competitive Analysis -- On Adaptive Fault Diagnosis for Multiprocessor Systems -- On-Line Multicasting in All-Optical Networks -- Graph Drawing and Algorithms (I) -- Enumerating Floorplans with n Rooms -- On Min-Max Cycle Bases -- On the Minimum Local-Vertex-Connectivity Augmentation in Graphs -- Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number -- Computational Geometry (I) -- Quantum Algorithms for Intersection and Proximity Problems -- BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces -- Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees -- Tree-Approximations for the Weighted Cost-Distance Problem -- Computational Complexity and Cryptology -- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups -- Generic Algorithms and Key Agreement Protocols Based on Group Actions -- Baire Category and Nowhere Differentiability for Feasible Real Functions -- Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams -- Automata and Formal Languages -- On Removing the Pushdown Stack in Reachability Constructions -- A New Recognition Algorithm for Extended Regular Expressions -- Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata -- An Index for the Data Size to Extract Decomposable Structures in LAD -- Invited Talk 2 -- Parameterized Complexity: The Main Ideas and Some Research Frontiers -- Graph Drawing and Algorithms (II) -- Tight Bounds on Maximal and Maximum Matchings -- Recognition and Orientation Algorithms for P4-Comparability Graphs -- Efficient Algorithms for k-Terminal Cuts on Planar Graphs -- Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths -- Combinatorial Generation and Optimization (II) -- Algorithms for Pattern Involvement in Permutations -- A Fast Algorithm for Enumerating Bipartite Perfect Matchings -- On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time -- On the Complexity of Train Assignment Problems -- Computational Biology and String Matching (I) -- A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model -- Complexity of Comparing Hidden Markov Models -- DNA Self-Assembly For Constructing 3D Boxes -- Exact Solutions for Closest String and Related Problems -- Computational Geometry (II) -- Topological Peeling and Implementation -- Image Segmentation with Monotonicity and Smoothness Constraints -- Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards -- Approximation of a Geometric Set Covering Problem -- Invited Talk 3 -- Shortest Path Algorithms: Engineering Aspects -- Graph Drawing and Algorithms (III) -- Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs -- Go with the Winners Algorithms for Cliques in Random Graphs -- Complexity of Partial Covers of Graphs -- On Game-Theoretic Models of Networks -- Parallel and Distributed Algorithms (II) -- The Complexity of Some Basic Problems for Dynamic Process Graphs -- Delay Optimizations in Quorum Consensus -- Randomized Shared Queues Applied to Distributed Optimization Algorithms -- Multiprocess Time Queue -- Computational Geometry (III) -- Labeling Points with Weights -- Small Convex Quadrangulations of Point Sets -- How to Color a Checkerboard with a Given Distribution — Matrix Rounding Achieving Low 2 × 2-Discrepancy -- Labeling Subway Lines -- Randomized and Approximation Algorithms -- Complexity Study on Two Clustering Problems -- A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2 -- A Unified Framework for Approximating Multiway Partition Problems -- On-Line Algorithms for Cardinality Constrained Bin Packing Problems -- Computational Biology and String Matching (II) -- Suffix Vector: A Space-Efficient Suffix Tree Representation -- Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works -- Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n) -- Algorithms and Data Structures -- The Cent-dian Path Problem on Tree Networks -- Approximate Hotlink Assignment -- Efficient Algorithms for Two Generalized 2-Median Problems on Trees.Lecture Notes in Computer Science,0302-9743 ;2223Computer programmingComputersAlgorithmsComputer communication systemsComputer science—MathematicsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Computer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computer programming.Computers.Algorithms.Computer communication systems.Computer science—Mathematics.Programming Techniques.Theory of Computation.Algorithm Analysis and Problem Complexity.Computation by Abstract Devices.Computer Communication Networks.Discrete Mathematics in Computer Science.004Eades Peteredthttp://id.loc.gov/vocabulary/relators/edtTakaoka Tadaoedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996465935603316Algorithms and Computation771857UNISA03879nam 2201033z- 450 991055729490332120210501(CKB)5400000000041090(oapen)https://directory.doabooks.org/handle/20.500.12854/69352(oapen)doab69352(oapen)69352(EXLCZ)99540000000004109020202105d2020 |y 0engurmn|---annantxtrdacontentcrdamediacrrdacarrierAdvances in Experimental and Computational Rheology, Volume IIBasel, SwitzerlandMDPI - Multidisciplinary Digital Publishing Institute20201 online resource (192 p.)3-03943-565-5 3-03943-566-3 Rheology, defined as the science of deformation and flow of matter, is a multidisciplinary scientific field, covering both fundamental and applied approaches. The study of rheology includes both experimental and computational methods, which are not mutually exclusive. Its practical importance embraces many processes, from daily life, like preparing mayonnaise or spreading an ointment or shampooing, to industrial processes like polymer processing and oil extraction, among several others. Practical applications include also formulations and product development. Following a successful first volume, we are now launching this second volume to continue to present the latest advances in the fields of experimental and computational rheology applied to the most diverse classes of materials (foods, cosmetics, pharmaceuticals, polymers and biopolymers, multiphasic systems, and composites) and processes.History of engineering and technologybicsscantibioticsartificial engineeringbactericidalBoger fluidsbreadbreadmakingbreastfeedingcircular contraction flowcomplex fluidscomplex modulusconsolidationCouette analogyCross-WLF modeldata-drivendensitydigital twindrop impactelasto-viscoplastic materialexperimental rheologyfilling stagefinite volume methodfirst normal-stress differencefree surfacegraphene oxidegravitational effectsgrouthuman milkinjection moldinglip vortexmachine learningmasonryMRSAn/anon-viscometric geometriesOpenFOAM®openInjMoldSimoxacillinpolyethylene glycolpolymer processingpolypropylene fiberpressure-dropsreactive extrusionrheological characterizationrheological measurementsrheologyS. aureusshear thinning fluidssuspensionsswIM modelTait modeltube feedingviscosityvortex-enhancementwheyyield stressHistory of engineering and technologyCidade Maria Teresaedt1283263Nóbrega João MigueledtCidade Maria TeresaothNóbrega João MiguelothBOOK9910557294903321Advances in Experimental and Computational Rheology, Volume II3019081UNINA