1  50
Next
2. A. Haar memorial conference [1987]
 A. Haar Memorial Conference (1985 : Budapest, Hungary)
 Amsterdam ; New York : NorthHolland ; New York, N.Y., U.S.A. : Elsevier Science Pub. Co., c1987.
 Description
 Book — 2 v. (1018 p.) : ill. ; 24 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks

Request (opens in new tab) 
QA7 .A46 1985 V.1  Available 
QA7 .A46 1985 V.2  Available 
 A4MMC (1st : 2010 : SaintMalo, France)
 Berlin ; New York : Springer, ©2011.
 Description
 Book — 1 online resource (xxvii, 378 pages) Digital: text file; PDF.
 Summary

 Accelerating AgentBased Ecosystem Models Using the Cell Broadband Engine
 Performance Impact of Task Mapping on the Cell BE Multicore Processor
 Parallelization Strategy for CELL TV
 Towards User Transparent Parallel Multimedia Computing on GPUClusters
 Implementing a GPU Programming Model on a NonGPU Accelerator Architecture
 On the Use of Small 2D Convolutions on GPUs
 Can Manycores Support the Memory Requirements of Scientific Applications?
 Parallelizing an Index Generator for Desktop Search
 Computation vs. Memory Systems: Pinning Down Accelerator Bottlenecks
 Trace Execution Automata in Dynamic Binary Translation
 ISAMAP: Instruction Mapping Driven by Dynamic Binary Translation
 Parallelization of Particle Filter Algorithms
 What Kinds of Applications Can Benefit from Transactional Memory?
 Characteristics of Workloads Using the Pipeline Programming Model
 The Search for EnergyEfficient Building Blocks for the Data Center
 KnightShift: Shifting the I/O Burden in Datacenters to Management Processor for Energy Efficiency
 Guarded Power Gating in a Multicore Setting
 Using Partial Tag Comparison in LowPower SnoopBased Chip Multiprocessors
 Achieving PowerEfficiency in Clusters without Distributed File System Complexity
 What Computer Architects Need to Know about Memory Throttling
 Predictive Power Management for Multicore Processors
 IOMMU: Strategies for Mitigating the IOTLB Bottleneck
 Improving Server Performance on Multicores via Selective OffLoading of OS Functionality
 Performance Characteristics of Explicit Superpage Support
 Interfacing Operating Systems and Polymorphic Computing Platforms Based on the MOLEN Programming Paradigm
 Extrinsic and Intrinsic Text Cloning
 A Case for Coordinated Resource Management in Heterogeneous Multicore Platforms
 TopologyAware QualityofService Support in Highly Integrated Chip Multiprocessors.
 AAAI Spring Symposium (2010 : Stanford University)
 Menlo Park, Calif. : AAAI Press, c2010.
 Description
 Book — ix, 202 p. : ill. ; 28 cm.
 Summary

 Preface / Michael Genesereth, Roland Vogl, and MaryAnne Williams
 Combining privacy and security risk assessment in security quality requirements engineering / Saeed AbuNimeh and Nancy R. Mead
 Information privacy and its value / Sabah AlFedaghi
 Privacy and international compliance : when differences become an issue / Dennys Antonialli
 Consumers : the missing piece in a piecemeal approach to privacy / Clark D. Asay
 Privacy in online social lending / Rainer Böhme and Stefanie Pötzsch
 Position and perspective of privacy laws in India / Bijan Brahmbhatt
 Ontological semantics for data privacy compliance : the NEURONA Project / Núria Casellas, JuanEmilio Nieto, Albert Moroño, Antoni Roig, Sergi Torralba, Mario Reyes, and Pompeu Casanovas
 The distinction between "privacy" and "personal information"issues of Personal Information Protection Act in Japan / Yeyoung Chang
 Modeling privacy requirements for quality manipulation of information on social networking sites / Shan Chen and MaryAnne Williams
 The web as a privacy lab / Richard Chow, Ji Fang, Philippe Golle, and Jessica Staddon
 The right to delete / Chris Conley
 Search query privacy : the problem of anonymization / Ron A. Dolin
 Radio frequency identification tags, memory spots, and the processing of personally identifiable information, and sensitive data: when there is no balance between right and wrong / Luca Escoffier
 Reasoning about the appropriate use of private data through computational workflows / Yolanda Gil and Christian Fritz
 Geospatial information services : balancing privacy and innovation / Nathaniel Jurist Gleicher and Jong Sung Hwang
 Personalized privacy policies : challenges for data loss prevention / Nathan Gnanasambandam and Jessica Staddon
 Influence of the "internet of things" on legislation regarding the protection of individual privacy / JeanFrançois Henrotte
 Privacy classification systems : recall and precision optimization as enabler of trusted information sharing / Christopher Hogan and Robert S. Bauer
 Application of an autonomous intelligent cyber entity as a veiled identity agent / Eran Kahana
 Enabling privacyawareness in social networks / Ted Kang and Lalana Kagal
 Mandatory enforcement of privacy policies using trusted computing principles / Frank Kargl, Florian Schaub, and Stefan Dietzel
 Wrap contracts and privacy / Nancy S. Kim
 Towards territorial privacy in smart environments / Bastian Könings, Florian Schaub, Michael Weber, and Frank Kargl
 Engineering privacy in an age of information abundance / Betsy Masiello and Alma Whitten
 Privacy and transparency / G. Randolph Mayes
 Privacy codes of practice for the social web : the analysis of existing privacy codes and emerging socialcentric privacy risks / Girma Nigusse and Bart De Decker
 Protecting reader privacy in digital books / Nicole A. Ozer and Jennifer A. Lynch
 Mobile networks and conflict management : farewell to privacy? / Marta Poblet and Sergi Torralba
 Privacy and social networks : from data protection to pervasive computing / Antoni Roig
 Forensic DNA profiles : database expansion, familial search, and a radical solution / Michael R. Seringhaus
 The problem of onward transfers under U.S. law / Raghu Seshadri
 Flash cookies and privacy / Ashkan Soltani, Shannon Canty, Quentin Mayo, Lauren Thomas and Chris Jay Hoofnagle
 Cloud privacy : normative standards for information privacy management within cloud computing / Robert Sprague
 How teenagers deal with their privacy on social network sites? : results from a national survey in France / Thomas Stenger and Alexandre Coutant
 Selfregulation and policy in the Spanish audiovisual sector : the Catalan code of best practices / Emma Teodoro, Núria Galera, and Pompeu Casanovas
 Protecting information privacy on the internet : legal framework in the EU / Faye Fangfei Wang
 Privacy in crosssystem personalization / Yang Wang and Alfred Kobsa
 Preprocessing legal text : policy parsing and isomorphic intermediate representation / K. Krasnow Waterman
 Selective privacy in a webbased world: challenges of representing and inferring context / K. Krasnow Waterman, Deborah L. McGuinness, and Li Ding
 The privacy paradox, or how I learned to have rights that never quite seem to work / Raffaele Zallone.
 Online
Law Library (Crown)
Law Library (Crown)  Status 

Basement  Request (opens in new tab) 
QA76.9 .A25 A17 2010  Unknown 
 Aaberg, Claes.
 Uppsala, 1972.
 Description
 Book — 53 leaves. 30 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA248 .A75 1972 F  Available 
 Aaboe, Asger.
 [New York] : L. W. Singer, [1963, c1964]
 Description
 Book — 1 online resource (x, 133 p. : ill., diagrs)
 Summary

 Chapter 1. Babylonian Mathematics Chapter 2. Early Greek Mathematics and Euclid's Construction of the Regular Pentagon Chapter 3. Three Samples of Archimedean Mathematics Chapter 4. Ptolemy's Construction of a Trigonometric Table Appendix
 AADIOS (Meeting) (5th : 2012 : Sofia, Bulgaria)
 Berlin : Springer, 2014.
 Description
 Book — 1 online resource (xii, 201 pages) Digital: text file; PDF.
 Summary

 Constructions of Free Commutative IntegroDifferential Algebras
 Basic Module Theory over Noncommutative Rings with Computational Aspects of Operator Algebras
 Operational Calculi for Nonlocal Cauchy Problems in Resonance Cases
 Intertwining Laplace Transformations of Linear Partial Differential Equations
 Composing and Factoring Generalized Green's Operators and Ordinary Boundary Problems
 Relativistic Coulomb Integrals and Zeilberger's Holonomic Systems Approach II
 Multivariate Dimension Polynomials of Inversive Difference Field Extensions
 Differential (Monoid) Algebra and More
 Exact Solution of Local and Nonlocal BVPs for the Laplace Equation in a Rectangle.
8. Algebraic algorithms and errorcorrecting codes : ... international conference, AAECC ... : proceedings [1985  1985]
 AAECC.
 Berlin ; New York : SpringerVerlag, c1986.
 Description
 Journal/Periodical — v. : ill. ; 25 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks

Request (opens in new tab) 
QA268 .A34 3RD 1985  Available 
9. Applicable algebra, errorcorrecting codes, combinatorics and computer algebra : proceedings [1986  1986]
 AAECC.
 Berlin ; New York : SpringerVerlag, c1988.
 Description
 Journal/Periodical — v. : ill. ; 25 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks

Request (opens in new tab) 
QA268 .A34 4TH 1986  Available 
 AAECC.
 Berlin ; New York : SpringerVerlag, 1989
 Description
 Journal/Periodical — v. ; 24 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks
BEGINNING WITH 2001, SUBSERIES CLASSED AS SEPARATES 
Request (opens in new tab) 
QA268 .A34 13TH 1999  Available 
QA268 .A34 12TH 1997  Available 
QA268 .A34 11TH 1995  Available 
QA268 .A34 10TH 1993  Available 
QA268 .A34 9TH 1991  Available 
QA268 .A34 8TH 1990  Available 
QA268 .A34 6TH 1988  Available 
QA268 .A34 5TH 1987  Available 
11. Applied algebra, algorithmics and errorcorrecting codes : ... international conference, AAECC ... : proceedings [1980  1984]
 AAECC.
 Berlin ; New York : SpringerVerlag, c1986.
 Description
 Journal/Periodical — v. : ill. ; 25 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks

Request (opens in new tab) 
QA268 .A34 2ND 1984  Available 
 AAECC10 (1993 : San Juan, P.R.)
 Berlin ; New York : SpringerVerlag, ©1993.
 Description
 Book — 1 online resource (x, 354 pages) : illustrations
 Summary

 Sequence based methods for data transmission and source compression / A.R. Calderbank, P.C. Fishburn, A. Rabinovich
 On the apparent duality of the Kerdock and Preparata codes / A.R. Hammons [and others]
 Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials / V. Levenshtein
 Systems of algebraic equations solved by means of endomorphisms / H.M. Moller
 Criteria for sequence set design in CDMA communications / R.A. Scholtz
 Using Groebner bases to determine the algebraic and transcendental nature of field extensions: return of the killer tag variables / M. Sweedler
 A "divide and conquer" algorithm for HilbertPoincare series, multiplicity and dimension of monomial ideals / A.M. Bigatti [and others]
 An efficient algorithm for the sparse mixed resultant / J.F. Canny, I. Emiris
 Some features of binary block codes for correcting asymmetric errors / G. Fang [and others]
 Fixedparameter complexity and cryptography / M.R. Fellows, N. Koblitz
 A class of algebraic geometric codes from curves in highdimensional projective spaces / G.L. Feng, T.R.N. Rao
 A new class of sequences / G. Gong
 A zerotest and an interpolation algorithm for the shifted sparse polynomials / D. Grigoriev, M. Karpinski
 Parallelization of quantifier elimination on a workstation network / H Hong
 Hyperplane sections of fermat varieties in P³ in char. 2 and some applications to cyclic codes / H. Janwa, R.M. Wilson
 Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems / E. Kaltofen
 Relations among lie formal series and construction of symplectic integrators / P.V. Koseleff
 Exponential sums as discrete Fourier transform with invariant phase functions / G. Lachaud
 Application of finite fields to memory interleaving / A. Lempel, G. Seroussi
 An elementary proof of a partial improvement to the AxKatz theorem / O. Moreno, C.J. Moreno
 Energy functions associated with errorcorrecting codes / C. Renteria, H. TapiaRecillas
 On determining all codes in semisimple group rings / R.E. Sabin
 On hyperbolic cascaded ReedSolomon codes / K. Saints, C. Heegard
 Peakshift and bit errorcorrection with channel side information in runlengthlimited sequences / Y. Saitoh, I. Ibe, H. Imai
 On a third order differential equation whose differential galois group is the simple group of 168 elements / M.F. Singer, F. Ulmer
 Approximating the number of error locations within a constant ratio is NPcomplete / J. Stern
 Two chosen plaintext attacks on the Liwang joint authentication and encryption scheme / J. van Tilburg
 Some constructions of perfect binary codes / A. Vardy, T. Etzion.
 AAECC11 (1995 : Paris, France)
 Berlin ; New York : SpringerVerlag, 1995.
 Description
 Book — 1 online resource (xi, 484 pages) : illustrations
 Summary

 Supports of a code. Chemical isomerism, a challenge for algebraic combinatorics and for computer science. On algebraic methods in covering radius problems. How lower and upper complexity bounds meet in elimination theory. Bivariate polynomial multiplication patterns. Division of entire functions by polynomial ideals. Variations on minimal codewords in linear codes. On the computation of the radical of polynomial complete inter
 section ideals. Which families of long binary linear codes have a binomial weight distribution?. The discovery of simple 7designs with automorphism group P?L(2, 32). Fast exponentation in cryptography. On maximal spherical codes I. Formal computation of Galois groups with relative resolvents. A case of automatic theorem proving in Euclidean geometry: the Maclane 83 theorem. Isometry classes of indecomposable linear codes. When polynomial equation systems can be "solved" fast?. Using symmetric functions to describe the solution set of a zero dimensional ideal. Triangular systems and factorized Groebner bases. Computation in algebraic function fields for effective construction of algebraicgeometric codes. Singlyeven selfdual codes and Hadamard matrices. Implicitization of curves parameterized by generalized trigonometric polynomials. Randomness properties of partial ?  ? planes as LSI test inputs and their implementations. Mixed covering codes with two binary and four ternary coordinates. About approximations of exponentials. A note on normal bases. On the covering radius of long Goppa codes. Integration of multivariate rational functions given by straightline programs. Polynomial gcd computations over towers of algebraic extensions. Displacements of matrix products. Testing identities of series defined by algebraic partial differential equations. The complexity of formal resolution of linear partial differential equations. A fast parallel implementation of the BerlekampMassey algorithm with a 1D systolic array architecture. Tomography of constructible functions. On the determination of formal solutions of a system of partial differential equations. D 4, E 6, E 8 and the AGM. Computation of the Galois groups of the resolvent factors for the direct and inverse Galois problems. First integrals and Darboux polynomials of homogeneous linear differential systems.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAECC12 (1997 : Toulouse, France)
 Berlin ; New York : Springer, 1997.
 Description
 Book — 1 online resource (x, 352 pages) : illustrations
 Summary

 Minimun distance decoding algorithms for linear codes. Efficient multivariate factorization over finite fields. On maximal codes in polynomial metric spaces. Yet another ideal decomposition algorithm. A resultant theory for ordinary algebraic differential equations. The symmetry group of ? q n in the Lee space and the ? q nlinear codes. On repeatedroot cyclic codes and the twoway chain condition. Exponentiation in finite fields: Theory and practice. Computing minimumlink path in a homotopy class amidst semialgebraic obstacles in the plane. Certain selfdual codes over ?4 and the odd Leech lattice. Order functions and evaluation codes. Codes from cocycles. A brief tour of split linear programming. Elementary approximation of exponentials of Lie polynomials. On the qary image of cyclic codes. The split weight (w L , w R ) enumeration of ReedMuller codes for w L +w R d min. Optimal linear codes of dimension 4 over GF(5). Characterisations of lexicographic sets and simplyconnected Hilbert schemes. An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance. Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach. Formal duality of linearly presentable codes over a Galois field. Tracefunction on a Galois ring in coding theory. A vector version of the BMS algorithm for implementing fast erasureanderror decoding of onepoint AG codes. On generalized Hamming weights of codes constructed on affine algebraic sets. Some results on regular mappings. Extension theorems for linear codes over finite rings. Nonperiodic cyclic equivalence classes of cyclic codes and algebraic constructions of cyclically permutable codes.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAECC13 (1999 : Honolulu, Hawaii)
 Berlin ; New York : Springer, ©1999.
 Description
 Book — 1 online resource (xiii, 510 pages) : illustrations Digital: text file.PDF.
 Summary

 Invited Papers. Codes on Graphs: A Survey for Algebraists. RA Codes Achieve AWGN Channel Capacity. Monomial Ideals and Planar Graphs. A Fast Program Generator of Fast Fourier Transforms. On Integer Programming Problems Related to SoftDecision Iterative Decoding Algorithms. Curves with Many Points and Their Applications. Codes and Iterative Decoding. New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity. On the Theory of LowDensity Convolutional Codes. Combinatorics I: Arithmetic. On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. A New Representation of Boolean Functions. Combinatorics II: Graphs and Matrices. An Algorithm to Compute a Nearest Point in the Lattice A n * . Sequences from Cocycles. Block Codes I. On the Second Greedy Weight for Binary Linear Codes. On the Size of Identifying Codes. Algebra I: Rings and Fields. Fast Quantum Fourier Transforms for a Class of Nonabelian Groups. Linear Codes and Rings of Matrices. On ?4Simplex Codes and Their Gray Images. Decoding Methods. Some Results on Generalized Concatenation of Block Codes. Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping. An Optimality Testing Algorithm for a Decoded Codeword of Binary Block Codes and Its Computational Complexity. Algebra II. Recursive MDSCodes and Pseudogeometries. Strength of ISTY1 without FL Function for Higher Order Differential Attack. Code Construction. Quantum ReedSolomon Codes. Capacity Bounds for the 3Dimensional (0, 1) Runlength Limited Channel. Rectangular Codes and Rectangular Algebra. Codes and Algebra I: Algebraic Curves. Decoding Hermitian Codes with Sudan's Algorithm. Computing a Basis of
 on an affine algebraic curve with one rational place at infinit. Cryptography. Critical Noise for Convergence of Iterative Probabilistic Decoding with Belief Propagation in Cryptographic Applications. An Authentication Scheme over Nonauthentic Public Channel in InformationTheoretic SecretKey Agreement. Codes and Decoding. A Systolic Array Architecture for Fast Decoding of OnePoint AG Codes and Scheduling of Parallel Processing on It. Convolutional Codes. Computing Weight Distributions of Convolutional Codes Via Shift Register Synthesis. Properties of Finite Response Input Sequences of Recursive Convolutional Codes. Combinatorics III: Designs. Lower Bounds for Group Covering Designs. Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices. Decoding of Block Codes. Double Circulant SelfDual Codes Using FiniteField Wavelet Transforms. Algebra III: Rings and Fields. Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey). Calculating Generators for Invariant Fields of Linear Algebraic Groups. Constructing Elements of Large Order in Finite Fields. Modulation and Codes. New Lower Bounds on the Periodic Crosscorrelation of QAM Codes with Arbitrary Energy. Conjectures on the Size of Constellations Constructed from Direct Sums of PSK Kernels. Codes and Algebra II: Groebner Bases and AG Codes. A New Criterion for Normal Form Algorithms. Discrete Fourier Transform and Groebner Bases. Block Codes II. On the State Complexities of Ternary Codes. Binary Optimal Linear Rate 1/2 Codes. On Binary/Ternary ErrorCorrecting Codes with Minimum Distance 4. Algebra IV: Polynomials. The Euclidean Algorithm and Primitive Polynomials over Finite Fields. On the Computational Hardness of Testing SquareFreeness of Sparse Polynomials. Mastrovito Multiplier for General Irreducible Polynomials.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAECC14 (2001 : Melbourne, Vic.)
 Berlin : Springer, 2001.
 Description
 Book — xii, 398 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes, AAECC14, held in Melbourne, Australia in November 2001. The 36 revised full papers presented together with four invited papers were carefully reviewed and selected from 61 submissions. The papers are organized in topical sections on block codes, code constructions, codes and algebra  rings and fields, codes and algebra  algebraic geometry codes, sequences, cryptography, algorithms, algorithms  decoding, and algebraic constructions.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA268 .A34 14TH 2001  Available 
 AAECC14 (2001 : Melbourne, Vic.)
 Berlin ; New York : Springer, 2001.
 Description
 Book — 1 online resource (xii, 398 pages) : illustrations Digital: text file.PDF.
 Summary

 Invited Contributions
 The Ubiquity of ReedMuller Codes
 Selfdual CodesTheme and Variations
 Design of Differential SpaceTime Codes Using Group Theory
 Ideal ErrorCorrecting Codes: Unifying Algebraic and NumberTheoretic Algorithms
 Block Codes
 Selfdual Codes Using Image Restoration Techniques
 Low Complexity TailBiting Trellises of Selfdual codes of Length 24, 32 and 40 over GF(2) and Z4 of Large Minimum Distance
 F q Linear Cyclic Codes over F q m: DFT Characterization
 Code Constructions
 Cyclic Projective ReedMuller Codes
 Codes Identifying Sets of Vertices
 Duality and Greedy Weights of Linear Codes and Projective Multisets
 Codes and Algebra:Rings and Fields
 Type II Codes over IF2r
 On Senary Simplex Codes
 Optimal Double Circulant Z4Codes
 Constructions of Codes from Number Fields
 On Generalized Hamming Weights for Codes over Finite Chain Rings
 Information Rates and Weights of Codes in Structural Matrix Rings
 Codes and Algebra:Algebraic Geometry Codes
 On Hyperbolic Codes
 On Fast Interpolation Method for GuruswamiSudan List Decoding of OnePoint AlgebraicGeometry Codes
 Computing the Genus of a Class of Curves
 Sequences
 Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers
 Even Length Binary Sequence Families with Low Negaperiodic Autocorrelation
 On the Nonexistence of (Almost )Perfect Quaternary Sequences
 Maximal Periods of x2 + c in Fq
 On the Aperiodic Correlation Function of Galois Ring mSequences
 Euclidean Modules and Multisequence Synthesis
 Cryptography
 On Homogeneous Bent Functions
 Partially Identifying Codes for Copyright Protection
 On the Generalised Hidden Number Problem and Bit Security of XTR
 CRYPTIM: Graphs as Tools for Symmetric Encryption
 Algorithms
 An Algorithm for Computing Cocyclic Matrices Developed over Some Semidirect Products
 Algorithms for Large Integer Matrix Problems
 On the Identification of Vertices and Edges Using Cycles
 Algorithms:Decoding
 On Algebraic Soft Decision Decoding of Cyclic Binary Codes
 Lifting Decoding Schemes over a Galois Ring
 Sufficient Conditions on Most Likely Local Subcodewords in Recursive Maximum Likelihood Decoding Algorithms
 A Unifying SystemTheoretic Framework for ErrorsandErasures ReedSolomon Decoding
 An Algorithm for Computing Rejection Probability of MLD with Threshold Test over BSC
 Algebraic Constructions
 Cartan's Characters and Stairs of Characteristic Sets
 On the Invariants of the Quotients of the Jacobian of a Curve of Genus 2
 Algebraic Constructions for PSK SpaceTime Coded Modulation.
 AAECC15 (2003 : Toulouse, France)
 Berlin ; New York : Springer, c2003.
 Description
 Book — x, 264 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the 15th International Symposium on Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes, AAECC15, held in Toulouse, France, in May 2003. The 25 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 40 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA268 .A34 15TH 2003  Available 
 AAECC16 (2006 : Las Vegas, Nev.)
 Berlin ; New York : Springer, c2006.
 Description
 Book — xi, 337 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the 16th International Symposium on Applied Algebra, Algebraic Algorithms and ErrorCorrecting Codes, AAECC16, held in Las Vegas, NV, USA in February 2006. The 25 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 32 submissions. Among the subjects addressed are block codes; algebra and codes: rings, fields, and AG codes; cryptography; sequences; decoding algorithms; and algebra: constructions in algebra, Galois groups, differential algebra, and polynomials.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA268 .A34 16TH 2006  Available 
 AAECC16 (2006 : Las Vegas, Nev.)
 Berlin ; New York : Springer, c2006.
 Description
 Book — xi, 337 p. : ill.
 AAECC17 (2007 : Bangalore, India)
 Berlin ; New York : Springer, ©2007.
 Description
 Book — 1 online resource (xii, 368 pages) : illustrations Digital: text file.PDF.
 Summary

 Invited Contributions. List Decoding and Pseudorandom Constructions. A Survey of Recent Attacks on the Filter Generator. Iterative List Decoding of LDPC Codes. Inverted Edwards Coordinates. Spectra of Boolean Functions, Subspaces of Matrices, and Going Up Versus Going Down. Efficient List Decoding of Explicit Codes with Optimal Redundancy. Algebraic Structure Theory of TailBiting Trellises. Nice Codes from Nice Curves. Regular Contributions. Generalized Sudan's List Decoding for Order Domain Codes. Bent Functions and Codes with Low PeaktoAverage Power Ratio for MultiCode CDMA. Determining the Nonlinearity of a New Family of APN Functions. An Improvement of Tardos's CollusionSecure Fingerprinting Codes with Very Short Lengths. SpaceTime Codes from Crossed Product Algebras of Degree 4. On Nonrandomness of the Permutation After RC4 Key Scheduling. Correctable Errors of Weight Half the Minimum Distance Plus One for the FirstOrder ReedMuller Codes. FaultTolerant Finite Field Computation in the Public Key Cryptosystems. A Note on a Class of Quadratic Permutations over
 Constructions of Orthonormal Lattices and Quaternion Division Algebras for Totally Real Number Fields. Quaternary Plotkin Constructions and Quaternary ReedMuller Codes. Joint SourceCryptographicChannel Coding Based on Linear Block Codes. On the KeyPrivacy Issue of McEliece PublicKey Encryption. Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function. Linear Complexity and Autocorrelation of Prime Cube Sequences. The "Art of Trellis Decoding" Is NPHard. On the Structure of Inversive Pseudorandom Number Generators. Subcodes of ReedSolomon Codes Suitable for Soft Decoding. Normalized Minimum Determinant Calculation for Multiblock and Asymmetric SpaceTime Codes. On the Computation of Nonuniform Input for List Decoding on BezerraGarcia Tower. Dense MIMO Matrix Lattices  A Meeting Point for Class Field Theory and Invariant Theory. Secure CrossRealm ClienttoClient PasswordBased Authenticated Key Exchange Against Undetectable OnLine Dictionary Attacks. Links Between Discriminating and Identifying Codes in the Binary Hamming Space. Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity. A Path to Hadamard Matrices. The Tangent FFT. Novel Algebraic Structure for Cyclic Codes. Distribution of Trace Values and TwoWeight, Selforthogonal Codes over GF(p, 2). Generalized Rotation Symmetric and Dihedral Symmetric Boolean Functions ? 9 Variable Boolean Functions with Nonlinearity 242. On Quasicyclic Codes over Integer Residue Rings. Extended NormTrace Codes with Optimized Correction Capability. On Generalized Hamming Weights and the Covering Radius of Linear Codes. Homomorphic Encryptions of Sums of Groups.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAECC18 (2009 : Tarragona, Spain)
 Berlin ; New York : Springer, ©2009.
 Description
 Book — 1 online resource (xi, 242 pages)
 Summary

 Codes. The Order Bound for Toric Codes. An Extension of the Order Bound for AG Codes. Sparse Numerical Semigroups. From the Euclidean Algorithm for Solving a Key Equation for Dual ReedSolomon Codes to the BerlekampMassey Algorithm. Rank for Some Families of Quaternary ReedMuller Codes. Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. Simulation of the SumProduct Algorithm Using Stratified Sampling. A Systems Theory Approach to Periodically TimeVarying Convolutional Codes by Means of Their Invariant Equivalent. On Elliptic Convolutional Goppa Codes. The Minimum Hamming Distance of Cyclic Codes of Length 2p s
 There Are Not Nonobvious Cyclic Affineinvariant Codes. On Selfdual Codes over Z 16
 Cryptography. A Nonabelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications. Word Oriented Cascade Jump ??LFSR. On Some Sequences of the Secret Pseudorandom Index j in RC4 Key Scheduling. VeryEfficient Anonymous PasswordAuthenticated Key Exchange and Its Extensions. Efficient Constructions of Deterministic Encryption from Hybrid Encryption and CodeBased PKE. Algebra. Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields. New Commutative Semifields and Their Nuclei. Spreads in Projective Hjelmslev Geometries. On the Distribution of Nonlinear Congruential Pseudorandom Numbers of Higher Orders in Residue Rings. Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t
 Extended Abstracts. Interesting Examples on Maximal Irreducible Goppa Codes. Repeated Root Cyclic and Negacyclic Codes over Galois Rings. Construction of Additive ReedMuller Codes. Grobner Representations of Binary Matroids. A Generalization of the ZigZag Graph Product by Means of the Sandwich Product. Novel Efficient Certificateless Aggregate Signatures. Bounds on the Number of Users for Random 2Secure Codes.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAECC2 (1984 : Toulouse, France)
 Berlin ; New York : SpringerVerlag, ©1986.
 Description
 Book — 1 online resource (vi, 265 pages) : illustrations
 Summary

 On associative algebras of minimal rank
 Construction of primitive idempotents for a variable codes
 Multivariate polynomials in coding theory
 Enumeration of self dual 2k circulant codes
 Codes, groups and invariants
 On a conjecture concerning coverings of Hamming space
 An improved upper bound on covering radius
 Association schemes and difference sets defined on two weight codes
 Automorphisms of two families of extended non binary cyclic Goppa Codes
 Some quasiperfect cyclic codes
 Explicit Kerdock codes over GF(2)
 Une classe de codes 2correcteurs adaptes aux systems d'information formates
 LOUSTICC simulation software : Experimental results of coding systems
 An algorithm of complete decoding of doubleerrorcorrecting goppa codes
 On the number of divisors of a polynomial over GF(2)
 Multivariate polynomial factoring and detection of true factors
 Discriminants and the irreducibility of a class of polynomials
 Computational aspects of reduction strategies to construct resolutions of monomial ideals
 Designs arising from symplectic geometry
 Distance
 transitive graphs and the problem of maximal subgroups of symmetric groups
 Can a fast signature scheme without secret key be secure / Un Schema de Signature Courte et Rapide N'Utilisant pas de CLE Secrete PeutIL Etre Fiable?
 Manipulation of recurrence relations in computer algebra
 Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation.
 AAECC5 (1987 : Menorca, Spain)
 Berlin ; New York : SpringerVerlag, ©1989.
 Description
 Book — 1 online resource (417 pages) : illustrations Digital: text file; PDF.
 Summary

 Non simple tournaments : Theoretical properties and a polynomial algorithm
 Covering radius for codes obtained from T(m) triangular graphs
 Searching for weakly autocorrelated binary sequences
 On the prefixes of a random trace and the membership problem for contextfree trace languages
 On decoding binary quadratic residue codes
 Pseudometrics associated with fuzzy relations having weak properties
 Towards an expert system for error correcting codes: SECC
 An Iterative Euclidean Algorithm
 Gröbner bases and differential algebra
 A procedure to prove geometrical statements
 Some applications of a classification of affineinvariant codes
 On the computation of the local and global analytic branches of a real algebraic curve
 Distribution of codewords and decoding error rate in rs codes with application to performance evaluation from optical disc
 On generalized minimum distance decoding
 Newton symmetric functions and the arithmetic of algebraically closed fields
 Non linear covering codes : A few results and conjectures
 Grobner bases, Ritt's algorithm and decision procedures for algebraic theories
 An algebraic model for the storage of data in parallel memories
 Algebrric solution of systems of polynomirl equations using Groebher bases
 How to decide whether a polynomial ideal is primary or not
 On the computational complexity of polynomials and bilinear mappings. A survey
 Coding theory and its applications in Japan
 Binary sequences with good correlation properties
 Hankel matrices and polynomials
 On the (d, D, D, s)digraph problem
 It is decidable in polynomial time whether a monoid presented by a finite weightreducing and confluent thue system is torsionfree
 A shiftremainder GCD algorithm
 New class of cyclic, random and burst error correcting codes
 A conjecture on the free distance of (2,1, m) binary convolutional codes
 On the construction of completely regular linear codes from distance
 Regular graphs
 Synthesis of twodimensional linear feedback shift registers and Groebner bases
 Constructing universal Gröbner bases.
 AAECC8 (1990 : Tokyo, Japan)
 Berlin ; New York : SpringerVerlag, ©1991.
 Description
 Book — 1 online resource (ix, 390 pages) : illustrations Digital: text file.PDF.
 Summary

 Covering radius and writing on memories. Geometric problems solvable in single exponential time. A description of the [16,7,6] codes. Periodic sequences for absolute type shaft encoders. Errorcoded algorithms for online arithmetic. Constructions of codes correcting burst asymmetric errors. A construction method for mary unidirectional error control codes. Feasible calculation of the generator for combined LFSR sequences. Substitution of characters in qary msequences. Pseudopolyphase orthogonal sequence sets with good crosscorrelation property. Realvalued bent function and its application to the design of balanced quadriphase sequences with optimal correlation properties. Coded modulation with generalized multiple concatenation of block codes. Trellis coded modulation based on timevarying mapping and encoders for utilizing a channel intersymbol interference. Use of the algebraic coding theory in nuclear electronics. Some ideas about faulttolerant Chinese Remaindering. On a categorial isomorphism between a class of Completely Regular Codes and a class of Distance Regular Graphs. Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersurface. On the complexity of algebraic power series. Local decomposition algorithms. An asymptotically fast probabilistic algorithm for computing polynomial GCD's over an algebraic number field. Some algebra with formal matrices. Implicitization of rational parametric curves and surfaces. An inequality about irreducible factors of integer polynomials (II). The symplectic trilinear mappings
 an algorithmic approach of the classification
 case of the field GF(3). A Groebner basis and a minimal polynomial set of a finite nD array. Bounds for degrees and number of elements in Groebner bases. Standard bases of differential ideals. Complexity of standard bases in projective dimension zero II. Systolic architectures for multiplication over finite field GF(2m). PARSAC2: A parallel SAC2 based on threads. Exponentiation in finite fields using dual basis multiplier. Applications of Cayley graphs. Duality between two cryptographic primitives.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAECC9 (1991 : New Orleans, La.)
 Berlin ; New York : SpringerVerlag, ©1991.
 Description
 Book — 1 online resource (xi, 488 pages) : illustrations
 Summary

 Algorithms for the shape of semialgebraic sets a new approach. On the parameters of algebraic geometric codes. On wiedemann's method of solving sparse linear systems. Fast algorithms for decoding orthogonal and related codes. Jacobian matrices and constructions in algebra. Homogenity, pseudohomogenity, and Groebner basis computations. Arithmetic on non supersingular elliptic curves. Implementing some algorithms of kantor. Computing roadmaps of general semialgebraic sets. An improved sign determination algorithm. The 2nd generalized Hamming weight of doubleerror correcting binary BCH codes and their dual codes. Buchberger algorithm and integer programming. New systolic architectures for cyclic code encoding. Algebraic constructions of efficient broadcast networks. Errorcorrection for WIMs and WUMs. Some constructions in rings of differential polynomials. Concurrent error detection in sequential circuits using convolutional codes. An algorithm for the computation of the radical of an ideal in the ring of polynomials. Integer multiplication in PARSAC2 on stock microprocessors. Polynomialtime construction of spherical codes. Algorithms for a multiple algebraic extension II. On the orphans and covering radius of the reedmuller codes. A joint authentication and encryption scheme based on algebraic coding theory. Arithmetic codes  Survey, recent and new results. Some results on linear unequalerrorprotection codes specified by their generator matrix. An ackermannian polynomial ideal. Complexity of the computation of the canonical Whitney stratification of an algebraic set in Cn. Some undecidability results for weakly confluent monadic stringrewriting systems. Calculating multidimensional symmetric functions using Jacobi's formula. Multivariate Sturm theory. Binary spherical geometric codes. An algebraic construction of generalized Beenker's codes. Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields. Completely transitive codes and distance transitive graphs. Placement of curved polygons. On the weights of the elements of the duals of binary BCH codes. Computation of the openness of some loci of modules. Random and byte error correcting codes for asymmetric or unidirectional error control. Finding a minimal polynomial vector set of a vector of nD arrays. Covering codes and combinatorial optimization. Decoding of quadrature partial response trellis coded signals (QPRTCM) in the presence of intersymbol interference and noise. On algebraic solutions of linear differential equations with primitive unimodular Galois group. Error detection and correction in numerical computations. dFunctions in V k (F 2) and selfdecimation of msequences. Multilevel modulation codes for rayleigh fading channels.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAIM 2005 (2005 : Xi'an, Shaanxi Sheng, China)
 Berlin ; New York : Springer, c2005.
 Description
 Book — xiii, 484 p. : ill. (some col.).
 AAIM 2005 (2005 : Xi'an, Shaanxi Sheng, China)
 Berlin ; New York : Springer, c2005.
 Description
 Book — xiii, 484 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the First International Conference on Algorithmic Applications in Management, AAIM 2005, held in Xian, China in June 2005. The 46 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 140 submissions. Among the topics addressed are approximation, complexity, automatic timetabling, scheduling algorithms, gametheoretic algorithms, economic equilibrium computation, graph computations, network algorithms, computational geometry, combinatorial optimization, sequencing, network management, data mining, Knapsack problems, etc.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA76.9 .A43 A25 2005  Available 
 AAIM 2005 (2008 : Shanghai, China)
 1st ed.  New York : Springer, 2008.
 Description
 Book — xi, 350 p. : ill.
 AAIM 2006 (2006 : Hong Kong, China)
 Berlin : Springer, 2006.
 Description
 Book — xi, 394 p. : ill.
 AAIM 2006 (2006 : Hong Kong, China)
 Berlin ; New York : Springer, c2006.
 Description
 Book — xi, 394 p. : ill. ; 24 cm.
 Summary

This book constitutes the refereed proceedings of the Second International Conference on Algorithmic Aspects in Information and Management, AAIM 2006, held in Hong Kong, China in June 2006. The 34 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 263 submissions. The papers cover topics from areas such as online scheduling, game and finance, data structures and algorithms, computational geometry, optimization, graph, and string.
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA76.9 .A43 A25 2006  Available 
 AAIM 2007 (2007 : Portland, Or.)
 Berlin ; New York : Springer, c2007.
 Description
 Book — xii, 428 p. : ill.
 Summary

 Contributed Papers To AAIM 2007. Solving Generalized Maximum Dispersion with Linear Programming. SignificanceDriven Graph Clustering. An Improved Approximation Algorithm for Maximum Edge 2Coloring in Simple Graphs. Digraph Strong Searching: Monotonicity and Complexity. Algorithms for Counting 2Sat 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 kDisjoint Paths Problems on DAGs. Acyclic Edge Colouring of Outerplanar Graphs. Smallest Bipartite BridgeConnectivity 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 PathLengths. Online OVSF Code Assignment with Resource Augmentation. Optimal Joint Rate and Power Allocation in CDMA Networks. Suppressing Maximum Burst Size Throughout the Path with Nonwork 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 PointSets and Nonuniform Hypergraphs. Optimal stOrientations for Plane Triangulations. Minimum Spanning Tree with Neighborhoods. An Almost Linear Time 2.8334Approximation Algorithm for the Disc Covering Problem. Optimal Field Splitting with Feathering in IntensityModulated Radiation Therapy. Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. BMA *: An Efficient Algorithm for the OnetoSome Shortest Path Problem on Road Maps. Strip Packing vs. Bin Packing. Probe Matrix Problems: Totally Balanced Matrices. Efficiency of Data Distribution in BitTorrentLike 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.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAIM (Conference) (10th : 2014 : Vancouver, B.C.)
 Cham : Springer, 2014.
 Description
 Book — 1 online resource (xvi, 342 pages) : illustrations Digital: text file; PDF.
 Summary

 Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. On the Exact Block Cover Problem. Minimax Regret ksink Location Problem in Dynamic Path Network. Competitive Algorithms for Unbounded OneWay Trading. The Complexity of Degree Anonymization by Vertex Addition. Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints. EdgeClique Covers of the Tensor Product. Protein Name Recognition Based on Dictionary Mining and Heuristics. A Facility Coloring Problem in 1D. Approximation Algorithms for Packing ElementDisjoint Steiner Trees on Bounded Terminal Nodes. The Garden Hose Complexity for the Equality Function. Finding Robust Minimum Cuts. A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case. Multiple Sink Location Problems in Dynamic Path Networks. Narrowing the Complexity Gap for Colouring (Cs, Pt)Free Graphs. New Lower Bounds on Broadcast Function. Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. Partially Dynamic SingleSource Shortest Paths on Digraphs with Positive Weights. Obtaining Split Graphs by Edge Contraction. Parameterized Complexity of Connected Induced Subgraph Problems. Semionline Hierarchical Load Balancing Problem with Bounded Processing Times. Restricted Bipartite Graphs: Comparison and Hardness Results. The Research on Controlling the Iteration of QuantumInspired Evolutionary Algorithms for Artificial Neural Networks. On P3Convexity of Graphs with Bounded Degree. The Competitive Diffusion Game in Classes of Graphs. A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. Clustering Performance of 3Dimensional Hilbert Curves. Broadcast Networks with Near Optimal Cost. An Optimal Context for Information Retrieval. An AuctionBargaining Model for Initial Emission Permits.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAIM (Conference) (11th : 2016 : Bergamo, Italy)
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xiv, 223 pages) : illustrations
 Summary

 Item Pricing for Combinatorial Public Projects
 NormBased Locality Measures of TwoDimensional Hilbert Curves
 On the Complexity of Clustering with Relaxed Size Constraints
 Superstring Graph: A New Approach for Genome Assembly
 Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
 A Very Fast String Matching Algorithm Based on Condensed Alphabets
 MinimumDensity Identifying Codes in Square Grids
 Separating Codes and Traffic Monitoring
 Know When to Persist: Deriving Value from a Stream Buffer
 Algorithmic Aspects of Upper Domination: A Parameterised Perspective
 On Network Formation Games with Heterogeneous Players and Basic Network Creation Games
 Parameterized Complexity of Team Formation in Social Networks
 Reconstructing Cactus Graphs from Shortest Path Information
 NearOptimal Dominating Sets via Random Sampling
 A Multivariate Approach for Checking Resiliency in Access Control
 Efficient Algorithms for the Order Preserving Pattern Matching Problem
 Computing the LineConstrained kCenter in the Plane for Small k
 Online kmax Search Algorithm with Applications to the Secretary Problem.
 AAIM (Conference) (12th : 2018 : Dallas, Tex.)
 Cham, Switzerland : Springer, 2018.
 Description
 Book — 1 online resource (viii, 320 pages) : illustrations (some color) Digital: text file.PDF.
 Summary

 Minimum Diameter $k$Steiner Forest. Factors Impacting the Label Denoising of Neural Relation Extraction. Makespan Minimization on Unrelated Parallel Machines with a Few Bags. Channel Assignment with rDynamic Coloring. Profit Maximization Problem with Coupons in Social Networks. A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial MultiCover Problem. A Novel Approach to Verifying Context Free Properties of Programs. Determination of Dual Distances for a Kind of Perfect Mixed Codes. Approximation and Competitive Algorithms for SingleMinded Selling Problem. An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. Qualityaware Online Task Assignment Using Latent Topic Model. Calibration Scheduling with Time Slot Cost. The kpower domination problem in weighted trees. General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach. A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTEA Network. Faster Compression of Patterns to Rectangle Rule Lists. Algorithm Designs for Dynamic Ridesharing System. New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems. Computation of KullbackLeibler Divergence between Labeled Stochastic Systems with NonIdentical State Spaces. Order preserving barrier coverage with weighted sensors on a line. Achieving Location Truthfulness in Rebalancing SupplyDemand Distribution for Bike Sharing. Approximation algorithms and a hardness result for the threemachine proportionate mixedshop problem. A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory. Communitybased Acceptance Probability Maximization for Target Users on Social Networks. Knowledge Graph Embedding Based on Subgraphaware Proximity.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAIM (Conference) (3rd : 2007 : Portland, Or.)
 Berlin ; New York : Springer, ©2007.
 Description
 Book — 1 online resource (xii, 428 pages) : illustrations Digital: text file.PDF.
 Summary

 Contributed Papers To AAIM 2007. Solving Generalized Maximum Dispersion with Linear Programming. SignificanceDriven Graph Clustering. An Improved Approximation Algorithm for Maximum Edge 2Coloring in Simple Graphs. Digraph Strong Searching: Monotonicity and Complexity. Algorithms for Counting 2Sat 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 kDisjoint Paths Problems on DAGs. Acyclic Edge Colouring of Outerplanar Graphs. Smallest Bipartite BridgeConnectivity 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 PathLengths. Online OVSF Code Assignment with Resource Augmentation. Optimal Joint Rate and Power Allocation in CDMA Networks. Suppressing Maximum Burst Size Throughout the Path with Nonwork 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 PointSets and Nonuniform Hypergraphs. Optimal stOrientations for Plane Triangulations. Minimum Spanning Tree with Neighborhoods. An Almost Linear Time 2.8334Approximation Algorithm for the Disc Covering Problem. Optimal Field Splitting with Feathering in IntensityModulated Radiation Therapy. Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. BMA *: An Efficient Algorithm for the OnetoSome Shortest Path Problem on Road Maps. Strip Packing vs. Bin Packing. Probe Matrix Problems: Totally Balanced Matrices. Efficiency of Data Distribution in BitTorrentLike 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.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAIM (Conference) (4th : 2008 : Shanghai, China)
 Berlin : SpringerVerlag, c2008.
 Description
 Book — xi, 350 p. : ill. ; 24 cm.
 AAIM (Conference) (5th : 2009 : San Francisco, Calif.)
 Berlin ; New York : Springer, ©2009.
 Description
 Book — 1 online resource (x, 325 pages) : illustrations Digital: text file.PDF.
 Summary

 Algorithmic Challenge in Online Advertising. Parallel Algorithms for Collaborative Filtering. On the Approximability of Some Haplotyping Problems. On Acyclicity of Games with Cycles. Discrete online TSP. On Approximating an Implicit Cover Problem in Biology. Power Indices in Spanning Connectivity Games. Efficiently Generating kBest Solutions to Procurement Auctions. Integer Polyhedra for Program Analysis. Line Segment Facility Location in Weighted Subdivisions. Algorithms for Placing Monitors in a Flow Network. Three Results on Frequency Assignment in Linear Cellular Networks. Link Distance and Shortest Path Problems in the Plane. Orca Reduction and ContrAction Graph Clustering. Equiseparability on Terminal Wiener Index. Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. Optimal Auctions Capturing Constraints in Sponsored Search. A Note on Estimating Hybrid Frequency Moment of Data Streams. TwoLevel PushRelabel Algorithm for the Maximum Flow Problem. A More Relaxed Model for GraphBased Data Clustering: sPlex Editing. Dynamic Position Auctions with Consumer Search. Nonlinear Optimization over a Weighted Independence System. Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers. Latency Constrained Aggregation in Chain Networks Admits a PTAS. Cutting a Cake for Five People. PLDA: Parallel Latent Dirichlet Allocation for LargeScale Applications. On Job Scheduling with Preemption Penalties.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 AAIM (Conference) (6th : 2010 : Weihai, China)
 Berlin ; New York : SpringerVerlag, ©2010.
 Description
 Book — 1 online resource (xi, 336 pages)
 Summary

 Comparison of Two Algorithms for Computing Page Importance
 The Invisible Hand for Risk Averse Investment in Electricity Generation
 Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
 The (K, k)Capacitated Spanning Tree Problem
 Optimal Algorithms for the Economic LotSizing Problem with Multisupplier
 Synthetic Road Networks
 Computing Exact and Approximate Nash Equilibria in 2Player Games
 Where Would Refinancing Preferences Go?
 Approximating Maximum Edge 2Coloring in Simple Graphs
 A Linear Kernel for CoPath/Cycle Packing
 A VaR Algorithm for Warrants Portfolio
 Some Results on Incremental Vertex Cover Problem
 Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
 Point Location in the ContinuousTime Moving Network
 Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints
 Inverse 1median Problem on Trees under Weighted l ??? Norm
 On the Approximability of the Vertex Cover and Related Problems
 Feasibility Testing for DialaRide Problems
 Indexing Similar DNA Sequences
 Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint
 A New Smoothing Newton Method for Symmetric Cone Complementarity Problems
 Approximation Algorithms for Scheduling with a Variable Machine Maintenance
 Bounded ParallelBatch Scheduling on Unrelated Parallel Machines
 Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles
 Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive
 A PrimalDual Approximation Algorithm for the kLevel Stochastic Facility Location Problem
 Optimal Semionline Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision
 Varieties of Regularities in Weighted Sequences
 Online Uniformly Inserting Points on Grid
 Kernelization for Cycle Transversal Problems
 Online Splitting Interval Scheduling on m Identical Machines
 Extended Tabu Search on Fuzzy Traveling Salesman Problem in Multicriteria Analysis
 Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery.
 AAIP 2009 (3rd : 2009 : Edinburgh, Scotland)
 Berlin ; Heidelberg : SpringerVerlag, ©2010.
 Description
 Book — 1 online resource Digital: text file.PDF.
 Summary

 Invited papers. Deriving a relationship from a single example / Neil Mitchell
 Synthesis of functions using generic programming / Pieter Koopman and Rinus Plasmeijer
 Regular papers. Inductive programming : a survey of program synthesis techniques / Emanuel Kitzelmann
 Incremental learning in inductive programming / Robert Henderson
 Enumerating welltyped terms generically / Alexey Rodriguez Yakushev and Johan Jeuring
 Generalisation operators for lists embedded in a metric space / V. Estruch, C. Ferri, J. HernándezOrallo, and M.J. RamírezQuintana
 Porting IgorII from Maude to Haskell / Martin Hofmann, Emanuel Kitzelmann, and Ute Schmid
 Automated method induction : functional goes object oriented / Thomas Hieber and Martin Hofmann
 Recent improvements of MagicHaskeller / Susumu Katayama.
 Aalen, Odd O.
 New York : Springer, c2008.
 Description
 Book — xviii, 539 p. : ill. ; 25 cm.
 Summary

 An introduction to survival and event history analysis. Stochastic processes in event history analysis. Nonparametric analysis of survival and event history data. Regression models. Parametric counting process models. Unobserved hererogeneity: The odd effects of frailty. Multivariate frailty models. Marginal and dynamic models for recurrent events and clustered survival data. Causality. First passage time models: Understanding the shape of the hazard rate. Diffusion and Levy process models for dynamic frailty. Markov processes and the productintegral. Vectorvalued counting processes, martingales and stochastic integrals. References.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA274 .A25 2008  Unknown 
 Aalen, Odd O.
 New York, NY : Springer, c2008.
 Description
 Book — xviii, 539 p. : ill.
43. Process mining : data science in action [2016]
 Aalst, Wil van der, author.
 Second edition.  Heidelberg : Springer, 2016.
 Description
 Book — 1 online resource (xix, 467 pages) Digital: text file.PDF.
 Summary

 Introduction
 Preliminaries
 From Event Logs to Process Models
 Beyond Process Discovery
 Putting Process Mining to Work
 Reflection
 Epilogue.
 AAMAS (Conference) (13th : 2014 : Paris, France)
 [Richland County, South Carolina] : International Foundation for Autonomous Agents and Multiagent Systems, [2014]
 Description
 Book — 1 online resource : illustrations (some color) Digital: text file.
 AAMAS (Conference) (15th : 2016 : Singapore, Singapore)
 Cham, Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (ix, 193 pages) : illustrations Digital: text file.PDF.
 Summary

 Intro; Preface; Organization; Contents; On the Trustworthy Fulfillment of Commitments; 1 Motivation; 2 Computational Models of Commitment; 3 Problem Formulation; 4 Commitment Semantics; 4.1 Relationship to Other Commitment Semantics; 4.2 SemanticsRespecting Algorithms; 4.3 Semantics with Other Kinds of Uncertainty; 5 Implications for NonDecisionTheoretic Agents; 6 Conclusions; References; Evaluating the Efficiency of Robust Team Formation Algorithms; 1 Introduction; 2 Problem Definition; 3 Related Work; 4 Approximations of the TORTF Problem; 4.1 Greedy Algorithms; 4.2 Genetic Algorithm
 4.3 Linear Programming Approach5 Results and Discussion; 5.1 Datasets; 5.2 Results; 6 Conclusions; References; Social Welfare in OneSided Matching Mechanisms; 1 Introduction; 1.1 Our Results; 1.2 Discussion and Related Work; 2 Preliminaries; 3 Price of Anarchy Guarantees; 4 Lower Bounds; 5 General Solution Concepts; 6 Extensions; 6.1 Price of Stability; 6.2 UnitRange Representation; 7 Conclusion and Future Work; References; Using Multiagent Negotiation to Model Water Resources Systems Operations; 1 Introduction; 2 Related Work; 3 The Case Study; 4 The Negotiation Protocols
 4.1 PointBased Protocol4.2 SetBased Protocol; 5 Simulations; 6 Conclusions; References; To Big Wing, or Not to Big Wing, Now an Answer; 1 Introduction; 1.1 The Battle of Britain; 1.2 The Lanchester Model; 1.3 Agent Based Models; 2 Model Design; 2.1 RAF Forces; 2.2 German Forces; 2.3 Model Functionality; 3 Experiments; 4 Results; 5 Conclusion; References; How Testable Are BDI Agents? An Analysis of Branch Coverage; 1 Introduction; 2 BeliefDesireIntention (BDI) Agents; 3 AllEdge Coverage Analysis; 3.1 Removing Failure Handling; 3.2 Simplifying for Uniform Programs
 4 AllEdges vs. AllPaths5 BDI vs. Procedural; 6 Conclusion; References; Dynamics of Fairness in Groups of Autonomous Learning Agents; 1 Introduction; 2 Multiplayer Ultimatum Game; 2.1 Subgame Perfect Equilibrium; 3 Learning Model; 4 Results; 5 Discussion and Conclusion; References; Using Stackelberg Games to Model Electric Power Grid Investments in Renewable Energy Settings; 1 Introduction; 2 Related Work; 3 Curtailment Rules; 3.1 Effects of Curtailment Strategies on Renewable Capacity Utilisation
 An Illustration; 4 Renewable Investment in Single Locations
 4.1 Individual Generator Incentives4.2 Total Generation Capacity; 5 Transmission Investment in Multiple Locations; 5.1 Implementation in Areas with High Curtailment; 5.2 Transmission Investment as a Stackelberg Game; 6 Network Upgrade Case Study; 7 Conclusions and Future Work; References; Multiscale Simulation for Crowd Management: A Case Study in an Urban Scenario; 1 Introduction; 2 Related Works; 3 A Multiscale Model for the Simulation of Urban Scenarios; 3.1 The Discrete Microscopic Model; 3.2 The Mesoscopic Model; 3.3 Strategic Model; 4 Analysis of an Urban Scenario
 AAMAS (Conference) (15th : 2016 : Singapore, Singapore)
 Cham, Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xii, 197 pages) : illustrations Digital: text file.PDF.
 Summary

 A Language for Trust Modelling (TRUST workshop)
 Abstraction Methods for Solving GraphBased Security Games (SECMAS workshop)
 Can I Do That? Discovering Domain Axioms Using Declarative Programming and Relational Reinforcement Learning (ARMS workshop)
 Simultaneous Optimization And Sampling Of Agent Trajectories Over A Network (OPTMAS workshop)
 POMDPs for Assisting Homeless Shelters
 Computational and Deployment Challenges (IDEAS workshop)
 Summarizing simulation results using causallyrelevant states (MABS workshop)
 Augmenting Agent Computational Environments with Quantitative Reasoning Modules and Customisable Bridge Rules (EMAS workshop)
 Using Awareness to Promote Richer, More HumanLike Behaviors in Artificial Agents (ALA workshop)
 Using GDL to Represent Domain Knowledge for Automated Negotiations (ACAN workshop)
 Simulating Urban Growth with Raster and Vector models: A case study for the city of Can Tho, Vietnam (ABMUS workshop)
 Gamification of MultiAgent Systems Theory Classes (COIN/CARE workshop)
 Analysis of Market Trend Regimes for March 2011 USDJPY Exchange Rate Tick Data (WEIN workshop).
 AAMAS (Conference) (2015 : Istanbul,Turkey)
 New York, New York : Association for Computing Machinery, [2015]
 Description
 Book — 1 online resource (xli, 2030 pages) : illustrations (some color) Digital: text file.
 AAMAS (Conference) (2016 : Singapore)
 New York, New York : Association for Computing Machinery, [2016]
 Description
 Book — 1 online resource : illustrations (some color) Digital: text file.
 Aanderud, Tricia, author.
 Cary, NC : SAS Institute, [2017]
 Description
 Book — 1 online resource : illustrations
 Summary

 Accessing content
 Building your first report
 Building your first dashboard
 Using the data builder
 Visualizing your data
 The where of data
 Approachable analytics
 Loading data
 LASR administration
 Performance considerations
 Introducing the SAS Viya platform
 Wrangling your data
 Visualizing and exploring your data.
 Aarhus Conference (4th : 2005 : Aarhus, Denmark)
 New York, NY : Association for Computing Machinery, ©2005
 Description
 Book — 212 pages : illustrations (some color)