LEADER 05020nam 2200637 450 001 996466272103316 005 20230921170644.0 010 $a1-280-94435-8 010 $a9786610944354 010 $a3-540-72870-8 024 7 $a10.1007/978-3-540-72870-2 035 $a(CKB)1000000000478507 035 $a(EBL)3061563 035 $a(SSID)ssj0000101070 035 $a(PQKBManifestationID)11131455 035 $a(PQKBTitleCode)TC0000101070 035 $a(PQKBWorkID)10037700 035 $a(PQKB)10950298 035 $a(DE-He213)978-3-540-72870-2 035 $a(MiAaPQ)EBC3061563 035 $a(MiAaPQ)EBC6742770 035 $a(Au-PeEL)EBL6742770 035 $a(OCoLC)184904688 035 $a(PPN)123162726 035 $a(EXLCZ)991000000000478507 100 $a20220629d2007 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aAlgorithmic aspects in information and management $ethird international conference, AAIM 2007, Portland, or, USA, June 6-8, 2007, proceedings /$fMing-Yang Kao, Xiang-Yang Li, editors 205 $a1st ed. 2007. 210 1$aBerlin ;$aHeidelberg :$cSpringer-Verlag,$d[2007] 210 4$dİ2007 215 $a1 online resource (438 p.) 225 1 $aLecture Notes in Computer Science ;$v4508 300 $aDescription based upon print version of record. 311 $a3-540-72868-6 320 $aIncludes bibliographical references and index. 327 $aContributed Papers To AAIM 2007 -- Solving Generalized Maximum Dispersion with Linear Programming -- Significance-Driven Graph Clustering -- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs -- Digraph Strong Searching: Monotonicity and Complexity -- Algorithms for Counting 2-Sat Solutions and Colorings with Applications -- Collaborative Ranking: An Aggregation Algorithm for Individuals? Preference Estimation -- A Compact Encoding of Rectangular Drawings with Efficient Query Supports -- A New Efficient Algorithm for Computing the Longest Common Subsequence -- Scheduling a Flexible Batching Machine -- Global Search Method for Parallel Machine Scheduling -- Releasing and Scheduling of Lots in a Wafer Fab -- Mixed Criteria Packet Scheduling -- Efficient Algorithms for k-Disjoint Paths Problems on DAGs -- Acyclic Edge Colouring of Outerplanar Graphs -- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract) -- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree -- An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths -- Online OVSF Code Assignment with Resource Augmentation -- Optimal Joint Rate and Power Allocation in CDMA Networks -- Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers -- How to Play the Majority Game with Liars -- On Satisfiability Games and the Power of Congestion Games -- The Complexity of Algorithms Computing Game Trees on Random Assignments -- An Efficient, and Fast Convergent Algorithm for Barrier Options -- An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options -- Optimal Order Allocation with Discount Pricing -- Convex Hulls of Point-Sets and Non-uniform Hypergraphs -- Optimal st-Orientations for Plane Triangulations -- Minimum Spanning Tree with Neighborhoods -- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem -- Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs -- BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps -- Strip Packing vs. Bin Packing -- Probe Matrix Problems: Totally Balanced Matrices -- Efficiency of Data Distribution in BitTorrent-Like Systems -- Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers -- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots -- A Heuristic Method for Selecting Support Features from Large Datasets -- Invited Lecture -- Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis -- Ad Auctions ? Current and Future Research -- Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. 410 0$aLecture notes in computer science ;$v4508. 606 $aComputer algorithms$vCongresses 606 $aManagement science$xMathematical models$vCongresses 615 0$aComputer algorithms 615 0$aManagement science$xMathematical models 676 $a005.1 702 $aKao$b Ming-Yang 702 $aLi$b Xiangyang 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466272103316 996 $aAlgorithmic Aspects in Information and Management$9771920 997 $aUNISA LEADER 03799nam 2200601z- 450 001 9910404088203321 005 20210211 010 $a3-03928-727-3 035 $a(CKB)4100000011302256 035 $a(oapen)https://directory.doabooks.org/handle/20.500.12854/41047 035 $a(oapen)doab41047 035 $a(EXLCZ)994100000011302256 100 $a20202102d2020 |y 0 101 0 $aeng 135 $aurmn|---annan 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aThe Application of Mathematics to Physics and Nonlinear Science 210 $cMDPI - Multidisciplinary Digital Publishing Institute$d2020 215 $a1 online resource (122 p.) 311 08$a3-03928-726-5 330 $aNonlinear science is the science of, among other exotic phenomena, unexpected and unpredictable behavior, catastrophes, complex interactions, and significant perturbations. Ocean and atmosphere dynamics, weather, many bodies in interaction, ultra-high intensity excitations, life, formation of natural patterns, and coupled interactions between components or different scales are only a few examples of systems where nonlinear science is necessary. All outstanding, self-sustained, and stable structures in space and time exist and protrude out of a regular linear background of states mainly because they identify themselves from the rest by being highly localized in range, time, configuration, states, and phase spaces. Guessing how high up you drive toward the top of the mountain by compiling your speed, road slope, and trip duration is a linear model, but predicting the occurrence around a turn of a boulder fallen on the road is a nonlinear phenomenon. In an effort to grasp and understand nonlinear phenomena, scientists have developed several mathematical approaches including inverse scattering theory, Backlund and groups of transformations, bilinear method, and several other detailed technical procedures. In this Special Issue, we introduce a few very recent approaches together with their physical meaning and applications. We present here five important papers on waves, unsteady flows, phases separation, ocean dynamics, nonlinear optic, viral dynamics, and the self-appearance of patterns for spatially extended systems, which are problems that have aroused scientists' interest for decades, yet still cannot be predicted and have their generating mechanism and stability open to debate. The aim of this Special Issue was to present these most debated and interesting topics from nonlinear science for which, despite the existence of highly developed mathematical tools of investigation, there are still fundamental open questions. 610 $aCahn-Hilliard equation 610 $aCauchy problem 610 $acontinuum spectrum pulse equation 610 $aconvergence 610 $adiffusion 610 $aexistence 610 $aexistence and uniqueness theorem 610 $aFaedo-Galerkin approximations 610 $aFeller equation 610 $aFokker-Planck equation 610 $aLagrangian scheme 610 $along-time behavior 610 $aLyapunov functional 610 $amultigrid method 610 $aNavier-Stokes-Voigt equations 610 $anon-Newtonian fluid 610 $aparabolic equations 610 $aprobability distribution 610 $astability 610 $aStokes operator 610 $astrong solutions 610 $aunconditionally gradient stable scheme 610 $auniqueness 610 $aviral infection 610 $aviscoelastic models 700 $aLudu$b Andrei$4auth$0799765 906 $aBOOK 912 $a9910404088203321 996 $aThe Application of Mathematics to Physics and Nonlinear Science$93035317 997 $aUNINA