LEADER 08070nam 22007935 450 001 9910484970903321 005 20251226203624.0 010 $a3-540-34022-X 024 7 $a10.1007/11750321 035 $a(CKB)1000000000232958 035 $a(SSID)ssj0000320373 035 $a(PQKBManifestationID)11233633 035 $a(PQKBTitleCode)TC0000320373 035 $a(PQKBWorkID)10247915 035 $a(PQKB)10943468 035 $a(DE-He213)978-3-540-34022-5 035 $a(MiAaPQ)EBC3067765 035 $a(PPN)123134390 035 $a(BIP)34164054 035 $a(BIP)13385080 035 $a(EXLCZ)991000000000232958 100 $a20100421d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory and Applications of Models of Computation $eThird International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings /$fedited by Jin-Yi Cai, Barry S. Cooper, Angsheng Li 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XVI, 800 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3959 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-34021-1 320 $aIncludes bibliographical references and index. 327 $aPlenary Lectures -- On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance -- Similarity of Objects and the Meaning of Words -- Totally ? ? Computably Enumerable and m-topped Degrees -- Mitosis in Computational Complexity -- Models of Intuitionistic Set Theories over Partial Combinatory Algebras -- Width Versus Size in Resolution Proofs -- Recent Progress in Quantum Computational Complexity -- Algorithm -- On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times -- LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing -- A Bounded Item Bin Packing Problem over Discrete Distribution -- Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms -- Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges -- An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems -- Adversary Immune Size Approximation of Single-Hop Radio Networks -- On Load-Balanced Semi-matchings for Weighted Bipartite Graphs -- Analyzing Chain Programs over Difference Constraints -- Linear-Time 2-Approximation Algorithm for the Watchman Route Problem -- Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks -- Real Time Critical Edge of the Shortest Path in Transportation Networks -- Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations -- A New Approximation Algorithm for the k-Facility Location Problem -- Computational Complexity -- Alternative Measures of Computational Complexity with Applications to Agnostic Learning -- Disjoint NP-Pairs from Propositional Proof Systems -- Valiant?s Holant Theorem and Matchgate Tensors -- Variable Minimal Unsatisfiability -- A New Lower Bound of CriticalFunction for (k,s)-SAT -- Cluster Computing and the Power of Edge Recognition -- Quadratic Lower Bounds on Matrix Rigidity -- Non-reducible Descriptions for Conditional Kolmogorov Complexity -- Generalized Counters and Reversal Complexity -- Multisource Algorithmic Information Theory -- Block Sensitivity of Weakly Symmetric Functions -- Optimization Problems in the Polynomial-Time Hierarchy -- #3-Regular Bipartite Planar Vertex Cover is #P-Complete -- Group Theory Based Synthesis of Binary Reversible Circuits -- On Some Complexity Issues of NC Analytic Functions -- Learning Theory -- Learning Juntas in the Presence of Noise -- Grey Reinforcement Learning for Incomplete Information Processing -- On the Foundations of Universal Sequence Prediction -- Some Recent Results in U-Shaped Learning -- Learning Overcomplete Representations with a Generalized Gaussian Prior -- On PAC Learning Algorithms for Rich Boolean Function Classes -- On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces -- Inductive Inference and Language Learning -- Time Series Predictions Using Multi-scale Support Vector Regressions -- Bioinformatics -- Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing -- On Probe Permutation Graphs -- Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network -- Protein Structure Comparison Based on a Measure of Information Discrepancy -- Succinct Text Indexes on Large Alphabet -- Security -- Identity-Based Threshold Proxy Signature Scheme with Known Signers -- Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions -- Formal Method -- Towards Practical Computable Functions on Context-Free Languages -- The Extended Probabilistic Powerdomain Monad over Stably CompactSpaces -- Analysis of Properties of Petri Synthesis Net -- A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs -- Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations -- Improved SAT Based Bounded Model Checking -- Models of Computation -- Encodings and Arithmetic Operations in Membrane Computing -- The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation -- Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable -- The Trade-Off Theorem and Fragments of Gödel?s T -- On Non-binary Quantum BCH Codes -- Maximal Models of Assertion Graph in GSTE -- Computatability -- Immunity Properties and the n-C.E. Hierarchy -- On Rogers Semilattices -- Invertible Classes -- Universal Cupping Degrees -- On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal -- Enumeration Degrees of the Bounded Total Sets -- A Generic Set That Does Not Bound a Minimal Pair -- Lowness for Weakly 1-generic and Kurtz-Random -- On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies -- Computable Mathematics -- On Mass Problems of Presentability -- Beyond the First Main Theorem ? When Is the Solution of a Linear Cauchy Problem Computable?. 330 $aThis book constitutes the refereed proceedings of the Third International Conference on Theory and Applications of Models of Computation, TAMC 2006, held in Beijing, China, in May 2006. The 75 revised full papers presented together with 7 plenary talks were carefully reviewed and selected from 319 submissions. All major areas in computer science, mathematics (especially logic) and the physical sciences particularly with regard to computation and computability theory are addressed. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3959 606 $aComputer science 606 $aAlgorithms 606 $aArtificial intelligence 606 $aComputer science$xMathematics 606 $aBioinformatics 606 $aTheory of Computation 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aMathematics of Computing 606 $aBioinformatics 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aComputer science$xMathematics. 615 0$aBioinformatics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aMathematics of Computing. 615 24$aBioinformatics. 676 $a004.0151 701 $aCai$b Jin-yi$f1961-$01756823 701 $aCooper$b S. B$g(S. Barry)$060840 701 $aLi$b Angsheng$01756824 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484970903321 996 $aTheory and applications of models of computation$94194345 997 $aUNINA