JCMCC


Book Description




Structural Analysis of Complex Networks


Book Description

Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Applications to biology, chemistry, linguistics, and data analysis are emphasized. The book is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science, machine learning, artificial intelligence, computational and systems biology, cognitive science, computational linguistics, and mathematical chemistry. It may also be used as a supplementary textbook in graduate-level seminars on structural graph analysis, complex networks, or network-based machine learning methods.




Discrete Mathematics and Theoretical Computer Science


Book Description

The refereed proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science, DMTCS 2003, held in Dijon, France, in July 2003. The 18 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 35 submissions. A broad variety of topics in discrete mathematics and the theory of computing is addressed including information theory, coding, algorithms, complexity, automata, computational mathematics, combinatorial computations, graph computations, algorithmic geometry, relational methods, game-theoretic methods, combinatorial optimization, and finite state systems.




JCMCC


Book Description




Designs 2002


Book Description

This volume is a sequel to our 1996 compilation, Computational and Constructive Design Theory. Again we concentrate on two closely re lated aspects of the study of combinatorial designs: design construction and computer-aided study of designs. There are at least three classes of constructive problems in design theory. The first type of problem is the construction of a specific design. This might arise because that one particular case is an exception to a general rule, the last remaining case of a problem, or the smallest unknown case. A good example is the proof that there is no projective plane of parameter 10. In that case the computations involved were not different in kind from those which have been done by human brains without electronic assistance; they were merely longer. Computers have also been useful in the study of combinatorial spec trum problems: if a class of design has certain parameters, what is the set of values that the parameters can realize? In many cases, there is a recursive construction, so that the existence of a small number of "starter" designs leads to the construction of infinite classes of designs, and computers have proven very useful in finding "starter" designs.




Graphs, Matrices, and Designs


Book Description

Examines partitions and covers of graphs and digraphs, latin squares, pairwise balanced designs with prescribed block sizes, ranks and permanents, extremal graph theory, Hadamard matrices and graph factorizations. This book is designed to be of interest to applied mathematicians, computer scientists and communications researchers.







Teaching Dance


Book Description

Teaching dance is an activity that is both a rigorous discipline which involves many years of study and a deeply personal expression. Throughout the years, from the time I first encountered the Spectrum, I've realized more and more what an amazing pedagogical tool it is for dance as an art form. The Spectrum will help dance teachers address many issues, including the following: - For the beginning teacher, "Did I meet my objectives? How can I judge how well I did?" - For the advanced teacher, "How can I encourage initiative and make students more self-motivated?" - For the college or university teacher, "How do I help my colleagues in other disciplines (and administration) understand dance as an academic discipline? What do I put in my tenure and promotion portfolio?" - For teachers with adult beginner classes, "How do I introduce my adult learners to basic movement material without 'teaching down' to them, to recognize their cognitive level and maturity?" - For teachers in private studios, "How can I teach so that I reach every student, keep students coming back for more classes, and thus keep enrollment (and my business) up?" - When teaching large classes, "How can I provide feedback for every student in the class and still keep the class moving?" Whether you are facing a class of students for the first time or are an experienced teacher, whether you teach children or adults, whether in a recreational setting or college, you will find useful information here. Supported by illustrations, examples, sample lesson plans, criteria sheets, activity suggestions and discussion questions, this work is designed for use as a textbook for student teachers and a resource for the professional teacher. It includes practical tips and application suggestions, with additional material downloadable from the author's website.




Algorithms and Computation


Book Description

This book constitutes the refereed proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009, held in Honolulu, Hawaii, USA in December 2009. The 120 revised full papers presented were carefully reviewed and selected from 279 submissions for inclusion in the book. This volume contains topics such as algorithms and data structures, approximation algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, cryptography, experimental algorithm methodologies, graph drawing and graph algorithms, internet algorithms, online algorithms, parallel and distributed algorithms, quantum computing and randomized algorithms.




Algebra


Book Description

The Indian National. Science Academy has planned to bring out monographs on special topics with the aim of providing acce~sible surveys/reviews of topics of current research in various fields. Prof. S.K. Malik, FNA, Editor of Publications INSA asked me in October 1997 to edit a volume on algebra in this series. I invited a number of algebraists, several of them working in group rings, and it is with great satisfaction and sincere thanks to the authors that I present here in Algebra: Some Recent Advances the sixteen contributions received in response to my invitations. I.B.S. Passi On Abelian Difference Sets K. r Arasu* and Surinder K. Sehgal 1. Introduction We review some existence and nonexistence results - new and old - on abelian difference sets. Recent surveys on difference sets can be found in Arasu (1990), Jungnickel (1992a, b), Pott (1995), Jungnickel and Schmidt (1997), and Davis and Jedwab (1996). Standard references for difference sets are Baumert (1971), Beth et al. (1998), and Lander (1983). This article presents a flavour of the subject, by discussing some selected topics. Difference sets are very important in combinatorial design theory and in commu nication engineering while designing sequences with good correlation properties. Our extended bibliography covers a wide variety of papers written in the area of difference sets and related topics.