%{search_type} search results

• Preface
• Part I: Fundamentals ; Introduction ; Tutorial
• Part II: Data Collection with Matlab ; Visual Search and Pop Out< ; Attention ; Psychophysics ; Signal Detection Theory
• Part III: Data Analysis with Matlab ; Frequency Analysis Part I ; Frequency Analysis Part II: Non-stationary Signals and Spectrograms ; Wavelets ; Convolution ; Introduction to Phase Plane Analysis ; Exploring the Fitzhugh-Nagumo Model ; Neural Data Analysis: Encoding ; Principal Components Analysis ; Information Theory ; Neural Decoding: Discrete variables ; Neural Decoding: Continuous variables ; Functional Magnetic Imaging
• Part IV: Data Modeling with Matlab
• Voltage-Gated Ion Channels ; Models of a Single Neuron ; Models of the Retina ; Simplified Models of Spiking Neurons ; Fitzhugh-Nagumo Model: Traveling Waves ; Decision Theory ; Markov Model ; Modeling Spike Trains as a Poisson Process ; Synaptic Transmission ; Neural Networks: Unsupervised learning ; Neural Network: Supervised Learning
• Appendices ; Appendix 1: Thinking in Matlab ; Appendix 2: Linear Algebra Review.

Matlab is the accepted standard for scientific computing, used globally in virtually all Neuroscience and Cognitive Psychology laboratories. For instance, SPM, the most used software for the analysis and manipulation of fMRI images in research and clinical practice is fully programmed in matlab, and its use of the possibility to allow for sophisticated software modules to be freely added to the software has established it as the by far dominant software in the field. Many universities now offer, or are beginning to offer matlab introductory courses in their neuroscience and psychology programs. Nevertheless, so far there hasn't been a textbook specific to this market, and the use of the plethora of existing engineering focused Matlab textbooks is notoriously difficult for teaching the package in those environments. This is the first comprehensive teaching resource and textbook for the teaching of Matlab in the Neurosciences and in Psychology. Matlab is unique in that it can be used to learn the entire empirical and experimental process, including stimulus generation, experimental control, data collection, data analysis and modeling. Thus a wide variety of computational problems can be addressed in a single programming environment. The idea is to empower advanced undergraduates and beginning graduate students by allowing them to design and implement their own analytical tools. As students advance in their research careers, they will have achieved the fluency required to understand and adapt more specialized tools as opposed to treating them as 'black boxes'. Virtually all computational approaches in the book are covered by using genuine experimental data that are either collected as part of the lab project or were collected in the labs of the authors, providing the casual student with the look and feel of real data. In some rare cases, published data from classical papers are used to illustrate important concepts, giving students a computational understanding of critically important research. The ability to effectively use computers in research is necessary in an academic environment that is increasingly focused on quantitative issues. Matlab represents an ideal language of scientific computing. It is based on powerful linear algebra structures which lend themselves to empirical problems on the one hand, while at the same time allowing the student to make rapid problem-oriented progress (particularly in terms of visualization of data points) without having to lose focus by worrying too much about memory allocation and other 'plumbing' minutiae as would be required in other, more low-level programming languages such as C or C++. Currently, there are several books that provide introductions to Matlab that are either too generic and fundamental or too irrelevant for neuroscientists and cognitive psychologists who typically face a very circumscribed range of problems in data collection, data analysis and signal processing. Some non-book tutorials and primers that are in use in the community are typically out of date. Matlab versions are usually not backwards compatible. Many commands and functions used in older tutorials and primers, such as 'flops' won't work in current versions of Matlab, necessitating a book that is timely and up-to-date. The complete lack of a relevant resource in this area, combined with a clearly felt need for such a text provided the primary and initial impetus for this project. The authors provide such a dearly needed resource adapting and pooling materials that developed for and used in highly rated courses involving the use of Matlab in Neuroscience at the University of Chicago. Two co-authors (PW and NH) have presented their respective work on teaching Matlab at national meetings and two of the co-authors (PW and MB) were awarded the coveted University of Chicago's Booth Prize for excellence in teaching these courses. Features include: the first comprehensive textbook on Matlab with a focus for its application in Neuroscience; problem based educational approach with many examples from neuroscience and cognitive psychology using real data; authors are award winning educators with strong teaching experience; and, Instructor's Website with figurebank, additional problems and examples, solutions, etc.
(source: Nielsen Book Data)

• Argumentation. Analysis of dialogical argumentation via finite state machines / Anthony Hunter
• What Can Argumentation Do for Inconsistent Ontology Query Answering? / Madalina Croitoru and Srdjan Vesic
• Enforcement in Argumentation is a kind of Update / Pierre Bisquert, Claudette Cayrol and Florence Dupin de Saint-Cyr
• A Conditional Logic-Based Argumentation Framework / Philippe Besnard, Éric Grégoire and Badran Raddaoui
• Modelling Uncertainty in Persuasion / Anthony Hunter
• On the implementation of a multiple output algorithm for defeasible argumentation / Teresa Alsinet ... et al.
• A formal characterization of the outcomes of rule-based argumentation systems / Leila Amgoud and Philippe Besnard
• Bimodal Graphs for Meta-Argumentation with Argument Schemes / Jann Müller, Anthony Hunter and Philip Taylor
• Efficiently Estimating the Probability of Extensions in Abstract Argumentation / Bettina Fazzinga, Sergio Flesca and Francesco Parisi
• AFs with Necessities : Further Semantics and Labelling Characterization / Farid Nouioua
• Ranking-based semantics for argumentation frameworks / Leila Amgoud and Jonathan Ben-Naim
• A Logical Theory about Dynamics in Abstract Argumentation / Richard Booth ... et al.

• Belief Functions, Possibility Theory and their Applications. Sound Source Localization from Uncertain Information using the Evidential EM Algorithm / Xun Wang ... et al.
• An Improvement of Subject Reacquisition by Reasoning and Revision / Jianbing Ma ... et al.
• Belief Functions: a Revision of Plausibility Conflict and Pignistic Conflict / Milan Daniel
• Bipolar possibility theory as a basis for a logic of desires and beliefs / Didier Dubois, Emiliano Lorini and Henri Prade
• Databases. A New Class of Lineage Expressions over Probabilistic Databases computable in P-time / Batya Kenig, Avigdor Gal and Ofer Strichman
• The Semantics of Aggregate Queries in Data Exchange Revisited / Phokion G. Kolaitis and Francesca Spezzano
• PossDB: An Uncertainty Database Management System / Gösta Grahne, Adrian Onet and Nihat Tartal
• Aggregate Count Queries in Probabilistic Spatio-Temporal Databases / John Grant, Cristian Molinaro and Francesco Parisi.

• Intelligent Data Analytics. Approximate Reasoning about Generalized Conditional Independence with Complete Random Variables / Sebastian Link
• Combinatorial Prediction Markets: An Experimental Study / Walter A. Powell ... et al.
• A scalable learning algorithm for kernel probabilistic classifier / Mathieu Serrurier and Henri Prade
• Logics, Description Logic, and Semantic Web. Privacy-Preserving Social Network Publication Based on Positional Indiscernibility / Tsan-sheng Hsu, Churn-Jung Liau and Da-Wei Wang
• On the implementation of a fuzzy DL solver over infinite-valued product logic with SMT solvers / Teresa Alsinet ... et al.
• On the Merit of Selecting Different Belief Merging Operators / Pilar Pozos-Parra, Kevin McAreavey and Weiru Liu
• Possibilistic DL-Lite / Salem Benferhat and Zied Bouraoui
• Group Preferences for Query Answering in Datalog+/- Ontologies / Thomas Lukasiewicz ... et al.
• Reasoning with Semantic-Enabled Qualitative Preferences. / Tommaso Di Noia, Thomas Lukasiewicz and Gerardo I. Simari.

This book constitutes the refereed proceedings of the 7th International Conference on Scalable Uncertainty Management, SUM 2013, held in Washington, DC, USA, in September 2013. The 26 revised full papers and 3 revised short papers were carefully reviewed and selected from 57 submissions. The papers cover topics in all areas of managing and reasoning with substantial and complex kinds of uncertain, incomplete or inconsistent information including applications in decision support systems, machine learning, negotiation technologies, semantic web applications, search engines, ontology systems, information retrieval, natural language processing, information extraction, image recognition, vision systems, data and text mining, and the consideration of issues such as provenance, trust, heterogeneity, and complexity of data and knowledge.
(source: Nielsen Book Data)

• Meaningful Models / Christiano Braga, Cássio Santos
• Deductive Generalization / Kenneth L. McMillan
• Unifying Theories of Logic and Specification / Victor Bandur, Jim Woodcock
• Institution-Based Semantics for MOF and QVT-Relations / Daniel Calegari, Nora Szasz
• Derivation and Verification of Parallel Components for the Needs of an HPC Cloud / Thiago Braga Marcilon
• An Executable Semantics for a Multimedia Authoring Language / Joel dos Santos, Christiano Braga
• On the Use of SPIN for Studying the Behavior of Nested Petri Nets / Mirtha Lina Fernández Venero
• Specifying a Linked Data Structure in JML for Formal Verification and Runtime Checking / Christoph Gladisch, Shmuel Tyszberowicz
• Toward the Revision of CTL Models through Kripke Modal Transition Systems / Paulo T. Guerra, Aline Andrade
• Formal Analysis of Information Flow Using Min-Entropy and Belief Min-Entropy / Ghassen Helali, Osman Hasan, Sofiène Tahar
• Theorem Proving Graph Grammars: Strategies for Discharging Proof Obligations / Luiz Carlos Lemos Junior
• A Refinement Framework for Autonomous Agents / Qin Li, Graeme Smith
• A Formal Semantics for SysML Activity Diagrams / Lucas Lima, André Didier, Márcio Cornélio
• Formal Analysis of Memory Contention in a Multiprocessor System / Liya Liu, Osman Hasan, Sofiène Tahar
• Algebraic Graph Transformations with Inheritance / Michael Löwe, Harald König, Christoph Schulz
• Generating Protocol Software from CPN Models Annotated with Pragmatics / Kent Inge Fagerland Simonsen.

This book constitutes the refereed proceedings of the 16th Brazilian Symposium on Formal Methods, SBMF 2013, held in Brasilia, Brazil, in September/October 2013. The 14 revised full papers presented together with 2 keynotes were carefully reviewed and selected from 29 submissions. The papers presented cover a broad range of foundational and methodological issues in formal methods for the design and analysis of software and hardware systems as well as applications in various domains.

• Physics. Constraints on the Two-Flavour QCD Phase Diagram from Imaginary Chemical Potential / O. Philipsen, Ph. de Forcrand
• Parallel Computer Algebra and Feynman Integrals / P.A. Baikov, K.G. Chetyrkin, J.H. Kühn, P. Marquard, M. Steinhauser, T. Ueda
• Electronic and Optical Excitations of Aminopyrimidine Molecules from Many-Body Perturbation Theory / A. Riefer, M. Rohrmüller, M. Landmann, S. Sanna, E. Rauls, U. Gerstmann, W.G. Schmidt
• Spinodal Decomposition Kinetics of Colloid-Polymer Mixtures Including Hydrodynamic Interactions / Alexander Winkler, Peter Virnau, Kurt Binder
• Multi Relaxation Time Lattice Boltzmann Simulations of Multiple Component Fluid Flows in Porous Media / Sebastian Schmieschek, Ariel Narváez, Jens Harting
• Simulation of Pre-planetesimal Collisions with Smoothed Particle Hydrodynamics II / R.J. Geretshauser, F. Meru, K. Schaal, R. Speith, W. Kley
• The Stellar IMF at Very Low Metallicities / Gustavo Dopcke, Simon C.O. Glover, Paul C. Clark, Ralf S. Klessen.

• The SuperN-Project: Porting and Optimizing VERTEX-PROMETHEUS on the Cray XE6 at HLRS for Three-Dimensional Simulations of Core-Collapse Supernova Explosions of Massive Stars / F. Hanke, A. Marek, B. Müller, H.-Th. Janka
• Stability of the Strongest Magnetic Fields / Konstantinos D. Kokkotas, Burkhard Zink, Paul Lasky
• Solid State Physics. Molecular Dynamics Simulations of Laser Ablation in Metals: Parameter Dependence, Extended Models and Double Pulses / Johannes Roth, Johannes Karlin, Marc Sartison, Armin Krauß, Hans-Rainer-Trebin
• Electronic Surface Properties of Transparent Conducting Oxides: An Ab Initio Study / B. Höffling, F. Bechstedt
• Surface Magnetism: Relativistic Effects at Semiconductor Interfaces and Solar Cells / U. Gerstmann, M. Rohrmüller, N.J. Vollmers, A. Konopka, S. Greulich-Weber, E. Rauls
• Ab-Initio Calculations of the Vibrational Properties of Nanostructures / Gabriel Bester, Peng Han.

• Reacting Flows. Conservative Implementation of LES-CMC for Turbulent Jet Flames / P. Siwaborworn, A. Kronenburg
• Numerical Investigation of a Complete Scramjet Demonstrator Model for Experimental Testing Under Flight Conditions / Yann Simsont, Peter Gerlinger, Manfred Aigner
• Application of the Unified Turbulent Flame-Speed Closure (UTFC) Combustion Model to Numerical Computation of Turbulent Gas Flames / Feichi Zhang, Peter Habisreuther, Henning Bockhorn
• Lagrangian Approach for the Prediction of Slagging and Fouling in Pulverized Coal Combustion / Olaf Lemp, Uwe Schnell, Günter Scheffknecht
• Computational Fluid Dynamics. Discontinuous Galerkin for High Performance Computational Fluid Dynamics / Christoph Altmann, Andrea Beck, Andreas Birkefeld, Gregor Gassner, Florian Hindenlang
• Computational Aeroacoustics with Higher Order Methods / E. Rebecca Busch, Michael S. Wurst, Manuel Keßler, Ewald Krämer
• Effects of an Oblique Roughness on Hypersonic Boundary-Layer Transition / Gordon Groskopf, Markus J. Kloker.

• Effect of Wall Roughness Seen by Particles in Turbulent Channel and Pipe Flows / Michael Breuer, Michael Alletto
• Large-Eddy Simulation of Supersonic Film Cooling at Incident Shock-Wave Interaction / Martin Konopka, Matthias Meinke, Wolfgang Schröder
• Large-Eddy Simulations of Stratified and Non-stratified T-junction Mixing Flows / David Klören, Eckart Laurien
• Simulation of Compressible Viscous Flow with an Immersed Boundary Method / B. Jastrow, F. Magagnato
• Numerical and Experimental Examination of Shock Control Bump Flow Physics / K. Nübler, S.P. Colliss, T. Lutz, H. Babinsky, E. Krämer
• Water Droplet Flow Paths and Droplet Deposition in Low Pressure Steam Turbines / J. Starzmann, M.V. Casey, J.F. Mayer
• MPC and Coarray Fortran: Alternatives to Classic MPI Implementations on the Examples of Scalable Lattice Boltzmann Flow Solvers / Markus Wittmann, Georg Hager, Gerhard Wellein, Thomas Zeiser, Bettina Krammer.

• Transport and Climate. Modelling Near Future Regional Climate Change for Germany and Africa / H.-J. Panitz, G. Fosser, R. Sasse, A. Sehlinger, H. Feldmann, G. Schädler
• Setting Up Regional Climate Simulations for Southeast Asia / Patrick Laux, Van Tan Phan, Christof Lorenz, Tran Thuc, Lars Ribbe, Harald Kunstmann
• The Agulhas System as a Key Region of the Global Oceanic Circulation / J.V. Durgadoo, A. Biastoch
• Numerical Investigation of Stratified Turbulence / S. Remmler, S. Hickel
• Miscellaneous Topics. Software Framework ug4: Parallel Multigrid on the Hermit Supercomputer / Ingo Heppner, Michael Lampe, Arne Nägel, Sebastian Reiter, Martin Rupp, Andreas Vogel
• Simulation of Liquid-Liquid Equilibria with Molecular Models Optimized to Vapor-Liquid Equilibria and Model Development for Hydrazine and Two of Its Derivatives / Stefan Eckelsbach, Thorsten Windmann, Ekaterina Elts, Jadran Vrabec
• A Particle-in-Cell Method to Model the Influence of Partial Melt on Mantle Convection / Ana-Catalina Plesa, Doris Breuer, Tilman Spohn.

• A Forward Model of Mantle Convection with Evolving Continents and a Model of the Andean Subduction Orogen / Uwe Walzer, Roland Hendel, Christoph Köstler, Markus Müller, Jonas Kley
• Euler Deconvolution of GOCE Gravity Gradiometry Data / M. Roth, N. Sneeuw, W. Keller
• Parameterization of Threshold Accepting: The Case of Economic Capital Allocation / H.-P. Burghof, J. Müller
• Distributed FE Analysis of Multiphase Composites Regarding 3D Elasticity Problems / Kai Schrader, Carsten Könke
• Reduction of Numerical Sensitivities in Crash Simulations on HPC-Computers (HPC-10) / Christiana Eck, Oliver Mangold, Raphael Prohl, Anton Tkachuk
• Characterization of Carrier Sense Multiple Access in Vehicular Propagation Channels / J. Mittag, H. Hartenstein
• HMDB51: A Large Video Database for Human Motion Recognition / Hilde Kuehne, Hueihan Jhuang, Rainer Stiefelhagen, Thomas Serre
• Efficient Parallelization of a Three-Dimensional High-Order Particle-in-Cell Method Applied to Gyrotron Resonator Simulations / J. Neudorfer, A. Stock, T. Stindl, R. Schneider, S. Roller, C.-D. Munz.

This book presents the state-of-the-art in simulation on supercomputers. Leading researchers present results achieved on systems of the High Performance Computing Center Stuttgart (HLRS) for the year 2012. The reports cover all fields of computational science and engineering ranging from CFD via computational physics and chemistry to computer science with a special emphasis on industrially relevant applications. Presenting results for both vector-systems and micro-processor based systems the book allows to compare performance levels and usability of various architectures. As HLRS operates not only a large cluster system but also one of the largest NEC vector systems in the world this book gives an excellent insight also into the potential of vector systems. The book covers the main methods in high performance computing. Its outstanding results in achieving highest performance for production codes are of particular interest for both the scientist and the engineer. The book comes with a wealth of coloured illustrations and tables of results.
(source: Nielsen Book Data)

• Invited Talk Paper. Market Approach to Social Ads: The MyLikes Example and Related Problems / Darja Krushevskaja, S. Muthukrishnan
• Session 1A: Computational Geometry I. Geodesic-Preserving Polygon Simplification / Oswin Aichholzer, Thomas Hackl, Matias Korman [and others]
• Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information / Jinhee Chun, Ricardo Garcia de Gonzalo, Takeshi Tokuyama
• On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs / Sergey Bereg, Seok-Hee Hong, Naoki Katoh [and others]
• Structure and Computation of Straight Skeletons in 3-Space / Franz Aurenhammer, Gernot Walzl
• Session 1B: Pattern Matching. Pattern Matching with Non Overlapping Reversals -- Approximation and On-line Algorithms / Amihood Amir, Benny Porat
• Single and Multiple Consecutive Permutation Motif Search / Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
• Beating O(nm) in Approximate LZW-Compressed Pattern Matching / Paweł Gawrychowski, Damian Straszak
• Less Space: Indexing for Queries with Wildcards / Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan.

• Session 2A: Computational Complexity I. On Determining Deep Holes of Generalized Reed-Solomon Codes / Qi Cheng, Jiyou Li, Jincheng Zhuang
• Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes / Yota Otachi, Pascal Schweitzer
• Determinantal Complexities and Field Extensions / Youming Qiao, Xiaoming Sun, Nengkun Yu
• Session 2B: Internet and Social Network Algorithms I. Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs / Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
• Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs / Marc Lelarge, Hang Zhou
• The Complexity of Finding a Large Subgraph under Anonymity Constraints / Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger.

• Session 3A: Graph Theory and Algorithms I. On the Number of Edges of Fan-Crossing Free Graphs / Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim
• Cops and Robbers on Intersection Graphs / Tomás Gavenčiak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
• SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs / Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson
• Hardness and Algorithms for Variants of Line Graphs of Directed Graphs / Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
• Session 3B: Scheduling Algorithms. Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds / Michael Etscheid
• Better Bounds for Online k-Frame Throughput Maximization in Network Switches / Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki
• The Solvable Cases of a Scheduling Algorithm / Sam Walker, Yakov Zinder.

• Session 4A: Computational Complexity II. Exact Sublinear Binomial Sampling / Martín Farach-Colton, Meng-Tsung Tsai
• Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas / Dominik Scheder
• Dynamic Point Labeling is Strongly PSPACE-Complete / Kevin Buchin, Dirk H.P. Gerrits
• Unsatisfiable CNF Formulas contain Many Conflicts / Dominik Scheder
• Session 4B: Computational Geometry II. Pursuit Evasion on Polyhedral Surfaces / Kyle Klein, Subhash Suri
• Algorithms for Tolerated Tverberg Partitions / Wolfgang Mulzer, Yannik Stein
• Abstract Voronoi Diagrams with Disconnected Regions / Cecilia Bohler, Rolf Klein
• Terrain Visibility with Multiple Viewpoints / Ferran Hurtado, Maarten Löffler, Inês Matos [and others].

• Session 5A: Graph Theory and Algorithms II. Exact Algorithms for Maximum Independent Set / Mingyu Xiao, Hiroshi Nagamochi
• On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs / Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary [and others]
• Testing Mutual Duality of Planar Graphs / Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
• Session 5B: Fixed-Parameter Tractable Algorithms. Effective and Efficient Data Reduction for the Subset Interconnection Design Problem / Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier [and others]
• Myhill-Nerode Methods for Hypergraphs / René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
• Augmenting Graphs to Minimize the Diameter / Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson.

• Session 6A: Algorithms and Data Structures I. Top-k Document Retrieval in Compact Space and Near-Optimal Time / Gonzalo Navarro, Sharma V. Thankachan
• Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers / Timothy M. Chan, J. Ian Munro, Venkatesh Raman
• Trajectory-Based Dynamic Map Labeling / Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
• Session 6B: Internet and Social Network Algorithms II. Asynchronous Rumor Spreading on Random Graphs / Konstantinos Panagiotou, Leo Speidel
• Unit Cost Buyback Problem / Yasushi Kawase, Xin Han, Kazuhisa Makino
• Faster Rumor Spreading with Multiple Calls / Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald.

• Session 7A: Algorithmic Game Theory. Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy / Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen
• Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items / Kazuo Murota, Akiyoshi Shioura, Zaifu Yang
• New Results on the Online Pricing Problem / Xiangzhong Xiang
• Session 7B: Algorithms and Data Structures II. RAM-Efficient External Memory Sorting / Lars Arge, Mikkel Thorup
• Succinct Data Structures for Representing Equivalence Classes / Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
• Sliding Bloom Filters / Moni Naor, Eylon Yogev.

• Session 8A: Graph Theory and Algorithms III. Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs / C. Gregory Plaxton
• Bounded Representations of Interval and Proper Interval Graphs / Martin Balko, Pavel Klavík, Yota Otachi
• Detecting and Counting Small Pattern Graphs / Peter Floderus, Mirosław Kowaluk, Andrzej Lingas, Eva-Marta Lundell
• An O *(1.1939 n) Time Algorithm for Minimum Weighted Dominating Induced Matching / Min Chih Lin, Michel J. Mizrahi, Jayme L. Szwarcfiter
• Session 8B: Approximation Algorithms I. New Inapproximability Bounds for TSP / Marek Karpinski, Michael Lampis, Richard Schmied
• Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise / Bodo Manthey, Rianne Veenstra
• Tight Approximation Bounds for Connectivity with a Color-Spanning Set / Chenglin Fan, Jun Luo, Binhai Zhu
• The Train Delivery Problem Revisited / Jing Chen, He Guo, Xin Han, Kazuo Iwama.

• Session 9A: Computational Geometry III. The Distance 4-Sector of Two Points Is Unique / Robert Fraser, Meng He, Akitoshi Kawamura [and others]
• The Number of Different Unfoldings of Polyhedra / Takashi Horiyama, Wataru Shoji
• Computing the Smallest Color-Spanning Axis-Parallel Square / Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi
• Session 9B: Approximation Algorithms II. Euclidean Traveling Salesman Tours through Stochastic Neighborhoods / Pegah Kamousi, Subhash Suri
• Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure / Angsheng Li, Pan Peng
• Approximate Čech Complex in Low and High Dimensions / Michael Kerber, R. Sharathkumar.

• Session 10A: Computational Complexity III. Model Counting for Formulas of Bounded Clique-Width / Friedrich Slivovsky, Stefan Szeider
• Computing Plurality Points and Condorcet Points in Euclidean Space / Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao
• Computing Minimum Tile Sets to Self-Assemble Color Patterns / Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki
• Session 10B: Network Algorithms. A Probabilistic Analysis of Kademlia Networks / Xing Shi Cai, Luc Devroye
• Approximating the Generalized Minimum Manhattan Network Problem / Aparna Das, Krzysztof Fleszar, Stephen Kobourov [and others]
• Minmax Regret 1-Facility Location on Uncertain Path Networks / Haitao Wang.

This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.

• Invited Talks.- A New Analysis of Expected Revenue.- Can Component/Service-Based Systems Be Proved Correct?.- Probabilistic Acceptors for Languages over Infinite Words.- Automatic Verification of Heap Manipulation Using Separation Logic.- Technology Diffusion in Social Networks.- Service Oriented Architecture Pitfalls.- Algorithms for Solving Infinite Games.- Randomness and Determination, from Physics and Computing towards Biology.- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures.- Regular Papers.- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems.- Framed Versus Unframed Two-Dimensional Languages.- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes.- The Shortcut Problem - Complexity and Approximation.- Green Computing: Energy Consumption Optimized Service Hosting.- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems.- Epistemic Strategies and Games on Concurrent Processes.- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures.- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay.- Time and Fairness in a Process Algebra with Non-blocking Reading.- Expressiveness of Multiple Heads in CHR.- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes.- A Framework for Mutant Genetic Generation for WS-BPEL.- Implementing Services by Partial State Machines.- Pattern Matching with Swaps for Short Patterns in Linear Time.- Automatic Bug Detection in Microcontroller Software by Static Program Analysis.- On the Unification of Process Semantics: Observational Semantics.- Factoring and Testing Primes in Small Space.- Adaptive Incentive-Compatible Sponsored Search Auction.- Semantically-Aided Data-Aware Service Workflow Composition.- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time.- Abstract Storage Devices.- On Stateless Deterministic Restarting Automata.- User Care Preference-Based Semantic Service Discovery in a Ubiquitous Environment.- Safe Reasoning with Logic LTS.- Partial Order Semantics of Types of Nets.- A Problem Kernelization for Graph Packing.- -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games.- Conjunctive Grammars with Restricted Disjunction.- Modelling and Verifying Mobile Systems Using ?-Graphs.- On Some SAT-Variants over Linear Formulas.- The Simple Reachability Problem in Switch Graphs.- Unambiguous Erasing Morphisms in Free Monoids.- An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA.- Asynchronous Deterministic Rendezvous on the Line.- Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image Manipulation.- Group Input Machine.- From Outermost Termination to Innermost Termination.- Improved Algorithms for the 2-Vertex Disjoint Paths Problem.- Event-Clock Visibly Pushdown Automata.- A Machine Checked Soundness Proof for an Intermediate Verification Language.- Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams.- Symbolic Reachability Analysis of Integer Timed Petri Nets.- On Toda's Theorem in Structural Communication Complexity.- The Minimum Reload s-t Path/Trail/Walk Problems.- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression.- A New Family of Regular Operators Fitting with the Position Automaton Computation.- A Formal Model of Business Application Integration from Web Services (Position Paper).
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in Spindleruv Mlyn, Czech Republic, in January 2009. The 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. SOFSEM 2009 was organized around the following four tracks: Foundations of Computer Science; Theory and Practice of Software Services; Game Theoretic Aspects of E-commerce; and Techniques and Tools for Formal Verification.
(source: Nielsen Book Data)

• Preliminaries.- Projective Dependency Structures.- Dependency Structures of Bounded Degree.- Dependency Structures without Crossings.- Structures and Grammars.- Regular Dependency Languages.- Generative Capacity and Parsing Complexity.- Conclusion.
• (source: Nielsen Book Data)

Since 2002, FoLLI has awarded an annual prize for outstanding dissertations in the fields of Logic, Language and Information. This book is based on the PhD thesis of Marco Kuhlmann, joint winner of the E.W. Beth dissertation award in 2008. Kuhlmann's thesis lays new theoretical foundations for the study of non-projective dependency grammars. These grammars are becoming increasingly important for approaches to statistical parsing in computational linguistics that deal with free word order and long-distance dependencies. The author provides new formal tools to define and understand dependency grammars, presents two new dependency language hierarchies with polynomial parsing algorithms, establishes the practical significance of these hierarchies through corpus studies, and links his work to the phrase-structure grammar tradition through an equivalence result with tree-adjoining grammars. The work bridges the gaps between linguistics and theoretical computer science, between theoretical and empirical approaches in computational linguistics, and between previously disconnected strands of formal language research.
(source: Nielsen Book Data)

• An Improvement to the OpenMP Version of BoomerAMG / Chunsheng Feng, Shi Shu and Xiaoqiang Yue
• Dynamic Partitioning of Scalable Cache Memory for SMT Architectures / Wu Jun-Min [and others]
• Scheduling Model of Virtual Machine Base on Task Type in Multi-core System / Hui-Xing Chen, Ken-Li Li and Lin Shi
• Dynamic Pricing Strategy for Cloud Computing with Data Mining Method / Xing Wu [and others]
• Detecting Communities and Corresponding Central Nodes in Large Social Networks / Shengyi Jiang and Meiling Wu
• The Design and Prototype Implementation of a Pipelined Heterogeneous Multi-core GPU / Junyong Deng [and others]
• A Parallel Approach for Real-Time OLAP Based on Node Performance Awareness / Wei He and Lizhen Cui
• A Parallel Multigrid Poisson PDE Solver for Gigapixel Image Editing / Zhenlong Du [and others]
• Parallel Implementation and Optimization of Haze Removal Using Dark Channel Prior Based on CUDA / Yungang Xue [and others]
• Research on the Solution of Heat Exchanger Network MINLP Problems Based on GPU / Mingxing Xia [and others]
• MapReduce-Based Parallel Algorithm for Detecting and Resolving of Firewall Policy Conflict / Qi Xiao, Yunchuan Qin and Kenli Li
• DPA-Resistant Algorithms for Trusted Computing System / Lang LI [and others]
• Detection of KVM's Virtual Environment and Vulnerability / Li Ruan [and others]
• Scalability Tests of a Finite Element Code on Hundreds of Thousands Cores and Heterogeneous Architecture / Jiangyong Ren [and others].

This book constitutes the refereed proceedings of the National Annual Conference on High Performance Computing, HPC 2012, held in Zhangjiajie, China, in October 2012. The 14 revised full papers presented were carefully reviewed and selected from 260 submissions. The papers address issues such as parallel architecture, GPU computing, resource scheduling, parallel algorithm, and performance evaluation.

• Finding One's Way in a World of Algorithms. Algorithms, An Historical Perspective / Giorgio Ausiello
• How to Design an Algorithm / Rossella Petreschi
• The One Million Dollars Problem / Alessandro Panconesi
• The Difficult Simplicity of Daily Life. The Quest for the Shortest Route / Camil Demetrescu and Giuseppe F. Italiano
• Web Search / Paolo Ferragina and Rossano Venturini
• Algorithms for Secure Communication / Alberto Marchetti-Spaccamela
• Algorithmics for the Life Sciences / Raffaele Giancarlo
• The Shortest Walk to Watch TV / Fabrizio Rossi, Antonio Sassano and Stefano Smriglio
• Algorithms for Auctions and Games / Vincenzo Bonifaci and Stefano Leonardi
• Randomness and Complexity / Riccardo Silvestri.

To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers. The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such as computability. The second chapter shows how the design of algorithms requires appropriate techniques and sophisticated organization of data. In the subsequent chapters the contributing authors present examples from diverse areas - such as routing and networking problems, Web search, information security, auctions and games, complexity and randomness, and the life sciences - that show how algorithmic thinking offers practical solutions and also deepens domain knowledge. The contributing authors are top-class researchers with considerable academic and industrial experience; they are also excellent educators and communicators and they draw on this experience with enthusiasm and humor. This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.
(source: Nielsen Book Data)

• The next frontier for user-centered design : making user representations more usable
• The persona lifecycle : a framework for the persona approach
• Phase 1: Family planning (planning a persona effort)
• Phase 2: Conception & gestation (creating personas)
• Phase 3: Birth & maturation (launching and communicating personas)
• Phase 4: Adulthood (using personas)
• Phase 5: Lifetime achievement and retirement (ROI and reuse of personas)
• Contributed chapters: Users, roles and personas / by Larry Constantine
• Storytelling and narrative / by Whitney Quesenbery
• Reality and design maps / by Tamara Adlin & Holly Jamesen
• Marketing versus design personas / by Bob Barlow-Busch
• Why personas work : the psychological evidence / by Jonathan Grudin
• Appendix A: G4K organizational archetype and sample persona
• Appendix B: Example personas from real projects
• Appendix C: Sample image release form.

• v. 1. Segmentation models, part A
• v. 2. Segmentation models, part B
• v. 3. Registration models.

• Invited Papers
• Well-Founded and Partial Stable Semantics Logical Aspects
• The Reachability Problem over Infinite Graphs
• Kolmogorov Complexity and Model Selection
• Automatic Verification of Heap-Manipulating Programs Using Separation Logic
• Accepted Papers
• Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
• Integrality Property in Preemptive Parallel Machine Scheduling
• Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
• k-SAT Is No Harder Than Decision-Unique-k-SAT
• Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Approximability Distance in the Space of H-Colourability Problems
• On Random Ordering Constraints
• Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
• A Feebly Secure Trapdoor Function
• Partitioning Graphs into Connected Parts
• Structural Complexity of AvgBPP
• Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
• Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
• One-Nonterminal Conjunctive Grammars over a Unary Alphabet
• Concatenation of Regular Languages and Descriptional Complexity
• Approximability of the Maximum Solution Problem for Certain Families of Algebras
• Complete Complexity Classification of Short Shop Scheduling
• Compressed Word Problems in HNN-Extensions and Amalgamated Products
• Variations on Muchnik's Conditional Complexity Theorem
• An Optimal Bloom Filter Replacement Based on Matrix Solving
• Aperiodicity Measure for Infinite Sequences
• On the Complexity of Matroid Isomorphism Problems
• Breaking Anonymity by Learning a Unique Minimum Hitting Set
• The Budgeted Unique Coverage Problem and Color-Coding
• Formal Verification of Gate-Level Computer Systems
• On Models of a Nondeterministic Computation
• New Plain-Exponential Time Classes for Graph Homomorphism
• Languages Recognized with Unbounded Error by Quantum Finite Automata.

This book constitutes the refereed proceedings of the Fourth International Computer Science Symposium in Russia, CSR 2009, held in Novosibirsk, Russia, August 18-23, 2009. The 29 revised papers presented together with 4 invited papers were carefully reviewed and selected from 66 submissions. All major areas in computer science are addressed. The theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory and applications of logic to computer science.