Catalog start Subject "computer analysis"

%{search_type} search results

703 catalog results

RSS feed for this result
1 - 20
View results as:
Number of results to display per page

1. An analysis of running skyline load path [1971]

  • Carson, Ward W.
  • Portland, Or. : Pacific Northwest Forest and Range Experiment Station, Forest Service, U.S. Dept. of Agriculture, 1971.
Description
Book — 9 pages : illustrations ; 27 cm.
Summary
This paper is intended for those who wish to prepare an algorithm to determine the load path of a running skyline. The mathematics of a simplified approach to this running skyline design problem are presented. The approach employs assumptions which reduce the complexity of the problem to the point where it can be solved on desk-top computers of limited capacities. The results of this approach are compared with the exact catenary solution.
Online
Green Library

2. Computer programs for weighting length-of-stay and other visitor characteristics [1968]

  • Wagar, J. Alan.
  • Ogden, Utah : Intermountain Forest and Range Experiment Station, Forest Service, United States Department of Agriculture, 1968.
Description
Book — 12 pages ; 27 cm.
Green Library

Online 3. Finite Element Formulation of Poro-Elasticity Suitable for Large Deformation Dynamic Analysis [2005]

  • Li, C (Author)
  • February 2005
Description
Book
Summary
A finite element model based on mixture theory is presented for the analysis of a mechanical phenomenon involving dynamic expulsion of fluids from a fully saturated porous solid matrix in the regime of both infinitesimal and finite deformation. The governing equations are obtained by applying the conservation laws of momentum and mass to each phase and the solid-fluid mixture. A complete formulation based on the motion of the solid and fluid phases is first presented; then approximations are made with respect to the relative acceleration vector to arrive at a so-called u-p formulation, which is subsequently implemented in a finite element model. The variational forms and matrix formulations are presented. The matrix equations are consistently linearized. The Newmark method is chosen as the global solution algorithm for solving the general finite element matrix equations. In the u-p formulation for the finite deformation analysis, a modified compressible neo-Hookean hyperelastic model with a Kelvin solid viscous enhancement for the solid matrix is implemented as a test function for the nonlinear constitutive model. The constitutive model for fluid flow is represented by a generalized Darcy’s law formulated with respect to the current configuration. Fluid compressibility is also considered in terms of volumetric logarithmic strain. Numerical examples in 1-D and 2-D are presented to validate the finite element model. Results of the small and finite deformation analyses are compared at different strain levels. For the 1-D case the numerical simulation was also compared with the analytical solution. These examples demonstrate the significance of large deformation effects on the transient responses of porous structures, as well as the strong convergence profile exhibited by the iterative algorithm.
Digital collection
John A. Blume Earthquake Engineering Center Technical Report Series

Online 4. An Internet-Enabled Software Framework for the Collaborative Development of a Structural Analysis Program [2002]

Description
Book
Summary
This thesis describes the research and prototype implementation of an Internet-enabled software framework that facilitates the utilization and the collaborative development of a finite element structural analysis program by taking advantage of object-oriented modeling, distributed computing, database and other advanced computing technologies. This new framework allows users easy access to the analysis program and the analysis results by using a web-browser or other application programs, such as MATLAB. In addition, the framework serves as a common finite element analysis platform for which researchers and software developers can build, test, and incorporate new developments. The collaborative software framework is built upon an object-oriented finite element program. The research objective is to enhance and improve the capability and performance of the finite element program by seamlessly integrating legacy code and new developments. Developments can be incorporated by directly integrating with the core as a local module and/or by implementing as a remote service module. There are several approaches to incorporate software modules locally, such as defining new subclasses, building interfaces and wrappers, or developing a reverse communication mechanism. The distributed and collaborative architecture also allows a software component to be incorporated as a service in a dynamic and distributed manner. Two forms of remote element services, namely the distributed element service and the dynamic shared library element service, are introduced in the framework to facilitate the distributed usage and the collaborative development of a finite element program. The collaborative finite element software framework also includes data and project management functionalities. A database system is employed to store selected analysis results and to provide flexible data management and data access. The Internet is utilized as a data delivery vehicle and a data query language is developed to provide an easy-to use mechanism to access the needed analysis results from readily accessible sources in a ready-to-use format for further manipulation. Finally, a simple project management scheme is developed to allow the users to manage and to collaborate on the analysis of a structure.
Digital collection
John A. Blume Earthquake Engineering Center Technical Report Series

5. Computing the GCD of two polynomials over an algebraic number field

Description
Book
SAL3 (off-campus storage)

6. Mathematical foundations of computer science 2015 : 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings. Part II [2015]

Description
Book — 1 online resource (xvii, 615 pages) : illustrations Digital: text file.PDF.
Summary
  • Intro
  • Preface
  • Conference Organization
  • Contents
  • Part II
  • Contents
  • Part I
  • Near-Optimal Asymmetric Binary Matrix Partitions
  • 1 Introduction
  • 2 Preliminaries
  • 3 The Uniform Case
  • 4 Asymmetric Binary Matrix Partition as Welfare Maximization
  • References
  • Dual VP Classes
  • 1 Introduction
  • 1.1 ACC1 and TC1
  • 1.2 Algebraic Degree
  • 1.3 Duality
  • 2 Preliminaries, and Definitions of -classes
  • 3 Subclasses of ACC1
  • 3.1 Comparing P and VP.
  • 4 Threshold Circuits and Small Degree
  • 4.1 Degree Reduction
  • 5 Conclusions, Discussion, and Open Problems
  • References
  • On Tinhofer's Linear Programming Approach to Isomorphism Testing
  • 1 Introduction
  • 2 Amenable Graphs
  • 3 Amenable Graphs Are Compact
  • 4 A Color-Refinement Based Hierarchy of Graphs
  • References
  • On the Complexity of Noncommutative Polynomial Factorization
  • 1 Introduction
  • 2 Variable-Disjoint Factorization Problem
  • 2.1 Uniqueness of Variable-Disjoint Factorization
  • 2.2 Equivalence with PIT
  • 2.3 Black-Box Variable-Disjoint Factorization Algorithm
  • 3 Factorization of Multilinear and Homogeneous Polynomials
  • 4 A Polynomial Decomposition Problem
  • 5 Concluding Remarks and Open Problems
  • References
  • An Algebraic Proof of the Real Number PCP Theorem
  • 1 Introduction
  • 1.1 Problems with the Classical Proof and Outline
  • 2 Basic Notions
  • 2.1 Testing Trigonometric Polynomials
  • 3 The Correctness Test
  • 4 Segmented Almost Transparent Proofs for NPR
  • References
  • On the Complexity of Hub Labeling (Extended Abstract)
  • 1 Introduction
  • 2 Preliminaries
  • 2.1 HL Approximation Algorithm
  • 2.2 Greedy HHL Algorithms
  • 3 HHL and Highway Dimension
  • 4 Upper Bounds
  • 5 Lower Bounds
  • 6 NP-Hardness Proofs
  • 6.1 Undirected Graphs
  • 6.2 Directed Graphs
  • 7 HL vs HHL
  • 8 Concluding Remarks
  • References
  • On the Complexity of Speed Scaling
  • 1 Introduction
  • 2 Model and Notation
  • 3 Hardness Results
  • 3.1 Hardness of B-IDUA
  • 4 Polynomial Time Algorithms
  • 4.1 An Algorithm for FE-IDUU
  • 4.2 An Algorithm for FE-ICUU
  • 4.3 An Algorithm for FE-FCWA
  • 5 Equivalence Reductions
  • 5.1 Reducing B-ICUU to FE-ICUU
  • 5.2 Reducing the Discrete to the Continuous Setting
  • 5.3 Reducing from Budget to Flow Plus Energy for Fractional Flow
  • References
  • Almost All Functions Require Exponential Energy
  • 1 Introduction
  • 1.1 Our Contributions
  • 1.2 Related Work
  • 1.3 Formal Model
  • 2 A Lower Bound on the Number of Functions Computable by a Circuit
  • 2.1 Homogeneous Supply Voltages
  • 2.2 Heterogeneous Supply Voltages
  • 3 Almost All Functions Require Exponential Energy
  • 3.1 Adaptation of Shannon's Argument
  • 3.2 Homogeneous Supply Voltages
  • 3.3 Heterogeneous Supply Voltages
  • 4 Relating Energy and the Number of Faulty Gates
  • References
  • On Dynamic DFS Tree in Directed Graphs
  • 1 Introduction
  • 1.1 An Efficient Decremental Algorithm for a DFS Tree in a DAG
  • 1.2 Lower Bounds on Dynamic DFS Tree
This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).
(source: Nielsen Book Data)
Online

7. Algorithmic randomness and complexity [2008]

Description
Book — 1 online resource (xxviii, 855 pages) : illustrations
Summary
  • Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite Strings.- Relating Plain and Prefix-Free Complexity.- Effective Reals.- II. Randomness of Sets.- Martin-Lof Randomness.- Other Notions of Effective Randomness.- Algorithmic Randomness and Turing Reducibility.- III. Relative Randomness.- Measures of Relative Randomness.- The Quantity of K- and Other Degrees.- Randomness-Theoretic Weakness.- Lowness for Other Randomness Notions.- Effective Hausdorff Dimension.- IV. Further Topics.- Omega as an Operator.- Complexity of C.E. Sets.- References.- Index.
  • (source: Nielsen Book Data)
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields.
(source: Nielsen Book Data)
Online

8. HIGH-SPEED SWITCHING PROPERTIES OF THE EMITTER-COUPLED TRANSISTOR-PAIR. [electronic resource]. [1969]

  • Menlo Park, Calif. : Stanford Linear Accelerator Center. ; Oak Ridge, Tenn. : distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 1969
Description
Book — 1 online resource (Pages: 44) : digital, PDF file.
Online

9. Stress analysis of pressurized water reactor steam generator tube denting phenomena [1978]

  • Palo Alto, Calif. : Electric Power Research Institute, [1978]
Description
Book — 1 v. (various pagings) : ill. ; 28 cm.
Collection
SAL3 (off-campus storage)

10. Cooperative bug isolation : winning thesis of the 2005 ACM Doctoral Dissertation Competition [2007]

Description
Book — 1 online resource (xv, 101 pages) : illustrations Digital: text file.PDF.
Summary
  • Instrumentation Framework.- Practical Considerations.- Techniques for Statistical Debugging.- Related Work.- Conclusion.
  • (source: Nielsen Book Data)
This monograph presents a new and fundamental approach to software analysis that will provide a source of ideas and inspiration for many years to come. It constitutes a thoroughly revised and extended version of the author's PhD thesis, which was selected as the winning thesis of the 2005 ACM Doctoral Dissertation Competition. Ben Liblit did his PhD work at the University of California, Berkeley, with Alexander Aiken as thesis adviser.
(source: Nielsen Book Data)
Online

11. Transactional memory : foundations, algorithms, tools, and applications : COST Action Euro-TM IC1001 [2015]

  • Cham : Springer, 2015.
Description
Book — 1 online resource (xiv, 469 pages) : illustrations Digital: text file; PDF.
Summary
  • Design and implementation of TM systems, including their theoretical underpinnings and algorithmic foundations.- Programming language integration and verification tools.- Hardware supports.- Distributed TM systems.- Self-tuning mechanisms.- Lessons learnt from building complex TM-based applications.
  • (source: Nielsen Book Data)
The advent of multi-core architectures and cloud-computing has brought parallel programming into the mainstream of software development. Unfortunately, writing scalable parallel programs using traditional lock-based synchronization primitives is well known to be a hard, time consuming and error-prone task, mastered by only a minority of specialized programmers. Building on the familiar abstraction of atomic transactions, Transactional Memory (TM) promises to free programmers from the complexity of conventional synchronization schemes, simplifying the development and verification of concurrent programs, enhancing code reliability, and boosting productivity. Over the last decade TM has been subject to intense research on a broad range of aspects including hardware and operating systems support, language integration, as well as algorithms and theoretical foundations. On the industrial side, the major players of the software and hardware markets have been up-front in the research and development of prototypal products providing support for TM systems. This has recently led to the introduction of hardware TM implementations on mainstream commercial microprocessors and to the integration of TM support for the world's leading open source compiler. In such a vast inter-disciplinary domain, the Euro-TM COST Action (IC1001) has served as a catalyzer and a bridge for the various research communities looking at disparate, yet subtly interconnected, aspects of TM. This book emerged from the idea having Euro-TM experts compile recent results in the TM area in a single and consistent volume. Contributions have been carefully selected and revised to provide a broad coverage of several fundamental issues associated with the design and implementation of TM systems, including their theoretical underpinnings and algorithmic foundations, programming language integration and verification tools, hardware supports, distributed TM systems, self-tuning mechanisms, as well as lessons learnt from building complex TM-based applications.
(source: Nielsen Book Data)
Online

12. Advanced process analysis for petroleum refining [electronic resource] : Petroleum project fact sheet [2000]

  • Washington, D.C. : United States. Dept. of Energy ; Oak Ridge, Tenn. : distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2000
Description
Book — 1 online resource (vp. ) : digital, PDF file.
Summary
This is a fact sheet on an advanced computer analysis system for petroleum refining written for the NICE3 Program.
Online

13. Developments in language theory : 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings [2015]

Description
Book — 1 online resource (xxii, 440 pages) : illustrations Digital: text file.PDF.
Summary
  • Recognisable Languages over Monads
  • Garside and quadratic normalisation: a survey
  • Grammar-Based Tree Compression
  • On decidability of intermediate levels of concatenation hierarchies
  • Ergodic in Finite permutations of minimal complexity
  • Diverse Palindromic Factorization is NP-Complete
  • Factorization in Formal Languages
  • Consensus Game Acceptors
  • On the Size of Two-Way Reasonable Automata for the Liveness Problem
  • Squareable Words
  • Complexity Analysis: Transformation Monoids of Finite Automata
  • Palindromic complexity of trees
  • Deciding proper conjugacy of classes of one-sided Finite-type-Dyck shifts
  • Transfinite Lyndon words
  • Unary patterns under permutations
  • Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change
  • Enumeration formulin neutral sets
  • On the Density of Context-Free and Counter Languages
  • Star-Continuous Kleene Omega-Algebras
  • Unary probabilistic and quantum automata on promise problems
  • Generalizations of Code Languages with Marginal Errors
  • Minimal Reversible Deterministic Finite Automata
  • Multi-Sequential Word Relations
  • The Boundary of Prefix-Free Languages
  • A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
  • Path Checking for MTL and TPTL over Data Words
  • On Distinguishing NC1 and NL
  • Sur minimisation of automata
  • On the Complexity of k-Piecewise Testability and the Depth of Automata
  • Interval Exchange Words and the Question of Hof, Knill, and Simon
  • State Complexity of Neighbourhoods and Approximate Pattern Matching
  • Deterministic ordered restarting automata that compute functions
  • Weight Assignment Logic
  • Complexity Bounds of Constant-Space Quantum Computation.
This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing.
Online

14. Developments in language theory : 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings [2014]

Description
Book — 1 online resource (xviii, 349 pages) : illustrations Digital: text file; PDF.
Summary
  • Finite Automata and Regular Languages On Automatic Transitive Graphs.- Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.- On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States.- State Complexity of Deletion.- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory.- On two Algorithmic Problems about Synchronizing Automata (short paper).- Synchronizing Automata with Random Inputs (short paper).- Graph Spectral Properties of Deterministic Finite Automata (short paper).- Pushdown Automata and Related Models.- Input-Driven Pushdown Automata with Limited Nondeterminism (invited paper).- How to Remove the Look-Ahead of Top-Down Tree Transducers.- Scope-Bounded Pushdown Languages.- Visibly Pushdown Transducers with Well-nested Outputs.- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing.- Pumping Lemma and Ogden Lemma for Displacement Context-free Grammars.- Combinatorics and Algorithmics on Words Aperiodic Tilings and Entropy
  • On k-Abelian Pattern Matching.- On k-Abelian Palindromic Rich and Poor Words.- Variations of The Morse{Hedlund Theorem for k-Abelian Equivalence.- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.- Knight Tiles: Particles and Collisions in The Realm of 4-Way Deterministic Tilings
  • Eigenvalues and Transduction of Morphic Sequences.- Breadth-First Serialisation of Trees and Rational Languages (short paper).- Algebraic, Decidability and Complexity Problems for Languages Measuring Communication in Automata Systems (invited paper).- From Algebra to Logic: There and Back Again { The Story of A Hierarchy (invited paper).- Closure Properties of Pattern Languages.- Minimal and Hyper-Minimal Biautomata.- Deterministic Set Automata.- The Minimum Amount of Useful Space: New Results and New Directions.- Debates with Small Transparent Quantum Verifiers.- Embedding Finite and Infinite Words into Overlapping Tiles.
  • (source: Nielsen Book Data)
This book constitutes the proceedings of the 18th International Conference on Developments in Language Theory, DLT 2014, held in Ekaterinburg, Russia, in August 2014. The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on Grammars, Acceptors and Transducers for Words, Trees and Graphs, Algebraic Theories of Automata, Algorithmic, Combinatorial and Algebraic Properties of Words and Languages, Variable Length Codes, Symbolic Dynamics, Cellular Automata, Polyominoes and Multidimensional Patterns, Decidability Questions, Image Manipulation and Compression, Efficient Text Algorithms, Relationships to Cryptography, Concurrency, Complexity Theory and Logic, Bio-Inspired Computing and Quantum Computing.
(source: Nielsen Book Data)
Online

15. Integrated uncertainty in knowledge modelling and decision making : international symposium, IUKM 2013, Beijing, China, July 12-14, 2013, proceedings [2013]

Description
Book — 1 online resource (xii, 218 pages) : illustrations Digital: text file.PDF.
Summary
  • Robot Reasoning Using First Order Bayesian Networks / Saleha Raza, Sajjad Haider
  • Dempster-Shafer Theory with Smoothness / Ronald Böck, Stefan Glüge, Andreas Wendemuth
  • A Probabilistic Model for Prioritizing Engineering Design Requirements in Uncertain QFD / Hong-Bin Yan, Tieju Ma
  • Applying OWA Operator to Model Group Behaviors in Uncertain QFD / Hong-Bin Yan, Tieju Ma, Van-Nam Huynh
  • New Propagation Algorithm in Dynamic Directed Evidential Networks with Conditional Belief Functions / Wafa Laâmari, Boutheina Ben Yaghlane
  • Evidential Grammars for Image Interpretation -- Application to Multimodal Traffic Scene Understanding / Jean-Baptiste Bordes, Franck Davoine
  • Generic Discounting Evaluation Approach for Urban Image Classification / Ahmed Samet, Imen Hammami, Eric Lefèvre
  • Spatial Weighting for Bag-of-Features Based Image Retrieval / Chuanqian Wang, Baochang Zhang
  • A Random Set and Rule-Based Regression Model Incorporating Image Labels / Guanyi Li, Jonathan Lawry
  • Mining Statistically Significant Target mRNA Association Rules Based on microRNA / Feng Chen, Tingting Wang, Yu Wang
  • Interval Algorithm for Set-Membership Identification of MIMO LTI System / Xiaojun Wang, Chen Yang, Baochang Zhang
  • An Approach for Obtaining Bargaining Set in Multi-choice Games / Tianwen Li, Feng Ma, Weiyi Liu
  • An Optimized Method for Selection of the Initial Centers of K-Means Clustering / YongJun Zhang, Enxiu Cheng
  • Improving Short Text Classification Using Public Search Engines / Wang Meng, Lin Lanfen, Wang Jing, Yu Penghua
  • Using Social Networks for Integrating a Tacit Knowledge Repository to Support the Performance of Software Development Teams / Reyes Juárez-Ramírez, Rafael Pimienta-Romo
  • Tacit Knowledge Formalization to Support the Adoption Process of Software Quality Models / Violeta Ocegueda-Miramontes
  • Design and Implementation of an Office Automation Assistant Utility Using Adobe AIR Technology / Xin Liu, Liang Liao, Bin Yang, Heng Liu
  • Modified NFTSM on State in Switched Reluctance Motor Speed Controller / Yong Cheng
  • Uncertain Nonlinear System Modeling and Identification Using Belief Rule-Based Systems / Yu-Wang Chen, Jian-Bo Yang, Dong-Ling Xu.
This book constitutes the refereed proceedings of the International Symposium on Integrated Uncertainty in Knowledge Modeling and Decision Making, IUKM 2013, held in Beijing China, in July 2013. The 19 revised full papers were carefully reviewed and selected from 49 submissions and are presented together with keynote and invited talks. The papers provide a wealth of new ideas and report both theoretical and applied research on integrated uncertainty modeling and management.
Online

16. Computer algebra in scientific computing : 10th international workshop, CASC 2007, Bonn, Germany, September 16-20, 2007 : proceedings [2007]

Description
Book — 1 online resource (xiii, 460 pages) : illustrations Digital: text file.PDF.
Summary
  • Analytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation.- Computations in Modules over Commutative Domains.- Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds.- An Efficient LLL Gram Using Buffered Transformations.- On the Computation of A ???-Maps.- Algebraic Visualization of Relations Using RelView.- Comprehensive Triangular Decomposition.- Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations.- A Symbolic-Numerical Algorithm for Solving the Eigenvalue Problem for a Hydrogen Atom in the Magnetic Field: Cylindrical Coordinates.- An Algorithm for Construction of Normal Forms.- Computer Algebra: A `Classical' Path to Explore Decoherence and Entanglement Phenomena in Quantum Information Theory.- Deducing the Constraints in the Light-Cone SU(3) Yang-Mills Mechanics Via Groebner Bases.- On the Weight Spectra of Conway Matrices Related to the Non-transitive Head-or-Tail Game.- Properties of the Liapunov Stability Zones of the Lagrange Triangle.- Studying the Stability of the Second Order Non-autonomous Hamiltonian System.- On the Peculiar Properties of Families of Invariant Manifolds of Conservative Systems.- A Unified Algorithm for Multivariate Analytic Factorization.- On the Computation of the Defining Polynomial of the Algebraic Riccati Equation.- Symmetries and Dynamics of Discrete Systems.- Exact Solutions of Completely Integrable Systems and Linear ODE's Having Elliptic Function Coefficients.- Dynamics of Nonlinear Parabolic Equations with Cosymmetry.- Weak Integer Quantifier Elimination Beyond the Linear Case.- Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors.- Ruppert Matrix as Subresultant Mapping.- Construction of Computer System for Microobjects Recognition Based on Neural Networks.- Analytical Solution for Transient Flow of a Generalized Bingham Fluid with Memory in a Movable Tube Using Computer Algebra.- Some Elimination Problems for Matrices.- A Full System of Invariants for Third-Order Linear Partial Differential Operators in General Form.- Automatic Stability Analysis for a Diffusion Equation with Memories Using Maple.- Bounds for Real Roots and Applications to Orthogonal Polynomials.- Distance Computation from an Ellipsoid to a Linear or a Quadric Surface in IR n
  • Robust Stability for Parametric Linear ODEs.- Symbolic and Algebraic Methods for Linear Partial Differential Operators.- A New Scheme for Deniable/Repudiable Authentication.- An Algebraic-Numeric Algorithm for the Model Selection in Kinetic Networks.- On the Representation of the Differential Operator in Bases of Periodic Coiflets and It's Application.
  • (source: Nielsen Book Data)
This book constitutes the refereed proceedings of the 10th International Workshop on Computer Algebra in Scientific Computing, CASC 2007, held in Bonn, Germany, in September 2007. The volume is dedicated to Professor Vladimir P. Gerdt on the occasion of his 60th birthday. The papers cover not only various expanding applications of computer algebra to scientific computing but also the computer algebra systems themselves and the CA algorithms.
(source: Nielsen Book Data)
Online

17. PECT-I [electronic resource] : A FORTRAN IV COMPUTER PROGRAM TO DETERMINE THE PLASTIC-ELASTIC CREEP AND THERMAL DEFORMATIONS IN THICK-WALLED CYLINDERS [1969]

  • Washington, D.C. : United States. Dept. of Energy. ; Oak Ridge, Tenn. : distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 1969
Description
Book — Pages: 87 : digital, PDF file.
Online

18. Computing with new resources : essays dedicated to Jozef Gruska on the occasion of his 80th birthday [2014]

  • Cham : Springer, 2014.
Description
Book — 1 online resource (xxi, 473 pages) : illustrations Digital: text file; PDF.
Summary
  • Counting With Probabilistic and Ultrametric Finite Automata
  • Systolic Automata and P Systems
  • Soliton Automata with Multiple Waves
  • On Power Series over a Graded Monoid
  • Advances on Random Sequence Generation by Uniform Cellular Automata
  • On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages
  • Aspects of Reversibility for Classical Automata
  • A Weakly Universal Cellular Automaton in the Pentagrid with Five States
  • Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem
  • Time-Optimum Smaller-State Synchronizers for Cellular Automata
  • Computing Boolean Functions via Quantum Hashing
  • Complexity of Promise Problems on Classical and Quantum Automata
  • Quantum Complexity of Boolean Matrix Multiplication and Related Problems
  • Quantum Distributed Computing Applied to Grover's Search Algorithm
  • Maximally Entangled State in Pseudo-Telepathy Games
  • Quantum Finite Automata: A Modern Introduction
  • Physical Aspects of Oracles for Randomness and Hadamard's Conjecture
  • From Quantum Query Complexity to State Complexity
  • Small Universal Devices
  • A Technique to Obtain Hardness Results for Randomized Online Algorithms
  • Integral Difference Ratio Functions on Integers
  • Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources
  • Symmetries and Dualities in Name-Passing Process Calculi
  • Learning from Positive Data and Negative Counterexamples
  • One-Sided Random Context Grammars
  • How Can We Construct Reversible Machines out of Reversible Logic Element with Memory?
  • On Evolutionary Approximation of Logic Circuits
  • A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
  • On the Limit of Some Algorithmic Approach to Circuit Lower Bounds
  • P Systems with Anti-Matter
  • A Robust Universal Flying Amorphous Computer
  • Minimal Reaction Systems Defining Subset Functions
  • Grand Challenges of Informatics
  • Konrad Zuse's Relationship to Informatics.
Professor Jozef Gruska is a well known computer scientist for his many and broad results. He was the father of theoretical computer science research in Czechoslovakia and among the first Slovak programmers in the early 1960s. Jozef Gruska introduced the descriptional complexity of grammars, automata, and languages, and is one of the pioneers of parallel (systolic) automata. His other main research interests include parallel systems and automata, as well as quantum information processing, transmission, and cryptography. He is co-founder of four regular series of conferences in informatics and two in quantum information processing and the Founding Chair (1989-96) of the IFIP Specialist Group on Foundations of Computer Science.
Online

19. Swarm Intelligence : 9th International Conference, Ants 2014, Brussels, Belgium, September 10-12, 2014. Proceedings [2014]

Description
Book — 1 online resource (308 pages) : illustrations Digital: text file; PDF.
Summary
  • A Novel Ant Colony Algorithm for Building Neural Network Topologies.- An ACO Algorithm to Solve an Extended Cutting Stock Problem for Scrap Minimization in a Bar Mill.- An Experiment in Automatic Design of Robot Swarms.- Angle Modulated Particle Swarm Variants.- Ant Colony Optimization on a Budget of 1000.- Application of Supervisory Control Theory to Swarms of e-puck and Kilobot Robots.- Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!.- Diversity Rate of Change Measurement for Particle Swarm Optimizers.- Evolutionary Swarm Robotics: Genetic Diversity, Task-allocation and Task-switching.- Influencing a Flock via Ad Hoc Teamwork.- MACOC: A Medoid-based ACO Clustering Algorithm.- Particle Swarm Convergence: Standardized Analysis and Topological Influence.- Scheduling a Galvanizing Line by Ant Colony Optimization.- SRoCS: Leveraging Stigmergy on a Multi-robot Construction Platform for Unknown Environments.- Swarm in a Fly Bottle: Feedback-based Analysis of Self-organizing Temporary Lock-ins.- Temporal Task Allocation in Periodic Environments.- Towards a Cognitive Design Pattern for Collective Decision-making.- Short Papers.- A Novel Competitive Quantum-behaviour Evolutionary Multi-swarm Optimizer Algorithm Based on CUDA Architecture Applied to Constrained Engineering Design.- Cooperative Object Recognition: Behaviours of a Artificially Evolved Swarm.- Emergent Diagnoses from a Collective of Radiologists: Algorithmic versus Social Consensus Strategies.- Foraging Agent Swarm Optimization with Applications in Data Clustering.- GPU Implementation of Food-foraging Problem for Evolutionary Swarm Robotics Systems.- Nature-inspired Swarm Robotics Algorithms for Prioritized Foraging.- Particle Swarm Optimisation with Enhanced Memory Particles.- Sorting in Swarm Robots Using Communication-based Cluster Size Estimation.- Using Fluid Neural Networks to Create Dynamic Neighborhood Topologies in Particle Swarm Optimization.- Extended Abstracts.- A Low-cost Real-time Tracking Infrastructure for Ground-based Robot Swarms.- A New Ant Colony Optimization Algorithm: Three Bound Ant System.- An Adaptive Bumble Bees Mating Optimization Algorithm for the Hierarchical Permutation Flowshop Scheduling Problem.- Gene Expression in DNA Microarrays: A classification problem using Artificial Bee Colony (ABC) algorithm.- Morphology Learning via MDL and Ants.- Parallelizing Solution Construction in ACO for GPUs.- Solving Resource-constraint Project Scheduling Problems based on ACO algorithms.
  • (source: Nielsen Book Data)
This book constitutes the proceedings of the 9th International Conference on Swarm Intelligence, held in Brussels, Belgium, in September 2014. This volume contains 17 full papers, 9 short papers, and 7 extended abstracts carefully selected out of 55 submissions. The papers cover empirical and theoretical research in swarm intelligence such as: behavioral models of social insects or other animal societies, ant colony optimization, particle swarm optimization, swarm robotics systems.
(source: Nielsen Book Data)
Online

20. Wireless internet : 7th International ICST Conference, WICON 2013, Shanghai, China, April 11-12, 2013, Revised selected papers [2013]

Description
Book — 1 online resource (x, 203 pages) : illustrations Digital: text file.PDF.
Summary
  • Vehicular Communications and Heterogeneous Networks.- Cognitive Radio and Multi-antenna Systems.- 3G Networks and Beyond.- Ad Hoc and Mesh Networks.
  • (source: Nielsen Book Data)
This book constitutes the thoroughly refereed post-conference proceedings of the 7th International ICST Conference on Wireless Internet, WICON 2013, held in Shanghai, China, in April 2012. The 20 revised full papers were carefully reviewed and selected from numerous submissions. The papers cover topics such as vehicular communications and heterogeneous networks, cognitive radio and multi-antenna systems, networks and beyond, ad hoc and mesh networks.
(source: Nielsen Book Data)
Online

Articles+

Journal articles, e-books, & other e-resources
See article+ results

Guides

Course- and topic-based guides to collections, tools, and services.
Search ""computer analysis"" in all guide pages