1  20
Next
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 desktop computers of limited capacities. The results of this approach are compared with the exact catenary solution.
Green Library
Green Library  Status 

Find it US Federal Documents  
A 13.78:PNW120  Unknown 
 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.
 Online
Green Library
Green Library  Status 

Find it US Federal Documents  
A 13.79:INT79  Unknown 
Online 3. Finite Element Formulation of PoroElasticity 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 solidfluid 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 socalled up 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 up formulation for the finite deformation analysis, a modified compressible neoHookean 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 1D and 2D are presented to validate the finite element model. Results of the small and finite deformation analyses are compared at different strain levels. For the 1D 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 InternetEnabled Software Framework for the Collaborative Development of a Structural Analysis Program [2002]
 Peng, J (Author)
 October 2002
 Description
 Book
 Summary

This thesis describes the research and prototype implementation of an Internetenabled software framework that facilitates the utilization and the collaborative development of a finite element structural analysis program by taking advantage of objectoriented 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 webbrowser 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 objectoriented 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 easyto use mechanism to access the needed analysis results from readily accessible sources in a readytouse 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
 Description
 Book
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
111729  Available 
 Symposium on Mathematical Foundations of Computer Science (1972 ) (40th : 2015 : Milan, Italy)
 Berlin, Heidelberg : Springer, 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
 NearOptimal 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 ColorRefinement Based Hierarchy of Graphs
 References
 On the Complexity of Noncommutative Polynomial Factorization
 1 Introduction
 2 VariableDisjoint Factorization Problem
 2.1 Uniqueness of VariableDisjoint Factorization
 2.2 Equivalence with PIT
 2.3 BlackBox VariableDisjoint 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 NPHardness 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 BIDUA
 4 Polynomial Time Algorithms
 4.1 An Algorithm for FEIDUU
 4.2 An Algorithm for FEICUU
 4.3 An Algorithm for FEFCWA
 5 Equivalence Reductions
 5.1 Reducing BICUU to FEICUU
 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
(source: Nielsen Book Data)
7. Algorithmic randomness and complexity [2008]
 Downey, R. G. (Rod G.)
 New York ; London : Springer, 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 PrefixFree Complexity. Effective Reals. II. Randomness of Sets. MartinLof 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. RandomnessTheoretic 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)
(source: Nielsen Book Data)
8. HIGHSPEED SWITCHING PROPERTIES OF THE EMITTERCOUPLED TRANSISTORPAIR. [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
 Palo Alto, Calif. : Electric Power Research Institute, [1978]
 Description
 Book — 1 v. (various pagings) : ill. ; 28 cm.
 Collection
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
EPRI NP828  Available 
10. Cooperative bug isolation : winning thesis of the 2005 ACM Doctoral Dissertation Competition [2007]
 Liblit, Ben.
 Berlin ; New York : Springer, ©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)
(source: Nielsen Book Data)
11. Transactional memory : foundations, algorithms, tools, and applications : COST Action EuroTM 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. Selftuning mechanisms. Lessons learnt from building complex TMbased applications.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 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
 Conference on Developments in Language Theory (19th : 2015 : Liverpool, England)
 Cham : Springer, 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
 GrammarBased Tree Compression
 On decidability of intermediate levels of concatenation hierarchies
 Ergodic in Finite permutations of minimal complexity
 Diverse Palindromic Factorization is NPComplete
 Factorization in Formal Languages
 Consensus Game Acceptors
 On the Size of TwoWay 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 onesided FinitetypeDyck 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 ContextFree and Counter Languages
 StarContinuous Kleene OmegaAlgebras
 Unary probabilistic and quantum automata on promise problems
 Generalizations of Code Languages with Marginal Errors
 Minimal Reversible Deterministic Finite Automata
 MultiSequential Word Relations
 The Boundary of PrefixFree Languages
 A connected 3state 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 kPiecewise 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 ConstantSpace Quantum Computation.
 Conference on Developments in Language Theory (18th : 2014 : Ekaterinburg, Russia)
 Cham : Springer, 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 TwoSided 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 WedderburnArtin 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. InputDriven Pushdown Automata with Limited Nondeterminism (invited paper). How to Remove the LookAhead of TopDown Tree Transducers. ScopeBounded Pushdown Languages. Visibly Pushdown Transducers with Wellnested Outputs. Characterising REGEX Languages by Regular Languages Equipped with FactorReferencing. Pumping Lemma and Ogden Lemma for Displacement Contextfree Grammars. Combinatorics and Algorithmics on Words Aperiodic Tilings and Entropy
 On kAbelian Pattern Matching. On kAbelian Palindromic Rich and Poor Words. Variations of The Morse{Hedlund Theorem for kAbelian Equivalence. Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Knight Tiles: Particles and Collisions in The Realm of 4Way Deterministic Tilings
 Eigenvalues and Transduction of Morphic Sequences. BreadthFirst 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 HyperMinimal 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)
(source: Nielsen Book Data)
 IUKM (Symposium) (2013 : Beijing, China)
 Heidelberg : Springer, 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
 DempsterShafer Theory with Smoothness / Ronald Böck, Stefan Glüge, Andreas Wendemuth
 A Probabilistic Model for Prioritizing Engineering Design Requirements in Uncertain QFD / HongBin Yan, Tieju Ma
 Applying OWA Operator to Model Group Behaviors in Uncertain QFD / HongBin Yan, Tieju Ma, VanNam 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 / JeanBaptiste Bordes, Franck Davoine
 Generic Discounting Evaluation Approach for Urban Image Classification / Ahmed Samet, Imen Hammami, Eric Lefèvre
 Spatial Weighting for BagofFeatures Based Image Retrieval / Chuanqian Wang, Baochang Zhang
 A Random Set and RuleBased 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 SetMembership Identification of MIMO LTI System / Xiaojun Wang, Chen Yang, Baochang Zhang
 An Approach for Obtaining Bargaining Set in Multichoice Games / Tianwen Li, Feng Ma, Weiyi Liu
 An Optimized Method for Selection of the Initial Centers of KMeans 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árezRamírez, Rafael PimientaRomo
 Tacit Knowledge Formalization to Support the Adoption Process of Software Quality Models / Violeta OceguedaMiramontes
 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 RuleBased Systems / YuWang Chen, JianBo Yang, DongLing Xu.
 CASC (Workshop : 2001 ) (10th : 2007 : Bonn, Germany)
 Berlin ; New York : Springer, ©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 NavierStokes Equations. A SymbolicNumerical 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 LightCone SU(3) YangMills Mechanics Via Groebner Bases. On the Weight Spectra of Conway Matrices Related to the Nontransitive HeadorTail Game. Properties of the Liapunov Stability Zones of the Lagrange Triangle. Studying the Stability of the Second Order Nonautonomous 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 ThirdOrder 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 AlgebraicNumeric 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)
(source: Nielsen Book Data)
 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 EqualLength Languages
 Aspects of Reversibility for Classical Automata
 A Weakly Universal Cellular Automaton in the Pentagrid with Five States
 Minimum and nonMinimum Time Solutions to the Firing Squad Synchronization Problem
 TimeOptimum SmallerState 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 PseudoTelepathy 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 NamePassing Process Calculi
 Learning from Positive Data and Negative Counterexamples
 OneSided 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 CyberPhysical Systems
 On the Limit of Some Algorithmic Approach to Circuit Lower Bounds
 P Systems with AntiMatter
 A Robust Universal Flying Amorphous Computer
 Minimal Reaction Systems Defining Subset Functions
 Grand Challenges of Informatics
 Konrad Zuse's Relationship to Informatics.
 ANTS (Conference : Swarm intelligence) (9th : 2014 : Brussels, Belgium)
 Cham : Springer, 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 epuck 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, Taskallocation and Taskswitching. Influencing a Flock via Ad Hoc Teamwork. MACOC: A Medoidbased ACO Clustering Algorithm. Particle Swarm Convergence: Standardized Analysis and Topological Influence. Scheduling a Galvanizing Line by Ant Colony Optimization. SRoCS: Leveraging Stigmergy on a Multirobot Construction Platform for Unknown Environments. Swarm in a Fly Bottle: Feedbackbased Analysis of Selforganizing Temporary Lockins. Temporal Task Allocation in Periodic Environments. Towards a Cognitive Design Pattern for Collective Decisionmaking. Short Papers. A Novel Competitive Quantumbehaviour Evolutionary Multiswarm 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 Foodforaging Problem for Evolutionary Swarm Robotics Systems. Natureinspired Swarm Robotics Algorithms for Prioritized Foraging. Particle Swarm Optimisation with Enhanced Memory Particles. Sorting in Swarm Robots Using Communicationbased Cluster Size Estimation. Using Fluid Neural Networks to Create Dynamic Neighborhood Topologies in Particle Swarm Optimization. Extended Abstracts. A Lowcost Realtime Tracking Infrastructure for Groundbased 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 Resourceconstraint Project Scheduling Problems based on ACO algorithms.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 International Conference on Wireless Internet (7th : 2013 : Shanghai, China)
 Heidelberg : Springer, 2013.
 Description
 Book — 1 online resource (x, 203 pages) : illustrations Digital: text file.PDF.
 Summary

 Vehicular Communications and Heterogeneous Networks. Cognitive Radio and Multiantenna Systems. 3G Networks and Beyond. Ad Hoc and Mesh Networks.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.