Narrow your search
Listing 1 - 4 of 4
Sort by

Book
Producing written and oral business reports : formatting, illustrating, and presenting
Author:
Year: 2017 Publisher: New York, New York (222 East 46th Street, New York, NY 10017) : Business Expert Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book emphasizes efficient, cost-effective methods for producing reports that will do what you, the writer or presenter, want them to do. This book is for you if you are: A business manager or other professional who must convey objective and organized information to others, in and outside your organization. An MBA candidate or an upper-level student in any professional field.


Book
Graph-Theoretic Problems and Their New Applications
Author:
ISBN: 3039287990 3039287982 Year: 2020 Publisher: MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

Graph theory is an important area of applied mathematics with a broad spectrum of applications in many fields. This book results from aSpecialIssue in the journal Mathematics entitled “Graph-Theoretic Problems and Their New Applications”. It contains 20 articles covering a broad spectrum of graph-theoretic works that were selected from 151 submitted papers after a thorough refereeing process. Among others, it includes a deep survey on mixed graphs and their use for solutions ti scheduling problems. Other subjects include topological indices, domination numbers of graphs, domination games, contraction mappings, and neutrosophic graphs. Several applications of graph theory are discussed, e.g., the use of graph theory in the context of molecular processes.

Keywords

Zagreb indices --- n/a --- generating function --- mitotic cell cycle --- Mycielskian graph --- evolution theory --- grids --- “partitions” of wheel graph --- generalized hypertree --- connectivity --- single-valued neutrosophic graph --- degree of a vertex --- domination game --- interval-valued intuitionistic fuzzy graph --- directed cycle --- makespan criterion --- total-colored graph --- bipartite matching extendable graph --- stochastic convergence --- bipartite neutrosophic graph --- signless Laplacian --- complete neutrosophic graph --- k-trees --- enhanced hypercube --- b-metric space --- resistance distance --- Wiener index --- mixed graph --- line graph --- NP-hard --- generalized first Zagreb index --- inverse degree index --- sum lordeg index --- Edge Wiener --- chromatic polynomial --- degree of vertex --- complement neutrosophic graph --- graphic contraction mappings --- embedding --- Cartesian product --- k-rainbow domination number --- distance between two vertices --- evolution algebra --- k-rainbow dominating function --- PI index --- subtree --- component --- competition-independence game --- interval-valued fuzzy graph --- b-metric-like space --- induced matching extendable --- edge coloring --- degree of edge --- approximation methods --- chromatic index --- join of graphs --- genetic algorithm --- hypergraph --- edge congestion --- complement --- polynomials in graphs --- vertex coloring --- interval-valued neutrosophic graph --- spanning tree --- Kempe chain --- general contractive mappings --- DD index --- wireless multihop network and social network --- distance --- evolutionary approach --- complexity analysis --- neutrosophic graph --- Kempe-locking --- wheel graph --- Birkhoff diamond --- domination number --- k-extendable --- degree-Kirchhoff index --- adjacent matrix --- perfect matching --- spectral radius --- normalized Laplacian --- corona product --- road transport network --- extremal values --- bound --- chromatic number --- graph coloring --- combinatorial optimization --- reformulated Zagreb indices --- wirelength --- intuitionistic fuzzy graph --- unit-time scheduling --- fan graph --- "partitions" of wheel graph


Book
Graph theoretic methods in multiagent networks
Authors: ---
ISBN: 1282979108 9786612979101 1400835356 9781400835355 9780691140612 0691140618 Year: 2010 Publisher: Princeton : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This accessible book provides an introduction to the analysis and design of dynamic multiagent networks. Such networks are of great interest in a wide range of areas in science and engineering, including: mobile sensor networks, distributed robotics such as formation flying and swarming, quantum networks, networked economics, biological synchronization, and social networks. Focusing on graph theoretic methods for the analysis and synthesis of dynamic multiagent networks, the book presents a powerful new formalism and set of tools for networked systems. The book's three sections look at foundations, multiagent networks, and networks as systems. The authors give an overview of important ideas from graph theory, followed by a detailed account of the agreement protocol and its various extensions, including the behavior of the protocol over undirected, directed, switching, and random networks. They cover topics such as formation control, coverage, distributed estimation, social networks, and games over networks. And they explore intriguing aspects of viewing networks as systems, by making these networks amenable to control-theoretic analysis and automatic synthesis, by monitoring their dynamic evolution, and by examining higher-order interaction models in terms of simplicial complexes and their applications. The book will interest graduate students working in systems and control, as well as in computer science and robotics. It will be a standard reference for researchers seeking a self-contained account of system-theoretic aspects of multiagent networks and their wide-ranging applications. This book has been adopted as a textbook at the following universities: ? University of Stuttgart, Germany Royal Institute of Technology, Sweden Johannes Kepler University, Austria Georgia Tech, USA University of Washington, USA Ohio University, USA

Keywords

Network analysis (Planning) --- Multiagent systems --- Agent-based model (Computer software) --- MASs (Multiagent systems) --- Multi-agent systems --- Systems, Multiagent --- Intelligent agents (Computer software) --- Project networks --- Planning --- System analysis --- Graphic methods. --- Mathematical models. --- Mathematical models --- Graphic methods --- Addition. --- Adjacency matrix. --- Algebraic graph theory. --- Algorithm. --- Automorphism. --- Bipartite graph. --- Cardinality. --- Cartesian product. --- Circulant graph. --- Combinatorics. --- Complete graph. --- Computation. --- Connectivity (graph theory). --- Controllability. --- Convex combination. --- Corollary. --- Cycle graph (algebra). --- Cycle space. --- Degree (graph theory). --- Degree matrix. --- Diagonal matrix. --- Diameter. --- Differentiable function. --- Dimension. --- Directed graph. --- Division by zero. --- Dynamical system. --- Eigenvalues and eigenvectors. --- Equilibrium point. --- Estimation. --- Estimator. --- Existential quantification. --- Extremal graph theory. --- Graph (discrete mathematics). --- Graph theory. --- Identity matrix. --- Incidence matrix. --- Information exchange. --- Initial condition. --- Interconnection. --- Iteration. --- Kalman filter. --- Kronecker product. --- LTI system theory. --- LaSalle's invariance principle. --- Laplacian matrix. --- Least squares. --- Line graph. --- Linear map. --- Lipschitz continuity. --- Lyapunov function. --- Lyapunov stability. --- Markov chain. --- Mathematical optimization. --- Matrix exponential. --- Measurement. --- Multi-agent system. --- Nash equilibrium. --- Natural number. --- Network topology. --- Nonnegative matrix. --- Notation. --- Observability. --- Optimal control. --- Optimization problem. --- Pairwise. --- Parameter. --- Path graph. --- Permutation matrix. --- Permutation. --- Positive semidefinite. --- Positive-definite matrix. --- Probability. --- Quantity. --- Random graph. --- Random variable. --- Rate of convergence. --- Requirement. --- Result. --- Robotics. --- Scientific notation. --- Sensor. --- Sign (mathematics). --- Simplicial complex. --- Special case. --- Spectral graph theory. --- Stochastic matrix. --- Strongly connected component. --- Subset. --- Summation. --- Supergraph. --- Symmetric matrix. --- Systems theory. --- Theorem. --- Theory. --- Unit interval. --- Upper and lower bounds. --- Variable (mathematics). --- Vector space. --- Without loss of generality.


Book
Molecular Computing and Bioinformatics
Authors: --- ---
ISBN: 303921196X 3039211951 Year: 2019 Publisher: MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

This text will provide the most recent knowledge and advances in the area of molecular computing and bioinformatics. Molecular computing and bioinformatics have a close relationship, paying attention to the same object but working towards different orientations. The articles will range from topics such as DNA computing and membrane computing to specific biomedical applications, including drug R&D and disease analysis.

Keywords

systems biology --- join graph --- hierarchical support vector regression --- transcription factor --- brain storm optimization --- heterogeneous information network embedding --- structural patterns --- gene fusion data --- Panax ginseng --- flowering plant --- geometric arithmetic index --- interspecies transmission --- iron-depleted --- drug discovery --- protein --- protein targeting --- recursively enumerable function --- Mycoplasma hominis --- environmental factor --- Alzheimer’s disease --- absorption --- angiogenesis --- classification --- self-organizing systems --- enzymatic numerical P system --- excretion --- atom-bond connectivity index --- molecular learning --- DNA coding --- phylogeny --- bone formation --- DCL1 --- line graph --- pseudo dinucleotide composition --- load balancing --- K2 --- efflux ratio --- osteogenesis --- distribution --- NanoString Technologies --- RAST server --- 8-bit adder/subtractor --- gene networks --- dihydrouridine --- structure information --- Cartesian product graph --- domain label --- stacking denoising auto-encoder --- DNA computing --- Stenotrophomonas maltophilia --- pattern classification --- stress --- causal direction learning --- machine learning --- adverse drug reaction prediction --- membrane computing --- support vector machine --- Brassica napus --- miRNA biogenesis --- identification of Chinese herbal medicines --- bio-inspired --- toxicity --- protein transduction domain --- RNA --- sequence information --- multiple interaction networks --- in silico --- protein complex --- drug --- low-dimensional representation --- gene coding protein --- amino acid mutation --- Bayesian causal model --- edge detection --- big data --- function prediction --- parallel computing --- resolution free --- Hamming distance --- cascade --- oligopeptide transporter --- DNA barcoding technology --- DNA strand displacement --- protein–protein interaction (PPI) --- biomedical text mining --- bioinformatics --- metabolism --- hypoxia-inducible factor-1? --- nucleotide physicochemical property --- Turing universality --- diabetes mellitus --- chaotic map --- multinetwork integration --- bacterial computing --- lignification --- penalized matrix decomposition --- ensemble classifier --- bacteria and plasmid system --- similarity network --- RNA secondary structure --- avian influenza virus --- evaluating driver partner --- image encryption --- siderophores --- meta-path-based proximity --- P-glycoprotein --- Tianhe-2 --- prostate cancer --- iron acquisition systems --- biochip technology --- gene susceptibility prioritization --- laccase --- DNA --- molecular computing --- microRNA --- clustering --- drug-target interaction prediction --- endoplasmic reticulum

Listing 1 - 4 of 4
Sort by