European Young Statisticians Meeting 1999
Marly-le-Roi, France; 24--28 August 1999.
European Young Statisticians Meeting Write us European Young Statisticians Meeting August 24 - 28, 1999 Marly-le-Roi, France Organized by INRA (the French National Institute of Agronomic Research) Department of Biometrics and Artificial Intelligence ( BIA ) Presentation of the EYSM Organizing Committee members Steering committee Local organizing committee International organizing committee Participants (the list of participants is now closed) Instructions for talks and abstracts ( Proceedings , postscript, 232 pages) Program Local information Meeting venue, accomodation, meals Reaching the meeting place Entry visa Tourism Meeting costs Registration fees Additionnal costs Instruction for payment (deadline for early registration: June 30, 1999) Conference sponsors S. Schbath Sept 8, 1999
BASS IX
Ninth Annual Biopharmaceutical Applied Statistics Symposium. Hilton Savannah DeSoto, Savannah, GA, USA; 9--13 December 2002.
BASS X - Dec 2003 BASS X Keynote Address: Nancy Geller National Heart, Lung and Blood Institute Dilemmas in Monitoring Clinical Trials TENTH ANNUAL BIOPHARMACEUTICAL APPLIED STATISTICS SYMPOSIUM DECEMBER 8 - 12, 2003 Hilton Savannah DeSoto, Savannah, Georgia BASS Program Committee Karl E. Peace, Georgia Southern University, BASS Chair W. Hans Carter, Jr., Virginia Commonwealth University, BASS Co-Chair Jim Nick, McNeil Consumer Healthcare, Program Chair Greg Enas, Eli Lilly Janis Grechko, Pfizer J.P. Hsu, Biopharmaceutical Research Consultants, Inc. Tifani McCann, Bristol-Myers Squibb Jeffrey Schwartz, Pfizer Tony Segreti, GlaxoSmithKline Don Stablein, The Emmes Corporation Russ Boyle, Virginia Commonwealth University SHORT COURSES Gary Koch James Rochon University of North Carolina: Duke Clinical Research Institute: Categorical Data Analysis A Second Course on Repeated Measures Analysis Mike Proschan Dave DeMets National Heart, Lung and Blood Institute: University of Wisconsin - Madison: Group-Sequential Monitoring of Clinical Trials Fundamentals of Data Monitoring BASS Distinguished Faculty MONDAY SESSIONS - DECEMBER 8, 2003 John Andersen, Eli Lilly Vern Chinchilli, Penn State College of Medicine Kathy Cronin, National Cancer Institute Dave DeMets, University of Wisconsin - Madison Susan Ellenberg, Center for Biologics Evaluation Research Eric Harvey, Constella Group Gary Koch, University of North Carolina Gordon Lan, Aventis Qing Liu, Johnson Johnson Karen Midthun, Center for Biologics Evaluation Research Robert O'Neill, Center for Drug Evaluation Research Karl Peace, Georgia Southern University Mike Proschan, National Heart, Lung and Blood Institute Viswanathan Ramakrishnan, Virginia Commonwealth University James Rochon, Duke Clinical Research Institute Robert Temple, Center for Drug Evaluation Research Ram Tiwari, National Cancer Institute Unusual Clinical Trial Designs in the Asthma Clinical Research Network Vern Chinchilli, Penn State College of Medicine Unusual and Interesting Applications from Three Decades of Biostatistical Consulting Karl Peace, Georgia Southern University Expanding the Sphere of Influence of the Consulting Statistician John Andersen, Eli Lilly Normal Mixture Models for Gene Cluster Identification In Two Dimensional Microarray Data Eric Harvey, Constella Group Viswanathan Ramakrishnan, Virginia Commonwealth University A Heuristic Approach to the Analysis of Survival Data Gordon Lan, Aventis TUESDAY SESSIONS - DECEMBER 9, 2003 Phase II III Combination Design to Accelerate Drug Development Qing Liu, Johnson Johnson New Developments in Population Based Survival Kathy Cronin and Ram Tiwari, National Cancer Institute Nonparametric Analysis of Covariance and Its Role in Non-Inferiority Clinical Trials Gary Koch, University of North Carolina Catherine Tangen, Fred Hutchinson Cancer Research Center Some Statistical Strategies for Analyzing Confirmatory Studies Involving One or More Occurrences of One or More Types of Primary Endpoints Gary Koch, University of North Carolina Dilemmas in Monitoring Clinical Trials Nancy Geller, National Heart, Lung and Blood Institute WEDNESDAY SESSIONS - DECEMBER 10, 2003 FDA Special Session Robert Temple, Center for Drug Evaluation Research Robert O'Neill, Center for Drug Evaluation Research Karen Midthun, Center for Biologics Evaluation and Research Susan Ellenberg, Center for Biologics Evaluation Research BASS X HOTEL RESERVATION TENTH ANNUAL BIOPHARMACEUTICAL APPLIED STATISTICS SYMPOSIUM December 8 - 12, 2003 Hilton Savannah DeSoto, 15 E. Liberty Street, Savannah, Georgia 31401 Tel: (912)-232-9000, Fax: (912)-232-6018 An Invitation... to participate in the Tenth Annual Biopharmaceutical Applied Statistics Symposium (BASS X), a December event that presents a unique opportunity to expand your knowledge of and enthusiasm for applied biopharmaceutical statistics. The three-day symposium and two-day short courses will enhance one's understanding of statistics and applications. The symposium will open with registration on Sunday, December 7, 5:00P.M.-7:00 P.M. Daily seminars will be presented Monday, December 8 through Wednesday, December 10. Optional short courses will be offered Wednesday-Friday, December 10-12. BASS is a not-for-profit organization established in 1994 by Karl E. Peace, Ph.D., Chief Scientific Officer, Biopharmaceutical Research Consultants, Inc. (BRCI) and Georgia Cancer Coalition Distinguished Cancer Scholar, Professor of Biostatistics, Georgia Southern University, in cooperation with the Department of Biostatistics, Virginia Commonwealth University, the Center for Biostatistics, Georgia Southern University, and Biopharmaceutical Research Consultants, Inc. (BRCI) . Any profits derived from the symposium are used to establish fellowships for graduate work in biostatistics. Sponsors: Department of Biostatistics, Virginia Commonwealth University (VCU) MCV Campus Center for Biostatistics, Georgia Southern University Biopharmaceutical Research Consultants, Inc. (BRCI) MAKE HOTEL RESERVATIONS DIRECTLY AND EARLY WITH THE HILTON SAVANNAH DESOTO, SAVANNAH, GEORGIA You must guarantee your first night's lodging by providing your account number from a major credit card. Either mail the hotel registration form to Hilton Savannah DeSoto, 15 E. Liberty Street or P.O. Box 8207, Savannah, Georgia 31401, or fax to (912) 231-1633. Telephone reservations will not be accepted. Hotel rates for BASS registrants are applicable two days prior and two days after the event, depending upon availability. Registrants not using the BASS rate or not staying at the Hilton Savannah Desoto are not eligible for food and refreshments at BASS functions. Credit Card: American Exp.(_) VISA (_) Diners Club (_) Discover (_) MasterCard (_) Card ______________________________________ Exp. Date___________________ Name__________________________________________________________________ Signature_______________________________________________________________ Firm___________________________________________________________________ Address________________________________________________________________ City___________________________________ State____________ ZIP_____________ Telephone (_____) _____________________ Arrival Date Time___________________________ Departure Date__________________ Number in Party_________ Adults_______ Children_________ Smoking ______ Nonsmoking ________ Vegetarian ______ Nonvegetarian ________ Written Confirmation? Yes(_) No(_) Are you a Hilton Honors Member? (_)Yes, Account ______________________ No (_) Daily Room Rates Single - $154.00 Double - $215.00 Triple - $276.00 Quad - $337.00 Rates include 12% state, local and occupancy tax. Rates also include continental breakfast, AM PM breaks and lunch for the day following the overnight accommodation. Refund and Cancellation Refundable cancellations allowed up to 72 hours prior to arrival. Check-out time is noon. Baggage should be checked with the bell captain if departure time is later than noon. Check-in Time 4:00 P.M. Please print or type the information requested below: Name __________________________________ Title____________________________________ Company________________________________ Division_________________________________ Address ________________________________ City_________________State_______________ Country_____________ ZIP_________________ Telephone (___)___________________________ Fax (___)________________________________ E-mail Address____________________________ Provide all information above, as you would like it to appear on your registration badge and directory. The registration form must be postmarked no later than November 1, 2003 to qualify for the early registration discount. Registration will be conducted at Hilton Savannah DeSoto, Savannah, Georgia, beginning Sunday, December 7, from 5:00 P.M. to 7:00 P.M., and all day Monday, Tuesday, and Wednesday, December 8-10, starting at 7:30 A.M. Short course registration is scheduled Wednesday December 10, beginning at 7:30 A.M. Payment (US dollars only) by company or personal check or money order must accompany registration form. You may now register for BASS X using American Express, Discover, MasterCard or Visa. If you register with one of these cards, please complete the following: Credit Card: American Express (_) Discover (_) MasterCard (_) Visa (_) Card : ________________________ Name: ________________________ Signature: ________________________ Firm: ________________________ Address: ________________________ City: ________________________ State: _____ Zip: _________ Telephone: (___) __________________ US Government and state agency purchase orders are acceptable but will be billed at the pre-discount rates. Only original purchase orders are acceptable and should be enclosed with your symposium registration form. Purchase orders must include total charges, registrant's name, course description and complete address for billing purposes. Cancellations Refunds: Cancellations must be received in writing. Refunds are subject to a 10% handling fee and will only be considered if written notice is received no later than November 1, 2003. Please check what you plan to attend: (_) Symposium (_) Short Course PRICE PAID (_) Three-Day Symposium $ 475.00 ______ (Monday, Tuesday, and Wednesday) (_) One-Day Session Only (Please circle choice below) Monday or Tuesday $ 250.00 ______ Wednesday AM $ 200.00 ______ (_) Student Retiree $ 250.00 ______ (Student Retiree ID Required) You may take a 10% discount, for the 3-day symposium only if payment rendered before November 1, 2003. Early registration discount does not apply to short courses or one-day session registrations. Wednesday Friday Short Courses: PRICE PAID Fundamentals of Data Monitoring $ 400.00 $ ______ (Wednesday pm through Thursday am) A Second Course on $ 775.00 $ ______ Repeated Measures Analysis (Wednesday pm through Friday am) Categorical Data Analysis $ 775.00 $______ (Wednesday pm through Friday am) Group Sequential Monitoring of $ 775.00 $______ Clinical Trials (Wednesday pm through Friday am) Total Fee: $_____ Less Discount: $_____ Payment Enclosed: $_____ Please send the BASS X registration form with check made payable to "BASS X" to: Ms. Shelly Bass Center for Biostatistics College of Health and Human Sciences Georgia Southern University PO Box 8148-01 Statesboro, GA 30460 Fax copy of BASS registration form to: 912 486-7907 For inquiries, please call 912 486-7906 Or email to SBASS@GeorgiaSouthern.edu BASS X information can be found at http: www.vcu.edu bis bass . Monday Sessions, December 8, 2003 SESSION M-1 8:15 am 9:30 am Unusual Clinical Trial Designs in the Asthma Clinical Research Network Vern Chinchilli, Penn State College of Medicine Moderator: W. Hans Carter, Jr., Virginia Commonwealth University In response to the national health problem with asthma, the National Heart, Lung and Blood Institute (NHLBI) formed theAsthma Clinical Research Network (ACRN)in 1993.The ACRN was designed to evaluate new and existing therapies for asthma treatment and disseminate the results of these evaluations. The ACRN has initiated 11 multi-center clinical trials and, as of February 2003, successfully completed the first six clinical trials, with the published results having appeared in major medical journals. Three ACRN clinical trials invoked unusual designs that resulted in some nonstandard statistical analyses. A particular design that the ACRN developed, called a paired crossover design, is of great interest. In this design, individuals with a different feature (e.g., genotype AA vs. genotype GG, smokers vs. nonsmokers) are matched according to baseline factors and then randomized as a pair to the same crossover sequence. The statistical analysis of the resultant data from a paired crossover design should not assume that the members of a pair are independent. A repeated measurements analysis is described for this design that accounts for the lack of independence between members of a matched pair. 9:30 am 9:45 am Break SESSION M-2 9:45 am 11 am Unusual and Interesting Applications from Three Decades of Biostatistical Consulting Karl Peace, Georgia Southern University Moderator: Janis Grechko, Pfizer Details of several interesting applications from 30 years of biostatistical consulting will be presented. One application involves using a parallel design instead of a crossover design in a bioequivalence trial of several formulations. This trial also incorporated blinded sample size re-estimation. Two other applications, one of a fixed combination drug for treating allergic rhinitis, and the other of a dose comparison trial in duodenal ulcer, reflect using bivariate plots of two primary response measures to illustrate simultaneously drug dose effects. Another application, also from a dose comparison duodenal ulcer trial, reflects logistical aspects of interim analyses procedures aimed initially at dropping the placebo arm, and later dose discrimination. Other applications will be presented as time permits. This talk is consistent with an original aim of BASS: an opportunity for professionals engaged in drug and or health research to share insight to applications. SESSION M-3 11 am-12:15 pm Expanding the Sphere of Influence of the Consulting Statistician John Andersen, Eli Lilly Moderator: Janis Grechko, Pfizer The role of the statistician in the pharmaceutical industry has traditionally been viewed as rather one-dimensional. Typically, fields of application include discovery, manufacturing, clinical trials, and marketing, but usually this is within the context of standard statistical applications. However, a statisticians skill set can be applied to a wider variety of applications. This presentation will give an overview of some of the possibilities, including decision consulting and portfolio management. 12:15 pm 1:15 pm Lunch SESSION M-4 1:15 pm 2:30 pm Normal Mixture Models for Gene Cluster Identification in Two Dimensional Microarray Data Eric Harvey, Constella Group Viswanathan Ramakrishnan, Virginia Commonwealth University Moderator: Jim Nick, McNeil Consumer Healthcare Microarray data in human genetics involve large numbers of observations and generally present as arrays of light intensity values reflecting the degree of activity of the genes. These measurements are often two dimensional in nature since each is associated with an individual sample (cell line) and gene. The usual hierarchical clustering techniques do not easily adapt to this type of problem. These techniques allow only one dimension of the data to be clustered at a time and lose information due to the collapsing of the data in the opposite dimension. A novel clustering technique based on normal mixture distribution models is presented. This method clusters observations that arise from the same normal distribution and allows the data to be simultaneously clustered in two dimensions. The model is fitted using the Expectation Maximization (EM) algorithm. Posterior probabilities are calculated for each observation belonging to a given cluster. These probabilities allow control over the cluster arrangements, including the use of overlapping clusters. 2:30 pm 2:45 pm Break SESSION M-5 2:45 pm 4:30 pm A Heuristic Approach to the Analysis of Survival Data Gordon Lan, Aventis Moderator: J.P. Hsu, Biopharmaceutical Research Consultants, Inc. A heuristic introduction to survival data analysis Several closely related nonparametric tests for survival data analysis are widely used in medical studies. These can be introduced as linear rank statistics, U-statistics, or weighted Mantel-Haenszel statistics. This pedagogical lecture elucidates the connections among different expressions of a test statistic. We will also discuss the sequential monitoring of survival data and the limitations of the proportional hazards model. This presentation is based on Rank tests for survival analysis, Lan, G and Wittes, J., Biometrics 1985 and Martingales without tears, Lan G and Lachin, J., Lifetime Data Analysis 1995. Tuesday Sessions, December 9, 2003 SESSION T-1 8:15 am 9:30 am Phase II III Combination Design to Accelerate Drug Development Qing Liu, Johnson Johnson Moderator: Jim Nick, McNeil Consumer Healthcare For late stage clinical development, we propose combining phase II and III trials via a two-stage adaptive design. In the phase II stage, short-term safety and efficacy are examined. Upon receiving the phase II data, promising doses are selected for further evaluation. In addition, the required sample size and method of analysis are also determined. In the phase III stage, patients, including those enrolled in the phase II stage, are evaluated using a clinical endpoint requiring a longer follow-up. At the end of the trial, data for the clinical endpoint from patients enrolled in both stages are integrated for the final analysis. A noticeable feature is that the decision rule governing dose selection, sample size calculation, and method of analysis does not need to be specified in advance to maintain the validity of the trial. The approach is effective in achieving the ultimate trial success and is also efficient, as fewer patients are needed. In addition, the total development time and costs associated with running separate phase II and III trials are reduced. 9:30 am 9:45 am Break SESSION T-2 9:45 am 11 am New Developments in Population Based Survival Kathy Cronin and Ram Tiwari, National Cancer Institute Moderator: W. Hans Carter, Jr., Virginia Commonwealth University Survival estimates derived from population-based cancer registries are more applicable to the population as a whole than those derived in a clinical trial setting, but they also present some unique challenges. Special issues related to population data, such as the use of relative survival as an estimate of cause-specific survival, will be covered as background. The focus of the talk will be two survival measures of interest. The first is an estimate of survival for patients currently diagnosed with cancer. A number of approaches to address this question will be described and evaluated, including period survival proposed by Brenner and Hakulinen [Am J Epidemiol 2002;156:566-577] and modeling of relative survival trends. The second is the use of cure models to estimate the fraction of cancer patients in a defined cohort that are at risk of dying from their cancer. Difficulties in modeling and interpreting a cure parameter in mixture survival models will be discussed and demonstrated with examples from cancer registry data. SESSION T-3 11 am 12:15 pm Nonparametric Analysis of Covariance and Its Role in Non-Inferiority Clinical Trials Gary Koch, University of North Carolina Catherine Tangen, Fred Hutchinson Cancer Research Center Moderator: Tony Segreti, GlaxoSmithKline This presentation discusses the role of nonparametric analysis of covariance in clinical trials to compare test treatment (T), reference control (R), and placebo (P). In these trials, non-inferiority of test treatment to reference control can often be evaluated through whether the lower limit of a confidence interval for (TP) (RP) exceeds K or through a one-sided statistical test for H0:(TP)K(RP) versus HA:(TP) K(RP). Here, K is a pre-specified fraction of the effect of R (relative to P) for the effect of T (relative to P) to have in order to demonstrate non-inferiority; and 0.5K1.0 usually. A further consideration for these trials is that both (TP) and (RP) should significantly exceed 0 in order to support useful estimation of (TP) (RP). Nonparametric covariance analysis strengthens the analysis of these types of clinical trials by providing more precise estimates for linear combinations of (TP) and (RP) than an unadjusted analysis, particularly when covariables are strongly correlated with response variables. It also clarifies interpretation by removing the influence of random imbalances in the covariables. A further advantage is that it requires essentially no assumptions in studies with randomized assignment of treatments. The application of nonparametric analysis of covariance is illustrated for clinical trials for which non-inferiority of T relative to R was of interest. For each of the examples, nonparametric covariance adjustment provided substantial variance reduction and narrower confidence intervals. This presentation is based on the article entitled Non-Parametric Analysis of Covariance and Its Role in Non-Inferiority Clinical Trials by Koch, GG and Tangen, CM, Drug Information Journal 33, pp. 1145-1159, 1999. 12:15 pm 1:15 pm Lunch SESSION T-4 1:15 pm 2:30 pm Some Statistical Strategies for Analyzing Confirmatory Studies Involving One or More Occurrences of One or More Types of Primary Endpoints Gary Koch, University of North Carolina Moderator: Tony Segreti, GlaxoSmithKline This presentation discusses some statistical strategies for analyzing confirmatory studies where patients can have one or more occurrences of one or more types of unfavorable (or favorable) events. Principal attention is given to methods for counts of a recurrent event during inter-visit intervals that comprise an entire follow-up period. Some comments are also provided for situations with multivariate times to event for subsets of the components of a composite time to first event. A major issue for confirmatory studies of this type is how to rank the patterns of events. A second issue is the management of missing data, particularly when patients can withdraw prematurely because of lack of efficacy or a terminating event such as death. Both nonparametric methods and regression models fitted with generalized estimating equations (GEE) are useful for comparisons between treatments for the extent of one or more events for a primary response variable. Results from such methods are illustrated for two principal examples. One is a pair of confirmatory randomized clinical trials for comparing two treatments with respect to skeletal complications in patients with metastatic bone disease. The other is an epidemiologic study concerning the association of lower respiratory illnesses in children during the first year of life with passive smoking in the home. Tuesday Evening Keynote Address 7 pm 8 pm Dilemmas In Monitoring Clinical Trials Nancy Geller, National Heart, Lung and Blood Institute Moderator: Karl Peace, Georgia Southern University Including statistical stopping rules for the primary and other endpoints of a clinical trial and giving guidance for monitoring toxicity in the trial protocol does not preclude the trial's Data and Safety Monitoring Board (DSMB) from considering decisions about the continuation of a trial based on other factors. In the case of a complex trial which appears to be negative and whose outcome might affect a sizable population, the decision to stop or continue becomes quite complex. The DSMB has to weigh protection of trial subjects against the potential of disbelief of the results by the community if the trial stops too early. Examples of protocol guidance and DSMB discussions and action will be given from clinical trials sponsored by the National Heart, Lung and Blood Institute. 8 pm 9 pm Reception Wednesday Sessions, December 10, 2003 SESSION W-1 8:00 am 12:15 pm (Includes a 15 minute break) Robert Temple, Robert ONeill, Center for Drug Evaluation and Research, Karen Midthun, Susan Ellenberg, Center for Biologics Evaluation and Research This years special FDA session at BASS X will feature key leaders from both the clinical and biostatistical areas representing the Center for Drug Evaluation and Research (CDER) and the Center for Biologics Evaluation and Research (CBER). This combined session emphasizes the vital importance of: Close collaboration between medical and biostatistical personnel FDAs active participation in clinical development and improvements to the development process This session will include presentations by Robert Temple, Associate Director for Medical Policy and Robert ONeill, Director of the Office of Biostatistics, both representing CDER as well as Karen Midthun, Director of the Office of Vaccine Research and Review and Susan Ellenberg, Director of the Office of Biostatistics and Epidemiology, both representing CBER. Topics include: Advances in drug development regulation over the last 10 years, including issues such as ICH guidances, globalization of development, risk assessment and management, multi-national trials, large outcome trials, and circumstances when a single study may be sufficient, etc. Looking to the future the next 10 years Insights into the development of vaccines useful in the prevention of SARS, West Nile virus, and HIV infection Developments in cutting edge therapy areas such as cellular and gene therapies Dealing with the threat of bioterrorism Other topics of importance to pharmaceutical research and development personnel, particularly biostatisticians. Following the presentations, the speakers will serve as a discussion panel and field questions from BASS X participants. SHORT COURSES, DECEMBER 10 - 12, 2003 Wednesday, December 10 1:15 pm 4:30 pm (Includes a 15 minute break) This course concludes on Thursday,December 11 8:15 am - 11:30 am (Includes a 15 minute break) Fundamentals of Data Monitoring Dave DeMets, University of Wisconsin - Madison Nearly all trials, especially Phase III trials, must have a monitoring plan. Those with a mortality or serious morbidity outcome must have an independent data monitoring committee. In this the first session of this course, the history, rationale and scope of responsibilities of a Data Monitoring Committee (DMC) will be reviewed. In addition, the process of appointing a DMC and the DMC meeting format will be discussed. The decision-making process to continue, modify or terminate a trial is complex and involves, among other issues, statistical issues that must be carefully addressed. Examples will be provided from completed trials. In the second session, interim data in an abbreviated format will be presented for a mock DMC to review and discuss before making a recommendation. Results of the trial DMC deliberation will then be revealed. If appropriate, the next interim analysis will be presented. Examples are selected to illustrate various types of decisions. Wednesday, December 10 1:15 pm - 4:30 pm (Includes a 15 minute break) This course continues on Thursday, December 11 8:15 am - 11:30 am (Includes a 15 minute break) and 1:15 pm - 4:30 pm (Includes a 15 minute break) This course concludes on Friday, December 12 8:15 am - 11:30 am (Includes a 15 minute break) A Second Course on Repeated Measures Analysis James Rochon, Duke Clinical Research Institute This course is designed to update knowledge and skills for analyzing longitudinal data in biomedical research. It is intended for Master's and Ph.D. statisticians with a good statistical background and some experience in analyzing longitudinal data using PROC MIXED and PROC GENMOD. We will consider advances that have arisen over the past 10 years, including random-coefficient and mixed-effects models, recent developments with the GEE model, and missing data issues. We will concentrate on ideas and concepts rather than mathematical derivations and proofs. By the end of the course, students should be able to apply these models in their day-to-day research. Key words: Adaptive design; Conditional error function; Conditional power; Confidence intervals; Interim analysis; Type I error rate; Unbiased estimator. Wednesday, December 10 1:15 pm - 4:30 pm (Includes a 15 minute break) This course continues on Thursday, December 11 8:15 am - 11:30 am (Includes a 15 minute break) and 1:15 pm 4:30 pm (Includes a 15 minute break) This course concludes on Friday, December 12 8:15 am - 11:30 am (Includes a 15 minute break) Categorical Data Analysis Gary Koch, University of North Carolina This course presents the conceptual background and computational procedures for statistical methods for categorical data analysis. Attention is given to two complementary strategies: 1) nonparametric (randomization) methods (e.g., Mantel-Haenszel tests) for testing hypotheses of no association under minimal assumptions; 2) regression methods for fitting statistical models to describe multivariate relationships (e.g., logistic regression, Poisson regression, weighted least squares regression, conditional logistic regression, generalized estimating equations). Consideration of these strategies is motivated through examples from clinical trials, observational studies, and sample surveys. For these examples, the roles for alternative methods and aspects of application are discussed from the perspective of the questions which statistical analyses are to address, the posture of inference, the sampling process, and the data structure. The specific topics for the course are as follows: logistic regression; Mantel-Haenszel procedures for sets of 2x2 contingency tables; proportional odds model extension of logistic regression for ordinal data; extensions of Mantel-Haenszel procedures for stratified ordinal data; weighted least squares methods for ordinal data; Poisson (incidence density) regression methods for categorized times to event; methods for studies with repeated measures and or matching including generalized estimating equations and conditional logistic regression; computing procedures for implementing methods. Wednesday, December 10 1:15 pm 4:30 pm (Includes a 15 minute break) This course continues on Thursday, December 11 8:15 am - 11:30 am (Includes a 15 minute break) and 1:15 pm - 4:30 pm (Includes a 15 minute break) This course concludes on Friday, December 12 8:15 am - 11:30 AM (Includes a 15 minute break) Group-Sequential Monitoring of Clinical Trials Michael Proschan, National Heart, Lung and Blood Institute This short course provides a unified treatment of group sequential monitoring of many different types of trials (continuous outcome, dichotomous outcome, survival outcome, etc.) using the B-value approach. Different boundaries will be put in their historical perspective, and their underlying ideas will be explained. Conditional power and stochastic curtailment are also covered. Fully Bayesian methods will be discussed, as well as a Bayesian version of conditional power known as predictive power. Estimation and p-values following group sequential monitoring are also considered. Transportation Coastal Transportation Services provides quality transportation from the Savannah International Airport to the Hilton Savannah Desoto. Coastal Transportation Services is conveniently located on the Lower Level North end of the Savannah International Airport. Coastal Transportation Services also provides transportation for fishing trips, golfing and shopping. Coastal Transportation Services offers the following rates for BASS X participants: Savannah International Airport to and from Hilton Savannah DeSoto: $15 per person - one person, one way $25 per person - one person, round trip $20 per person - two or more persons, round trip For reservations, call Coastal Transportation Services at (912) 964-5999 or e-mail them at shuttle31408@yahoo.com
Statistical Modelling - Model Building and Evaluation
Euroworkshop. Schlo Hhenried, Bernried, near Munich Germany; 31 October -- 3 November 2002.
Euroworkshop on Statistical Modelling - Model Buildin and Evaluation Euroworkshop on Statistical Modelling - Model Building and Evaluation 31st October to 3rd November, 2002 Schlo Hhenried, Bernried, near Munich Germany http: www.stat.uni-muenchen.de euroworkshop 2002.html Report General Information: The Euroworkshop on Statistical Modelling was a project fundeded by the European Commission ( CORDIS ) in the programme High Level Scientific Conferences . The project was also connected to the International Workshop on Statistical Modelling . The workshop on Model Building and Evaluation was the third event in a series of three workshops with the topics Mixed Models and Nonparametric Models . To read more about the entire project please follow this link . Coordinator of the project was Gran Kauermann . The event was also supported by the Sonderforschungsbereich 386 at the Institute of Statistics, Ludwig-Maximilians-University Munich. Topic: Generally speaking, every model is plausible as long as it is not falsified. The falsification of models however is the most challenging point in science. This holds in the same for statistical models. To provide valid Statistical Models that fulfil the task of modelling reality, it is of fundamental importance to consider the model building process in more depth and to check and validate fitted models by means of model diagnostics . The workshop intended to consider our "modelling toolbox" critically, rather than considering one particular model critically. This included areas like "Traditional Model Diagnostic Tools", "Graphical Model Diagnostics", "Model validation using smoothing techniques", "Bayesian Models and their validation" as well as "Bootstrapping and its role in model evaluation". Model validation does not only mean to check one particular model at hand (like a typical testing procedure), but also, if not more importantly, to check whether the entire model class being applied is valid. In short the focus was on the question: "Are we modelling the right things with our model and how can we validate and evaluate this" Keynote Speakers : Anthony Davison , Swiss Federal Institute of Technology, Switzerland Arnoldo Frigessi , Norwegian Computing Center, Norway Jeffrey Hart , Texas AM University, USA Brian Ripley , University of Oxford, UK Antony Unwin , University of Augsburg, Germany Location: The workshop took place in Schlo Hhenried , Bernried near Munich, Germany. List of Participants (click on link) Programme and Presentations (click on link) Minutes of Discussionrounds (click on link) Conference Photo (click on link) Young Researchers: 1 3 of the participants were young researchers ( official definition see below ) supported by the European Commission Organisers: Gran Kauermann , Coordinator; University of Glasgow, UK Adrian Bowman , (Guest Organiser); University of Glasgow, UK Herwig Friedl , Technische Universitt Graz, Austria John Hinde , National University of Ireland, Galway IRE Emmanuel Lesaffre , Katholieke Universiteit Leuven, Belgium Official Definition for Young Researchers: Young Researchers are researchers up to an age limit of 35 years at the time of a particular conference event. Allowance will be made for compulsory military or civil service and childcare. Grants can only be provided to citizens of a EU membership country respectively for citizens from Bulgaria, Cyprus, Czech Rep., Estonia, Hungary, Latvia, Lithuania, Poland, Romania, Slovakia, Slovenia, Iceland, Liechtenstein, Norway, Israel and Switzerland. Goeran Kauermann Last modified: 01 12 02
Questionnaire Development, Evaluation, and Testing Methods
Radisson Hotel Charleston, South Carolina, USA; 14--17 November 2002.
Qdet You need to upgrade to a frames capable browser. You need to upgrade to a frames capable browser.
ICFS 5
The Fifth International Conference on Forensic Statistics. Isola di San Servolo, Venice, Italy; 30 August -- 2 September 2002.
ICFS 5
IAOS 2002 - Official Statistics and the New Economy
UK Office for National Statistics, London, UK; 27--29 August 2002.
IAOS homepage Conference Report Conference Presentations Conference Papers Feedback SEARCH Whole site Paper abstracts The International Association for Official Statistics conference on "Official Statistics and the New Economy", was hosted by the Office for National Statistics from 27 - 29 August. By the time the conference ended, some 340 delegates from around the World had been involved in presentations, panel sessions and discussions with a good number of the economists and statisticians who lead the world thinking in this area. The conference was a great success, in both the quality of the programme, and the organisation of each day. Len Cook, the National Statistician, said: "I have been to many statistical conferences, and this was one of the best organised, and relevant in content that I have attended". The programme committee, chaired by Tim Holt, managed to bring in leading contributors from North America and Europe, and as far as the Antipodes. There was an excellent mix of delegates, many from the United States, and strong contingents from Asia and Africa. After the conference, both ONS and the Department for International Development, DfID, organised workshops on leadership in statistics and in capacity building for senior statistical office staff. Image courtesy Dev Virdee, ONS delegate SITE MAP Homepage Conference report Conference presentations Conference papers Main speakers' biographies Attendees Conference background Feedback Committees Pictures from the Conference National Statistics home Feedback or Enquiries | Copyright | Terms and Conditions | Privacy Statement | Link to www.ukonline.gov.uk
Perspectives in Modern Statistical Inference II
Satellite workshop to the 24th European Meeting of Statisticians (Prague, 19--23 August). Brno, Czech Republic; 14--17 August 2002.
Perspectives in Modern Statistical Inference II Perspectives in Modern Statistical Inference II Workshop, August 14 -17, 2002 Brno, Czech republic Satellite to the 24th European Meeting of Statisticians Prague, August 19-23,2002 Third Announcement
ISI 2003
54th session of the International Statistical Institute. Berlin, Germany; 13--20 August 2003.
54th ISI Session 2003, August 13-20, Berlin, GermanyISI Scientific Programme Schedules Photos ISI Organisation Who is Who General Information Germany and Berlin Social Programme Exhibition Short Courses Tutorials Satellite Meetings Press Sponsors CO CONGRESS ONLINE Keywords Please choose: Accommodation Accompanying Persons Addresses Administrative Schedules Airline, offical Airport Info Banking Budget Accomodation Child Care Climate Clothing Concert Congress Office Contacts Copying CP Meetings CP Registration CP Schedule CP Topics List Currency Dates and Venue Deadlines for CP Authors Deadlines for IP Authors Deadlines, Major Disabled Persons Electricity Exchange Rates Excursions Executive Secretariat Exhibition Farewell Party First Aid Food Form A Form B1 Form B2 Form C General Information General Schedule Health Help Desk Line Honorary Committee Hotel Information Hotel Reservation Immigration Information Desks Instructions, CP Authors Instructions, IP Authors Instructions, Manuscripts Internet Area Interpretation IP Meetings IP Organisers IP Schedule IP Topics ISI ISI Council ISI Permanent Office ISI Prog. Comm. Language Local Prog. Comm. Lost and Found Lounges Mail Office Manuscript Model Media Check National Org. Comm. Official Carrier Opening Ceremony Organisation Paper Presentation Paperupload Organisers List Participation Passport and Visa PCO Counter Phone numbers Press Prog. Co-ord. Comm. Reception, Government Reception, Welcome Refreshments Registration Registration Fees Satellite Meetings Schedules Scientific Programme Short Courses Social Programme Speakers Lounge Sponsors Tax Telecomm. Templates Tours Time Tipping Tutorials Visa Wardrobe News The deadline for the submission of discussant papers has been extended to October 10, 2003. Please note that papers arriving after this date can neither be accepted nor published. The 54th Session of the International Statistical Institute (ISI) has ended. The National Organising Committee would like to thank all participants for attending the Session, and the congress assistants for their valuable work. See you in Sydney from 5-12 April 2005. The 54th Session of the ISI is held under the patronage of the President of the Federal Republic of Germany, Johannes Rau. The Chairman of the Honorary Committee is the Chancellor of the Federal Republic of Germany, Gerhard Schrder. Scientific Programme The scientific programme of the 54th ISI Session consists of Invited Paper Meetings and Contributed Paper Meetings . The scientific programme for the Invited Paper Meetings has been developed by the ISI Programme Committee and the ISI Programme Co-ordinating Committee . Anyone actually participating in the Session may present one Contributed Paper during the Session. The Local Programme Committee will arrange Contributed Paper Meetings according to a standard topic classification. However, submissions on other topics are also welcome. ... More Daily Bulletins Daily Bulletin No. 1 (August 13th, 2003) Daily Bulletin No. 2 (August 14th, 2003) Daily Bulletin No. 3 (August 15th, 2003) Daily Bulletin No.4 (August 16th, 2003) Daily Bulletin No. 5 (August 18th, 2003) Daily Bulletin No. 6 (August 19th, 2003) Daily Bulletin No.7 (August 20th, 2003) Words of Welcome from Messrs Merk and Wilrich On our way to the 54th ISI Session in Berlin: an attempt to whet your appetite... The organisation of the 54th Session of the International Statistical Institute (ISI) from 13th 20th August, 2003, in Berlin has entered its final stage... More Germany and Berlin The Federal Republic of Germany is situated in the heart of Europe. Its central position having become even more pronounced since the reunification, Germany is more than ever a connecting link between Western Europe and the countries of Central and Eastern Europe. ... More Organisation Responsible for the organisation of the 54th ISI Session is the National Organising Committee (NOC), chaired by the former President of the Federal Statistical Office, Hans Gnther Merk. ... More Information in other languages The Information Bulletins No.1 and 2 are also available in French, German and English as PDF files. ... More
Joint Statistical Meetings
ASA IMS ENAR WNAR. New York, NY, USA; 11--15 August 2002.
JSM 2002 Get Ready for the City That Never Sleeps! August 11 - 15, 2002 New York City, New York Follow the tabs on the left to navigate through this site. Comments and suggestions are welcome at meetings@amstat.org . This page is updated frequently so visit often. Proceedings | Online Program
The Sixth Sense
6th Sensometrics Meeting. Dortmund, Germany; 31 July -- 2 August 2002.
The sixth sense: 6th Sensometrics Meeting 2002 in Dortmund, Germany
SSDBM2002
14th International Conference on Scientific and Statistical Database Management. Edinburgh, Scotland, UK;24--26 July 2002.
SSDBM 2002: home page SSDBM2002 24th - 26th July 2002 Edinburgh, Scotland Information for Authors: Call for Papers Submission Guidelines Submission site Information for Delegates: Venue Hotels Programme Registration Social Programme Local Information: Scotland Edinburgh How to get there Committees: Organising Committee Programme Committee Steering Committee SSDBM News SSDBM2003 15th International Conference on Scientific and Statistical Database Management , Cambridge, Massachusetts - July 9-11, 2003 SSDBM2002 The papers presentations are now available for downloading. Further copies of the Proceedings are available at a cost of 25.00. Welcome to SSDBM2002 14th International Conference on Scientific and Statistical Database Management This international conference will bring together scientific domain experts, databases researchers, practitioners and developers for the presentation and exchange of current research on concepts, tools and techniques for scientific and statistical database applications. The 14th SSDBM will provide a forum for original research contributions and practical system design, implementation and evaluation. This year the conference will focus on two priority themes, Bioinformatics (genomic and biodiversity informatics), and Statistical Metadata. The priority areas will be supplemented with tutorials, invited talks or panel sessions and illustrated with demonstrations of research prototypes and industrial systems. SSDBM 2002 will continue the tradition of past SSDBM meetings in providing a stimulating environment to encourage discussion, fellowship and exchange of ideas in all aspects of research related to scientific and statistical database management. Napier University In co-operation with: Page Last Modified 12 August 2002 by the Centre for Educational Sociology, email CES.Webmaster@ed.ac.uk
IBC 2002
XXI International Biometric Conference. Freiburg, Germany; 21--26 July 2002.
IBC2002 Hinweis: Die WWW-Seiten der Universitt Freiburg verwenden Frames. Sollten Sie die Seiten mit einem 'nicht framefhigen' Browser darstellen wollen, so koennen Sie dies nur unter starker Einschrnkung der Benutzerfreundlichkeit: Link zum Navigations-Element der Uni-Seiten.
Current Advances and Trends in Nonparametric Statistics
Knossos Royal Village Conference Center, Crete, Greece; 15--19 July 2002.
Current Advances and Trends in Nonparametric Statistics INTERNATIONAL CONFERENCE ON CURRENT ADVANCES AND TRENDS IN NONPARAMETRIC STATISTICS July 15-19, 2002 - Crete, Greece Co-Sponsored by: Bernoulli Society Greek Statistical Institute Institute of Mathematical Statistics Nonparametrics Section of the American Statistical Association GENERAL INFORMATION Scope Main Conference Themes Organizers Advisory Committee Organizing Committee Location Sponsors PROGRAM INFORMATION Keynote Speakers Invited Paper Sessions Contributed Paper Sessions Journal of Nonparametric Statistics Deadlines Abstracts of talks OTHER INFORMATION Registration Travel information Accommodation Cancelation Policy Local Information Social Events Host and Participating Institutions: National Technical University of Athens University of Macedonia University of Crete
Probability Theory and Mathematical Statistics
8th International Vilnius Meeting. Vilnius, Lithuania; 23--29 June 2002.
IMI. 8th Vilnius Conf. The 8th International VILNIUS CONFERENCE on PROBABILITY THEORY and MATHEMATICAL STATISTICS June 23-29, 2002 VILNIUS , LITHUANIA For three decades the International Vilnius Meetings on Probability Theory and Mathematical Statistics have provided an important event for our science. The meeting will follow the well established pattern of Vilnius Conferences with a few plenary talks and sessions on important subfields. The conference will provide a forum for the international exchange of knowledge among scientists and give an impulse for international relations between participants, statistical societies and other official and non-official organizations. Honorary Patron of the Conference - President of the Republic of Lithuania Valdas ADAMKUS. The Conference is supported by the government of the Republic of Lithuania. The Conference is being organized under the auspicies of the International Statistical Institute. Contents of Information Honorary Organizing Committee Organizing Institutions Programme Committee Organizing Committee Address of the Organizing Committee List of participants Foto exhibition: * Room 1. Sessions * Room 2. Participants at Breaks Between the Sesions * Room 3. Entertainment To Home Page of IMI Honorary Organizing Committee Algirdas BRAZAUSKAS, Prime Minister of the Republic of Lithuania Algirdas MONKEVIUS, Minister of Education and Science of the Republic of Lithuania Benediktas JUODKA, President of the Lithuanian Academy of Science Edmundas ZAVADSKAS, Rector of Vilnius Gediminas Technical University To Content Organizing Institutions The main organizers: Institute of Mathematics and Informatics Vilnius University Vilnius Gediminas Technical University Lithuanian Academy of Sciences Lithuanian Mathematical Society Lithuanian Statistical Society To Content Programme Committee Chairman of the Programme Committee - Peter Jagers Vice-chairman of the Programme Committee - Vygantas Paulauskas Members: Serguei Aivazian, Russia Per Kragh Andersen, Denmark Ole Barndorff-Nielsen, Denmark Vidmantas Bentkus , Lithuania Miklos Csrg, Canada Richard Gill, The Netherlands Friedrich Gtze, Germany Bronius Grigelionis , Lithuania Steven Haberman, United Kingdom Rafail Khasminski, USA Frank den Hollander, The Netherlands Jacek Koronacki, Poland Jonas Kubilius, Lithuania Terry J. Lyons, United Kingdom Vladimir Piterbarg, Russia Henrikas Pragarauskas , Lithuania Yurij Prokhorov, Russia Peter Robinson, United Kingdom Holger Rootzen, Sweden Boris Rozovski, USA Rimantas Rudzkis , Lithuania Donatas Surgailis , Lithuania Aad van der Vaart, The Netherlands To Content Organizing Committee Chairman of the Organizing Committee Vytautas STATULEVIIUS , Lithuania Vice-chairman Mifodijus SAPAGOVAS , Lithuania Vice-chairman Leonas SAULIS , Lithuania Members: Aldona ALEKEVIIEN , Lithuania Gediminas BAGUKA, Lithuania Vladimir KHOKHLOV, Russia Kstutis KUBILIUS , Lithuania Eugenijus MANSTAVIIUS, Lithuania Henrikas PRAGARAUSKAS , Lithuania Elmundas ALYS, Lithuania Secretariat: Aleksandras PLIKUSAS Mindaugas BLOZNELIS To Content The Address of the Organizing Committee Institute of Mathematics and Informatics Akademijos str. 4 2600 Vilnius, Lithuania Tel: +370-5-27 29 207, +370-5-21 09 317 Fax: +370-5-27 29 209 E-mail: conf@ktl.mii.lt Website: http: www.mii.lt vilconf8 To Content Last updated on January 13, 2003 conf@ktl.mii.lt
WNAR IMS 2002
UCLA, CA, USA; 23--26 June 2002.
UCLA Department of Biostatistics UCLA Department of Biostatistics Los Angeles , California . The Department Prospective Students Courses Seminars Current Students People of Biostatistics Alumni, Jobs etc. Other Links News Events [ Prospective Students | Current Students | Alumni | Courses Seminars ] [ The Department | People | News Events | Other Links ] [ UCLA School of Public Health | UCLA Home Page ] Department of Biostatistics UCLA School of Public Health Los Angeles, CA 90095-1772 310-825-5250 FAX:310-267-2113 email: biostat@ucla.edu
NORDSTAT 2002
19th Nordic Conference on Mathematical Statistics. Stockholm, Sweden; 9--13 June 2002.
Nordic Conference on Mathematical Statistics 19th Nordic Conference on Mathematical Statistics June 9-13, 2002 Stockholm, Sweden http: www.math.kth.se nordstat Programme Call for papers Venue Accommodation Social events Fee Registration Contact addresses Sponsors Hosts The Nordic Conference on Mathematical Statistics (NORDSTAT) is a meeting place for probabilists and statisticians from the countries in Northern Europe. NORDSTAT also welcomes participants from countries outside Scandinavia, in particular from our close neighbours in the Baltic states. The official language at all sessions of this international conference is English. The focus is on recent research in the Nordic countries, but we are also very happy to announce that the conference will be attended by a few specially invited guests from overseas. Programme Now a detailed time schedule is availabe. NORDSTAT 2002 is planned to have four main themes in plenar sessions with invited speakers and discussants, and 12 partially parallel theme sessions with contributed papers, organized by the convenors listed below. The parallel sessions give both established researchers and PhD students an opportunity to present their latest work and gain new contacts. Attendants who wants to make a contribution to a parallel session should contact the convenor by no later than April 1, 2002, submitting a title and a short abstract. MAIN THEMES 1. Causal modelling and inference Causal reasoning from longitudinal data, Elja Arjas, Rolf Nevanlinna Institute, Helsinki [ Abstract ] The Use of Surrogate Outcomes in Experiments: Application to bridging human and macaque randomized studies of Anthrax Vaccine, Donald Rubin, Harvard University [ Abstract ] The session ends with a panel discussion. Discussants: Odd Aalen, Medical Statistics, University of Oslo Steffen Lauritzen, Aalborg University 2. Probability problems from physics Random matrices, Kurt Johansson, Royal Institute of Technology, Stockholm [ Abstract ] Some remarks on reinforced random walk, Harry Kesten, Cornell University, NY [ Abstract ] Hydrodynamic limits for asymmetric systems, Timo Sepplinen, University of Wisconsin [ Abstract ] 3. Bioinformatics Cross-species Gene Finding and Alignment with Generalized Pair Hidden Markov Models, Marina Alexandersson, UC Berkeley [ Abstract ] Combinatorics and probability in comparative genomics, Kimmo Eriksson, Mlardalen University, Vsters [ Abstract ] Statistical methods for gene localisation, Ola Hssjer, Lund University [ Abstract ] 4. Spatial Statistics Recent advances in statistical modelling and inference for space-time phenomena, Arnoldo Frigessi, Norwegian Computing Center, Oslo [ Abstract ] The use of Gaussian Markov random fields in spatial statistics, Hvard Rue, Norwegian University of Science and Technology, Trondheim [ Abstract ] THEME SESSIONS (partially in parallel) Theme Convenor 1. Environmental Statistics Anders Grimvall, Linkping 2. History of Probability and Statistics Kenneth Nordstrm, Oulu 3. Markov Models Gran Hgns, bo 4. Mathematical Finance and Insurance Thomas Mikosch, Copenhagen 5. Monte Carlo Methods in Probability and Statistics Jesper Mller, Aalborg 6. Probability in Biology and Physics Ingemar Kaj, Uppsala 7. Statistical Inference Hkon Tjelmeland, Trondheim 8. Statistics in Genetics and Bioinformatics Ilona Pylvninen, Gothenburg 9. Statistics in Medicine rnulf Borgan, Oslo 10. Stochastic Geometry and Spatial Statistics Antti Penttinen, Jyvskyl 11. Stochastic Processes Sven Erick Alm, Uppsala 12. Survey Sampling and Official Statistics Imbi Traat, Tartu 13. Teaching Statistics Gudrun Brattstrm, Stockholm Miscellaneous contributions Olle Hggstrm, Gothenburg Call for papers Submission of papers was closed on April 1, 2002. Venue NORDSTAT will take place at Krftriket, which is the location of the Maths department (including Mathematical Statistics) of Stockholm University. Krftriket is situated by the lake of Brunnsviken (connected to the Baltic Sea), just outside the inner town of Stockholm , 3 km from the central station. In June, the weather is most often good for a stroll in the beautiful park-like surroundings of the lake. The conference main sessions will take place at Wallenbergsalen ( sketch and photo ). Here is a map showing the location of Wallenbergsalen and the other conference buildning. How to get there: The easiest way to get to Krftriket is by taking the Metro's Green Line to station "Odenplan" and then go on by bus 40 or bus 40X towards "Universitetet". Get off at "Albano" and Krftriket is just across the road. Alternatively, take the Metro's Red Line to station "Universitetet" and go on by bus 40 towards "Reimersholme" och bus 40X towards "Odenplan". Get off at "Albano". Altenatively,Krftriket is within approximately 10 minutes walking distance from the Metro station "Universitetet". In this map you find a 'T' in [D3] indicating the station where you get off. Then walk to house 13 or 15 in [C6]. Accommodation Please make your hotel reservation on the on-line Registration Form, see Registration . You can there book rooms from the following list of hotels. Rooms are booked on a first-time-first-serve basis. Prices are quoted per room and night (SEK), includning breakfast, but exluding 12% VAT. Weekend rates are valid on Friday and Saturday nights only. The total accommodation cost will be invoiced together with the registration fee. Hotels Single Double Approximate distance Normal Weekend Normal Weekend Hotell Haga 700.00 880.00 10 min, bus 40, 40X Victoria Bentleys 920.00 600.00 1080.00 680.00 20 min, metro red+walk Freys Hotel 1276.00 1432.00 20 min, metro red+walk Elit Palace Hotel 1596.00 916.00 20 min, walk+bus 40,40X Ibis Hotel Stockholm Syd 620.54 513.39 45 min, walk+metro red+walk Hotel Oden 1016.00 816.00 10 min, bus 40, 40X Alexandra Hotel 604.00 30 min, metro green+bus 40, 40X Hotel Arcadia 660.00 15 min, walk Youth Hostel 4-beded room Approximate distance STF Vandrarhem Zinkensdamm 1052.00 25 min, metro red+walk Social events Get-together-party on June 9: 17.30 Busses leave from Stockholm City Bus Terminal to take you to Haga Forum. 18.00 A guided tour around along Hagaparken will take you to Koppartlten . 19.00 A cold dinner plate will be served at Koppartlten. Registration for the conference will also be possible here. 21.00 End. Excursion on June 11: We make a boat trip along Brunnsviken and Ekoparken, the water surrounding the conference location. The boats leave at 14.00 from a bridge located at approximately 15 minutes' walking distance from Krftriket (a joint walk starts at 13.30). After a stop for coffee at Fjderholmarna, the trip ends at 17.00 at Strmkajen in downtown Stockholm. Conference dinner on June 12: In the evening on Wednesday we enjoy a three-course dinner at Hgloftet, which is a part of the open-air museum Skansen . The dinner starts at 19.30. Fee Due to Swedish tax legislation, participants from different countries should pay the fees either including or excluding Swedish VAT (25%). Would you, therefore, please identify your category below and choose the appropriate alternative on the Registration Form: 1) Fees paid from countries outside the European Union excl. VAT 2) Fees paid by companies and other taxable entities within the EU excl. VAT 3) Fees paid by non-taxable entities and private persons within the EU incl. VAT 4) Fees paid within Sweden incl. VAT The registration fee is (all prices in Swedish kronor, SEK) Excl. VAT Incl. VAT Before April 1 SEK 2000,- SEK 2500,- After April 1 SEK 3000,- SEK 3750,- The fee includes participation in invited and contributed sessions, documentation, morning and afternoon coffee, lunches and all social events listed in the program. Registration after April 1, 2002 will be accepted depending on availability. Registration Deadline for registration is April 1. On-site registration or registration after April 1 is possible at a higher registration fee. All participants (also invited speakers and convenors) need to be registrated. This should be performed through the on-line registration . Hotel booking is done simultaneously. Contact For questions concerning organizational matters and hotel reservations, please contact: NORDSTAT SKD Konferensservice AB Ms Eva Ljungkvist or Mr Henrik Levin P.O.Box 1252 SE-171 24 Solna, Sweden Tel: +46 8 7058080 Fax: +46 8 7300699 Organizing Committee Swedish Statistical Association represented by Esbjrn Ohlsson, Stockholm (chair) Tom Britton, Uppsala Maria Deijfen, Stockholm Per Hallberg, Stockholm Programme Committee Olle Hggstrm, Gothenburg (chair) Sven Erick Alm, Uppsala Esbjrn Ohlsson, Stockholm Juni Palmgren, Stockholm Dietrich von Rosen, Uppsala Sponsors Skandia AstraZeneca Folksam Vetenskapsrdet AFA avtalsfrskringar SCB Hosts NORDSTAT 2002 is organized by the Swedish Statistical Association and hosted by Mathematical Statistics , Stockholm University and Mathematical Statistics , Royal Institute of Technology . Latest update May 29 2002, Per Hallberg perh@math.kth.se
MMR 2002
3rd International Conference onMathematical Methods in Reliability. Trondheim, Norway; 17--20 June 2002.
MMR 2002
Hawaii International Conference on Statistics
An annual opportunity for academics and professionals to meet and learn from each other. Next meeting: Honolulu, Hawaii, USA; 9--12 June 2004.
Hawaii International Conference on Statistics, Mathematics and Related Fields Home Call for Papers Registration Information for Authors Hotel Travel and Tours Program Proceedings E-mail Co-Sponsored by: American Statistical Association - Hawaii Chapter East West Council for Education Asia-Pacific Research Institute of Peking University University of Louisville - Center for Sustainable Urban Neighborhoods Organized By: Hawaii International Conferences For more information, please contact: Andrew Burge, Conference Coordinator Phone: 808-946-9927 Fax: 808-947-2420 Aloha and Welcome! Extended Submission Deadline: September 19th, 2005 The 5th Annual Hawaii International Conference on Statistics, Mathematics and Related Fields will be held from January 16 (Monday) to January 18 (Wednesday), 2006 at the Renaissance Ilikai Waikiki Hotel in Honolulu, Hawaii. Honolulu is located on the island of Oahu. "Oahu" is often nicknamed "the gathering place". The 2006 Hawaii International Conference on Statistics, Mathematics and Related Fields will be the gathering place for academicians and professionals from statistics and mathematics related fields from all over the world. The main goal of the 2006 Hawaii International Conference on Statistics, Mathematics and Related Fields is to provide an opportunity for academicians and professionals from various statistics and or mathematics related fields from all over the world to come together and learn from each other. An additional goal of the conference is to provide a place for academicians and professionals with cross-disciplinary interests related to statistics and mathematics to meet and interact with members inside and outside their own particular disciplines. The 2005 conference was a great success! Last year's conference was attended by more than 200 participants representing more than 25 countries.
Statistics for the Cities of Tomorrow
23rd Conference on Regional and Urban Statistics and Research. Lisbon, Portugal; 12--15 June 2002.
Conference "Statistics for the Cities of Tomorrow" Lisbon 12-15 June 2002 Organisation, contributed and invited papers, travelling, accommodation and useful information Conference Registration Form (PDF- 245 Kb) Provisional Programme Hotel Booking Form (Microsoft Word document - 50 Kb) Hotel Booking Form (PDF- 302 Kb) Social Programme, transportation and tourism Images from the Conference List of Participants (PDF- 48 Kb) a
TIES 2002
Annual Conference of The International Environmetrics Society. Genova, Italy; 18--22 June 2002.
TIES 2002 Conference This page uses frames, but your browser doesn't support them.
Developments and Challenges in Bump Hunting, Mixtures and Measurement-error Models
Dively Center, Case Western Reserve University, Cleveland, Ohio, USA; 2--4 June 2002.
Workshop on Developments and Challenges in Mixture Models, Bump Hunting and Measurement Error Models Workshop on Developments and Challenges in Mixture Models, Bump Hunting and Measurement Error Models Home Invited Speakers Committees Program Schedule Contributed Talk Poster Session Photos Feedback Location Links Accommodations Travel Discounts June 2 to 4, 2002 Dively Center, Case Western Reserve University Cleveland, Ohio Bumps, components, clusters and atypical structures from real data often lead to scientific discoveries or reveal interesting phenomena of a population. They are important in astronomy, biology, data mining, bioinformatics and in applications to virtually all natural and social sciences. The wide interest in such structures has in the last decade led to significant developments in each of these areas: mixture models for component hunting; nonparametric methods for bump or mode hunting; methods for cluster and structure hunting; and Bayesian computational methods for model selection and latent variable mixture models. Additionally, data often come with measurement errors or incomplete information. These problems add additional challenges to component, bump and cluster hunting and lead to another area of active research. Image sharpening can be also considered as an inferential problem involving measurement error models. This special international workshop brings together scientists from different camps but all working towards a common theme: knowledge hunting from real data in scientific problems involving bumps, components, clusters and other related topics. We'll exchange new ideas and discuss challenges. Invited Sessions: Astronomy, Bayesian methods, Bioinformatics, Bump hunting, Classification and Clustering, Image analysis, Measurement errors, Mixture models, Neyman Lectures: (a) Physical Sciences (b) Genetics Organized by: Jiayang Sun Hemant Ishwaran Sponsored by: National Science Foundation Institute of Mathematical Statistics Case Western Reserve University (College of Arts and Sciences, Provost Office, Medical School) Cleveland Clinic Foundation American Statistical Association, Cleveland Chapter Questions: wksp@sun.cwru.edu
16th Annual New England Statistics Symposium (NESS)
Yale University, CT, USA; 27 April 2002. On-line registration.
Yale-New Haven Medical Center Search this site: Yale New-Haven Medical Center New Haven, CT 06510 USA Hospital info: 203.688.4242 Patient info 203.688.4177 Yale University info 203.432.4771 Yale University Yale-New Haven Medical Center Web Server http: info.med.yale.edu Error 404, file not found. Sorry, we could not locate the file you requested: If you used a bookmark, to get to this page. Possibly the page has been moved and no longer exists on this server. Please check in the column to the left for links to institutions you may be trying to reach. Remember to change your bookmark. If you followed a link, the link may be out of date. Please inform the person responsible for maintaining the page that the link is not working. If you typed the link address, please check to be sure you spelled the link correctly. If you need help finding resources on this Web server, try one of these links: Medical Center home page Search page (to search by keyword). Phonebook (to find a person by name). Send mail to the Webmaster of this site. Last modified: December 1, 1999. (PL) Copyright 1999 Yale University School of Medicine and Yale-New Haven Hospital. All rights reserved. Comments or suggestions to the site editor. Home URL: http: info.med.yale.edu center
Statistical Analysis of Neuronal Data
Pittsburgh Supercomputing Center (PSC), PA, USA; 3--4 May 2002. On-line application.
Biomedical Initiative - Statistical Analysis of Neuronal Data Statistical Analysis of Neuronal Data May 3 - 4, 2002 ORGANIZERS: Emery Brown , Harvard University Rob Kass , Carnegie Mellon University SPONSORS: NIH National Center for Research Resources (NCRR) NIH National Institute of Mental Health (NIMH) ) - Theoretical and Computational Neuroscience NIH National Institute of Neurological Disorders and Stroke (NINDS) - Channels, Synapses and Circuits Cluster Institute of Mathematical Statistics (Sponsored mini-meeting) Center for the Neural Basis of Cognition ( Carnegie Mellon University of Pittsburgh ) Department of Statistics , Carnegie Mellon University Biomedical Initiative , Pittsburgh Supercomputer Center SITE: Carnegie Mellon University Pittsburgh, PA CONFIRMED PARTICIPANTS (as of January 31, 2002): Emery Brown ( Harvard University ) Zhiyi Chi ( University of Chicago ) Stu Geman ( Brown ) Satish Iyengar ( Pittsburgh ) Rob Kass ( Carnegie Mellon University ) Tai-Sing Lee (Carnegie Mellon) Mike Lewicki (Carnegie Mellon) John Miller ( Montana ) Partha Mitra ( Lucent ) Carl Olson (Carnegie Mellon) Andy Schwartz ( Neurosciences Institute ) Jennie Si ( Arizona State ) Dan Simons ( Pittsburgh ) Valerie Ventura (Carnegie Mellon) Jonathan Victor ( Cornell ) Matt Wilson ( MIT ) APPLICATION DEADLINE: April 1, 2002 (DEADLINE FOR REQUEST FOR TRAVEL FUNDS:February 28, 2002) DESCRIPTION: A fundamental question, arising repeatedly in neurophysiological investigations, is what physiological significance should be attached to particular neuron firing patterns. Many studies attempt to relate firing patterns of individual neurons in particular regions of the brain to characteristics of a stimulus or behavior, thereby inferring function. A major relatively new direction for the field involves the use of multielectrode recording, in which responses from dozens of neurons are recorded simultaneously. Important analysis issues include the precise temporal response of the neurons with respect to a stimulus, a behavior, or each other; neuronal variability, across ensembles and across trials; the additional information provided by multiple neurons; and the timing and dynamics of multiple neuronal responses. In this workshop we are bringing together a small number of neurophysiologists, statisticians, and computer scientists who are interested in quantitative analysis of neuronal data. The chief goal is to identify specific, important problems in neuronal data analysis where neurophysiologists and statisticians computer scientists can collaborate usefully. We plan to have several presentations, and plenty of time for informal discussion. The workshop has space, and some residual funding, for additional participants. To indicate interest please use ONLINE APPLICATION . Please address logistical questions to Nancy Blankenstein, blankens@psc.edu, and substantive questions to either of the co-organizers, Emery Brown, brown@srlb.mgh.harvard.edu, or Rob Kass, kass@stat.cmu.edu. ONLINE APPLICATION AGENDA CONFIRMED PARTICIPANTS PRESENTATION ABSTRACTS DIRECTIONS Pittsburgh Supercomputing Center (PSC), Carnegie Mellon University, University of Pittsburgh URL: http: www.psc.edu biomed SAND.html Revised: Wednesday, 01-May-2002 17:11:22 EDT
Nonparametric Smoothing in Complex Statistical Models
Centro Stefano Franscini, Scaona, Switzerland; 28 April -- 3 May 2002.
Smoothing 2002 Home An international workshop on Nonparametric Smoothing in Complex Statistical Models April 28th - May 3rd 2002 Centro Stefano Franscini ASCONA, SWITZERLAND Organised by: Theo Gasser Department of Biostatistics, ISPM University of Zurich Hans-Ruedi Knsch Seminar of Statistics ETH Zurich Enno Mammen Institute of Applied Mathematics University of Heidelberg The workshop is supported by: Swiss National Science Foundation, Centro Stefano Franscini, Novartis Pharma AG Basel, Winterthur Versicherungen (Schweiz), Rentenanstalt Swiss Life, SPSS (Schweiz) AG Zrich Comments to Jan C. Schuller
Interface '02
The 34th Symposium on the Interface of Computing Science and Statistics. Montreal, Canada; 17--20 April 2002.
Interface 2002
Extremes in Theory and Practice
Leuven, Belgium; 5--10 August 2001.
Home Topics Location Pre-registration Registrationform SecondCircular ScientificProg SocialProgramme SomePictures W elcome to the home page of the International Symposium on Extreme Value Analysis: Theory and Practice Leuven, Belgium August 5 till August 10, 2001 This conference is the second meeting on the topic of extremes organized in close collaboration with the management of the journal Extremes. The first syposium was organized in Gothenburg in 1998. The 2001 conference will schedule review papers as well as original reseach on all aspects of extreme value theory and its applications in science, engineering, economics, etc. Contributions that give detailed case studies are particularly welcomed. Aside from contributed paper sessions and poster sessions, invited paper sessions are organized. Organizing commitee J. Beirlant, I. Gybels, H. Rootzn and J.L. Teugels Scientific commitee C.W. Anderson, University of Sheffield, U.K. J. Beirlant, University of Leuven, Belgium H. Drees, University of Heidelberg, Germany P. Embrechts, ETH Zrich, Switzerland I. Gomes, University of Lisbon, Portugal L. de Haan, Erasmus University Rotterdam, the Netherlands H. Rootzn, Chalmers University of Technology, Sweden J.L. Teugels, University of Leuven, Belgium W. Willinger, ATT Laboratories, USA Important dates December 15, 2000 : final date to return pre-registration form begin March, 2001 : second circular and registration form will be available on the WEB April 15,2001 : abstracts and registation forms should be returned by this day May 31, 2001 : confirmation of registration and accomodation Click for information on: Topics Location Pre-registration Registration Second Circular Scientific Programme Social Programme Style Format for Abstract You can download a LaTeX 2.09 file with the style format for your abstract here . Enter the title, the name of the contributor(s) and the abstract, and e-mail back as attachment to extremes@ucs.kuleuven.ac.be . If you want to print any of these pages please make sure that you use the right settings. For Netscape Navigator you should go to Page setup and check whether you have "Black text" switched on on your page options. If you use Internet Explorer you open Internet options, choose advanced and there switch off "print background colors and images". Back to Top Copyright 1998, Katholieke Universiteit Leuven Style: Bettie Joossens Reactions for the authors: Bettie Joossens Last changed: September 27, 2001
SIB99
Third Conference of the Italian Biometric Society. Rome, Italy; 7--9 July 1999.
Italian Biometric Society - SIB99 Italian Biometric Society International Biometric Society Italian Region III Conference Rome, July 7 - 9 1999 Scientific Committee Ettore Marubini (president) Stefano Benedettelli Luisa Bernardinelli Alessandro Camussi Bruno Dallapiccola Adriano Decarli Anna De Sarno Gian Franco De Stefano Gino Farchi Francesco Grigoletto Marco Marchi Alberto Piazza Isabella Pierantoni Carla Rossi Giuseppe Schinaia Luciano Terrenato Giovanni Battista Tranquilli Maria Grazia Valsecchi Organizing Committee Susanna Conti Fabio Divino Anna Gigli Lucilla Rav Gianpaolo Scalia Tomba Congress Secretary Rita Abbondanza Hotel Reservation Griffe Italia Via Portoferraio 13, Roma The 3rd National Conference of the Italian Region of the International Biometric Society is organized to bring together researchers in various fields of application of statistics: agricoltural sciences and forestry, anthropology, biology, demography, environmental sciences, genetics, medicine. Contacts are in progress with the Comune di Roma for a formal partonage. On Wednesday morning there will be a tutorial seminar on survival analysis by Maria Grazia Valsecchi (University of Verona, Italy) and Alessandra Nardi (University of Teramo, Italy). This seminar will include a short presentation by Andrea Span (Mathsoft) on the application of the computer package S-Plus to survival analysis. A conference banquet will be offered to all registered participants on Thursday evening in one of the historical garden properties of the Town Council of the city: further details will be soon available. CONFERENCE SITE Conference Room (SALA CONVEGNI) of the National Council for Research (C.N.R.), Piazzale Aldo Moro 7, Rome. The C.N.R. building is near the University area of the city, within a short distance of the main railway station (Termini Station). OFFICIAL LANGUAGES The conference official languages are Italian and English. IMPORTANT DATES March 29: deadline for asbtract submission April 20: notification of acceptance May 14: early registration (without extra charge) and hotel reservation SCIENTIFIC PROGRAM Wednesday, July 7 9:00 - 13.00 Tutorial seminar on Survival Analysis 14:30 - 15:30 Registration 15:30 - 16:00 Opening and welcome message 16:00 - 16:50 Invited plenary session - Chairman: Carla Rossi M. SCHEMPER - University of Wien "Predictive precision and explained variation in Cox and other regression models" 16:50 - 17:20 Coffee break 17:20 - 18:10 Invited plenary session - Chairman: Gian Franco De Stefano P.O'HIGGINS - University of London "The shapes of things: Applications of geometric morphometrics to the study of craniofacial variation in primates" 18:10 - 19:00 Invited plenary session - Chairman: Alberto Piazza A. GOLINI - Universit "La Sapienza" di Roma (title to be defined) Thursday, July 8 8:50 - 9:40 Invited plenary session - Chairman: Luisa Bernardinelli BERTRAM MULLER-MYHSOK- Istituto "B. Nocht" di Medicina Tropicale, Amburgo Provisional Title: "Genetic Mapping " 9:40 - 10:30 Invited plenary session - Chairman: Giuseppe Schinaia Z. AGUR - Tel Aviv University "Use of Mathematical Methods for Protocol Design in Cancer" 10:30 - 11.00 Coffee break 11:00 - 12:40 Parallel sessions of oral presentations 12:40 - 13:30 Lunch 13:30 - 14:30 Assembly of members and elections of society executive board 14:30 - 16.10 Parallel sessions of oral presentations 16.10 - 16:30 Coffee break 16:30 - 18:10 Parallel sessions of oral presentations Friday, July 9 8:50 - 9:40 Invited plenary session- Chairman: Renato Coppi E. BIGANZOLI - Istituto Nazionale Tumori, Milan "Reti neurali artificiali per lo studio di fenomeni complessi: limiti e vantaggi delle applicazioni in biostatistica" 9:40 - 11:00 Coffee break and poster exhibition 11:00 - 12:30 Discussion on "Quality, collection and management of biometric and environmental data" Chair: Ettore MARUBINI with: ENEA, ISTAT, IST. SUPERIORE SANITA', REGISTRO TUMORI 12:30 - 13:30 Closure of the Conference REGISTRATION HOTEL ACCOMODATION Related conferences and seminars List of sessions of oral presentations and posters For comunications, pls contact: SIB99@iac.rm.cnr.it Web page by Giuseppe Schinaia Last update: June 21, 1999
International Workshop in Applied Probability (IWAP2002)
Caracas, Venezuela; 14--17 January 2002.
index.gif
8th International Meeting on Statistical Climatology
Lneburg, Germany, 12-16 March 2001.
8th International Meeting on Statistical Climatology 8th International Meeting on Statistical Climatology University of Lneburg , Germany, 12-16 March 2001 organized by: Institute of Coastal Research Hydrophysics , GKSS Research Centre , Geesthacht, Germany (Information on Lneburg in German and English ) Homepage of the IMSCs . The 9IMSC will be held in Cape Town, organized by Bruce Hewitson. Please send articles for the special volume of "Climate Research" to Hans von Storch ! Book on John Refveim on the web! Pictures taken during 8imsc Conference Proceedings in Word and pdf -format Updated: schedule for 12.3. , 13.3. , 14.3. , 15.3. and 16.3.2001 To the Campus' site plan How to reach the unversity campus List of hotels in Lneburg Street finder Lneburg Topics Stochastic Climate Models Statistics, Models and Data Assimilation Extreme Value Analysis Simulation Models Decision Making Posters Scope The " International Meetings on Statistical Climatology " have been organized by a group of independent climatologists and statisticians since 1979. The 8th of these meetings will be held in March, 2001 in Lneburg in Germany. The purpose of the meetings is to bring together climatologists and statisticians, to exchange concepts and problems. Climatologists present statistical problems in climatology (including meteorology and related fields) and consider the methods that are currently used to deal with these problems. Also, techniques tailored by climatologists for the specific needs of climatology are presented. Statisticians, on the other hand, present new, state-of-the art techniques developed within mathematical statistics and other scientific fields. By discussing the needs of climatology and the possibilities offered by modern statistics, synergetic effects are obtained, advancing the methodical basis of climatology and helping statistics to focus on relevant problems. The present meeting is organized into five sessions, each dealing with a challenge that climatology is presently facing: Stochastic climate models, Extreme value analysis, Statistics, models and data assimilation, Simulation models, Decision making. Contributions unrelated to these chosen topics are welcome as well. Program committee Hans von Storch , GKSS Research Centre, Geesthacht, Germany (chair), email storch@gkss.de Gtz Flser , GKSS Research Centre, Geesthacht, Germany (local organization), email floeser@gkss.de Hans Alexandersson, Swedish Meteorological and Hydrological Institute, Norrkping, Sweden, email hans.alexandersson@smhi.se Joao Corte-Real, Univ. Lisbon, Portugal, email jcr@fc.ul.pt Peter Guttorp , University of Washinton, Seattle, WA, USA, email peter@stat.washington.edu Gabi Hegerl , University of Washinton, Seattle, WA, USA, email hegerl@atmos.washington.edu Ian T Jolliffe , Univ. of Aberdeen, Scotland, email itj@maths.abdn.ac.uk Rol Madden, UCAR, Boulder, Colorado, USA, email ram@ucar.edu Peter Mller , Department of Oceanography, University of Hawaii, USA, email pmuller@iniki.soest.hawaii.edu Carlos Nobre , Centro de Previso de Tempo e Estudos Climticos, Cachoeira Paulista, Brasil, email nobre@cptec.inpe.br Doug Nychka, Geophysical Statistics Project, National Center for Atmospheric Research, Climate and Global Dynamics Division, Boulder, CO, USA, email nychka@cgd.ucar.edu Jin-Song von Storch , Meteorologisches Institut der Universitt Hamburg, Germany, email jinsong@gkss.de Dietrich Stoyan , Institut fr Stochastik, Bergakademie Freiberg, Germany, email stoyan@orion.hrz.tu-freiberg.de Hans Wackernagel , Ecole des Mines, Paris, France, email hans@cg.ensmp.fr Lawrence Wilson, Environment Canada, email Lawrence.Wilson@ec.gc.ca Francis Zwiers , Canadian Center for Climate Modeling and Analysis, Victoria, Canada, email fzwiers@ec.gc.ca Presentation Posters will be fixed to DIN A0 poster walls, i.e. 119 x 84 cm, portrait format. Every seminar room is equipped with an overhead projector. In the lecture hall, there will be a video beamer. Publication The journal Climate Research has offered a special issue with important clusters of papers presented at the meeting. Details will be discussed during the meeting. Structure General overview lecture plus 2 or 3 invited talks. In the afternoon parallel sessions would be organized with contributed talks and posters. For each of the morning sessions, two members of the Program Committee are responsible. Details see here . Conference fee 250,- DM. The participants are requested to transfer the money to the following account: Banking information Account holder GKSS-Forschungszentrum Geesthacht GmbH Max-Planck-Strae, D-21502 Geesthacht Germany Name and address of the bank Deutsche Bank AG, Geesthacht Bergedorfer Strae 40 D-21502 Geesthacht Germany Bank code (BLZ) 200 700 00 Account number 58 004 04 Reference required with payments 5T500V01, Keyword: 8.IMSC Name of person to contact in case of transfer of funds Michael Schmid (Treasurer) Tel.: +49-4152-87-1657 Fax: +49-4152-87-1732 If there are problems with the international bank transfer procedure, please contact me. Conference location: University of Lneburg, Scharnhorststrae 1. Details will follow. How to reach the university campus . The participants are requested to contact the hotels directly: Hotels in Lneburg 1) "Seminaris Hotel Lneburg" Seminaris Hotel- und Kongresttten-Betriebs-GmbH (SeHoKo) Soltauer Strae 3 21335 Lneburg e-mail: lueneburg@seminaris.de Telefon: (0 41 31) 7 13-0; Fax 713-128 bernachtung 149 175 DM 2) "Mvenpick Hotel Bergstrm" Bei der Lner Mhle 21335 Lneburg Telefon: (0 41 31) 30 80; Fax 30 84 99 bernachtung 168 278 DM 3) Hotel Bargenturm Lambertiplatz 21335 Lneburg Telefon: (0 41 31) 72 90; Fax 72 94 99 bernachtung 176,50 DM 4) "Ringhotel Residenz" Munstermannskamp 10 21335 Lneburg Telefon: (0 41 31) 75 99 10; Fax 7 59 91 75 bernachtung 135 180 DM 5) "Hotel Heiderose" Uelzener Strae 29 21335 Lneburg Telefon: (0 41 31) 4 44 10, Fax 4 83 57 bernachtung 80 85 DM 6) "Park-Hotel Lneburg" Uelzener Strae 27 21335 Lneburg Telefon: (0 41 31) 4 11 25 bernachtung 75 85 DM Blue dots represent the hotels mentioned on the left. S: Seminaris, M: Mvenpick, B: Bargenturm, R: Ringhotel Residenz, H: Hotel Heiderose, L: Park-Hotel Lneburg The red dot denotes the university campus. If you have comments to make concerning the conference, please send an email here . Gtz Flser, GKSS, email: floeser@gkss.de Last update: 23 April 2001
Symposium in Honour of Sir John Kingman
This meeting is organised to mark the occasion of Sir John Kingman leaving Bristol to take up the Directorship of the Isaac Newton Institute in Cambridge. The programme will focus on topics of current interest in probability and related fields where John Kingman's own work has been particularly influential. University of Bristol, UK; 16 May 2001.
John Kingman symposium
Statistical Challenges in Modern Astronomy III
Statistical Challenges in Modern Astronomy III homepage. Penn State University, University Park, PA, USA; 18--21 July 2001.
Statistical Challenges in Modern Astronomy III Search Offerings: Browse Offerings: Areas of Interest Agricultural Sciences Arts and Architecture Business Communications Corporate Education Earth and Mineral Science Education Engineering Environment Health Information Technology International Programs Justice and Safety Liberal Arts Outdoor Activities Personal Enrichment Science Sports My Cart Advanced Search Log In November 17, 2005 This program has already taken place, but the information provided here may still be helpful if youre considering attending such a program in the future. Programs are often repeated on an annual or semi-annual basis...to learn more about future offerings of this program, please go to the for more information section of this Web site. The Statistical Challenges in Modern Astronomy conferences provide a unique forum for astronomers and statisticians to discuss complex methodological issues in modern astronomical research. The third conference, held this summer, focuses on observational cosmology and a variety of other astrostatistical topics, including Bayesian statistics, time-series analysis, multiscale methods, and spatial statistics. The conference features a distinguished group of invited speakers from both fields and emphasizes cross-disciplinary commentary and discussion. A preliminary program with speakers and titles is now available. Scholars and graduate students interested in astrostatistics are encouraged to attend. Contributed papers for the poster session are welcome. Please register and arrange your travel and accommodations early. Conference Timeline November 20, 2000 Preliminary announcement March 15, 2001 Second announcement May 15 Submit title and abstract for contributed posters Request funding assistance for students and young scientists Registration deadline (fee $210) June 17 Hotel reservation deadline Final announcement July 1 Late registration deadline ($25 late fee after May 15) July 1821 Conference at Penn State September 15 Deadline for papers abstracts for proceedings an outreach service of the Eberly College of Science in cooperation with the National Science Foundation, NASA, and the Institute of Mathematical Statistics About the Conference | Program | Location and Accommodations | Fee and Registration | Contact Us Penn State is committed to affirmative action, equal opportunity, and the diversity of its workforce. This site is a product of Penn State , Outreach Office of Marketing Communications . Please e-mail us with your questions, comments, or suggestions at WebInfo@outreach.psu.edu . Copyright 2001 The Pennsylvania State University This page was last modified on Thursday, June 14, 2001. U.Ed.OCE 01-0641 ms ac HN
Statistical Approaches to the Ocean Circulation Inverse Problem
IMS Mini-Meeting. Florida State University, Tallahassee, Florida, USA; 13--14 November 2001.
Statistical Approaches to the Ocean Circulation Inverse Problem IMS Mini-Meeting Statistical Approaches to the Ocean Circulation Inverse Problem November 13-14, 2001 Florida State University, Tallahassee, Florida This mini-meeting is designed to foster interaction between statisticians and oceanographers with a common interest in inverse problem methods. Oceanography has evolved very quickly over the past decade with the increasing realization of the ocean's importance to climate around the globe, the implementation of large field experiments such as the World Ocean Circulation Experiment, and with the development of new technologies to measure temperature, movement, and other quantities in the ocean from space with satellites. A major effort is being made to integrate diverse observations and analyze larger datasets; these efforts are challenging because of the basic complexity of the ocean and climate system. Variability exists at the longest and shortest space and time scales, and little is presently known about the spatial and temporal coherence of ocean circulation. Furthermore, despite the observational efforts, datasets are typically sparse, and methods of analysis typically must incorporate dynamical information about the circulation in order to proceed. Studies of the basic statistical variability, mapping, estimation, and more sophisticated forward and inverse modeling techniques are being developed and used in the oceanography community to determine circulation. On the other hand, a large variety of inferential methods for the study of indirect or sparsely measured phenomena, including Bayesian techniques and nonparametric smoothing for spatio-temporal data, have been developed by statisticians in recent years. A 1994 National Research Council panel ( Statistics and Physical Oceanography ) encouraged collaboration between statisticians and oceanographers in a number of areas, including inverse problem methods. So the time is ripe for a fruitful interaction between the oceanographic and statistics communities to discuss this topic. Invited Speakers Discussants Carl Wunsch (MIT, cwunsch@pond.mit.edu) Paul Switzer (Stanford, ps@stat.stanford.edu) Keith Haines (Edinburgh, kh@met.ed.ac.uk) Grace Wahba (Madison, wahba@stat.wisc.edu) Armin Koehl (Scripps, akoehl@ucsd.edu) Chris Wikle (Missouri, wikle@ss1.stat.missouri.edu) Susan Lozier (Duke, s.lozier@duke.edu) Michael Lavine (Duke, michael@stat.duke.edu) Francois-Xavier Le-Dimet (Grenoble, Francois-Xavier.Le-Dimet@imag.fr) Organizers Ian McKeague (FSU) Kevin Speer (FSU) The meeting had an informal workshop flavor, open to anyone interested in attending. There was no registration fee. A poster session was organized for all presentations other than invited talks. We originally intended that a record of the invited talks would be made available through this web page, but speakers were reluctant to send summaries of their talks after the meeting, so that idea fell by the wayside. However, e-mail addresses are provided above, and we encourage anyone interested to ask the speakers for further information about their talks. Persons interested in attending or in presenting a poster were asked to notify: Pam McGhee Department of Statistics Florida State University Tallahassee, FL 32306-4330 e-mail: mcghee@stat.fsu.edu Program TUESDAY, NOVEMBER 13: 8:30 a.m. - Pick-up time for rides to Dirac Science Library from Holiday Inn and Doubletree hotels 8:40 a.m. - Refreshments 9:00 a.m. - Welcome 9:15 a.m. - Carl Wunsch Statistical Issues Raised by Ocean Data Assimilation, and other Stories Discussant: Paul Switzer 10:30 a.m. - Break 11:00 a.m. - Grace Wahba Covariance Modeling for Atmospheric and Ocean Data Assimilation Discussant: Paul Switzer 12:15 p.m. - Lunch 2:00 p.m. - Keith Haines Diagnostics of Thermodynamic Bias in Ocean Data Assimilation Discussant: Chris Wikle 2:45 p.m. - Armin Koehl Discussant: Michael Lavine 3:30 p.m. - Break 4:00 p.m. Poster session WEDNESDAY, NOVEMBER 14: 8:30 a.m. - Pick-up time for rides to Dirac Science Library from Holiday Inn and Doubletree hotels 8:40 a.m. - Refreshments 9:00 a.m. - Chris Wikle Bayesian Hierarchical Modeling of Air-Sea Interaction Discussant: Keith Haines 9:45 a.m. - Susan Lozier and Michael Lavine Discussant: Armin Koehl 10:45 a.m. - Break 11:15 a.m. - Francois-Xavier Le Dimet Errors and Data Assimilation Discussant: Grace Wahba 12:00 a.m. - Open discussion All talks and the poster session took place in the Seminar Room on the 4th floor of Dirac Science Library. To find the Dirac Science Library and the Oceanography Statistics Building, see the campus map . Accommodation Special rates were arranged at two hotels within a few blocks of the downtown walking tour sights, and we advised "Be sure to request the FSU-Department of Statistics group block rate when making reservations." The locations of these hotels are shown on the map. Holiday Inn Select Downtown Capital Hill 316 W. Tennessee St. Tallahassee, FL 32301 Phone: 800-648-6135 Rate $79 (if reserved by Oct 29) Doubletree Hotel 101 S. Adams St. Tallahassee, FL 32301 Phone: 850-224-5000 Rate $89 (if reserved by Oct 29) Downtown Tallahassee Travel For those planning air travel to the conference, the Tallahassee Regional Airport is located 7 miles southwest of Tallahassee on Capital Circle SW. For travel by interstate, Tallahassee is just off I-10 at the east edge of Florida's Panhandle. Tallahassee regional map
Spring Research Conference on Statistics in Industry and Technology
Spring Research Conference on Statistics in Industry and Technology homepage. Roanoake, VA, USA; 18--20 June 2001.
Conference 2001
SAMO (Sensitivity Analysis of Model Ouput) Conference 2001
SAMO 2001. Third International Symposium on Sensitivity Analysis of Model Output. CIEMAT, Madrid, Spain; 18 -- 20 June 2001.
Scientific Programme - Convocatorias - Eventos - Samo 2001 - Ciemat Third International Symposium on Sensitivity Analysis of Model Output Symposium Information Samo 2001 Summary Honorary Committee Scientific Programme Scientific Committee Communications Organising Committee Registration Secretariat General Information Useful links Abstracts News SCIENTIFIC PROGRAMME The provisional outline of the conference programme is as follows: Local Methods Variance Based Methods Bayesian Methods Model Sensitivity Knowledge, Judgement and Use of Models Calibration SA in Quality Management FORM and SORM SA in Performance Assessment Applications (Environment, nuclear, economics, etc.) Innovative Approaches ( Ciemat - jule 2.000 )
JSM 2001. Joint Statistical Meetings. Atlanta, 2001.
Joint Statistical Meetings of the ASA, Biometric Society, and IMS. Atlanta, Georgia; 5--9 August 2001.
JSM 2001 JSM 2001 Program This is the preliminary program for the 2001 Joint Statistical Meetings in Atlanta, Georgia. Currently included in this program is the "technical" program, schedule of invited, topic contributed, regular contributed and poster sessions; Continuing Education courses and workshops; and Committee and Business Meetings. This on-line program will be updated frequently to reflect the most current revisions. To View the Program: You may choose to view all activities of the program or just parts of it at any one time. All activities are arranged by date and time. Where room names are listed, the following abbreviations apply: M = Marriott H = Hilton Deming Lecture Handouts - view here to download and print out these Handouts compiled by Gerry Hahn Select the Activity Types you want to view Contributed Papers Panel Posters Invited Papers Panel Posters Luncheons Roundtable Luncheon Speaker Luncheon Other Committee Business Continuing Education Special Presentation ICW Topic Contributed Papers Panel Posters People Index A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Search By Sponsor Sponsor: ASA ASA Alaska Chapter ASA Atlanta Chapter ASA Finance Committee ASA MAA Joint Cmte on Undergrad Stats ASA SIAM Book Series Academic Program Representatives Addison Wesley Advisory Cmte on Continuing Education Advisory Cmte on Teacher Enhancement American Educational Research Association (AERA) Amstat Online Association of GCRC Statisticians Biometrics Section* Biopharmaceutical Section* Business Economics Statistics Section* CIS Cancer Center Biostatistics Directors Capital One Carnegie Mellon Alumni Faculty Caucus for Women in Statistics Census Research Meeting Chance Christian Statisticians Classification Society of North America Cmte of Representatives to AAAS Cmte on ASA Archives Historical Materials Cmte on Applied and Theoretical Statistics Cmte on Career Development Cmte on Committees Cmte on Gay and Lesbian Concerns in Statistics Cmte on Meetings Cmte on Membership Cmte on Minorities in Statistics Cmte on Privacy and Confidentiality Cmte on Professional Ethics Cmte on Scientific Freedom and Human Rights Cmte on Statisticians in Defense and National Security Cmte on Statistics Disabilities Cmte on Women in Statistics Committee on Outreach Committee on Publications Communications in Statistics Council of Chapters Council of Presidents of Stat Societies Council of Sections Deming Lectureship Committee Development Committee Duxbury Thomson Learning ENAR Eli Lilly and Company Forest Service Statisticians Gay Lesbian Statisticians' Caucus General Methodology Health Informatics Hispanic Statisticians Household Credit Services IMS Indian Statistical Institute Individual Membership Subcmte Insightful Corporation Interface Foundation of North American Stat Assn International Chinese Statistical Association Intl Chinese Statistical Association Intl Indian Statistical Association Intl Society for Bayesian Analysis (ISBA) Iowa State University Alumni Isolated Biostatisticians Isolated Statisticians JABES JASA Book Review JASA, Applications JASA, Theory and Methods JBES JCGS JQT Review Board JSE JSM 2002 Program Committee JSM Advisory Committee John Wiley Sons Key College Publishing Korean Statisticians in America Memorial Sessions Merck Co Mu Sigma Rho National Institute of Statistical Societies (NISS) Natl Inst of Statistical Sciences Natl Research Ctr for Stats in the Environment Natl Science Foundation Noether Award Committee North Carolina State University Organizational Membership Committee RAND Statistics Group SMU Alumni Friends SPAIG SSC STATS Magazine Science Public Affairs Advisory Committee Section on Bayesian Stat. Sciences* Section on Government Statistics* Section on Health Policy Statistics* Section on Nonparametric Statistics Section on Physical Engineering Sciences* Section on Quality Productivity* Section on Risk Analysis Section on Statistical Computing* Section on Statistical Consulting* Section on Statistical Education* Section on Statistical Graphics* Section on Statistics the Environment* Section on Statistics and Marketing Section on Statistics in Epidemiology* Section on Statistics in Sports* Section on Survey Research Methods* Section on Teaching of Statistics in the Health Sciences* Social Statistics Section* Special Subcommittee on Meetings Statistics in Medicine Technometrics Texas AM University Alumni The American Statistician University of Connecticut University of North Carolina Alumni University of Pittsburgh W J Youden Award in Interlaboratory Testing Cmte WNAR Washington Statisticial Society Advanced Search You can search the Abstracts for the 2001 Joint Statistical Meetings in Atlanta. There are several different types of searches you can perform. Hit the appropriate button for: Keyword. Searches all keywords. Affiliation. Find all abstracts from a certain company or organization. Author. Enter a part of any author's name. (In the form: Family name, Given name) Choose the search type: Keyword Affiliation Author Search Word(s): JSM 2001 For information, contact meetings@amstat.org or phone (703) 684-1221. If you have questions about the Continuing Education program, please contact the Education Department . Revised March 2001
2001 ISI
53rd session of the International Statistical Institute. Seoul, 22-29 August 2001.
2001 ISI SEOUL Your Browser doesn't support frame view.
IMS ENAR 2002 Spring Regional Meetings
The IMS Eastern Regional meeting will be held jointly with the spring meeting of the International Biometric Society, Eastern North American Region (ENAR) and sections of American Statistical Association (ASA). Arlington, VA, USA; 15--21 March 2002.
IMS ENAR 2002
GfKl 2002
Annual meeting of the German Classification Society GfKl (Gesellschaft fr Klassifikation). University of Mannheim, Germany; 21--24 July 2002.
Lehrstuhl fr Wirtschaftsinformatik III Prof. Dr. Martin Schader - GfKl-2002 Conference Lehrstuhl fr Wirtschaftsinformatik III Prof. Dr. Martin Schader EN | Print Travel Information Mainpage Supporting Organizations Call For Papers Abstracts Proceedings Program GIS Tutorial Book Exhibition Organizers Conference Site Hotels near Conf. Site University of Mannheim Around Mannheim City of Mannheim IFCS 2002 CoALa WAM 2004 MDD 2004 DOREA2 DOREA-Workshop 2004 MIEA-Workshop 2003 JEFF-CODES-2003 Technical Session GfKl-2002 Conference VIDIO-Projekt EDOC-Conference 1999 UML-Workshop 1997 IIOP Internet InterORB Protocol Home Neuigkeiten Portrt Studium Projekte Abgeschlossene Projekte Vermischtes GfKl 2002 Main Page Between Data Science And Everyday Web Practice 26th Annual Conference of the Gesellschaft fr Klassifikation July 22-24, 2002, University of Mannheim, Germany The conference is now over, and we look forward to see you again at GfKl 2003 in Cottbus. GfKl 2002 was attended by some 250 participants from 23 countries. The program included tutorials, plenaries, and refereed papers. Please, have a look at our photo gallery .
The Fifth ICSA International Conference
The University of Hong Kong; 17--19 August 2001.
The Fifth ICSA International Conference The Fifth ICSA International Conference Co-sponsored by the Institute of Mathematical Statistics Information Date Place Programme Organising Committee Keynote Speakers Registration Call for papers Conference Schedule (Preliminary Programme) Maps and Direction Hotel Tours information (ENG CHI) History Contact Patronage Photo - 16-17 Aug - 18 Aug - Conference Dinner Other Links [ NEXT | BACK ] Information: The main venue for the above conference will be at the University of Hong Kong, Pokfulam Road, Hong Kong. The above dates are chosen with the purpose that potential participants can easily make arrangements to attend the International Statistical Institute meeting to be held in Seoul, South Korea on the following Wednesday. The Conference Programme Committee members listed below would appreciate your suggestions about the topics of the invited sessions and possible short courses. Please contact any of the committee members about your suggestions of potential topics, speakers and session organizers. Participants will have to book their own hotel. Please visit here for hotel information. Date: August 17-19, 2001 Place: The University of Hong Kong, Hong Kong Programme Organising Committee: W.K. Li (The University of Hong Kong)(Programme Chair) H. Tong (The University of Hong Kong and London School of Economics and Political Science) K.T. Fang (Hong Kong Baptist University) L.K. Chan (City University of Hong Kong) Fred Ho (Census and Statistics Department, Hong Kong SAR Government) Xiao-Li Meng (The University of Chicago) Jianqing Fan (The Chinese University of Hong Kong and The University of North Carolina) Ming-Gao Gu (The Chinese University of Hong Kong) K.W. Ng (The University of Hong Kong) W.S. Chan (The University of Hong Kong) L. Zhu (The University of Hong Kong) Keynote Speakers: Prof. Peter Hall (FRS) Australian National University Prof. Tze-Leung Lai Stanford University Conference Schedule (Preliminary Programme): Please click here to get the Conference Schedule and the Preliminary Programme. Registration: Please click here to get more information on registration. Call for papers: Papers, both theoretical and applied, are invited for presentation at the conference. Papers with applications to banking, insurance and risk management are also welcome. Please send a copy of the abstract of no more than 200 words (without any symbols or formulas) to us (preferably by e-mail or on disk) before April 1, 2001 along with your registration form and fee. The Template and Sample of Abstract can be downloaded here: Template: In Microsoft Word Format (.RTF, 6KB) In TeX Format (.TEX, 1KB) Sample of Abstract: In Microsoft Word Format (.RTF, 6KB) In TeX Format (.TEX, 1KB) Map and Direction: Direction from Airport to Hotels, Hotels to HKU (.PDF, 12KB) Map of the Hotels (.PDF, 337KB) Map of The University of Hong Kong (.PDF, 250KB) History: 1998 - The Fourth International Statistical Conference was held in Kunming, China, August 19-21, 1998. More than 150 participants came from China, Hong Kong, Taiwan, USA, Australia, Brazil, Canada, Greece, Japan, Norway, Singapore, South Korea, and UK. Over 150 papers in 54 sessions were delivered. 1995 - The Third International Statistical Conference was held in Fragrant Hill, Beijing, China, August 17 - 20, 1995. More than 200 participants came from China, Hong Kong, Taiwan, USA, Canada, Japan, Australia, Sweden and Austria. 192 papers were delivered. 1993 - The Second International Statistical Conference was held in Taipei, Taiwan, ROC, December 16-19, 1993, cosponsored by the Taipei International Statistical Symposium and Institute of Statistical Science, Academia Sinica, Taiwan. More than 500 attendees came to the meeting and 240 papers were delivered in various areas. 1990 - The First International Statistical Conference was held in Hong Kong, December 15 - 17, 1990. 145 people from countries including Hong Kong, China, Taiwan, and USA attended the meeting. 110 papers were delivered. Contact: E-mail : icsa2001@hku.hk Mail : The Secretariat, ICSA 2001, Department of Statistics Actuarial Science The University of Hong Kong Pokfulam Road, HONG KONG Fax : (852) 2858 9041 Tel. : (852) 2859 2467 Patronage: SAS Institute Aon Asia K.C. Wong Education Foundation Map and Direction: Direction from Airport to Hotels, Hotels to HKU (.PDF, 12KB) Map of the Hotels (.PDF, 337KB) Map of The University of Hong Kong (.PDF, 250KB) Other Links: The 2nd International Symposium on Business and Industrial Statistics Other links about HongKong (Hotels, Transportation and other information) You can to read the materials. [ BACK ]
EMA 2001
International Conference on Environmental Statistics. Cdiz, Spain; 21--23 November 2001.
EMA 2001
Biometric Society (WNAR) SSC IMS Western Regional Meeting
Western region joint statistics meeting of the Statistical Society of Canada (SSC), the Biometric Society Western North American Region (WNAR), and the Institute of Mathematical Statistics (IMS). Simon Fraser University, Burnaby, BC, Canada; 10--14 June 2001.
SSC WNAR IMS 2001
Applied Stochastic Models and Data Analysis (ASMDA) 2001
Compigne,France; 12--15 June 2001.
ASMDA 2001
Advanced Computational Methods for Statistical Inference
Summer School. CIRM, Luminy, France; 17--21 September 2001.
Presentation Summer School Advanced Computational Methods for Statistical Inference Ecole d'Ete Mthodes de Monte-Carlo pour l'infrence Statistique CIRM, Luminy, 17-21 September 2001 Organizers Organisateurs E. MOULINES, C.P. ROBERT Ecole parraine par le groupe Modlisation Alatoire et Statistique The summer school is funded by the European Union's TMR network "Statistical and Computational Methods for the Analysis of Spatial Data. ERB-FMRX-CT96-0096" The purpose of this 5 days summer school (September 17-21, 2001), is to bring together senior researchers on the topic of recent advances in computational methods, with applications to complex statistical problems, like those encountered in econometrics, signal processing and finance, and to introduce Ph.D. students and junior researchers to these methods. The school will be organised in order to meet these two requirements, with courses held in the mornings, advanced talks in the afternoon and round-tables in the evenings. In fact, new methods are currently appearing in the field of computational Statistics which go beyond standard MCMC algorithms, taking advantage of earlier works on importance sampling (auxiliary variables, stratified sampling) and particle systems, the later being mainly studied in probability theory and statistical physics so far. Different simulation methods have also been devised for the analysis of continuous-time stochastic processes, in particular in connection with stochastic differential equations. The applications of these methods in various fields are also undergoing a rapid growth: see for instance the use of particle filters in target tracking and image analysis, advanced signal processing, quantitative finance and econometrics. Eric MOULINES, Ecole Nationale Suprieure des Tlcommunications, Dpartement Traitement du Signal et des Images, 46 rue Barrault, 75634 PARIS Cdex 13 (33) 1 45 81 77 03, moulines@tsi.enst.fr Christian P. ROBERT, Laboratoire de Statistique, CREST, Timbre J340, INSEE, 18 Blvd Adolphe Pinard, 75675 PARIS Cedex 15 (33) 1 41 17 57 69, robert@ensae.fr Presentation | Preliminary Program
CIRET Conferences
International conferences held every other year to develop consistent and applicable explanatory patterns for cyclical fluctuations and to overcome the divergence of empirical, theoretical and policy activities.
CIRET Conferences News Conferences IDC JBCMA Membership User Organisation Contact Login ciret conferences CIRET Conferences The networking-basis are the international conferences that are held every other year. They last four days and provide interested researchers (including CIRET members) with the opportunity to present and discuss their latest research activities mainly within specially selected groups. The biennial conference is the meeting place for top scientists from all over the world and successfully integrates the theoretical aspects as well as the perspectives of those who are primarily engaged in applying survey data. The goal is to develop consistent and applicable explanatory patterns for cyclical fluctuations and to overcome the divergence of empirical, theoretical and policy activities. The conferences are held in one of the Member countries. They are organized in cooperation with so called local organizers. The focus program puts priority on a topical problem in conducting economic surveys. The Conference is not only a meeting point for experts, but also establishes a forum for researchers who start working in the field of socio-economic surveys. The Conference papers are available for CIRET members as well as authors and participants of the respective Conference in the USER area . For past Conferences up to the 25th CIRET Conference in Paris in 2000, selected papers were published in the Conference proceedings volume (see CIRET Publications) Starting with the 26th CIRET Conference in Taipei in 2002, authors are kindly invited to submit a ready-to-publish version of their paper to the joint OECD and CIRET Journal of Business Cycle Measurement and Analysis (JBCMA). Submissions accepted by the Editor-in-Chief are sent to two referees (double blind procedure). Next Conference Rome 2006 Past Conferences Warsaw 2004 Taipei 2002 Paris 2000 Table of CIRET Conferences 2005 CIRET | Contact
Sminaire Europen de Statistique (SemStat)
A series of workshops for young researchers at the postdoctoral level.
University of Warwick: Department of Statistics Skip to main content navigation Notify | Stats | Accessibility | Search | Contact Us | A-Z Index | Edit | Sign out Sign in [m] Home | General Information | Staff | Research | Undergraduate | Postgraduate | News Events | Social Life | [n] Local Navigation General Information Staff Research Undergraduate Postgraduate News Events Social Life Powered by Sitebuilder MMV | Privacy Department of Statistics [c] About the Department The University of Warwick is one of Britain's leading research Universities and many of its departments are at the international forefront of research in their various disciplines. The Department of Statistics is no exception, having been given the top rating 5* for its research work in the recent National Research Assessment. The work of the department covers a wide range of topics in probability and statistics, both mathematical and theoretical aspects as well as applications to many different fields. The research expertise of the staff is reflected in the quality of teaching and student supervisors, as well as in the wide choice of topics on offer to students. Centre for Research in Statistical Methodology (CRiSM) In May 2005 the Statistics Department of Warwick University was selected by the EPSRC to be awarded substantial funding to nurture and support research in statistical methodology. CRiSM is a focus of statistical research in the UK. It embraces a large research staff and as well as organising themed workshops and visitor programmes on behalf of the UK statistical community, provides and supports strong training programmes at the doctoral and post doctoral level. Risk Initiative Statistical Consultancy Unit (RISCU) As well as its main academic work, the Department runs a statistical consultancy service with industrial and commercial companies, and with research staff both within the University and in external organisations. These activities are co-ordinated through RISCU. Page owner: Paula Matthews Last revised: Thu, Nov 17, 2005 Back to top of page Address Dept of Statistics University of Warwick Coventry CV4 7AL General Enquiries +44(0)24 7657 4812 Fax +44(0)24 7652 4532 Undergraduate Enquiries +44(0)24 7652 3066 Postgraduate Enquiries +44(0)24 7652 4553 RSS Birmingham District Group Department of Statistics, 2005. All rights reserved
Leeds Annual Statistics Research Workshops
Organised by the Department of Statistics, University of Leeds, Leeds, UK. Some papers are online. 23rd meeting: LASR2004 - Bioinformatics, Images and Wavelets; 6--8 July 2004.
Leeds Annual Statistical Research Workshops Leeds Annual Statistical Research Workshops Department of Statistics The University of Leeds, Leeds, LS2 9JT, U.K. Tel: 0113 343 5101, Fax: 0113 343 5090 The Leeds Workshop is a well established annual event now looking forward to its 24th year. Although begun as an internal event, it now enjoys the support of a number of visitors each year from other universities and research bodies from around the world. These workshops usually extend over three days with input by one or more invited speakers. Over recent years, the theme of the workshop has reflected the growing, but not exclusive, departmental interest and expertise in bioinformatics, image and shape analysis, and wavelets. LASR 2006 - The Role of Statistics in Interdiciplinary Research Our 25th anniversary workshop will be held on the 4th - 6th July 2006. The programme will include the following key speakers: Brian Athey (University of Michigan) Julian Besag, FRS (University of Washington) Fred Bookstein (University of Michigan) Sir David Cox, FRS (Nuffield College, Oxford) Walter Gilks (University of Cambridge) John Kent (University of Leeds) Alf Linney (University College, London) Kanti Mardia (University of Leeds) Janet Thornton (European Bioinformatics Institute) David Westhead (University of Leeds) More details coming soon. LASR2005 - Quantitative Biology, Shape Analysis, and Wavelets. (Workshop Proceedings now available online.) We are pleased to acknowledge the generous sponsorship of Nonlinear Dynamics for LASR 2005. LASR2004 - Bioinformatics, Images and Wavelets. (Workshop Proceedings now available online.) LASR2003 - Stochastic Geometry, Biological Structure and Images . (Workshop Proceedings now available online.) LASR2002 - Statistics of large datasets: Functional and image data, bioinformatics and data mining . (Some of the papers from the Workshop Proceedings are now available online.) LASR2001 - Functional and Spatial Data Analysis . (Workshop Proceedings are now available online.) LASR2000 - The Statistics of Directions, Shapes and Images [A review of the workshop written by Fred Bookstein] (Abstract booklet is now available online.) LASR1999 - Spatial-temporal modelling and its applications LASR1997 - The Art and Science of Bayesian Image Analysis. LASR1996 - Image Fusion and Shape Variability Techniques LASR1995 - Current Issues in Statistical Shape Analysis E-mail Address: workshop@maths.leeds.ac.uk Postal Address: Department of Statistics, University of Leeds, Leeds LS2 9JT, U.K. Telephone: +44 (0)113 343 5146 Fax: +44 (0)113 343 5090 [ University of Leeds ] [ School of Mathematics ] [ Department of Statistics ] Last modified: Fri Jul 1 14:55:07 BST 2005
Deming Conference on Applied Statistics
An annual conference on Applied Statistics held in Atlantic City. 59th meeting: 8--12 December 2003.
61st Deming Conference on Applied Statistics DECEMBER 5 (Monday) .................................8:30-11:30 AM................................ .................................8:30-11:30 AM................................ Creating More Effective Graphs Naomi B. Robbins NBR ...see abstract Multiple Comparisons And Multiple Endpoints In Clinical Trials Dr. Alex Dmitrienko Eli Lilly ...see abstract ..................................1:00-4:00 PM................................. ..................................1:00-4:00 PM................................. Statistical Analysis and Data Display Professors Richard M. Heiberger Burt Holland Temple University ...see abstract Hierarchical Bayes Methods Software for Data Analysis Professor Bradley P. Carlin University of Minnesota ...see abstract DECEMBER 6 (Tuesday) .................................8:30-11:30 AM................................ .................................8:30-11:30 AM................................ QTc Panel-Early Cardiac Safety Signals in Clinical Research Marilyn Agin, Scott Patterson, Joanne Zhang Pfizer, GSK, FDA ...see abstract Fundamentals of Longitudinal Data Analysis Professor Gerald van Belle University of Washington ...see abstract ..................................1:00-4:00 PM................................. ..................................1:00-4:00 PM................................. Pharmacoepidemiology, An Overview Dr. Yi Tsong Office of Biostatistics, Center for Drug Evaluation and Research, FDA ...see abstract Statistics for Experimenters Professor J. Stuart Hunter Princeton University ...see abstract DECEMBER 7 (Wednesday) .................................8:30-11:30 AM................................ .................................8:30-11:30 AM................................ Linear, Logistic, Survival, and Repeated Measures Professors Stephen C. Shiboski Charles E. McCulloch University of California, San Francisco ...see abstract Nonparametric Methods For The Analysis Of Data From Cross-Over Trials With Two Or More Treatments Dr. Byron Jones Pfizer ...see abstract ..................................1:00-4:00 PM................................. ..................................1:00-4:00 PM................................. Handling Drop-Out In Longitudinal Clinical Trials Peter Lane GlaxoSmithKline ...see abstract Latent Class Model And Its Clinical Application Professor Charles E. McCulloch University of California, San Francisco ...see abstract DECEMBER 8-9 An Introduction to Generalized Linear Mixed Models Professor Charles E. McCulloch University of California, San Francisco ...see abstract Bioequivalence and Statistics in Clinical Pharmacology Drs Scott Patterson and Byron Jones GSK and Pfizer ...see abstract Print the Conference Brochure (download Acrobat Reader if needed). Free download: Registration Hotel Transportation Book Sale Organizing Committee For further information contact Walter R. Young 16 Harrow Circle Wayne, PA 19087 (610) 989-1622 walter.young10@verizon.net Last update: 07 07 05
Bayesian Time Series Analysis by Mike West
Fortran S-plus software for nonstationary time series analysis and autoregression component models and the BATS software for the book "Applied Bayesian Forecasting and Time Series Analysis".
Mike West, ISDS, Duke University Mike West Arts Sciences Professor of Statistics Decision Sciences and Professor of Biostatistics Bioinformatics Duke University Home Teaching Students Postdocs Publications Software, data etc Research Opportunities Other links Contact Software: Software for Stochastic Computation in Gaussian Graphical Models GraphExplore software for dynamically exploring large graphical structures such as generated from statistical graphical models Software for Nonstationary Time Series Analysis and Decomposition Software for Autoregressive Component Models , incorporating model uncertainty and unit roots in time series Applied Bayesian Forecasting with BATS software Other software links at ISDS Data: Some time series data sets Other data sets I use in teaching and research
Software for Flexible Bayesian Modelling by Radford Neal
Supports Bayesian regression and classification based on neural networks, Gaussian processes and mixture models using a variety of Markov chain sampling methods.
Software for Flexible Bayesian Modeling and Markov Chain Sampling Software for Flexible Bayesian Modeling and Markov Chain Sampling This software supports Bayesian regression and classification models based on neural networks and Gaussian processes, and Bayesian density estimation and clustering using mixture models and Dirichlet diffusion trees. It also supports a variety of Markov chain sampling methods, which may be applied to distributions specified by simple formulas, including simple Bayesian models defined by formulas for the prior and likelihood. Before trying to use the software, you may need to read various references that describe the models and the Markov chain methods used. The software is written in ANSI C for Unix and Linux systems. Some of the programs in this package are designed for use with the xgraph plot package for X-Windows, though the data can instead be plotted by whatever plot program you have available. Current release of 2004-11-10: Index to documentation in hypertext form Compressed tar archive of everything (1.4 Megabytes) Uncompressed tar archive of everything (4.0 Megabytes) The tar archives include the complete hypertext documentation, so that you can set it up to be read from your local machine. The documentation is also readable the old-fashioned way. For directions on how to untar a tar archive, see the installation instructions within the above hypertext documentation. NOTE: In this release (as well as the previous one), the maximum number of target values is set to 10000, which can be useful, but which leads to rather large log files for mixture models (other models are not affected). You may wish to reduce the value defined for Max_targets in mix data.h to avoid this. Old release of 2003-06-29: Index to documentation in hypertext form Compressed tar archive of everything (1.4 Megabytes) Uncompressed tar archive of everything (3.9 Megabytes) Old release of 2001-08-31: Index to documentation in hypertext form Compressed tar archive of everything (1.2 Megabytes) Uncompressed tar archive of everything (3.4 Megabytes) Warning: This version contains a bug in net-pred that affects predictions for multi-way classification models. It can be patched by changing line 392 of net net-model.c, replacing "type=1" with "type==1". There's also a bug affecting the "n" option for gp-pred for multi-way classification models, which you can patch by replacing "+=" with "=" on line 440 of gp-pred.c. Old release of 2000-08-21: Index to documentation in hypertext form Compressed tar archive of everything (1.2 Megabytes) Uncompressed tar archive of everything (3.2 Megabytes) Old release of 1999-12-06: Index to documentation in hypertext form Compressed tar archive of everything (1.1 Megabytes) Uncompressed tar archive of everything (3.1 Megabytes) Old release of 1999-03-13: Index to documentation in hypertext form Compressed tar archive of everything (1.1 Megabytes) Uncompressed tar archive of everything (3.0 Megabytes) Old release of 1998-09-01: Index to documentation in hypertext form Compressed tar archive of everything (1.0 Megabytes) Uncompressed tar archive of everything (2.8 Megabytes) Old release of 1998-08-02: Index to documentation in hypertext form Compressed tar archive of everything (1.0 Megabytes) Uncompressed tar archive of everything (2.8 Megabytes) This was the first release with the facilities for sampling from distributions specified by formulas for the "energy" or the prior and likelihood. Old release of 1997-07-22: Index to documentation in hypertext form Compressed tar archive of everything (817K) Uncompressed tar archive of everything (2150K) This is the release that was used for the tests in my paper on Assessing relevance determination methods using DELVE . Old release of 1997-01-18: Index to documentation in hypertext form Compressed tar archive of everything (600K) Uncompressed tar archive of everything (1600K) Old release of 1996-08-26: Index to documentation in hypertext form Compressed tar archive of everything (500K) Uncompressed tar archive of everything (1200K) This is the release that was used by Carl Rasmussen for the neural network models evaluated in his thesis. Gaussian processes were not implemented in this release. Old release of 1995-08-09: Documentation (50K) Compressed tar archive (400K, includes documentation) Uncompressed tar archive (800K, includes documentation) Back to Radford Neal's home page
Bayesian Research Conference
A diverse conference on various aspects of Bayesian decision making held each year in mid February in Studio City, California.
Bayesian Research Conference 43rd Bayesian Research Conference January 13-14, 2005 The Bayesian Research Conference was hosted for 41 years by Ward Edwards, and for the last decade it was held each year in mid February at the Sportsman's Lodge in Studio City, California. These meetings have been very high in quality, extremely diverse in topic and approach, and under Ward's leadership they have been extremely fruitful and constructive. The 42nb meeting was held at California State University, Fullerton. In the Bayesian Research Conference, sometimes called Ward Edwards' conference, investigators present topics that might be empirical or theoretical, involving questions that may be basic or applied, and theories that may be normative or descriptive. Topics deal with decision theory, application, and behavior, and are not limited to Bayes theorem. Michael Birnbaum has been drafted again to host the 43nd meeting in Fullerton January 13-14, 2005. The conference will be held on a holiday weekend, giving you an extra day to travel home. We hope you will accept the invitation to attend, which has more information on the conference. Deadline to submit papers and register is December 22, 2004. On-Line Registration for the 2005 Conference. Workshop in Web Methods: January 15, 2004 A Workshop on How to implement Judgment and Decision Making Research via the WWW will be held January 15 from 8 am to 6 pm. There are up to 15 openings for people who can attend the Saturday sessions. For more information on the Web workshop, see the Application form for the Web Workshop. Other Links Links to other items of interest to Bayesians and decision makers Simple Bayes Theorem Calculator
Bayesian Nonparametric Regression
Theory, Methods and Applications. Research session at the Isaac Newton Institute for Mathematical Sciences, Cambridge, UK; 30 July -- 24 August 2007.
INI Programme BNR - Institute Home Page Programmes Web-Seminars Programme Home Seminars Workshops Additional Links Contacts Mailing List Isaac Newton Institute for Mathematical Sciences Bayesian Nonparametric Regression: Theory, Methods and Applications 30 July - 24 August 2007 Organisers: Professor N Hjort (Oslo), Dr C Holmes (Oxford), Professor P Mueller (Texas), Professor S Walker (Kent) Programme Theme Bayesian nonparametric regression has traditionally been studied as two separate disciplines. On the one hand researchers have considered the construction of probability measures on spaces of univariate density functions, which act as prior distributions with full coverage in Bayesian inference. These prior distributions are typically achieved by the construction of stochastic processes; the most well known being the Dirichlet process. On the other hand, researchers in stochastic modelling have investigated the construction of probability measures on general function spaces which act as regression functions in specifying the evolution of parametric distributions indexed on a covariate set, such as the mean function of a Gaussian process. To date there has been surprisingly little overlap between these two strands of research. The aim of the programme is to bring together researchers working in both areas of Bayesian nonparametrics in order to stimulate further research and discuss the foundations of fully nonparametric regression, in theory, methods and applications.
Future Meetings of the ISBA
Meetings organised or sponsored by the International Society for Bayesian Analysis.
Future Meetings of the ISBA Future Meetings of ISBA If you are thinking about proposing a site for an ISBA meeting then we encourage you to refer to the ISBA Program Committee Report on meetings. The report provides the guidelines that will be used to recommend venues for these meetings. ISBA is involved in the following forthcoming meetings. World Meetings Valencia ISBA Eighth World Meeting on Bayesian Statistics, June 1st-June 7th, 2006, Benidorm (Alicante), Spain Meetings Organized by ISBA Chapters Co-sponsored and Endorsed Meetings II Congreso Bayesiano de Amrica Latina, COBAL 2, February 6-10, 2005 at Hotel Presidente Intercontinental, Los Cabos in San Jos del Cabo, Baja California, Mexico This is an ISBA endorsed meeting. Fourth Workshop on Bayesian Inference and Stochastic Processes, (Italy), June, 2-4, 2005 This is an ISBA endorsed meeting. Obayes5 - The Fifth International Workshop on Objective Bayes Methodology, Branson, Missouri, USA, on June 5-8, 2005 This is an ISBA endorsed meeting. Progic2005: second workshop on Combining Probability and Logic special focus: Objective Bayesianism, Centre for Philosophy of Natural and Social Science, London School of Economics, 6th-8th July 2005 This is an ISBA endorsed meeting. 25th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering, San Jos State University, San Jose CA USA, Aug 7-12, 2005 This meeting is cosponsored by ISBA. A Conference in Honor of George Judge The 2nd Conference on Information and Entropy Econometrics: Theory, Method, and Applications September 23 - 25, 2005 This is an ISBA endorsed meeting.
BISP4
Fourth Workshop on Bayesian Inference in Stochastic Processes. Villa Monastero, Varenna (LC), Italy; 2--4 June 2005.
BISP4 - Fourth Workshop on Bayesian Inference in Stochastic Processes BISP4 Fourth Workshop on BAYESIAN INFERENCE IN STOCHASTIC PROCESSES Villa Monastero, Varenna (LC), Italy June, 2-4, 2005 Last update: 13 6 2005 The workshop follows the ones held in Madrid in 1998, in Varenna in 2001 and La Manga in 2003. The Workshop is now held every other year, once in Italy and once in Spain. In this workshop, we will bring together experts in the field to review, discuss and explore directions of development of Bayesian Inference in Stochastic Processes and in the use of Stochastic Processes for Bayesian Inference. There will be sessions on Markov processes, state-space models, spatial, empirical, birth-death and branching processes. Theoretical and applied contributions (for example queueing, population modelling, signal processing) are both welcome. The workshop will thus be of interest to workers in both Bayesian Inference and Stochastic Processes. The workshop will be held in an informal environment ( Villa Monastero , an ancient villa, property of CNR (Italian National Research Council), on the lake of Como) to encourage discussion and promote further research in these fields. Information is available on proceedings in JSPI (paper submission) proceedings in JSPI (information on JSPI) pictures (thanks to Vanja Dukic and Matthew Beal) invited speakers scientific committee organising committee participants programme abstracts of talks abstracts of posters abstracts of talks and posters(PDF) paper submission registration, deadlines and address for inquiries registration form hotels tourist information how to get to Varenna First Workshop (Madrid, Spain, 1998) Second Workshop (Varenna, Italy, 2001) Third Workshop (La Manga, Spain, 2003) Fifth Workshop (Valencia, Spain, 2007) ABS05 Summer School , Villa Monastero, 5-9 June 2005 The Workshop is organised by CNR IMATI (Istituto di Matematica Applicata e Tecnologie Informatiche - Consiglio Nazionale delle Ricerche) in Milano and by Istituto di Metodi Quantitativi at Universit Bocconi, Milano. The Workshop is supported by the University of Murcia , as well. The workshop is endorsed by ISBA (International Society for Bayesian Analysis) and by SIS (Societ Italiana di Statistica).
Scientific Applications of Bayesian Analysis
The 3rd Winter Workshop on Statistics and Computer Science. Ein-Gedi, Dead Sea, Israel; 5--7 December 2004.
THE 3RD WINTER WORKSHOP ON STATISTICSCOMPUTER SCIENCE Hebrew University of Jerusalem Department of Statistics The Center for the Study of Rationality Endorsed by The 3rd Winter Workshop on Statistics Computer Science - Scientific Applications of Bayesian Analysis - December5-7 2004 EIN-GEDI RESORT AND CONFERENCE CENTER Ein-Gedi, Dead Sea, Israel Opening Page Internet Connection Schedule Pictures Gallery Transportation The 3rd Winter Workshop will bring Bayesian statisticians and decision theorists together with scientific practitioners who use, or may use, Bayesian methods in scientific research. Workshop participants will include leading researchers from statistics and computer science together with a range of applied social, natural, biomedical and engineering scientists, in a forum conducive to free-flowing exchange and discussion of Bayesian ideas and applied Bayesian methods. Invited presentations will address issues pervasive in scientific inference, recent developments in the theory, methods and computational aspects of Bayesian statistics and decision analysis, and various scientific applications. Registration is required (there is no registration fee) The Workshop is co-sponsored by: Caesarea Rothschild Institute, Haifa University The Center for the Study of Rationality Hebrew University Hebrew University of Jerusalem Teva Pharmaceutical Industries Ltd The Ministry of Science Technology BEST-Bayesian Enhanced Strategic Trading,LLC Scientific Program Committee Phil Dawid (UC London) Udi Makov (Haifa) Yosi Rinott (Hebrew U) Mike West (Duke), chair Local Organising Committee Martin Golumbic (Haifa) Yoel Haitovsky (Hebrew U), chair Udi Makov (Haifa) Shmuel Zamir (Hebrew U), co-chair More information on the planned scientific program, topics and speakers, registration, accommodation, travel and and other workshop details, are available at this Workshop web site. For other enquiries contact the Chair of the Organizing Committee, Professor Yoel Haitovsky .
2nd IMS-ISBA Joint Meeting
The second joint international meeting of the IMS (Institute of Mathematical Statistics) and ISBA (International Society for Bayesian Analysis). Bormio, Italy; 12--14 January 2005.
2nd IMS-ISBA Joint Meeting Sorry, this site can be viewd only by browsers supporting frames.
Valencia International Meetings on Bayesian Statistics
A meeting devoted to Bayesian statistics held about every 4 years in Valencia, Spain. Next meeting will be early June 2006.
Jos M. Bernardo: Valenciam Valencia International Meetings on Bayesian Statistics Bayesian Statistics Statistics is primarily concerned with the analysis of data, either to assist in the appreciation of some underlying mechanism, or to reach effective decisions. In both cases, some uncertainty resides in the situation and the statistician's tasks are both to reduce this uncertainty and to explain it clearly. Problems of this type occur throughout all the physical, social and other sciences. One way of looking at statistics stems from the appreciation that all uncertainty must be described by probability: that probability is the only sensible language for a logic that deals with all degrees of uncertainty, and not just with the extremes of truth and falsity. This is called Bayesian Statistics. Decision-making is embraced by introducing a utility function, itself probability-based, and then maximizing expected utility. Bayesian statistics is designed to handle all situations where uncertainty is found. Since some uncertainty is present in most aspects of life, it is held that Bayesian statistics should be appreciated and used by everyone. It is the logic of contemporary society. It is 'common sense reduced to calculation.' For an elementary, college level, introduction to Bayesian Statistics, see Bernardo (2003) Bayesian Statistics , an article written for the UNESCO Encyclopedia of Life Support Systems (EOLSS). The Valencia Meetings Every four years since 1979, the University of Valencia, Spain, has sponsored meetings devoted to Bayesian Statistics, the Valencia International Meetings on Bayesian Statistics. The published proceedings are listed below. The tremendous number of citations generated by them underscores their scientific relevance. The numbers attending have dramatically increased and include not only specialist statisticians but also others whose work has uncertainty as an important ingredient. J. M. Bernardo, M. H. DeGroot, D. V. Lindley and A. F. M. Smith (eds). (1980). Bayesian Statistics. Valencia: University Press. J. M. Bernardo, M. H. DeGroot, D. V. Lindley and A. F. M. Smith (eds). (1985). Bayesian Statistics 2. Amsterdam: North-Holland. J. M. Bernardo, M. H. DeGroot, D. V. Lindley and A. F. M. Smith (eds).(1988). Bayesian Statistics 3. Oxford: Oxford University Press. J. M. Bernardo, J. O. Berger, A. P. Dawid and A. F. M. Smith (eds). (1992). Bayesian Statistics 4. Oxford: Oxford University Press. J. M. Bernardo, J. O. Berger, A. P. Dawid and A. F. M. Smith (eds). (1996). Bayesian Statistics 5. Oxford: Oxford University Press. J. M. Bernardo, J. O. Berger, A. P. Dawid and A. F. M. Smith (eds). (1999). Bayesian Statistics 6. Oxford: Oxford University Press. Contents available at Valencia 6 J. M. Bernardo, M. J. Bayarri, J. O. Berger, A. P. Dawid, D. Heckerman, A. F. M. Smith and M. West (eds). (2003). Bayesian Statistics 7. Oxford: Oxford University Press. Preface and contents available at Valencia 7.pdf For details on the origin and development of the Valencia International Meetings on Bayesian Statistics, click The Valencia Meetings.pdf The Valencia Meetings are Equal Opportunity Affirmative Action Conferences. Universitat de Valncia, Spain International Society for Bayesian Analysis Valencia ISBA Eighth World Meeting on Bayesian Statistics Benidorm (Alicante, Spain), June 1st to June 7th, 2006 www.uv.es valenciameeting Co-sponsored by the Universitat de Valncia (UV) and by the International Society for Bayesian Analysis (ISBA) , the 8th Valencia International Meeting on Bayesian Statistics and the 2006 World Meeting of the International Society for Bayesian Analysis will be jointly held in Benidorm (Alicante, Spain) from Friday June 2nd to Tuesday June 6th, both inclusive. Programme Committee Susie Bayarri (Universitat de Valncia, Spain) [susie.bayarri at uv.es] James O. Berger (Duke University, USA) [berger at stat.duke.edu] Jos M. Bernardo (Universitat de Valncia, Spain) [jose.m.bernardo at uv.es] A. Philip Dawid (University College London, UK) [dawid at stats.ucl.ac.uk] David Heckerman (Microsoft Research, USA) [heckerma at microsoft.com] Adrian F. M. Smith (Queen Mary, University of London, UK) [afms at qmw.ac.uk] Mike West (Duke University, USA) [mw at stat.duke.edu] Local Organizer: Jos M. Bernardo (Universitat de Valncia, Spain) [jose.m.bernardo at uv.es] Language The language of the conference will be English. Venue Delegates are expected to arrive on the evening of Thursday June 1st (the opening lecture will be early in the morning of June 2nd) and depart on the morning of Wednesday, June 7th (the gala dinner will be on the evening of June 6th). As in previous occasions, this will be a residential conference in a coastal resort. On this occasion the venue is Gran Hotel Bali (see picture below), a four star hotel with an appropriate purpose built large auditorium, built in the south end of Benidorm (50 km north from Alicante and 140 km south from Valencia). The closest airport is Alicante (ALC), well connected to Madrid, Barcelona and many European cities, by both conventional and low-cost airlines. Given the timing of the conference early flight bookings are strongly recommended. Scientific Programme 1. Tutorials The Conference will be preceded by three 2h30m long tutorials, intended to provide a short review of the main ideas in Bayesian Statistics. The tutorials will be delivered by members of the programme committee and will take place through Thursday June 1st, from 09h00 to 20h00. Bernardo, Jos M. and Dawid, A. Philip Foundations: Subjective and Objective Bayesian Statistics Heckerman, David and West, Mike Bayesian Modelling and Computation Bayarri, Susie and Berger, James, O. Bayesian Model Assessment, Testing and Selection 2. Invited lectures A set of 20 invited plenary thirty minute talks, followed by a discussion initiated by an invited discussant; these will take place in the mornings. Bishop, Christopher (Microsoft Research Cambridge, U. K.) [cmbishop@microsoft.com] Generative versus discriminative methods in computer vision Discussant: Lee, Herbert (University of California, Santa Cruz, U. S. A.) [herbie@soe.ucsc.edu] Brooks, Stephen (University of Cambridge, U. K.) [s.p.brooks@statslab.cam.ac.uk] Assessing the affect of genetic mutation - the evolutionary origins of island endemics (with I. Manolopoulou) Discussant: Mallick, Bani (Texas AM University, U. S. A.) [bmallick@stat.tamu.edu] Clyde, Merlise (Duke University, U. S. A.) [clyde@stat.duke.edu] Bayesian modelling with overcomplete representations Discussant: Vidakovic, Brani (Georgia Institute of Technology, U. S. A.) [brani@isye.gatech.edu] Doucet, Arnaud (University of British Columbia, Canada) [arnaud@stat.ubc.ca] Sequential Monte Carlo methods for static problems Discussant: Berzuini, Carlo (Universit di Pavia, Italy) [carlo.berzuini@unipv.it] Gamerman, Dani (Universidade Federal do Rio de Janeiro, Brazil) [dani@im.ufrj.br] Dynamic Gaussian process priors Discussant: Fuentes, Montserrat (North Carolina State University, U. S. A.) [fuentes@stat.ncsu.edu] Gelfand, Alan (Duke University, U. S. A.) [alan@stat.duke.edu] Bayesian nonparametric modelling of random functions using Dirichlet processes Discussant: Hjort, Nils (University of Oslo, Norway) [nils@math.uio.no] Ghahramani, Zoubin (University College London, U. K.) [zoubin@gatsby.ucl.ac.uk] Nonparametric Bayesian latent feature models Discussant: Dunson, David (Duke University, U. S. A.) [dunson@stat.duke.edu] Ghosh, Jayanta (Indian Statistical Institute, India) [ghosh@stat.purdue.edu] Prediction problems in Bayesian model selection (with A. Chakrabarti) Discussant: Lauritzen, Steffen (University of Oxford, U. K.) [steffen@stats.ox.ac.uk] Girn, Javier (Universidad de Mlaga, Spain) [fj_giron@uma.es] Objective Bayesian analysis of change-point problems in linear models (with E. Moreno) Discussant: Rueda, Ral (UNAM, Mexico) [pinky@sigma.iimas.unam.mx] Holmes, Chris (Oxford University, U. K.) [c.holmes@stats.ox.ac.uk] Exploring complex model spaces using Bayesian priors, with applications in genomics (with A. Pintore Discussant: Kohn, Robert (University of New South Wales, Australia) [R.Kohn@unsw.edu.au] Little, Roderick (University of Michigan, U. S. A.) [rlittle@umich.edu] Robust Bayesian inference for finite population surveys Discussant: Ruggeri, Fabrizio (CNR IMATI, Italy) [fabrizio@mi.imati.cnr.it] Mira, Antonietta (University of Insubria, Italy) [antonietta.mira@uninsubria.it] Deriving Bayesian and frequentist estimators from time-invariant estimating equations: a unifying approach (with A. Baddeley) Discussant: Smith, Richard L. (University of North Carolina, U. S. A.) [rs@stat.unc.edu] Mller, Peter (University of Texas, U. S. A.) [pmueller@mdanderson.org] FDR and Bayesian decision rules Discussant: Fearn, Tom (University College London, U. K.) [tom@stats.ucl.ac.uk] Prado, Raquel (University of California, Santa Cruz, U. S. A.) [raquel@ams.ucsc.edu] Detecting selection in multiple DNA sequences: An hierarchical Bayesian approach to modelling molecular adaptation in malaria antigens Discussant: Vannucci, Marina (Texas AM University, U. S. A.) [mvannucci@stat.tamu.edu] Raftery, Adrian (University of Washington, U. S. A.) [raftery@stat.washington.edu] Bayes factors and cross-validation Discussant: Polson, Nicholas (University of Chicago, U. S. A.) [ngp@gsb.uchicago.edu] Rousseau, Judith (Universit de Paris 5 and CREST, France) [rousseau@ensae.fr] Bayes factors in nonparametric statistics Discussant: Petrone, Sonia (Universit Bocconi, Italy) [sonia.petrone@uni-bocconi.it] Schack, Rdiger (Royal Holloway, University of London, U. K.) [r.schack@rhul.ac.uk] Bayesian probability in quantum mechanics Discussant: Helland, Inge (University of Oslo, Norway) [ingeh@math.uio.no] Schmidler, Scott (Duke University, U. S. A.) [schmidler@stat.duke.edu] Bayesian shape classification with applications to structural proteomics Discussant: Wilkinson, Darren (University of Newcastle Upon Tyne, U. K.) [d.j.wilkinson@ncl.ac.uk] Skilling, John (Maximum Entropy Data Consultants Ltd, U. K.) [skilling@eircom.net] Nested sampling for general Bayesian computation Discussant: Evans, Michael (University of Toronto, Canada) [mevans@utstat.utoronto.ca] Sun, Dongchu (Virginia Tech, U. S. A.) [sund@vt.edu] Objective and subjective Bayesian analysis for linear mixed models Discussant: Liseo, Brunero (Universit di Roma "La Sapienza", Italy) [brunero.liseo@uniroma1.it] 3. Orally presented plenary contributed talks A set of 32 twenty-five minute plenary contributed oral presentations selected by the ISBA Conference Programme Committee, which will take place in the afternoons. These will be announced by December 15th, 2005. For submission instructions, see below. 4. Plenary poster sessions A set of three plenary poster sessions, the seminal means of communication of research by conference participants. These will take place in the evenings. The abstracts of poster contributions should be submitted, in the format which will be posted here, before March 31st, 2006. For optional submission to the published conference proceedings see below. Call for ISBA oral presentations ISBA is organizing a limited number of contributed oral presentations. A total of 32 such presentations will be scheduled, each of 25 minutes duration (20 minutes talk, 5 minutes for discussion). Anyone interested in giving an oral presentation is invited to submit an abstract of no more than three pages (including references), accompanied by one additional page listing no more than five relevant published references by the author s. Any additional pages will not be considered. Submissions should be made via email to isba06 at qut.edu.au . Please use the header AbstractName where Name is the first author's name. Attach the abstract and accompanying page as .ps, .pdf or .doc files. Abstracts will be accepted between 1st September and 30th October 2005. No late submissions will be accepted. The ISBA Conference Programme Committee will review and vote on the submissions during November, and the list of selected presentations will be available on the conference website by 15th December 2005. The ISBA Conference Programme Committee comprises the following: Kerrie Mengersen (Australia, co-chair), Peter Mueller (USA, co-chair), Herbie Lee (USA, co-chair Finance), Jose Bernardo (Spain, past Chair; Valencia Programme Committee), Subashis Ghosal (USA), Paolo Giudici (Italy), Merlise Clyde (USA), Yanan Fan (Australia), Judith Rousseau (France), Cathy Chen (Taiwan), Richard Arnold (New Zealand), Paul Mostert (South Africa), Robert Wolpert (USA), Josemar Rodrigues (Brazil), Jiangsheng Yu (China), Antonietta Mira (Italy), Mark Steel (UK), Fabrizio Ruggeri (Italy). Proceedings Authors of invited papers will be asked to submit their final versions as soon as available, but before May 1st 2006, in a specific LaTeX style which will be posted at the conference web page. For contributed papers at the meeting, the following two-step publication process is encouraged: 1. Submit the paper to Bayesian Analysis (http: ba.stat.cmu.edu). Submission can, of course, be done at any time; indeed, submission well before the conference is encouraged. The paper will then undergo the usual refereeing process of the journal. 2. Authors of those papers that are accepted by Bayesian Analysis (and presented as either an oral contributed paper or as a poster at the Valencia meeting) are encouraged to prepare a synopsis of the paper---of at most 5 pages---to be submitted for publication in the Valencia Volume. A synopsis must clearly be so labelled, and should provide an overview of the primary Bayesian Analysis article. The synopsis should also use the LaTeX style posted at the conference web page. Those contributed papers accepted by Bayesian Analysis, presented at the Valencia meeting, and for which a synopsis is submitted to the Valencia Proceedings will be considered for the Lindley Prize (www.bayesian.org awards LindleyPrize.html). Note that it will be the original paper, not the synopsis, that will be considered for the Lindley Prize. A CD-ROM of papers will be distributed at the conference. The final pdf version of all invited papers must be submitted by May 1st 2006 and will be included on the CD. Contributing authors whose full papers are accepted by Bayesian Analysis will also need to submit the synopsis by May 1st 2006 in order to appear on the CD (so that early submission to Bayesian Analysis is strongly encouraged). Bayesian Statistics 8, the conference proceedings, will be published after the meeting by Oxford University Press. Edited by the Conference Programme Committee, this will include refereed versions of the invited papers and the synopsis arising from the contributed papers that are accepted in Bayesian Analysis. The title page, the preface and the contents of Bayesian Statistics 7, the Proceedings of the previous meeting, may be downloaded from Valencia 7 . Registration The registration fee (which includes the farewell dinner) is 225 250 Eur for ISBA Non-ISBA members. Non-ISBA members may use the conference registration form to join ISBA at a reduced 25 Eur fee and qualify for the ISBA registration fee. The registration fee for accompanying persons (which also includes the farewell dinner) is 100 Eur. The accommodation fee at Gran Hotel Bali for the full period, (6 nights) with breakfast and dinner (including beer or wine), but not lunch, is 650 450 Eur on single double occupancy basis. The hotel has 52 floors and delegates are encouraged to express their floor preference at registration; the 400 pre-reserved rooms will be allocated on a first come, first served basis. The cost of the use of the auditorium, and that of renting the required equipment has been distributed in the fees quoted above. To register, please open here the registration form RegistrationForm , or download it as a pdf file V8Registration.pdf , and mail, e-mail or fax the completed form, including the appropriate payment details, to the address provided at the form heading. Grants The organizing committee is submitting grant proposals for travel support to junior researchers and colleagues from developing countries. Applications forms for financial support will be posted here. Valencia Mailing List If you may be interested in attending Valencia 8, or if you just want to be included in the conference mailing list, please send to the conference office valenciameeting@uv.es the following information: Family Name: Given Name: Affiliation: Postal address: Country: Telephone: Fax: Preferred e-Mail address: Personal web page: Institutional web page: Area(s) of interest within Bayesian Statistics: This web page, http: www.uv.es valenciameeting and its US mirror, http: www.isds.duke.edu research conferences valencia will be periodically updated as the organization of the Meeting progresses. It was last modified on October 6th, 2005.
Computational Statistics and Data Analysis
Incorporating Statistical Software Newsletter. The Official Journal of the International Association for Statistical Computing. Contents and abstracts from vol.29 (1998). Full text to subscribers.
Elsevier.com This site requires scripting to be enabled in your browser. Please change your Internet Options, then click here to go to our home page.
Biometrics
A Journal of the International Biometric Society. Full text through Blackwell Synergy and JSTOR from vol. 1 (1945).
Biometrics
Springer: Statistical Methods and Applications
The official journal of the Italian Statistical Society. General description and editorial board.
Statistical Methods and Applications-Springer Statistics (general) Journal Please enable Javascript in your browser to browse this website. Select your subdiscipline Business, Economics Finance Computational Statistics Life Sciences, Medicine Health Physical Information Science Pure Applied Probability Social Sciences Law Theory Methods Home Statistics Select a discipline Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Online Journals Archive Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom All Author Editor Title ISBN ISSN Series Journals Series Zentralblatt MATH Textbooks Statistical Methods and Applications Journal of the Italian Statistical Society Editor: M. Vichi ISSN: 1618-2510 (print version) ISSN: 1613-981X (electronic version) Journal no. 10260 Physica-Verlag Online version available Society | Description | Editorial Board | Most viewed articles Society Societ Italiana di Statistica Print version Recommend to others Electronic sample copy E-content For authors and editors Aims and scope LaTeX macro package Instructions for authors (pdf, 78 Kb) Copyright Transfer Statement (pdf, 25 Kb) Instructions for Authors OpenChoice Copyright information Table of Contents Alert Please register: E-mail Retype E-mail Please feel free to send me information from Springer. Additional information Shipping dates Order this journal Article Reprints Bulk Orders Societies Societ Italiana di Statistica Other contacts Customer Service Advertising Related subjects Business, Economics Finance Economic Theory Statistics Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
Elsevier: Stochastic Processes and their Applications
An official journal of the Bernoulli Society for Mathematical Statistics and Probability. Tables of contents and abstracts of all volumes, full text to subscribers.
Elsevier.com This site requires scripting to be enabled in your browser. Please change your Internet Options, then click here to go to our home page.
Biostatistics
(OUP) Abstracts of all volumes. Full text to subscribers from vol. 1 (2000).
Oxford Journals | Mathematics Physical Sciences | Biostatistics Skip Navigation Oxford Journals Contact Us My Basket My Account Biostatistics About This Journal Contact This Journal Subscriptions Current Issue Archive Search Oxford Journals Mathematics Physical Sciences Biostatistics Read This Journal View Current Issue ( Volume 6 Issue 4 October 2005 ) Advance Access Browse the Archive Among the important scientific developments of the 20th century is the explosive growth in statistical reasoning and methods for application to studies of human health. Examples include developments in likelihood methods for inference, epidemiologic statistics, clinical trials, survival analysis, and statistical genetics. Substantive problems in public health and biomedical research have fueled the development of statistical methods, which in turn have improved our ability to draw valid inferences from data. The objective of Biostatistics is to advance statistical science and its application to problems of human health and disease, with the ultimate goal of advancing the public's health. Search This Journal Advancedsearch Related Journals The European Journal of Public Health International Journal of Epidemiology Law, Probability and Risk Additional Access Options New Open Access Option Reader Services Free sample issue Access purchase this journal The Journal About this journal Rights Permissions Impact factor: 2.543 Co-Editors Scott L. Zeger Peter J. Diggle View full editorial board For Authors Instructions to authors Self archiving policy Open access options for authors - visit Oxford Open Alerting Services Email table of contents CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements Online ISSN 1468-4357 - Print ISSN 1465-4644 Copyright 2005 Oxford Journals Oxford Journals Oxford University Press Site Map Privacy Policy Frequently Asked Questions Other Oxford University Press sites: Oxford University Press American National Biography Booksellers' Information Service Children's Fiction and Poetry Children's Reference Corporate Special Sales Dictionaries Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks Humanities International Education Unit Law Medicine Music Online Products Oxford English Dictionary Reference Rights and Permissions Science School Books Social Sciences Very Short Introductions World's Classics
The Annals of Statistics
An Official Journal of the Institute of Mathematical Statistics. Full text through Project Euclid and JSTOR from vol. 1 (1973).
Annals of Statistics Editorial Board Editorial Policy Contacts Electronic Access Recent Future Issues August 2005 October 2005 December 2005 February 2006 April 2006 Papers to appear in future issues Instructions for Authors Preparation of Manuscripts Submission of Manuscripts Resources for Authors Copyright, Page Charges and Author Offprints Procedures for Handling Manuscripts Referees Guidelines for Referees 2004 List of Referees Subscriptions Back Issues Article Reprints Other IMS Journals Annals of Statistics The Annals of Statistics aim to publish research papers of highest quality reflecting the many facets of contemporary statistics. Primary emphasis is placed on importance and originality, not on formalism. Editorial Board (2004 to 2006) Editors Morris L. Eaton Jianqing Fan Associate Editors Yacine At-Sahalia Adam Martinsek Peter Bhlmann Thomas Mathew T. Tony Cai Rahul Mukerjee Ming-Yen Cheng Hans-Georg Mller Dorota M. Dabrowska Per A. Mykland Rainer Dahlhaus Michael D. Perlman Anirban DasGupta Dominique Picard Holger Dette Donald St. P. Richards Holger Drees Christian P. Robert Lutz Dmbgen Peter M. Robinson Sam Efromovich Qi-Man Shao Charles J. Geyer Xiaotong Shen Subhashis Ghosal Vladimir Spokoiny Irene Gijbels Michael Stein Peter Hall Sara van de Geer Xuming He Mark van der Laan James P. Hobert Larry Wasserman Vladimir Koltchinskii Michael Wolf Michael R. Kosorok Qiwei Yao Jan T. A. Koster Yi-Ching Yao Bing Li Bin Yu Jun Liu Ruben H. Zamar Enno Mammen Managing Editor Paul Shaman Production Editor Patrick Kelly Past Editors John Marden and Jon A. Wellner , 2001-2003 Past Editors from previous years web site contact: imswebmaster@imstat.org
Technometrics
Statistics for the Physical, Chemical, and Engineering Sciences: published quarterly by the American Society for Quality and the American Statistical Association. Contents and abstracts from 1997.
Join or Renew Now! About ASA Awards ASA Marketplace Career Center Education Meetings and Events Members Only Membership Online Journal Access Professional Needs Publications Related Links Site Map FAQ Home Site Map | FAQ Technometrics ASA Journals ASQ Publications For Authors Style Guide Subscribe Order Reprints Technometrics Home A Journal of Statistics for the Physical, Chemical, and Engineering Sciences Published Quarterly by the American Society for Quality and the American Statistical Association Electronic Access 2001 - current issue 2000 | 1999 | 1998 | 1997 ORDER 41 YEARS OF TECHNOMETRICS ON CD-ROM 1959-2000 SUBMITTING ARTICLES TO Technometrics The editor of Technometrics strongly prefers to receive your article submissions as PDF files (printable on 8.5 x 11 paper). Please submit a blinded as well as an unblinded version. Submit files using the Technometrics AllenTrack website http: technometrics.allentrack.net . For Technometrics Book Reviews, email files that can be printed out as editable copy (WORD, WordPerfect, or FAXed as last resort). No need to mail hard copies. Email to the editorial office at walberjc@bp.com . About the Journal Since its inception in 1959, the mission of Technometrics has been to contribute to the development and use of statistical methods in the physical, chemical, and engineering sciences. Technometrics publishes papers that describe new statistical techniques, illustrate innovative application of known statistical methods, or review methods, issues, or philosophy in a particular area of statistics or science, when such papers are consistent with the journal's objective. Since 1959, the methods presented in the journal have reflected changes in the discipline. In recent years, some of these changes have been associated with improved computer technology and availability, resulting in highly flexible and computer-intensive approaches to scientific data analysis. (See for example the lead article in the August 1998 issue by Richard A. Becker, Linda A. Clark, and Diane Lambert entitled "Events Defined By Duration and Severity, with an Application to Network Reliability," with discussion by Jeff Robinson and Josef Schmee.) With the emergence of massive computing and data storage capabilities, statistical approaches to screening, flexible modeling, pattern characterization, and change detection that were infeasible 20 years ago are now viable. There have also been shifts in basic attitudes about data analysis (e.g., less formal hypothesis testing, more fitted models via graphical analysis), and in how some of our important application areas are managed (e.g., quality assurance through robust design rather than detailed inspection). Many of the problems in industry today concern the analysis of huge data sets that lead to improved quality or better understanding of the manufacturing or development process. The journal would like to encourage submissions that address problems of this nature and that take advantage of modern resources. Technometrics is reviewed in Mathematical Reviews, abstracted in Applied Science Technology Abstracts and abstracted and indexed in The Engineering Index, COMPENDEX, and Applied Science Technology Index. Subscribe Online! Top of Page Printer Friendly Version 1429 Duke Street Alexandria, VA 22314-3415 Phone: 703-684-1221 Toll-free: 888-231-3473 Fax: 703-684-2037 Email: asainfo@amstat.org Copyright | Privacy Statement | Disclaimer | Link to Us | Staff Directory 2005 American Statistical Association. All Rights Reserved. Upgrading to the latest version of your browser software may enhance your online experience.
IMS Bulletin
Bimonthly newsletter published by the Institute of Mathematical Statistics.
IMS Bulletin Home Issues Current issue Previous issues Advertising Meetings Announcements Subscriptions and Back Issues Welcome to the online version of the IMS Bulletin, a bimonthly newsletter published by the Institute of Mathematical Statistics . The Bulletin contains items of interest to IMS members, letters to the Editor, information about meetings and conferences around the world, news about IMS members, a calendar of statistical events, and employment and other advertisements. Contributions to the IMS Bulletin Items for consideration for publication should be sent in MS Word or plain text to bulletin@imstat.org . Editorial Board (2002 to 2004) Editor Bernard Silverman Assistant Editor Tati Howell Associate Editors Susan Murphy Ingram Olkin Nicole Lazar Past Editors web site contact: imswebmaster@imstat.org
Statistics Education Research Journal
An electronic free-access journal of the International Association for Statistical Education and the International Statistical Institute. Full text from 1996 in PDF.
Publications - IASE - The International Association for Statistical Education Search IASE JSE MSOR ISLP ASA St. Ed. CAUSEWeb for Publications Introduction SERJ IASE Review ISI Newsletter IASE Matters ICOTS ICOTS 6, 2002 ICOTS 5, 1998 IASE at ISI ISI 55, 2005 ISI 54, 2003 ISI 53, 2001 ISI 52, 1999 IASE Satellites Communication of Stat., 2005 Stat. the Internet, 2003 Statistical Literacy, 2001 IASE Round Tables Training Researchers, 2000 Role of Technology, 1996 IASE at... ICME 10, 2004 ICME 9, 2000 ICME 8, 1996 JSM 2003-5 Assessment Book Dissertations in Stats Ed Dissertations Regional Hipotesis Alternativa SERJ - Statistics Education Research Journal ISSN: 1570-1824 SERJ is a peer-reviewed electronic journal of the International Association for Statistical Education (IASE) and the International Statistical Institute (ISI). SERJ is published twice a year and is free. SERJ aims to advance research-based knowledge that can help to improve the teaching, learning, and understanding of statistics or probability at all educational levels and in both formal (classroom-based) and informal (out-of-classroom) contexts. Such research may examine, for example, cognitive, motivational, attitudinal, curricular, teaching-related, technology-related, organizational, or societal factors and processes that are related to the development and understanding of stochastic knowledge. In addition, research may focus on how people use or apply statistical and probabilistic information and ideas, broadly viewed. The Journal encourages the submission of quality papers related to the above goals, such as reports of original research (both quantitative and qualitative), integrative and critical reviews of research literature, analyses of research-based theoretical and methodological models, and other types of papers described in full in the Guidelines for Authors. All papers are reviewed internally by an Associate Editor or Editor, and are blind-reviewed by at least two external referees. Contributions in English are recommended. Contributions in French and Spanish will also be considered. A submitted paper must not have been published before or be under consideration for publication elsewhere. Further information and guidelines for authors are available below. Submissions Manuscripts should be sent to co-editor Flavia Jolliffe (F.Jolliffe@kent.ac.uk), by email, as an attached document in Word format. These files should be produced using the Template available online. Full details regarding submission are given in the Guidelines for Authors below. Current Issue: Vol. 4 No. 1, May 2005 (Single pdf file for download 746 kb) Current Issue: Contents (Download individual papers and other journal sections) Editorial New Associate Editors Call for Nominations for New Co-Editor Call for Papers: Reasoning about Distribution Linda Collins and Kathleen Mittag. Effect of Calculator Technology on Student Achievement in an Introductory Statistics Course Elena C. Papanastasiou. Factor Structure of the Attitudes to Research Scale Special Section: Reasoning about Variation Guest Editors: Joan Garfield and Dani Ben-Zvi Katie Makar and Jere Confrey. Variation-Talk: Articulating Meaning in Statistics Bob delMas and Yan Liu. Exploring Students Conceptions of the Standard Deviation Maxine Pfannkuch. (Invited) Thinking Tools and Variation Joan Garfield and Dani Ben-Zvi. (Invited) A Framework for Teaching and Assessing Reasoning about Variability Conferences Archive of past issues Volume 3 Number 2, November 2004 Contents Editorial Dani Ben-Zvi and Joan Garfield (Invited). Research on Reasoning about Variability: A Forward Rob Gould (Invited). Variability: One Statistician's View James Hammerman and Andee Rubin. Strategies for Managing Statistical Complexity with New Software Tools Dani Ben-Zvi. Reasoning about Variability in Comparing Distributions Arthur Bakker. Reasoning about Shape as a Pattern in Variability Chris Reading. Student Description of Variation while Working with Weather Data Forthcoming IASE Conferences Other Forthcoming Conferences SERJ Referees , or Full Download (400 kB) Volume 3 Number 1, May 2004 Contents Editorial New Associate Editors Jose Carmona Marquez. Una Revision de las Evidencias de Fiabilidad y Vadlidez de los Cuestionarios de Actitudes y Ansiedad Hacia la Estadistica Sonia Kafoussi. Can Kindergarten Children be Successfully Involved in Probabilistic Tasks? Sue Gordon. Experiences of Statistics in a Service Course Maria Virginia Lopez, Maria del Carmon Fabrizio, Maria Cristina Plencovich and Hernan Giorgini. Some Issues about the Status of Statistics Teaching in Agricultural Colleges in Argentina Paula R. Williamson and Gillian A. Lancaster. Statistical Education for PHd Students in UK Medical Schools Forthcoming IASE Conferences Other Forthcoming Conferences , or Full Download (400 kB) Volume 2 Number 2, Nov. 2003 Contents Editorial Jane Watson and Rosemary Callingham. Statistical Literacy: A Complex Hierarchical Construct Flavia Jolliffe. Towards a Database of Research in Statistical Education Jamie D. Mills. SPSS Textbooks: A Review for Teacher Information on Past IASE Conferences Forthcoming IASE Conferences Other Forthcoming Conferences Statistics Education Research Journal Referees , or Full Download (432 kB) Volume 2 Number 1, May 2003 , Erratum to Vol.2 No. 1 Volume 1 Number 2, December 2002 Volume 1 Number 1, May 2002 Statistical Education Research Newsletter Volume 2 Number 3, September 2001 Volume 2 Number 2, May 2001 Volume 2 Number 1, January 2001 Volume 1 Number 3, September 2000 Volume 1 Number 2, May 2000 Volume 1 Number 1, January 2000 Newsletter of the International Study Group for Research on Learning Probability and Statistics Volume 12 Number 3, September 1999 Volume 12 Number 2, April 1999 Volume 12 Number 1, January 1999 Volume 11 Number 4, October 1998 Volume 11 Number 3, July 1998 Volume 11 Number 2, April 1998 Volume 11 Number 1, January 1998 Volume 10 Number 4, October 1997 Volume 10 Number 3, July 1997 Volume 10 Number 2, April 1997 Volume 10 Number 1, January 1997 Volume 9 Number 4, October 1996 Volume 9 Number 3, July 1996 Volume 9 Number 2, April 1996 Volume 9 Number 1, January 1996 For Authors Author guidelines (Last updated 10-08-05) Microsoft Word template (Last updated 03-11-05) Template guidelines (Last updated 10-08-05) Referee guidelines (Last updated 02-12-02) Copyright Form (Last updated 11-06-04) Editors Flavia Jolliffe and Iddo Gal (Please submit all new papers and inquiries to Flavia Jolliffe .) Assistant Editor Chris Reading Associate Editors Carmen Batanero , Andrej Blejec , Carol Blumberg , Joan Garfield , John Harraway , M. Gabriella Ottaviani , Lionel Periera-Mendoza , Maxine Pfannkuch , Victor Polaki , Dave Pratt, Ernesto Sanchez , Richard Shaeffer , Gilberte Schuyten , and Jane Watson. LINKS Publishing in Statistics Education Journals: Views from the Editors, IASE Invited Session at JSM 2005 , go to http: www.stat.auckland.ac.nz ~iase publications.php?show=jsm and scroll down to 2005 Journal of Statistics Education Teaching Statistics International Statistical Literacy Programme (ISLP) 2005 Call for nominations for SERJ Co-editor Updated by: Christine Reading on Sep 14 2005 30409 visitors to this page since 1 January 2004. Over 10000 visitors in 2003. Back to the top Hosted by
Journal of Statistics and Management Systems
(Taru) Author information and recent tables of contents (PDF).
Journal of Statistics,Journal of Management Systems,Indian Journals Exporters,Indian Journals Suppliers,Wholesalers of Indian Journals,Distributors of Indian Journals JIOS JIM JSMS JDMSC JDSGT DMAT AHA GCGMOCDSVO MSWW Scope of The Journal Chief Editor Editorial Board Past Editors Abstracted Reviewed Contents of Published Issues Sample Issue Subscriptions Order Form Guidelines for Authors Contact Us Home Journal of Statistics Management Systems Scope of the Journal The Journal of Statistics Management Systems is a refereed journal following two-referee system which is published in one volume per year of three issues in the months of March, July and November. Original research papers, survey articles, book reviews, dissertation abstracts etc. devoted to all theoretical and applicable topics in Statistics, Management System and related areas are considered for publication in this journal. Editorial Board Chief Editor Bal Kishan Dass Department of Mathematics, University of Delhi, Delhi 110 007, INDIA E-mail: dassbk@rediffmail.com Address for Correspondence: G-159, Pushkar Enclave, Paschim Vihar, New Delhi-110063, INDIA E-mail: bkdass@tarupublications.com Advisory Editors K.K. AGGARWAL Guru Gobind Singh Indraprastha Kashmere Gate Delhi 110006 INDIA aggarwal_krishna@hotmail.com S.N. GUPTA University of North Carolina at Greensboro 383 Bryan Building Greensboro, NC 27402 USA sngupta@uncg.edu PROF. P R PARTHASARATHY Department of Mathematics Indian Institute of Technology - Madras CHENNAI - 600 036 INDIA prp@iitm.ac.in Associate Editors PROF. M MASOOM ALI Dept. of Math. Sciences Ball State Univ. Muncie, IN 47306 USA mali@bsu.edu PROF. M. KURANO Department of Mathematics Faculty of Education Chiba University Yayoi-cho, Inage-ku Chiba 263 JAPAN kurano@math.e.chibau.ac.jp PROF. ANDREW ROSALSKY Department of Statistics University of Florida 206 Griffin-Floyd Hall Gainesville, FL 32611 U.S.A. rosalsky@stat.ufl.edu PROF. C. A. BOTSARIS Department of Mathematics Stat.-Prob. OR Unit University of Patras 261 10 Patras GREECE botsaris@otenet.gr PROF. K. L. MAK Department of Indus. Manufacturing Sys. Eng. The University of Hong Kong Pokfulam Road HONG KONG makkl@hkucc.hku.hk PROF. A. SAPOUNAKIS Department of Informatics University of Piraeus 80 Karaoli Dimitrious str. 185 34 Piraeus GREECE arissap@unipi.gr PROF. D. FAVARETTO Depart. di Matematica Applicata Universita Ca' Foscari di Venezia Dorsoduro 3825 E 30123 Venezia ITALY faveret@unive.it PROF. LAURA MARTEIN Dept. of Stat. Appl. Math. University of Pisa Via Ridolfi, 10 56100 Pisa ITALY lmartein@ec.unipi.it PROF. F. RUSSO SPENA Dip. di Ingegneria dei Materiali e delle Produzione, Universita di Napoli "Federico II", Piazzale V. Tecchio, 80121-Napoli, ITALY rrs@fastwebnet.mcgill.it PROF. A. GUPTA Microsimulation Modelling and Data Analysis Division Jeanne Mance Building 5th Floor, Room C577 Ottawa, Ontario K1A 0K9 CANADA anil_gupta@hcsc.gc.ca PROF. GIOVANNI. MATARAZZO Professor of Mathematical Physics Dip. di Ingegneria dell'Informazione e Matematica Applicata dell' Universita di Salerno Via Ponte Don Melillo 84084 Fisciano (SA) ITALY matarazz@diima.unisa.it PROF. GEORGE P. H. STYAN Dept. of Mathematics and Statistics McGill University, Sherbrooke Street West Montral (Qubec), Canada H3A 2K6 styan@math.mcgill.ca PROF. K. JORNSTEN Norwegian School of Eco. Bus. Admn. Helleveien 30 5035 Bergen-Sandviken NORWAY inst.foretak@nhh.no PROF. PIERA MAZZOLENI Istituto di Econometria e Matematica Universita Cattolica del Sacro Cuore Largo A. Gemelli, 1 20123 Milano, ITALY ist.econometriamatematica@unicatt.it PROF. C.-S. WANG Department of Mathematis Aletheia University 32 Chen Li Street Tamsui, Taipei Taiwan, R.O.C wangcs@email.au.edu.tw PROF. D. S. KIM Department of Appl. Math. Pukyong National University 599-1 Daeyeon-3 Dong Nam-gu Pusan 608-737 SOUTH KOREA dskim@dolphin.pknu.ac.kr PROF. TERUHISA NAKAI Department of Systems Management Engineering Kansai University 3-3-35 Yamate, Suita, Osaka 564-8680 JAPAN nakai@iecs.kansaiu.ac.jp PROF. MASAMI YASUDA Dept. of Math. Informatics, Chiba University Yayoicho, Inageku Chiba 263-8522 JAPAN yasuda@math.s.chiba-u.ac.jp About Us | Our Journals | Our Book | Trems Conditions | FAQ | Your Feedback | Contact Us | Other Indian Publications TARU Publications G-159, Pushkar Enclave Pashchim Vihar New Delhi 110 063, INDIA Web Site : www.tarupublications.com Phone : +91-11-25260534,52331159 Fax (India) : +91-11-25276386 Fax (USA) : +1-208-361-8322 E-mail : info@tarupublications.com
Journal of Multivariate Analysis
(Elsevier Science Direct) Contents and abstracts from vol.44 (1993). Text to subscribers.
ScienceDirect - Journal of Multivariate Analysis - List of Issues Register or Login: Password: Athens Institution Login Quick Search: within This Journal All Journals All Full-text Sources Brought to you by: Jozef Stefan Institute Journal of Multivariate Analysis Copyright 2005 Elsevier Inc. All rights reserved Bookmark this page as: http: www.sciencedirect.com science journal 0047259X Articles in Press Volume 97 Volume 97, Issue 1 , Pages 1-294 (January 2006) Volume 96 Volume 95 Volume 94 Volume 93 Volume 92 Volume 91 Volume 90 Volume 89 Volume 88 Volume 87 Volume 86 Volume 85 Volume 84 Volume 83 Volume 82 Volume 81 Volume 80 Volume 79 Volume 78 Volume 77 Volume 76 Volume 75 Volume 74 Volume 73 Volume 72 Volume 71 Volume 70 Volume 69 Volume 68 Volume 67 Volume 66 Volume 65 Volume 64 Volume 63 Volume 62 Volume 61 Volume 60 Volume 59 Volume 58 Volume 57 Volume 56 Volume 55 Volume 54 Volume 53 Volume 52 Volume 51 Volume 50 Volume 49 Volume 48 Volume 47 Volume 46 Volume 45 Volume 44 Volume 43 Volume 42 Volume 41 Volume 40 Volume 39 Volume 38 Volume 37 Volume 36 Volume 35 Volume 34 Volume 33 Volume 32 Volume 31 Volume 30 Volume 29 Volume 28 Volume 27 Volume 26 Volume 25 Volume 24 Volume 22 Volume 21 Volume 20 Volume 19 Volume 18 Volume 17 Volume 16 Volume 15 Volume 14 Volume 13 Volume 12 Volume 11 Volume 10 Volume 9 Volume 8 Volume 7 Volume 6 Volume 5 Volume 4 Volume 3 Volume 2 Volume 1 Alert me when new Journal Issues are available Add this journal to My Favorite Journals Sample Issue Online More Publication Info Information for Authors Contact Us | Terms Conditions | Privacy Policy Copyright 2005 Elsevier B.V. All rights reserved. ScienceDirect is a registered trademark of Elsevier B.V.
Journal of Agricultural, Biological, and Environmental Statistics
Published by the American Statistical Association and the International Biometric Society. Contents and abstracts from 1997 to 1999 (vol.2 to vol.5). Subscribers-only online access to current issues.
Journal of Agricultural, Biological, and Environmental Statistics Online Access 2001 - current issue 2000 Contents and Abstracts 1999 Contents and Abstracts 1998 Contents and Abstracts 1997 Contents and Abstracts Information for JABES Authors JABES Editorial Board JABES Contact Information American Statistical Association Publications Subscription Information Journal of Agricultural, Biological, and Environmental Statistics JABES RATES ASA or IBS Member $50 Non Member $90 Library - Print Electronic $225 Library - Online Only $155 Member Developing Country $30 Library Developing Country $126 A journal of applied statistics. Published by the American Statistical Association and the International Biometric Society. The purpose of the Journal of Agricultural, Biological, and Environmental Statistics (JABES) is to contribute to the development and use of statistical methods in the agricultural sciences, the biological sciences (including biotechnology), and the environmental sciences (including those dealing with natural resources). Published articles are expected to be of immediate and practical value to applied researchers and statistical consultants in these fields. Only papers addressing applied statistical problems will be considered. Interdisciplinary papers as well as papers that illustrate the application of new and important statistical methods using real data are strongly encouraged. Expository, review, and survey articles addressing broad-based statistical issues will be particularly valuable. JABES is indexed in BIOSIS, Current Index to Statistics, Current Contents Agriculture Biology and Environmental Sciences (CC ABES), The Science Citation Index, Science Citation Index Expanded, Agricultural On Line Access (AGRICOLA), and Compumath Citation Index. ISSN 1085-7117 Online Access 2001 - current issue | 2000 Contents and Abstracts | 1999 Contents and Abstracts 1998 Contents and Abstracts | 1997 Contents and Abstracts Information for JABES Authors | Contact Information | JABES Editorial Board American Statistical Association Publications Copyright 1999 American Statistical Association and the International Biometric Society. All rights reserved.
Chance
A magazine about statistics and its use in society. Topical index.
Chance Magazine Homepage This page uses frames, but your browser doesn't support them.
ESAIM : Probability and Statistics
(SMAI) An online probability and statistics journal.
ESAIM: Probability and Statistics Journals Books Services Company Choose a journal Actualit Chimique Agronomie Agron. Sustain. Dev Analusis Anim. Res. Ann. Phys. Fr. Ann. For. Sci. Apidologie Aquat. Living Resou AA AA Suppl. Ser. EAS Publications Se Environ. Biosafety pistmologiques EPJdirect ESAIM: COCV ESAIM: M2AN ESAIM: PS ESAIM: PROC E.J.E.S.S. Eur. Phys. J. AP Eur. Phys. J. A Eur. Phys. J. B Eur. Phys. J. C Eur. Phys. J. D Eur. Phys. J. E Europhys. Lett. Europhysics News Fruits Genet. Sel. Evol. J3eA J. Chim. Phys. J. Phys. I France J. Phys. II France J. Phys. III France J. Phys. IV France Lait Mater. Tech. Mc. Ind. Microsc. Microanal. Nat. Sci. Soc. Quadrature Radioprotection RAIRO Oper. Res. RAIRO - Theoret. In Reprod. Nutr. Dev. REE Rev. Met. Paris Vet. Res. 17 Nov 05 Mirror sites: France | USA First visit | Contacts | EDPS' sites | Useful links | Suggestion box | FAQ Advanced search in abstracts ESAIM: Probability and Statistics All issues Forthcoming Vol. 1st page EDPS Link Manager Help All about... - Journal home page Contents Announcement Aims and scope Editorial board Online edition Dispatch dates Inquiries E-mail alert Forthcoming papers Permission to reuse Contact us Subscription Prices User's license Registration form Propose this journal How to publish in... Instructions for authors Publishing tools Copyright transfer More... Related events Related books Probability and statistics (read more about ESAIM) Editors-in-Chief: Serge Cohen et FabriceGamboa Published under the scientific responsibility of the Socit de Mathmatiques Appliques et Industrielles (SMAI) and with the support of the Centre National de la Recherche Scientifique (CNRS). ISSN (print edition): 1292-8100 ISSN (electronic edition): 1262-3318 Frequency: irregular Masthead This journal is part of the European Series in Applied and Industrial Mathematics (ESAIM) and as such is an electronic-only journal with only one print volume published at the year's end. EDP Sciences, SMAI Recommend this journal Free registration to E-mail alerts Information Free access to 2005 online contents EDP Sciences is pleased to announce that the access to the 2005 full online edition of ESAIM: Probability and Statistics will be available free of charge from September, 10, 2005. Tables of contents are located here . Math-Fi.com: Jobs Education in Finance and Math New services (2004) Links in references CrossRef indexation 1995-2004 issues are available in print: see announcement EDP Sciences 17, avenue du Hoggar - Parc d'Activits de Courtaboeuf - BP 112 - F-91944 Les Ulis Cedex A - France
Journal of Classification
(Springer) Tables of contents from vol.14 (1997) on. Full text to susbcribers via LINK.
SpringerLink - Publication Articles Publications Publishers Home Publication Journal of Classification Publisher:Springer-Verlag New York ISSN:0176-4268 (Paper) 1432-1343 (Online) Subject: Computer Science , Mathematics Issues in bold contain content you are entitled to view. Volume 22 Number 1 June 2005 (1 - 144) Volume 21 Number 2 September 2004 (163 - 299) Number 1 March 2004 (1 - 160) Volume 20 Number 2 September 2003 (139 - 286) Number 1 May 2003 | Request a sample (1 - 136) Volume 19 Number 2 December 2002 (193 - 346) Number 1 January 2002 (1 - 189) Volume 18 Number 2 February 2001 (155 - 306) Number 1 January 2001 (1 - 152) Volume 17 Number 2 July 2000 (149 - 366) Number 1 January 2000 (1 - 145) Volume 16 Number 2 July 1999 (161 - 326) Number 1 January 1999 (1 - 158) Volume 15 Number 2 February 1998 (160 - 309) Number 1 January 1998 (1 - 156) Volume 14 Number 2 January 1997 (195 - 325) Number 1 January 1997 (3 - 170) First page Previous page Next page Last page Linking Options About This Journal Editorial Board Manuscript Submission Quick Search Search within this publication... For: Search Title Abstract Only Search Author Search Fulltext Search DOI Table Of Contents Alerting Click the button below to enable Table Of Contents Alerting for this publication. Frequently asked questions | General information on journals and books Springer. Part of Springer Science+Business Media | Privacy, Disclaimer, Terms and Conditions, Copyright Information Remote Address: 212.235.208.157 Server: MPWEB17 HTTP User Agent: IE
Journal of Statistical Planning and Inference
(Elsevier) Tables of contents of all volumes. Full text to subscribers.
Elsevier.nl - De pagina kan niet worden weergegeven donderdag 17 november 2005 16:33 ZOEKEN Op deze site Op internet Home Help Sitemap Log in Abonneer Maak Elsevier mijn startpagina DE ZEDENMEESTER Mag seks buiten het huwelijk... Ga naar weblog Nieuws Nederland Politiek Europese Unie Buitenland Economie Wetenschap Cultuur Televisie Sport Society Internet Gadgets Laatste 24 uur Opinie Commentaren Leon de Winter De Zedenmeester Brussels Blog Essays Reacties Onderzoeken Beste woon- gemeenten Studie en werk Beste Scholen Elsevier Webgids Test uw kansen Veiligste gemeenten Wie verdient wat? Beste studies 2005 Persoonlijk Gezondheid Gezin Carrire Geld Eten Uitgaan Mode Wonen Auto Reizen Extra Relatie Auto kopen Hotels Shopping Routeplanner American Express Service Elsevier op uw website of weblog Digitaal Archief RSS Nieuwsflitser Nieuwsbrieven Help Weekblad Deze week Abonneren Adres wijzigen Nabestellen Expat service Over Elsevier Veelgestelde vragen Contact Elsevier THEMA Redactie Adverteren Exclusief Alle covers De eerste Elsevier FOUTMELDING De pagina kan niet worden weergegeven De pagina die u zoekt is misschien verwijderd, de naam van de pagina kan zijn gewijzigd of de pagina is tijdelijk niet beschikbaar. Probeer het volgende: Controleer of u geen typefout hebt gemaakt in het pagina-adres dat u in de adresbalk hebt getypt. Klik op de knop Vorige om een andere koppeling te proberen. Indien u op zoek bent naar de meest actuele informatie op www.elsevier.nl, klik op de link: ' Laatste 24 uur ' om deze informatie in te zien. U kunt ook de introductiepagina openen en kijken of er koppelingen zijn naar de gewenste informatie. HTTP 404 Onze excuses voor het ongemak Hieronder hebben wij een selectie nieuwsberichten van de laatste 24 uur voor u. Misschien staat daar hetgeen u zoekt. 17 november 2005van16tot17 uur VS pakten meer dan 83.000 terreurverdachten op De Villepin: Terroristisch gevaar groter dan ooit Industrile productie VS conform verwachting Shell ruilt belangen in VS met Total Dreigende stakingen bij Smit Internationale Home Adverteer Algemene voorwaarden Disclaimer Privacy zibb.nl beleggersbelangen.nl fembusiness.nl marketingtribune.nl fiscaaltotaal.nl subsidietotaal.nl totaljobs.nl kellysearch.nl Elsevier is een uitgave van 2005 Reed Business Information bv. Het is niet toegestaan om zonder voorafgaande toestemming van Elsevier, door Elsevier gepubliceerde artikelen, onderzoeken of gedeelten daarvan over te nemen, te (doen) publiceren of anderzins openbaar te maken of te verveelvoudigen. Op onze aanbiedingen en overeenkomsten zijn van toepassing onze algemene voorwaarden, welke zijn gedeponeerd bij de Kamer van Koophandel te Amsterdam. Design Satama Interactive
Statistical Modelling
(Arnold) An interdisciplinary journal incorporating contributions from non statisticians working in related fields. Contents, abstracts, datasets and software on-line.
www.statmod.com www.statmod.com: None None www.statmod.com
Journal of the Bernoulli Society
Tables of contents of all volumes.
CBS - Pagina niet gevonden Spring naar inhoud Centraal Bureau voor de Statistiek Home Thema's Cijfers Publicaties Methoden Informatie voor Over het CBS Sitemap English Home Uw eerste bezoek? Voor deelnemers aan CBS-onderzoeken Terug naar standaardweergave Om de CBS-website goed op uw wensen aan te laten sluiten, doet het CBS mee aan een onderzoek naar het gebruik van zijn website. Wij vragen u voodat u de CBS-website verlaat een vragenlijst in te vullen. Alvast bedankt voor uw medewerking. Pagina niet gevonden De pagina waar u naar zoekt is niet gevonden. Het CBS heeft 1 september 2005 zijn website geheel vernieuwd. Mogelijk volgde u een link naar de oude site. Terug naar standaardweergave Laatst gewijzigd: maandag 29 augustus 2005 11:55 Zoeken in CBS.nl Paginaopties Voeg toe aan favorieten Printversie Vaste breedte Snelkoppelingen StatLine databank FAQ's RSS Newsfeed Bedrijvenloket Inflatie Huuraanpassing Dossiers Allochtonen Europese Unie Vergrijzing Vrouwen en mannen Centraal Bureau voor de Statistiek, Voorburg Heerlen, 2005 Copyright Privacyverklaring Disclaimer Help Contact
Statistics and Probability Letters
Contents and abstracts from vol.41 (1999).
Elsevier.com This site requires scripting to be enabled in your browser. Please change your Internet Options, then click here to go to our home page.
Journals of the Royal Statistical Society
Links to RSS newsletter and four journals.
The Royal Statistical Society - Welcome to the Royal Statistical Society Home | About the RSS | Contact RSS | E-mail: rss@rss.org.uk | 12 Errol Street, London, EC1Y 8LX, UK. Tel: +44(0)20 7638 8998 Quick jump to Please select the topic you are interested in... About the RSS Accreditation of university courses Advertisements in RSS News Annual Conference 2005 Archive of events Archives Calendar of Events Careers Chartered Statistician Code of Conduct Committee Meeting Schedule Consultations Continuing Professional Development Council Current hot topics Curriculum report: Statistics in the 14-19 Curriculum Education Education and Qualifications Education Workshops Background Information Education: useful links Election Method for Council Elections to Council Examination Centres Examinations registration forms Examinations timetable Examinations: the Society's professional examinations Exemptions Fellow Finding Errol Street Graduate Diploma Graduate Statistician Higher Certificate Historical Book Collection Honours Awards Main examinations documents Maintained Professional Certificate (MPC) Media News Mid-term assessment (MTA) National Statistics the Statistical Community Online subscription payments Ordinary Certificate Ordinary Meetings Outside Organisations Past papers and solutions Performance Monitoring Post-14 Maths Inquiry Preprints of journal discussion papers Professional Member Professional Membership Qualifications RAE Risk in Society RSS 2004 RSS Mission Statement RSS Schools Lecture ('Guy Lecture') Social Statistics Section Society Honours Awards Staff at Errol Street Statistics the Law Statistics User Forum Subscription Rates The Fellows Suite The Story of the Society Themes Website Registration What's new in Publications Young statisticians or goto Search Username Password GO Forgotten your password or not yet registered? My RSS About the RSS Society and Statistics Education and Qualifications Careers Membership Specialist, Local and User Groups Publications and reports Meetings and Events Jobs Facilities Welcome to the Royal Statistical Society We are one of the premier statistical societies in the world, with a high international reputation. Founded in 1834, we are both a learned and a professional society, with some 6500 members based in the United Kingdom and overseas.Over 1700 of our members are professionally qualified. Our main purposes are: To nurture the discipline of statistics by publishing a Journal, organising meetings, setting and maintaining professional standards, accrediting university courses and operating examinations. To promote the discipline of statistics by disseminating and encouraging statistical knowledge and good practice with both producers and consumers of statistics, and in society at large. To provide effective and efficient services to our members which will support their professional and academic interests and their endeavours to advance the other objectives of the Society. It is not our role to provide statistical data on any subject. For UK official statistics, please visit the government's National Statistics website. Challenges for National Statistics Karen Dunnell, National Statistician 21 November 2005 Jobs Jobs instatistics See job advertisements from RSS News. Coming soon - an onlinejob searchfacility for fellows! Bayesian palaeocllimate reconstruction RSS Ordinary Meeting 23 November 2005 The Royal Statistical Society. Design by Unified Solutions. Home | About the RSS | Enquiries | Contact | Sitemap
Journal of Statistical Research (JSR)
Published by the Institute of Statistical Research and Training (ISRT), University of Dhaka. Contact information, contents of current issue.
Journal of Statistical Research (JSR) | Home | Contact | SiteMap | ABOUT ISRT ACADEMIC STUDENTS PEOPLE TRAINING RESOURCES COMPUTING PUBLICATIONS SPORTS Search Journal of Statistical Research (JSR) JSR is an official publication of the Institute of Statistical Research and Training since 1970. Since its inception, it has been an excellent means of transfer and communication of statistical knowledge for the developing nations across the globe. It publishes original research articles both in theoretical and applied statistics areas. Paper published in the JSR are accepted only through appropriate referring. The Journal is published twice a year, one in June and the other in December. Note for the Authors Manuscripts should be typewritten or computer-composed, double spaced throughout on one side of good quality papers and they should be submitted in triplicate. The author of an accepted paper will have to supply a diskette of his her paper composed in LaTeX. Where to Submit? The editorial board suggests that authors from Europe and North America may submit manuscripts to Professor A K Md E Saleh, Editor-in-Chief of JSR, School of Mathematics Statistics, Carleton University, Ottawa, Ontario K1S 5B6, Canada Asia Pacific region may submit manuscripts to Professor M King, Department of Econometrics Business Statistics, Monash University, Clayton, Vic. 3800, Australia Middle Eastern region may submit manuscripts to Professor E Aly, Department of Statistics OR, Kuwait University, P O Box 5969, Safatg 13060, Kuwait all other places may submit manuscripts to Professor M Sekander Hayat Khan, Editor of JSR, Institute of Statistical Research Training, University of Dhaka, Dhaka 1000, Bangladesh. Papers may also be submitted to any Associate Editor, JSR Guideline Sample Paper Template IMPORTANT: Accepted papers must be submitted as per the style of JSR. For convenience, a template file along with the style file is available for downloading. Please use these style and template files only. All files together in one WinZIP file Individual files: (Save all files in same folder) To download, point to the file, right-click the mouse button and click Save Target As...) Template file (Updated Feb. 24, 2005) Style file (Updated Feb. 24, 2005) Macro file (Updated Feb. 24, 2005) Example graph ReadMe file There is a brief guideline about how to typeset Theorems, Equations, Corollaries, etc. in PDF. Click here to download. It is in fact, the PDF version of the template file . Paging Charges and Reprints Paging charge is US $ 100 flat for each article from outside the SAARC countries. Each author will receive 25 copies of reprints. Additional copies may be ordered, well in advance, on extra payment. Authors from SAARC countries will receive 25 reprints for a fixed price of Tk.1000 or US $ 40 including postage. Mode of Payment Crossed Bank Cheque Demand Draft. Cheque Draft should be payable to Director ISRT, University of Dhaka SB A C No. 61034551. Sonali Bank, Dhaka University Campus Branch Dhaka-1000, Bangladesh. Current Issue Vol. 38 No. 2 June, 2004) Old Issues Area of Interest Mathematical Statistics Quality control in Industries Bio-statistics Sampling Techniques and Computer intensive statistics with graphics Subscription for 2 issues Individuals US $40 (Air mail postage) Institutions US $ 50 (Air mail postage ) Editors-in-chief A K MD E SALEH School of Mathematics and Statistics Carleton University of Ottawa Ontario K1S 5B6, Canada Email:esaleh at math.carleton.ca Editor M SEKANDER HAYAT KHAN Institute of Statistical Research and Training, University of Dhaka Dhaka 1000, Bangladesh Email: mshkhan at udhaka.net Updated: 24 February, 2005 Developed and Maintained by ISRT Web Development Team. Contact: isrt at udhaka dot net 2000-2004, ISRT, University of Dhaka, Bangladesh Site established 22 June 1999
The American Statistician
(ASA) Searchable index 1947--1996. Table of contents and abstracts from vol. 51 (1997). Full text to subscribers from vol. 54 (2001).
Join or Renew Now! About ASA Awards ASA Marketplace Career Center Education Meetings and Events Members Only Membership Online Journal Access Professional Needs Publications Related Links Site Map FAQ Home Site Map | FAQ ASA Journals IMS Publications Editorial Board For Authors Style Guide Subscribe Order Reprints Index (1947-1996) Advertising Keyword Selection TAS Home The American Statistician, TAS Electronic Access 2001 - current issue 2000 | 1999 | 1998 | 1997 | Order Reprints Online Order Form | Comprehensive Index 1947-1996 Editor's Home Page | More Links Are you looking for general-interest articles about current national and international statistical problems and programs, interesting and fun articles of a general nature about statistics and its applications, or the teaching of statistics? The American Statistician (TAS), published quarterly by the American Statistical Association. Contains timely articles organized into the following sections: Statistical Practice, General, Teacher's Corner, History Corner, Interdisciplinary, Statistical Computing and Graphics, Reviews of Books and Teaching Materials, and Letters to the Editor. The American Statistician is indexed by MathSci Online, ISI Web of Knowledge, the SRM Database, and Current Index to Statistics ; it is also reviewed in Mathematical Reviews and abstracted in Research into Higher Education Abstracts, as well as by Information Access Group. The American Statistician - ISSN 0003-1305 Top of Page Printer Friendly Version 1429 Duke Street Alexandria, VA 22314-3415 Phone: 703-684-1221 Toll-free: 888-231-3473 Fax: 703-684-2037 Email: asainfo@amstat.org Copyright | Privacy Statement | Disclaimer | Link to Us | Staff Directory 2005 American Statistical Association. All Rights Reserved. Upgrading to the latest version of your browser software may enhance your online experience.
Journal of Statistics Education
A refereed electronic journal on postsecondary teaching of statistics. Online contents, abstracts, full text free with two-year delay.
Journal of Statistics Education (JSE) Home Page ISSN 1069-1898 Volume 13 (2005) Archive (1993-2004) Index Data Archive Information Service Editorial Board Authors Data Contributors Home Page Contact JSE ASA Publications Search JSE An International Journal on the Teaching and Learning of Statistics Journal of Statistics Education Current issue The July 2005 (Volume 13, Number 2) issue of JSE is now available. The table of contents is available at the following site: [ Link to the 2005 Table of Contents ] The next issue of JSE is due to be announced in November 2005. Articles in the next issue may appear on the Web site one at a time during the construction of the issue. JSE is a publication of the American Statistical Association Comments from the Editor As I was getting ready to attend the Joint Statistical Meetings in Minneapolis I realized that summer is almost over and I really had to start thinking about what I will be teaching during the Fall semester. I am sure that this time of year many of the readers of JSE are looking for new things to try in their statistics classes. The July issue has many articles that can help out. For those of you teaching a probability course the articles Pedigrees, Prizes, and Prisoners: The Misuse of Conditional Probability and Powerball, Expected Values, and the Law of (very) Large Numbers give some new insight on some probability problems. For those teaching an introductory statistics class, Mean, Median, and Skew: Correcting a Textbook Rule advises you to be more careful when discussing the relationship between the mean and the median for skewed data. Did you ever wonder how certain attributes of students, might affect their performance? Perfectionism in Students: Implications in the Instruction of Statistics looks at one such attribute, perfectionism. From the students perspective, are traditional of non-traditional methods perferred? The article by Johnson and Dasgupta investigates this. I am always looking for new data sets to use in my classes and July's issue has one new data set and a different analysis of an existing data set in the JSE data archive. An Exhalent Problem for Teaching Statistics has data on forced expiratory volume. Say the title aloud, I think the auditory pun was intended. Predicting Body Fat Using Data on BMI gives an alternative analysis of bodyfat data (fat.dat) in the JSE data archive. I hope these articles help you as you prepare to teach statistics in the coming school year. New manuscripts should be submitted to Bob Stephenson ( wrstephe@iastate.edu ). Please see the Guidelines for JSE Authors page for contact information and submission instructions. Mission statement JSE disseminates knowledge for the improvement of statistics education at all levels, including elementary, secondary, post-secondary, post-graduate, continuing, and workplace education. ... [ Read the entire JSE Mission Statement ] Subscribe to JSE JSE is available for no charge. If you wish to receive e-mail announcements when new issues are published (or if you have questions or comments about JSE), please send an e-mail to the Editorial Assistant, Denise Riker ( riker@iastate.edu ). . Volume 13 (2005) | Archive | Index | Data Archive | Information Service | Editorial Board | Guidelines for Authors | Guidelines for Data Contributors | Home Page | Contact JSE | ASA Publications Copyright 2005 American Statistical Association. All rights reserved.
Natural Resource Modeling
International journal devoted to mathematical modeling of natural resource systems, including their inherent physical, chemical, and biological processes, and of the economic and operational basis for their management.
Rocky Mountain Mathematics Consortium Rocky Mountain Mathematics Consortium A NONPROFIT ORGANIZATION PROMOTING RESEARCH AND EDUCATION IN MATHEMATICS WITHIN THE ROCKY MOUNTAIN REGION Journals - Online Version If you or your institution is a subscriber to the online version of one or all of the RMMC journals and you wish to view a journal article (starting with the year 2000) please click on the button to your right. Journals - Abstracts and Information Rocky Mountain Journal of Mathematics Journal of Integral Equations and Applications Natural Resource Modeling Canadian Applied Mathematics Quarterly Summer School Program General information and this years program Member Colleges and Universities The Rocky Mountain Mathematics Consortium is a nonprofit corporation with headquarters at Arizona State University. The Executive Director is Professor Thomas Sherman (tsherman@asu.edu). The Administrative Assistant is Carol Nunez (rmmc@asu.edu). Member Institutions Speakers' Bureau Rules Send email to rmmc@ASU.EDU
Biometrika
(OUP) A journal of statistics in which emphasis is placed on papers containing original theoretical contributions of direct or potential value in applications. Contents and abstracts on-line from vol. 83 (1996). Full text to subscribers from vol. 86 (1999).
Oxford Journals | Mathematics Physical Sciences | Biometrika Skip Navigation Oxford Journals Contact Us My Basket My Account Biometrika About This Journal Contact This Journal Subscriptions Current Issue Archive Search Oxford Journals Mathematics Physical Sciences Biometrika Read This Journal View Current Issue ( Volume 92 Issue 4 December 2005 ) Browse the Archive Biometrika is primarily a journal of statistics in which emphasis is placed on papers containing original theoretical contributions of direct or potential value in applications. From time to time, papers in bordering fields are also published. Search This Journal Advancedsearch Reader Services Free sample issue Access purchase this journal Mathematics Statistics Books from Oxford The Journal About this journal Rights Permissions Published on behalf of The Biometrika Trust Impact Factor: 0.988 Editor-in-Chief D M Titterington View full editorial board For Authors Instructions to authors Alerting Services Email table of contents CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements Online ISSN 1464-3510 - Print ISSN 0006-3444 Copyright 2005 Biometrika Trust Oxford Journals Oxford University Press Site Map Privacy Policy Frequently Asked Questions Other Oxford University Press sites: Oxford University Press American National Biography Booksellers' Information Service Children's Fiction and Poetry Children's Reference Corporate Special Sales Dictionaries Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks Humanities International Education Unit Law Medicine Music Online Products Oxford English Dictionary Reference Rights and Permissions Science School Books Social Sciences Very Short Introductions World's Classics
Statistical Methods in Medical Research
Review articles. Contents, all volumes.
Statistical Methods in Medical Research - A Medical Journal from Hodder Arnold Statistical Methods in Medical Research An International Review Journal Editors Brian S Everitt, London, UK Theodore R Holford, New Haven, CT, USA Print ISSN: 0962-2802 - Online ISSN: 1477-0334 Volume 14 - 2005 - Bi-Monthly - Approx 576 pages per volume To view the online version of Statistical Methods in Medical Research (hosted by www.ingentaconnect.com) please click HERE . Aims Scope Statistical Methods in Medical Research is the leading vehicle for review articles in all the main areas of medical statistics and is an essential reference for all medical statisticians. It is particularly useful for medical researchers dealing with data and provides a key resource for medical and statistical libraries, as well as pharmaceutical companies. This unique journal is devoted solely to statistics and medicine and aims to keep professionals abreast of the many powerful statistical techniques now available to the medical profession. As techniques are constantly adopted by statisticians working both inside and outside the medical environment, this review journal aims to satisfy the increasing demand for accurate and up-to-the-minute information. Why choose Statistical Methods in Medical Research? Covers all areas of medical statistics Full of statistics and statistical techniques Contains the latest, accurate information An indispensable reference for medical statisticians, statistical libraries and pharmaceutical companies.
Entropy Journal
Journal devoted to the exploration of entropy in statistics and science.
Entropy (ISSN 1099-4300, CODEN: ENTRFG) http: www.mdpi.net entropy http: www.mdpi.org entropy About MDPI | Open Access Journals | Open Access Advocacy | Mirrors | Printed Edition | Contact Us Aims Scope Editors Instructions for Authors Conferences Discussion Entropy Mailing List Some Entropy-Related Websites Textual Search Donations Entropy, An International and Interdisciplinary Journal of Entropy and Information Studies: ISSN 1099-4300, CODEN: ENTRFG, 1999-2005 by MDPI Entropy is a peer-refereed scientific journal. It is published online quarterly at http: www.mdpi.org entropy (official site) and at http: www.mdpi.net entropy (mirror). For readers: Entropy is an open access online journal which follows the guidelines of the Budapest Open Access Initiative . No subscription charge is required. For authors: no page charge is required. Voluntary donation is accepted. Since 1999, Entropy is indexed and abstracted by Chemical Abstracts and INSPEC (covered completely, see the list ). Because Entropy is an online journal and the access to all the papers is free, papers published in Entropy have high publicity. Accepted papers are published and visible on our web site as soon as they are sent to us by their authors in final PDF form, discarding the periodical dates at which the table of contents is updated. Thus, the publication delays are shortened and depend mainly on the diligence of the reviewers. Published papers are archived by printing 100 hard copies of the volumes which are distributed almost free of charge to the most important libraries in the world (see the PRINTED-EDITION website), by publishing CD-ROM volumes and by mirroring at several servers . To be added to the free subscriber's mailing list, send an e-mail to entropy_request@mdpi.org (put "ENTROPY free subscription" as the subject title and your name and address as the text in your e-mail)" FIS2005 - Third Conference on the Foundations of Information Science Paris, 4-7 July 2005. Proceedings to be published in open access by MDPI . Contact addresses: Dr. Michel Petitjean , Editor-in-Chief, ITODYS (CNRS, UMR 7086), 1 rue Guy de la Brosse, 75005 Paris, France. Tel. +33 (1) 44 27 48 57; Fax +33 (1) 44 27 68 14. E-mail: entropy@mdpi.org , petitjean@itodys.jussieu.fr , ptitjean@ccr.jussieu.fr Dr. Shu-Kun Lin , The Publisher, MDPI Center, Matthaeusstrasse 11, CH-4057 Basel, Switzerland. Tel. +41 79 322 3379; Fax +41 61 302 8918. E-mail: lin@mdpi.org Entropy (ISSN 1099-4300) Last change: 23 March 2005; Webmaster: entropy@mdpi.org 1999-2005 by MDPI , Basel, Switzerland Current Issue Vol. 7, 2005 Vol. 6, 2004 Vol. 5, 2003 Vol. 4, 2002 Vol. 3, 2001 Vol. 2, 2000 Vol. 1, 1999 Special Issues Molecular Diversity Preservation International (MDPI)
Canadian Journal of Statistics Revue canadienne de statistique
Publication of the Statistical Society of Canada, released quarterly.
The Canadian Journal of Statistics La revue canadienne de statistique English version | Version franaise Site rfrenc : Web site referenced at :
Journal of Statistical Software
Full text, code and data from vol.1 (1996).
Journal of Statistical Software Journal of Statistical Software editor: Jan de Leeuw ISSN 1548-7660 CODEN JSSOBK Related Links: Journal of Computational and Graphical Statistics [ Instructions for Authors ][ LaTeX Style Files ] [ Editorial Board ][ Referees ][ Bibtex ][ DOAJ ][ JSS-Announce ] Vol 1 | Vol 2 | Vol 3 | Vol 4 | Vol 5 | Vol 6 | Vol 7 | Vol 8 | Vol 9 | Vol 10 | Vol 11 | Vol 12 | Vol 13 | Vol 14 Articles Author: Robin K. S. Hankin Title: Introducing BACCO, an R Bundle for Bayesian Analysis of Computer Code Output Reference: Volume 14, 2005, Issue 16 Acquire: paper [293] browse files [130] Dates: submitted: 2005-06-09 accepted: 2005-10-19 Authors: Michael Hahsler and Bettina Grn and Kurt Hornik Title: arules - A Computational Environment for Mining Association Rules and Frequent Item Sets Reference: Volume 14, 2005, Issue 15 Acquire: paper [254] browse files [119] Dates: submitted: 2005-04-15 accepted: 2005-09-29 Authors: Ciprian M. Crainiceanu and David Ruppert and M.P. Wand Title: Bayesian Analysis for Penalized Spline Regression Using WinBUGS Reference: Volume 14, 2005, Issue 14 Acquire: paper [249] browse files [178] Dates: submitted: 2004-03-18 accepted: 2005-09-29 Author: George Marsaglia Title: Monkeying with the Goodness-of-Fit Test Reference: Volume 14, 2005, Issue 13 Acquire: paper [427] browse files [163] Dates: submitted: 2005-05-01 accepted: 2005-09-20 Author: Kurt Hornik Title: A CLUE for CLUster Ensembles Reference: Volume 14, 2005, Issue 12 Acquire: paper [342] browse files [175] Dates: submitted: 2005-05-13 accepted: 2005-09-20 Authors: Andreas Brezger and Thomas Kneib and Stefan Lang Title: BayesX: Analyzing Bayesian Structural Additive Regression Models Reference: Volume 14, 2005, Issue 11 Acquire: paper [507] browse files [232] Dates: submitted: 2004-06-18 accepted: 2005-09-09 Authors: Dimitris Karlis and Ioannis Ntzoufras Title: Bivariate Poisson and Diagonal Inflated Bivariate Poisson Regression Models in R Reference: Volume 14, 2005, Issue 10 Acquire: paper [483] browse files [215] Dates: submitted: 2003-11-14 accepted: 2005-09-05 Author: John Fox Title: The R Commander: A Basic-Statistics Graphical User Interface to R Reference: Volume 14, 2005, Issue 9 Acquire: paper [2165] browse files [371] Dates: submitted: 2004-07-22 accepted: 2005-08-19 Authors: Lin Yee Hin and Vincent Carey Title: An Algorithm for Clustered Data Generalized Additive Modelling with S-PLUS Reference: Volume 14, 2005, Issue 8 Acquire: paper [486] browse files [256] Dates: submitted: 2005-01-27 accepted: 2005-08-31 Authors: Jeff T. Terpstra and Joseph W. McKean Title: Rank-Based Analysis of Linear Models Using R Reference: Volume 14, 2005, Issue 7 Acquire: paper [1327] browse files [503] Dates: submitted: 2004-04-06 accepted: 2005-07-01 Authors: Achim Zeileis and Gabor Grothendieck Title: zoo: S3 Infrastructure for Regular and Irregular Time Series Reference: Volume 14, 2005, Issue 6 Acquire: paper [1120] browse files [601] Dates: submitted: 2005-04-27 accepted: 2005-05-21 Author: Phil Woodward Title: BugsXLA: Bayes for the Common Man Reference: Volume 14, 2005, Issue 5 Acquire: paper [2465] browse files [793] Dates: submitted: 2004-06-23 accepted: 2005-01-31 Author: Samuel E. Buttrey Title: Calling the lp_solve Linear Program Software from R, S-PLUS and Excel Reference: Volume 14, 2005, Issue 4 Acquire: paper [2547] browse files [669] Dates: submitted: 2004-10-08 accepted: 2005-05-01 Authors: Kosuke Imai and David A. Van Dyk Title: MNP: R Package for Fitting the Multinomial Probit Model Reference: Volume 14, 2005, Issue 3 Acquire: paper [1371] browse files [681] Dates: submitted: 2004-07-01 accepted: 2005-05-08 Authors: Garnett McMillan and Timothy Hanson Title: SAS Macro BDM for Fitting the Dale Regression Model to Bivariate Ordinal Response Data Reference: Volume 14, 2005, Issue 2 Acquire: paper [1223] browse files [618] Dates: submitted: 2005-01-07 accepted: 2005-05-01 Author: Guy Nason Title: pinktoe: Semi-automatic Traversal of Trees Reference: Volume 14, 2005, Issue 1 Acquire: paper [943] browse files [592] Dates: submitted: 2002-09-13 accepted: 2005-04-19 UCLA Department of Statistics Last updated: 18-Feb-2005 Access count is: 210191, since 01-Jul-2001 Maintained by: Web Staff [ webstaff@stat.ucla.edu ]
Computational Statistics
International journal which promotes the publication of applications and methodological research on the contribution to and influence of computing on statistics and vice versa. Editors' site with news and instructions for authors.
Computational Statistics News News Aims and Scope Authors Instructions Editorial Board Publisher Information Contents e-mail Submission Impressum XploRe MD*Base NEWS 04 Nov 2005 Our e-mail-service is interrupted for a few days so that we cannot receive any mails. We therefor please you for your patience. 01 Oct 2005 Volume 20 Issue 3 is published. 07 Sep 2005 Our Editorial Assistant is on vacation from September 12th through October 07th. 22 Jul 2005 Our Webpages moved to a new server. In case of any problems in accessing the web pages please contact us. Jun 2005 Volume 20 Issue 2 is published. April 2005 Meeting of Associate Editors at ISI 2005 in Sydney. We will meet in front on April 8th from 12.00 in front of the Harbourside Meeting Room 1, located on level 2 of the Convention Centre North, and have a small lunch in a restaurant nearby. For questions concerning the meeting please send an email to Mr. Uwe Ziegenhagen, ziegenhagen at wiwi.hu-berlin.de Mar 2005 Volume 20 Issue 1 is published. 17 Dec 2004 We are in holidays from 18th december 200 till 9th january 2005. We wish all authors, associate editors and visitors a merry christmas and a happy new year. 24 Aug 2004 17:15-19:00 Meeting of Associate Editors at CompStat 2004 in Prague. The location will be annouced at conference site (prelimnary: Room 305). 17 Dec 2004 Volume 19 Issue 4 is published. Sep 2004 Volume 19 Issue 3 is published. Jun 2004 Volume 19 Issue 2 is published. 15 Apr 2004 Submission via ftp is again possible under 141.20.100.6 or apus.wiwi.hu-berlin.de. 13 Apr 2004 Style files and templates are available again. ftp will take some time; please submit via e-mail. 08 Apr 2004 Unfortunately our ftp server has crashed last week. Currently no submission via ftp or a download of the style files is possible. We try to recover from backup, but it may take some time. Nevertheless, we wish everybody a happy eastern. 03 Mar 2004 Volume 19 Issue 1 is published. It is the Special Issue on Data Visualization edited by Antony Unwin and Martin Theus. 19 Dec 2003 We are in holidays from 20th december 2003 till 11th january 2004. We wish all authors, associate editors and visitors a merry christmas and a happy new year. 15 Dec 2003 Volume 18 Issue 4 is published. 15 Aug 2003 Volume 18 Issue 3 is published. It is the Special Issue on Computational Finance edited by Helmut Herwartz. 15 May 2003 Volume 18 Issue 2 is published. It is the Special Issue by Goeran Kauermann. 01 Apr 2003 Volume 18 Issue 1 is published.
ACM:Software System Award
Press release from The Association for Computing Machinery naming Dr. John M. Chambers of Bell Labs as recipient of 1998 Award for developing the S System.
ACM:Software System Award Software System Award CONTACT: Anne P. Wilson 212-626-0505 annewilson@acm.org http: www.acm.org Christopher Morgan 617-262-2044 morgan@acm.org IMMEDIATE ACM HONORS DR. JOHN M. CHAMBERS OF BELL LABS WITH THE 1998 ACM SOFTWARE SYSTEM AWARD FOR CREATING "S SYSTEM" SOFTWARE New York, March 23, 1999...The Association for Computing Machinery (ACM) today named Dr. John M. Chambers of Bell Labs as the recipient of the 1998 Software System Award for developing the S System, an innovative software program that helps users to manage and extract useful information from data. The ACM's citation notes that Dr. Chambers' work "will forever alter the way people analyze, visualize, and manipulate data . . . S is an elegant, widely accepted, and enduring software system, with conceptual integrity, thanks to the insight, taste, and effort of John Chambers." The System Software Award recognizes those who develop software systems having a lasting influence. It will be presented on May 15, 1999 during a special ACM awards banquet in New York City, and will be accompanied by a $10,000 prize. Financial support is provided by IBM. About The "S System" The first versions of S in the 1970s pioneered the use of data visualization and interactive statistical computing. Subsequent versions provided richly enhanced modeling capability, and user extensibility, based on its functional object-based approach. Still more recent versions provide a powerful class method structure, new techniques to deal with large objects, extended interfaces to other languages and files, object-based documentation compatible with HTML, and powerful interactive programming techniques. The commercial version, S-Plus, is used across many disciplines where analysts must struggle with creative ways to manage and extract useful information from data. More information about S is available at http: cm.bell-labs.com stat S. John Chambers has been a member of technical staff in research at Bell Laboratories since 1966. In 1997, he became the first statistician to be named a Bell Labs Fellow, cited for "pioneering contributions to the field of statistical computing." His research has touched on nearly all aspects of computing with data but he is best known for the design (and continuing re-design) of the S language. From 1981-83 he was head of the Advanced Software Department, and from 1983-88, head of the Data Analysis and Statistics Research Department. He is the author or co-author of seven books on S, on computational methods, and on graphical methods, most recently Programming with Data: A Guide to the S Language, published in 1998. His professional activities have included being president of the International Association for Statistical Computing and various offices in the ISI, ASA and AAAS. He is a fellow of ASA and AAAS, and a member of ISI. At Bell Labs, he served as head of the advanced software department and the statistics and data analysis research department, before returning to full-time research in 1989. He continues active research on computing with data, with many plans for the future of S and related projects. Dr. Chambers obtained his Ph. D. in statistics in 1966 from Harvard University, after receiving a B. Sc. degree in mathematics from the University of Toronto in 1963 and an M.A. in statistics from Harvard in 1965. About the ACM The Association for Computing (ACM) is a major force in advancing the skills of information technology professionals and students. ACM serves its global membership by delivering cutting-edge technical information and transferring ideas from theory to practice. ACM, with its world-class journals and magazines, dynamic special interest groups, and numerous conferences, workshops, and electronic forums, is a primary resource to the information technology field. For additional information about ACM, visit our web site at http: www.acm.org. ACM Press Release Last Update: March 29, 1999 by Ann Wilson HOME || ABOUT ACM || MEMBERSHIP || PUBLICATIONS || SPECIAL INTEREST GROUPS (SIGs) || EDUCATION || EVENTS CONFERENCES || AWARDS || CHAPTERS || COMPUTING PUBLIC POLICY || PRESSROOM 1997 Association for Computing Machinery
S Programming
Author's page with errata, description, contact information.
`S Programming' `S Programming' by W. N. Venables and B. D. Ripley Springer. ISBN 0-387-98966-8, 2000. Hardback 232mm 155mm, x+264 pages, US price $59.95 This is a companion to the Third Edition of Modern Applied Statistics with S-PLUS . It was published on 12 April 2000. On-line material: Description Contents Scripts and complements Errata Contact authors Publisher's Web Sites There are mirrors of this material at Oxford , Sydney , StatLib (Pittsburgh) and Wisconsin . Description: S is a high-level language for manipulating, analysing and displaying data. It forms the basis of two highly acclaimed and widely used data analysis software systems, the commercial S-PLUS and the Open Source R . This book provides an in-depth guide to writing software in the S language under either or both of those systems. It is intended for readers who have some acquaintance with the S language and want to know more about how to use it more effectively, for example to build re-usable tools for streamlining routine data analysis or to implement new statistical methods. One of the outstanding strengths of the S language is the ease with which it can be extended by users. S is a functional language, and functions written by users are first-class objects treated in the same way as functions provided by the system. S code is eminently readable and so a good way to document precisely what algorithms were used, and as much of the implementations are themselves written in S they can be studied as models and to understand their subtleties. The current implementations also provide easy ways for S functions to call compiled code written in C, Fortran and similar languages; this is documented here in depth. Increasingly S is being used for statistical or graphical analysis within larger software systems or for whole vertical-market applications. The interface facilities are most developed on Windows and these are covered with worked examples. The authors have written the widely adopted Modern Applied Statistics with S-PLUS for Springer, now in its third edition, and several software libraries that enhance S-PLUS and R; these and the examples used in both books are available on the Internet . Dr Venables is now a senior Statistician with the CSIRO CMIS Environmetrics Project in Australia, having been at the Department of Statistics, University of Adelaide for many years previously. Professor Ripley holds the Chair of Applied Statistics at the University of Oxford, and is the author of four other books on spatial statistics, simulation, pattern recognition and neural networks. Both authors are known and respected throughout the international S and R communities, for their books, workshops, short courses, freely available software and through their extensive contributions to the S-news and R mailing lists. Contents Introduction The S language: Syntax and semantics The S language: Advanced aspects Classes New-style classes Using compiled code General strategies and extended examples S software development Interfaces under Windows Appendices: Compiling and loading code The interactive environment BATCH operation Scripts and Complements Scripts for the S, R and C used in the book are available as Sprog.tar.gz (a gzipped tar file) and Sprog.zip (a zip file in the INFO-ZIP projects' format). Unpack these by one of gzip -dc Sprog.tar.gz | tar xvf - tar zxvf Sprog.tar.gz (GNU tar only) unzip Sprog.zip which will unzip the material into one directory for each chapter (and appA for Appendix A). We will produce on-line complements updating the book for new developments in S-PLUS and R as they occur. There is an initial complement (describing S-PLUS 6.x, including under Windows, R 1.2.x, how to program `Life' and how use other Windows compilers), in gzipped postscript or PDF . Those complements mention the Perl file S2html . Errata An errata list for the first printing, including updates for changes to R and new features of S-PLUS 6.x. An errata list for the second printing. An errata list for the third printing. Authors: Dr W. N. Venables CMIS Environmetrics Project PO Box 120, Cleveland, Qld, 4163 AUSTRALIA Email: Bill.Venables@cmis.csiro.au Professor B. D. Ripley Department of Statistics 1 South Parks Road Oxford OX1 3TG UK Email: ripley@stats.ox.ac.uk Publisher: Links are provided to Springer's home pages in Germany and the USA , and the preview page for this book. Last edited on Tuesday 26 August 2003 by Brian Ripley ripley@stats.ox.ac.uk
S-News and S-News-Advisory Mailing Lists
Discussion group on S, S-Plus statistics, graphics, programming. Topics: programming, usage questions and suggestions; problem reports; new software announcements; books, articles; conferences, educational events; short job announcements.
The S-News and S-News-Advisory Mailing Lists The S-News and S-News-Advisory Mailing Lists Introduction to the S-News Mailing List . Introduction to the S-News-Advisory Mailing List . The S-News Mailing List Archives are available here. The S-News Advisory Mailing List Archives are available here. Note: because of the substantial number of submissions which are bogus because of SPAM or infected machines we are forced to reject all submissions from individuals who are not subscribers to s-news. For information about how to subscribe, please see the S-News Introduction . We apologize for this inconvenience. If you are having problems, please send e-mail to JPhilipMiller@WUstl.edu .
The Basics of S-Plus
Author's page with errata, prior editions, S links.
Krause and Olson: The Basics of S-PLUS, 4th edition Andreas Krause, Melvin Olson The Basics of S-PLUS Springer-Verlag, New York 4th Edition, 2005 444 pages ISBN 0-387-26109-5 About the book This book explains the basics of S-PLUS in a clear style at a level suitable for people with little computing or statistical knowledge. Unlike the manuals, it is not comprehensive, but instead introduces the most important ideas of S-PLUS and R, its companion in implementing the S language. The authors take the reader on a journey into the world of interactive computing, data exploration, and statistical analysis. They explain how to approach data sets and teach the corresponding S-PLUS commands. A collection of exercises summarizes the main ideas of each chapter. The exercises are accompanied by solutions that are worked out in full detail, and the code is ready to use and to be modified. The volume is rounded off with practical hints on how efficient work can be performed in S-PLUS, for example by pointing out how to set up a good working environment and how to integrate S-PLUS with office products. The book is well suited for self-study and as a textbook. It serves as an introduction to S-PLUS as well as R. A separate chapter points out the major differences between R and S-PLUS. Over the last editions, the book has been updated to cover important changes like the inclusion of S Language Version 4, Trellis graphics, a graphical user interface, and many useful tips and tricks. The fourth edition is based on S-PLUS Version 7.0 for Windows and UNIX and has been updated and revised accordingly. Table of Contents Introduction, Graphical User Interfaces, A First Session, A Second Session, Graphics, Trellis Graphics, Exploring Data, Statistical Modeling, Programming, Object-Oriented Programming, Input and Output, Tips and Tricks, S-PLUS Internals, Information Sources On and Around S-PLUS, R, Bibliography Errata click here Previous editions First edition (1997) Second edition (2000) Third edition (2002) German edition (1997) Authors Andreas Krause, Novartis Pharma AG, Biostatistics, 4002 Basel, Switzerland Melvin Olson, Novartis Pharma AG, Health Economics and Pricing, 4002 Basel, Switzerland Contact We would be glad to receive any type of feedback, comments, or errors. Note, however, that we are not able to provide support. You can reach us at Firstname.Lastname@novartis.com. (The email address is a little bit obfuscated to avoid even more spam email.) Differences between editions New in Edition 2 New chapter on the Graphical User Interface (GUI). New chapter on Trellis Graphics. Major revisions and additions in almost all chapters. Coverage of the S Language Version 4, in particular Object-Oriented Programming (in a new chapter). Various new exercises and solutions. New in Edition 3 Graphical User Interface revised to cover S-Plus version 6.0. Almost all graphs are now Trellis-type graphs and treated in more detail (in particular in chapter "Exploring Data"). Trellis chapter revised and expanded, sections on subset argument added. Tips and Tricks: new sections on Factors and Treating Data Frames as Lists. New chapter on R comparing and highlighting differences and similarities (concluding that this book serves as well as an introduction to R). New in Edition 4 Updates in various places, including new functions introduced with S-Plus versions 6 and 7 and supported hardware. Graphical User Interface updated (with screen shots based on S-Plus Version 7.0), coverage of multiple S-Plus instances, new (short) section on merging data sets, Trellis chapter revised in various places (section on generally good Trellis settings, extended section on subscripts option for Trellis graphs, and more), big data handling, restructuring of Tips and Tricks including a revision of the section on Factors, new sections on Working with Graph Sheets and The Script Window. Further references related to "The Basics of S-PLUS" Springer-Verlag The Springer-Verlag web page for this book The Amazon.com web page for this book The Barnes and Noble web page for this book Further S-PLUS resources The S-News mailing list and its searchable archive http: www.biostat.wustl.edu s-news The S-PLUS vendor (Insightful) http: www.insightful.com A list of S-Plus related books Applied Statistics in the Pharmaceutical Industry (with case studies using S-Plus) by Steve Millard and Andreas Krause (eds.) .. statistics-in-pharma
The Basics of S-Plus
By Andreas Krause, Melvin Olson; Springer-Verlag, 2002, ISBN 0387954562. Not comprehensive, explains basics in clear style at level useful for those with little computing or statistics knowledge. Equally useful with R. Ends by comparing S-Plus and R.
The Basics of S-PLUS (Krause)-Springer Statistics and Computing Statistics Programs Book Please enable Javascript in your browser to browse this website. Select your subdiscipline Business, Economics Finance Computational Statistics Life Sciences, Medicine Health Physical Information Science Pure Applied Probability Social Sciences Law Theory Methods Home Statistics Computational Statistics Select a discipline Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Online Journals Archive Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom All Author Editor Title ISBN ISSN Series Journals Series Zentralblatt MATH Textbooks The Basics of S-PLUS Series: Statistics and Computing Krause, Andreas, Olson, Melvin 3rd ed., 2002, XX, 419 p. 31 illus., Softcover ISBN: 0-387-95456-2 Online version available Title available online only. About this book | Table of contents About this book This book explains the basics of S-PLUS in a clear style at a level suitable for people with little computing or statistical knowledge. Unlike the S-PLUS manuals, it is not comprehensive, but instead introduces the most important ideas of S-PLUS through the use of many examples. Each chapter also includes a collection of exercises that are accompanied by fully worked-out solutions and detailed comments. The volume is rounded off with practical hints on how efficient work can be performed in S-PLUS. The book is well suited for self-study and as a textbook. The third edition is based on S-PLUS Version 6 for Windows and Unix and has been completely updated. It covers the underlying S Version 4 and the graphical user interfaces for Windows and Unix. A new section of the details of factor objects has been added, Trellis graphs are used in more depth, and new exercises (and solutions) were written. The book serves equally well as an introduction to the R system, and concludes with a comparison of S-PLUS and R. Written for: Practitioners, students Keywords: S language S-PLUS Print version Recommend to others E-content Additional information Reviews All books by these authors Krause, Andreas Olson, Melvin Related subjects Computational Statistics Related links Krause's Website Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
Modern Applied Statistics with S
By William N. Venables, B.D. Ripley; Springer-Verlag, 2002, ISBN 0387954570. Guide to using S-Plus and R for statistical analyses: introduces using S, and is a course in modern statistical methods.
Modern Applied Statistics with S, 4th ed Modern Applied Statistics with S. Fourth Edition by W. N. Venables and B. D. Ripley Springer. ISBN 0-387-95457-0, 2002. Hardback 232mm 155mm, xi+495 pages This fourth edition was published in late July 2002, and reprinted in May 2003. Links to material for earlier editions . On-line material: Description Contents Differences from Earlier Editions On-line Complements Exercises and Selected Answers Software and Datasets Errata Contact authors Publisher's Web Sites Description: S is a powerful environment for the statistical and graphical analysis of data. It provides the tools to implement many statistical ideas that have been made possible by the widespread availability of workstations having good graphics and computational capabilities. This book is a guide to using S environments to perform statistical analyses and provides both an introduction to the use of S and a course in modern statistical methods. Implementations of S are available commercially in S-PLUS ; and as the Open Source R for a wide range of computer systems. The aim of this book is to show how to use S as a powerful and graphical data analysis system. Readers are assumed to have a basic grounding in statistics, and so the book is intended for would-be users of S-PLUS or R and both students and researchers using statistics. Throughout, the emphasis is on presenting practical problems and full analyses of real data sets. Many of the methods discussed are state of the art approaches to topics such as linear, nonlinear and smooth regression models, tree-based methods, multivariate analysis, pattern recognition, survival analysis, time series and spatial statistics. Throughout modern techniques such as robust methods, non-parametric smoothing and bootstrapping are used where appropriate. This fourth edition is intended for users of S-PLUS 6.0 or R 1.5.0 (or later). A substantial change from the third edition is updating for the current versions of S-PLUS and adding coverage of R. The introductory material has been rewritten to emphasis the import, export and manipulation of data. Increased computational power allows even more computer-intensive methods to be used, and methods such as GLMMs, MARS, Kohonen's SOM and support vector machines are considered. The authors have written several software libraries that enhance S-PLUS and R; these and all the datasets used are supplied with Windows versions of S-PLUS and all versions of R, and are also available on the Internet in versions for Windows and Unix . There are extensive on-line complements covering advanced material, exercises and new features of S-PLUS and R as they are introduced. Dr Venables is a Senior Statistician with the CSIRO in Australia. He has given many courses on statistical computing, data analysis and graphics using S in Australia, Europe and the USA. Professor Ripley holds the Chair of Applied Statistics at the University of Oxford, and is the author of four other books on spatial statistics, simulation, pattern recognition and neural networks. They are the joint authors of `S Programming' , the authoritative guide to using the S language. S-PLUS is a commercial system of the Insightful Corporation . The book is equally useful with R , a freely-available Open Source statistical system `not unlike S'. Contents Introduction Data manipulation The S language Graphics Univariate statistics Linear statistical models Generalized linear models Non-linear and smooth regression Tree-based methods Random and mixed effects Exploratory multivariate analysis Classification Survival analysis Time series analysis Spatial statistics Optimization Appendices: Implementation-specific details The S-PLUS GUI Datasets, software and libraries On-line Complements The `complements' provide an on-line updating of the book, as well as further details of technical material. Currently there are `Statistical Complements' in gzip-ed postscript and PDF covering Pseudo-random number generators Median polish Gamma GLMs Profiling non-linear fits Smooth estimates of survival and hazard functions Semi-parametric survival modelling Expected survival distributions Tree-structured survival analysis Bivariate spectral analysis Our spatial examples via S+SpatialStats Future complements are planned to cover changes in S-PLUS and in R. Exercises and Selected Answers Some exercises on both S programming and data analysis are available for downloading. There are answers to almost all the programming exercises and to some of the data analysis problems. VR4ex.ps.gz gzip-ed PostScript (125Kb) VR4ex.pdf PDF (240Kb) The PDF version has extensive hyperlinks, for example between exercises and their answers. Viewers can be downloaded from www.adobe.com ; a suitable viewer is normally installed with S-PLUS 6.x on Windows. Errata There are errata lists available for Printing First Edition first second third fourth Second Edition first second third Third Edition first second third Fourth Edition first second Only those for the current edition are maintained. Differences from the Earlier Editions The Second Edition was written when S-PLUS 3.4 was current; version 4.0 appeared shortly after the book. The Third Edition was extensively revised, assuming that the reader had S-PLUS 4.0 or later, and it takes account of S-PLUS 5.x and 2000. As much of the material as possible was usable with S-PLUS 3.3 4 and also with R. This gave accounts of the analyses made possible by the nlme3 and survival5 software. We added enhanced software for robust regression and for proportional odds logistic regression, and provided in-depth analyses using these. The Fourth Edition is targeted at S-PLUS 6.x and R. This enables many new features of current S to be used, and will be particularly helpful to R users for whom almost all the changes needed are present in the main text. We have re-organized the introductory material and added new material on data import export. The statistical material uses automated bandwidth selectors for histograms and density estimation, and adds new material on visualization, ICA, Kohonen's SOM, support vector machines and fitting GLMMs. Material previously in the on-line complements on over-dispersion, factor analysis and correspondence analysis is now in the main text. The time-series material has been re-worked, using the arima() function we wrote and including material on GARCH models. There is a separate chapter on optimization, making use of the optim() function written by BDR for R and now available for S-PLUS in MASS. The material on programming has been reduced since the first and second editions: a much more comprehensive account is given in the companion volume S Programming . Authors: The main contact address is MASS@stats.ox.ac.uk : please use that for general enquiries. Dr W. N. Venables CMIS Environmetrics Project PO Box 120, Cleveland, Qld, 4163 AUSTRALIA Email: Bill.Venables@csiro.au Professor B. D. Ripley Department of Statistics 1 South Parks Road Oxford OX1 3TG UK Email: ripley@stats.ox.ac.uk Publisher: Links are provided to Springer's home pages in Germany and the USA . Last edited on 2 May 2003 by Brian Ripley ripley@stats.ox.ac.uk
Burns Statistics
Software, consulting, training, mainly for the fund management industry; working papers, tutorials, downloads, other information on quantitative finance and programming in S language (R and S-Plus).
Burns Statistics name="bl" noresize scrolling="no"
S Programming
By William N. Venables, B.D. Ripley; Springer-Verlag, 2000, ISBN 0387989668. In-depth guide for researchers, graduate students, to writing software in either or both S variants: S-Plus, open source R.
S Programming (Venables)-Springer Statistics and Computing Statistics Programs Book Please enable Javascript in your browser to browse this website. Select your subdiscipline Business, Economics Finance Computational Statistics Life Sciences, Medicine Health Physical Information Science Pure Applied Probability Social Sciences Law Theory Methods Home Statistics Computational Statistics Select a discipline Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Online Journals Archive Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom All Author Editor Title ISBN ISSN Series Journals Series Zentralblatt MATH Textbooks S Programming Series: Statistics and Computing Venables, William, Ripley, B.D. 1st ed. 2000. Corr. 3rd printing, 2004, X, 264 p. 10 illus., Hardcover ISBN: 0-387-98966-8 Online orders shipping within 2-3 days. 61.50 About this book | Table of contents About this book S is a high-level language for manipulating, analysing and displaying data. It forms the basis of two highly acclaimed and widely used data analysis software systems, the commercial S-PLUS(R) and the Open Source R. This book provides an in-depth guide to writing software in the S language under either or both of those systems. It is intended for readers who have some acquaintance with S language and want to know how to use it more effectively, for example to build re-usable tools for streamlining routine data analysis or to implement new statistical methods. One ofhe most outstanding strengths of the S language is the ease with which it can be extended by users. S is a functional language, and functions written by users are first-class objects treated in the same way as functions provided by the system. S code is eminently readable and so a good way to document precisely what algorithms were used, and as much of the implementations are themselves written in S, they can be studied as models and to understand their subtleties. The current implementations also provide easy ways for S functions to call compiled code written in C, Fortran and similar languages; this is documented here in depth. Increasingly S is being used for statistical or graphical analysis within larger software systems or for whole vertical-market applications. The interface facilities are most developed on Windows(R) and these are covered with worked examples. The authors have written the widely adopted 'Modern Applied Statistics with S-PLUS', now in its third edition, and several software libraries that enhance S-PLUS and R; these and the examples used in both books are available on the Internet. Dr. W.N. Venables is a senior Statistician with the CSIRO CMIS Environmentrics Project in Autralia, having been at the Department of Statistics, University of Adelaide for many years previously. Professor B.D. Ripley holds the Chair of Applied Statistics at the University of Oxford, and is the author of four other books on spatial statistics, simulation, pattern recognition and neural networks. Both authors are known and respected thorughout the international S and R communities, for their books, workshops, short courses, freely available software and through their extensive contributions to the S-news and R mailing lists. Written for: Researchers, practitioners, graduate students Keywords: S language S programming S-PLUS Print version Recommend to others Additional information Reviews All books by these authors Venables, William Ripley, B.D. Related subjects Computational Statistics Related links Ripley's Website Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
Programming with Data: A Guide to the S Language
By John M. Chambers; Springer-Verlag, 1998, ISBN 0387985034. Premier reference work on S, written by its chief designer, describes new, greatly extended version.
Programming with Data (Chambers)-Springer Statistics and Computing Statistics Programs Book Please enable Javascript in your browser to browse this website. Select your subdiscipline Business, Economics Finance Computational Statistics Life Sciences, Medicine Health Physical Information Science Pure Applied Probability Social Sciences Law Theory Methods Home Statistics Computational Statistics Select a discipline Architecture Design Biomedical Sciences Business Management Chemistry Computer Science Economics Education Engineering Environmental Sciences Geography Geosciences Humanities Law Life Sciences Linguistics Materials Mathematics Medicine Online Journals Archive Philosophy Physics Astronomy Popular Science Psychology Public Health Social Sciences Statistics Please select Africa Asia Australia Oceania Europe France Germany Italy North America South America Switzerland United Kingdom All Author Editor Title ISBN ISSN Series Journals Series Zentralblatt MATH Textbooks Programming with Data A Guide to the S Language Chambers, John M. 1st ed. 1998. Corr. 3rd printing, 2000, XV, 469 p. 4 illus., Softcover ISBN: 0-387-98503-4 Online orders shipping within 2-3 days. 44.00 About this book | Table of contents About this book Here is a thorough and authoritative guide to the latest version of the S language and its programming environment. Programming With Data describes a new and greatly extended version of S, written by the chief designer of the language itself. It is a guide to the complete programming process, starting from simple, interactive use, and continuing through ambitious software projects. The focus is on the needs of the programmer user, with the aim of turning ideas into software, quickly and faithfully. The new version of S provides a powerful class method structure, new techniques to deal with large objects, extended interfaces to other languages and files, object-based documentation compatible with HTML, and powerful new interactive programming techniques. This version of S underlies the S-Plus system, versions 5.0 and higher. Written for: Practitioners Keywords: S Language S programming S-PLUS Print version Recommend to others All books by this author Chambers, John M. Related subjects Computational Statistics Related links Chambers' Website Help | Login | Contact | Shopping cart | About us | Terms conditions | Impressum Privacy statement | Springer. Part of Springer Science+Business Media
Omega Project for Statistical Computing
Joint project to provide variety of open source software for 3 extant statistical languages: S, R, Lisp-Stat. Focus: new directions, more so web-based systems, Java and JVM, and distributed systems.
The Omega Project for Statistical Computing The Omega Project for Statistical Computing Table of Contents Wiki for discussing Omegahat packages and ideas. Recent Activities CRAN-style repository for Omegahat packages Package Binaries for Windows R-2.1.0 Recently Updated packages Aspell An interface to the GNU aspell library for checking the spelling of words and entire documents. RDCOMEvents This package provides a facility to listen for DCOM events from applications such as Excel and Word and others and to process them with R functions. RMatlab An interface between R and Matlab. One can call R functions from Matlab code, and Matlab functions from R code using the syntax of the local programming language. RCurl A package for performing HTTP requests using the C-level cURL library. This is a very flexible, customizable way to handle HTTP-based communications from within R in a higher-level and more extensive way than is directly available via socket connections. This is used by the SSOAP package and a forthcoming package for HTML form submissions. Rstem A package for performing word stemming for use in text analysis. This is an interface to Martin Porter's Snowball generated C code for performing stemming. The package has support for several languages and is exensible. IDocs An experimental package for interactive documents created in XML and rendered using viewHtml in RGtkViewers . This connects the different plugins in a document and across documents using nested environments and a stack that pushes and pops environments as they are entered and exited. XSL files for Omegahat This is a collection of support XSL, DTD and CSS files for Omegahat. The suite allows thefiles to be used via catalogs. SASXML An experimental package for reading XML data in the Open Information Model (OIM) format, e.g. SAS XML files. This might be generalized to have functionality for reading PMML (Predictive Model Markup Language). RDCOMServer A rich, extensible and flexible mechanism for defining and implementing COM classes and objects entirely within the S language. This allows one to make S functions and objects accessible to other applications and programming languages without people having to know the S language. This provids not just access to the R evaluator, but arbitrary S objects. RDCOMClient A mechanism that allows S users to create and use COM objects directly within an R session. RGnomePrint An R interface to libgnomeprint, the Gnome printing library that provides facilities for controlling printing from Gtk widgets, previewing, and generating Postscript, Windows metafiles (and potentially PDF.) GccTranslationUnit A Python module for obtaining reflectance information from C C++ source code. This can be used to programmatically generate S bindings to arbitrary routines, classes and data structures in native code and also build the registration table for routines to be accessed from R. We can also use this to compute on C C++ code, e.g. determining call graphs, free variables. SWinTypeLibs Facilities for reading type information from DLLs, type libraries or (D)COM objects directly in R. This can be used to programmatically generate interfaces to C C++ code. SWinRegistry Read and write access to the Windows registry. For Windows platform only. S language binding to the gtk+extra library. Access to the widgets in the gtk+extra library, i.e. the data-grid sheet display, directory list, icon list and file list. S language binding to the Gdk pixbuf library. Access to the Pixbuf library for reading images into R to be used in RGtk and associated packages. S language binding to the Glade library. S language facilities for instantiating GUIs constructed interactively via the glade GUI builder. This can register S functions or expressions, or C routines specified as callbacks in the glade interface. A plugin event-loop for R. A facility that allows one to dynamically specify a new event loop to use within an R session. This allows one to use Gtk or Tk event loop to drive R. One can write methods for other toolkits such as Carbon, Qt, etc. S language binding generator for Gtk-based libraries. A package that creates S and C code to interface to arbitrary Gtk-based C libraries and Gtk classes such as Gtk itself, Zvt, gtk+-extra, gtkhtml, embedded Mozilla, etc. R SPlus XML Parsing package Parse and create XML documents within the S language. RGtk package Bindings for programming GUIs using Gtk and extended widget sets. An R-XLisp interface Interface between R and XLisp allowing R code to call XLisp functions. RObjectTables package Framework for user-defined search path elements, alternative automatic serialization, external variables, etc. Sxslt package Bi-directional interface between R and libxslt, providing XSLT facilities within R and R facilities in XSLT rules. RGtkViewers package A collection of GUI tools for viewing different information, built using RGtk. RSMethods Formal S classes and methods for R. RSPython a bi-directional interface allowing calling R functions from Python code and accessing Python objects, classes and functions from R sessions. RSPerl a bi-directional interface allowing calling R functions from Perl code and accessing Perl objects, classes and routies from R sessions. RGnumeric an R plugin for Gnumeric that allows Gnumeric users to call R functions from within a spreadsheet, and for R programmers to access Gnumeric sheets and their contents from within R functions. R embedded in Xalan, the XSL translator Use R to generate output in and control transformation of XML documents using XSL functions R Plugin for Netscape A plugin for Netscape that allows one to call R from JavaScript and JavaScript from R. These are just some of a complete collection of Omegahat packages for R and S-Plus . Omega is a joint project with the goal of providing a variety of open-source software for statistical applications. The Omega project began in July, 1998, with discussions among designers responsible for three current statistical languages (S, R, and Lisp-Stat), with the idea of working together on new directions with special emphasis on web-based software, Java, the Java virtual machine, and distributed computing. We encourage participation by anyone wanting to extend computing capabilities in one of the existing languages, to those interested in distributed or web-based statistical software, and to those interested in the design of new statistical languages. Software is being developed for the project; we refer to it as the omegahat software, to emphasize in typical statistical terminology that we are starting on a process of approximating the ideal software through many iterations, among other reasons . Follow the pointers below to find out more about the omegahat software. Organization of the Software. Documentation. Mailing Lists. . Source Binary Distributions. Related Software. Philosophy Related Software Some of the many areas in which Java packages may be of value to statistics include: the JDBC database connectivity software, providing a general interface to database systems, extended by some facilities typically needed in statistical applications; numerical computations for linear algebra (e.g., work is currently proceeding on two Java matrix and linear algebra packages called JAMA and COLT ); processing and analysis of images---can we combine computational techniques with the flexibility of graphics and user interface tools in Java; graphics---possible new models for statistical graphics; dynamic reporting -- the Java packages supporting XML , lightweight components ( Swing Java Foundation Classes ), HTML viewers and network-distributed computations make the Omega environment useful for generating reports with live objects. In many of these areas, there have been questions about the speed attainable by Java. Investigating such questions is part of what we want to do. Policy Specific goals and procedures are still being developed, but the current policy includes the following. The code developed will be created and offered as open-source software, under a public license similar to the licenses used for Linux, Netscape, and R. Contributions are encouraged in the form of software compatible with the three-level structure shown above. This includes but is not restricted to: Java packages; software in other languages, if it can be structured as a module defined in CORBA; software for the interactive languages built in Omega. We anticipate organizing software into layers, including at least two: a general contributed software layer and a central layer for core Omega facilities. We have established a number of mailing lists for exchange of ideas. These include lists for general discussion, for Omega packages, for interactive languages using Omega, and for technical issues about Omega itself. Membership The current core group of Omega developers includes: Douglas Bates John Chambers Di Cook Peter Dalgaard Robert Gentleman Kurt Hornik Ross Ihaka Friedrich Leisch Thomas Lumley Martin Mchler Guido Masarotto Paul Murrell Balasubramanian Narasimhan Brian Ripley Gnther Sawitzki Duncan Temple Lang Luke Tierney Bill Venables Participation in the general and special-purpose software work of the Omega project is open to anyone interested in our goals. The mailing lists are a good place to start; in particular omega-devel@omegahat.org is a list for discussion of the general development of software for the project. The success of the Omega project is highly dependent on the involvement of a wide range of participants in many different areas. We can all benefit. The Omega Project Umbrella As well as developing software ourselves, the project also hopes to support other development efforts. To this end, Doug Bates has generously allowed his machine to be used for distributing code for different projects. These projects include. RS-DBI: Database connectivity for both R and S. More general details are also available .
Averill M. Law and Associates
Simulation products and services, providing the ExpertFit statistical package, simulation training, and simulation consulting.
Simulation Consulting, Simulation Training, and the ExpertFit Distribution-Fitting Statistical Software by Averill M. Law Associates Simulation Consulting, Simulation Training, and the ExpertFit distribution-fitting statistical software by Averill M. Law Associates Averill M. Law Associates, Inc. A world leader in simulation training, simulation consulting, and distribution-fitting software since 1977. Simulation Training - Simulation Consulting - ExpertFit Distribution-Fitting Software Simulation Industry NewsTM - About Averill M. Law Associates - Request More Information Last updated 11 04 2005
ScaleTrans
Windows application for the transformation and visualization of psychodiagnostic scale values and values of empirical scales. User-defined scales, probability calculator, visualization, im- export, conversion tables.
www.otwesten.de News DriveSitter is a full-featured HDD analyzation, health diagnostic and background monitoring tool for IDE hard disk drives based upon modern S.M.A.R.T. technology. DriveSitter reliably detects and forecasts up to 70% of all sudden HDD failures before they happen. You will be alerted of any unhealthy condition by various notification methods, including emails and network messages. Read more about S.M.A.R.T. or DriveSitter or download the 30 days shareware version now. Check out if one of our freeware tools meets your needs. As the designation implies, you can download these tools totally free and use them as much as you want. Have fun! Check it out! Welcome to www.otwesten.de 09 27 05DriveSitter v1.4 released! Here we are with a new update v1.4 of DriveSitter with some long awaited new features: DriveSitter now supports up to 24 S.M.A.R.T. capable IDE devices on Windows NT4 2000 XP. You can now view the stock data in a convenient Data Viewer. It even displays temperature values. An alert advisory text is appended to the S.M.A.R.T. test reports and optionally added to message box and email alert notifications. No gory details, just plain English. The attribute time series graph is visually improved with a colored traceline for easier trend interpretation and data point mouse attraction for easier data review. We have improved many visual components to support XP styles. Some minor fixes and enhancements. Try it 30 days for free and tell us what you think! 01 23 05DriveSitter v1.3.5 released! DriveSitter v1.3.5.0 has just been released and comes with some improvements and additions. Capability to shutdown, suspend or hibernate the computer system on alert. More information on partitions: Creation date time of NTFS volumes, bootability, subst'ed volumes. Optional S.M.A.R.T. status report generation on every poll. Usage of one central message box dialog. Debug logging capability. Some minor fixes and enhancements. Try it 30 days for free and tell us what you think! 09 27 04DriveSitter v1.3.1 released! DriveSitter v1.3.1.0 has just been released! In this minor update, we added capability for advanced status report creation, per-manufacturer S.M.A.R.T. attributes, fixed some bug and changed some annoyances. DriveSitter now supports per-manufacturer S.M.A.R.T. attribute detection. This new capability allows us for detection of manufacturer proprietary attributes. Voluminous status reports with selectable content can be created in plain-text or HTML format. The manufacturer detection has been improved. Auto-resize of lists have been fixed and improved. Some minor fixes and enhancements. Try it 30 days for free and tell us what you think! 06 12 04DriveSitter v1.3 released! DriveSitter v1.3.0.0 has just been released! Since the HDD temperature is the fastest varying S.M.A.R.T. attribute by far and is very important to prevent damage, fatal failures and data loss caused by overheating, Most of the new features concentrate on improving DriveSitter's HDD temperature handling. DriveSitter now implements a separate stock for the HDD temperature and separately defineable polling intervals. Intelligent temperature polling intervals provide protection from unnoticed HDD overheating while conserving system resources. The HDD temperatures can optionally be displayed in the system tray. Automatic downtime detection for temperature attributes improves the quality of forecasts on the HDD temperature development over time. Some minor fixes and enhancements. Try it 30 days for free and tell us what you think! 04 17 04DriveSitter v1.2.0.1 released! DriveSitter v1.2.0.1 has just been released to fix some bugs and shortcomings of version 1.2.0: Correctly calculates hard disk drive capacities 137.5GB Optionally do not poll S.M.A.R.T. while device is in power saving mode (sleeps) Minor fixes. 03 05 04DriveSitter v1.2 released! DriveSitter v1.2 has just been released and comes with new and exiting featured: Minimize false T.E.C. Date warnings by configurable T.E.C. alert thresholds. Review advanced details of each volume. Log alerts to an alert log file, in the local events log and any event log in a network (WinNT4 2000 XP) for centralized alerts review. Stay up to date by the now build-in internet updater. XP theme support, customizable toolbar, and more... Try it 30 days for free and tell us what you think! 01 11 04New American Reseller + New Pricing Model We are happy to launch our Online-Store, hosted by our new American reseller eSellerate . Customers outside the European Union who use our online store to order by credit card will not pay V.A.T. markup anymore. Due to the new situation, we introduce a new pricing model for all our products. We hope that this new model is as fair and attractive as the old one was. 12 01 03DriveSitter v1.1 Invites Guests! 12 05 03DriveSitter v1.11 BUGFIXES S.M.A.R.T. diagnostic and monitoring for everyone! This is probably the most exciting new feature for business use of DriveSitter v1.1 on WinNT4 2000 XP: You do not need administrative privileges anymore to monitor your HDDs with DriveSitter - even a guest account will do it. But that's not the only new feature: DriveSitter now displays life statistics of your HDDs, offers two new and very useful visualization modes, 5 temperature scales, optional raw S.M.A.R.T. values in hex and more! Try it 30 days for free and tell us what you think! 11 18 03ScaleTrans v1.04 + price cut by 28% ScaleTrans v1.04 (free, minor update) has just been released by now. The updates includes significant speed improvement on calculation of huge empirical datasets, some GUI updates, an update of the setup engine and the license scheme. More good news: Prices for ScaleTrans have been reviewed and significantly reduced by 28%! As before, ScaleTrans is free for private use. If you are a psychologist or diagnostician working with standard scales and do not already know ScaleTrans, just try it out now! 11 18 03DriveSitter v1.0 Shareware now online! We are proud to release the first version of DriveSitter , a brand new HDD health diagnostic and monitoring tool for IDE hard disk drives. Try it 30 days for free and tell us what you think! ScaleTrans is a software tool for professional psychologists or diagnosticians working with psychological standard scales. ScaleTrans converts standard scales like T-scale, Z-scale, IQ-scale, Stanine, percentage rank etc. and allows the creation of advanced user-defined scales either based on theoretical distributions or empirical data. Read more about ScaleTrans or download the free personal version now. Eine deutsche Version von ScaleTrans ist hier verfgbar. You might want to get in contact with us, and we are looking forward to receive your mails with questions, suggestions, accolades or criticism. Contact us!
StatCalc
PC calculator that computes table values and other statistics of 34 probability distributions; includes some nonparametric and bivariate normal distribution.
StatCalc Professor K. Krishnamoorthy [Dept of Mathematics, UL Lafayette, Lafayette, Louisiana, USA] To download: Right-click on the file, then select 'Save Target As...' StatCalc StatCalc 1.1 Description: StatCalc is a PC calculator that computes table values of many statistical distributions (see the screen shots below). It also computes moments and small sample confidence intervals for discrete distributions. This software comes with help files in WinHelp format. StatCalc 1.1 is a freeware. Operating Systems: Windows 95 or above Disk space : 1.8MB StatCalc 2.0 Table of Content Fortran Programs... Comments to krishna@louisiana.edu 1. Noncentral t Fortran program to evaluate the cdf of the noncentral t [Benton, D. and Krishnamoorthy, K. (2003). Computing discrete mixtures of continuous distributions: noncentral chisquare, noncentral t and the distribution of the square of the sample multiple correlation coefficient. Computational Statistics and Data Analysis, 43, 249-267] 2. Noncentral chi-square Fortran program to evaluate the cdf of the noncentral chi-square [ Benton, D. and Krishnamoorthy, K. (2003)] 3. Two Proportions Fortran program: computes the p-value for testing the difference between proportions from two finite populations. [Krishnamoorthy, K. and Thomson, J. (2002). Hypothesis testing about proportions in two finite populations. The American Statistician, 56, (2002), 215-222.] 4. Power : Two Proportions Fortran program: computes the power of the test (3) for the difference between proportions from two finite populations. [Krishnamoorthy, K. and Thomson, J. (2002)] 5. Two Poisson Means Fortran program: computes the p-value for testing the difference between two Poisson means. [Source: Krishnamoorthy, K and Thomson, J. (2004) A more powerful test for comparing two Poisson means. Journal of Statistical Planning and Inference, 119, 249-267] 6. Power: Two Poisson Means Fortran program: computes the power of the unconditional test for the difference between two Poisson means. [Krishnamoorthy, K and Thomson, J. (2004) A more powerful test for comparing two Poisson means. Journal of Statistical Planning and Inference, 119, 249-267] 7. Lognormal mean Fortran program: computes confidence limits for the mean of a lognormal distribution. [Krishnamoorthy, K. and Mathew, T. (2003) Inferences on the means of lognormal distributions using generalized p-values and generalized confidence intervals. Journal of Statistical Planning and Inference, (2003), 115, 103 121] Help7.pdf 8. Power: Lognormal mean Computes the power of the test in (7). For a given mean and standard deviation of the logged data, and the sample size, this program computes the power of the test in (7). Help8.pdf 9. Lognormal: Two-sample Computes the p-value for testing the difference between two lognormal means. Also, computes the confidence interval for the difference between the means. Help9.pdf 10. Lognormal: Power for Two-sample Test Computes the power of the test (9) for testing the difference between two lognormal means. Help10.pdf You are visitor ! ... since March 3, 2001
ESBPDF Analysis
Probability Distribution Calculator for Win32.
ESBPDF Analysis Home page ESBPDF Analysis Home page Home Registration Benefits Educational Licensing Purchase License Details Reg User Site (Password Required) ESB Consultancy Home ESB Calculator Home ESBStats Home ESBPCS Home Probability Analysis made easy for Windows. Current Release: v2.2 on 21 Oct 2005 Current Trial Release: v2.2 on 21 Oct 2005 Grab What's New: text or zip Downloads Support ESBPDF Analysis provides an easy-to-use tool for using Discrete and Continuous Probability Distributions in a single application. Most Tables and supplied functions (such as in MS Excel) give P (X A) and using algebra other results can be found whereas ESBPDF Analysis is Probability Analysis Software that handles all the combinations for you. Features include Binomial, Poisson, Hypergeometric, Normal, Exponential, Student t, Chi Squared, F, Beta and Lognormal Distributions; Inverses of Normal, Student t, Chi Squared, F, Beta and Lognormal Distributions; Lists of Binomial Coefficients, Factorials and Permutations; Calculations of Gamma and Beta Functions; Printing of Standard Normal Tables and Critical t Values; Fully Customisable; Inbuilt Scientific Calculator; Integrated Help System which includes a Tutorial. Ideal for the Maths Stats Student who wishes to understand Probability Distributions better, as well as the Maths Stats Buff who wants a well designed calculating tool. Also of use for people involved in Financial and Economical modelling. We also plan on adding many more Distributions and features. Requirements: ESBPDF Analysis has been designed for Win32 systems and has been tested under Microsoft Windows 95 OSR2, Microsoft Windows 98, Microsoft Windows Millennium, Microsoft Windows NT 4 SP6, Microsoft Windows 2000, Microsoft Windows XP, Microsoft Windows 2003 and Microsoft Windows Vista (Beta). It has been optimised for use with Microsoft Windows XP. Trial Downloads ESBPDF Analysis Trial v2.2 - (2,304 Kb 21 Oct 2005) Includes Installer UnInstaller - trial version does not allow printing and will run only 20 times. ESBPDF Analysis Trial v2.2 - No Install - (2,067 Kb 21 Oct 2005) No Installer, all the files just in a zip file - trial version does not allow printing and will run only 20 times. The Registered version is different to the Trial version - Registered Users need to download from the Registered Users page. Support ESB Newsgroups - There is a dedicated forum for ESBPDF Analysis. ESB Online Forums - There is a dedicated forum to ESBPDF Analysis. This is in fact the same as the above Newsgroup. You also have the option of RSS Feeds from this site. So you can have you choice of NNTP, Web or RSS and any combination of them. Mail - We are always happy to receive support emails from our customers. Website Developed using PageBlender Website Checked using CSE HTML Validator Professional Screen Captures made with HyperSnap-DX 1999-2005 ESB Consultancy email support ESB Consultancy Home Page Last Updated:11:31pm 20th October 2005 Trademark Acknowledgments: Microsoft Internet Explorer, Office, Access, Excel, Word, FrontPage, Win32, Win95, Win98, Win NT, WinXP, Win2003, Visual Studio, Windows and Windows NT Server Workstation, Microsoft Internet Explorer logo and Windows Flag logo are registered trademarks or trademarks of Microsoft Corporation in the United States and or other countries. Borland, the Borland logo, Delphi, C++ Builder, C Builder, JBuilder, Kylix and the Delphi logo are trademarks or registered trademarks of Borland Software Corporation in the United States and other countries. Other brand and product names are trademarks or registered trademarks of their respective holders.
Visual Data Interfaces
Statistical process control (SPC) ActiveX components and consulting.
VDISoft Home Page This page uses frames, but your browser doesn't support them.
Nonparametric Statistical Analysis
ActiveX program to perform nonparametric testing (e.g., Kruskal-Wallis, Friedman).
Nonparametric Statistical Analysis (Kruskal-Wallis, Friedman) Nonparametric Testing William A. Levinson, P.E., CQE This is a freeware (online ActiveX) program to perform nonparametric tests. It requires Internet Explorer 4 (Service Pack 2 or higher) or version 5 to operate. What it does Accepts data from the clipboard, e.g. data you copy from a spreadsheet. The data columns must contain the Block, Treatment, and Measurement. The first two may be alphanumeric. When there is no blocking, insert a dummy (e.g. "None") for the block. The measurement must be a real number. Performs one of the following nonparametric tests: Kruskal-Wallis rank sum test (similar to one-way analysis of variance) Allows removal of block effects, e.g. if different product or material lots (blocks) are subjected to the treatments of interest. The Friedman test assumes one replicate of each treatment for each block; it does not (apparently) work when there are several replicates of each treatment for each block. This methodology- use of aligned observations, or observations whose block averages have been subtracted before ranking- is not yet proven or documented for the Kruskal-Wallis test. Use with caution. Also shows block ranks when blocking is present. If aligned ranks are used, there should be no block effects, i.e. no significant differences between the blocks. Friedman test for balanced complete block designs: each block or specimen gets one replicate of each treatment. Friedman test with aligned observation ranks. Aligned ranks are computed by (1) subtracting each block's average from each measurement in the block, thus removing block (specimen, lot) effects, and then (2) ranking the aligned observations against each other. Shows the results. ActiveX page with the program The program has been marked as safe for initialization and scripting. It writes a file called nonparam.txt to your hard drive; this is simply a copy of what you place on the clipboard. It does not write anything else to your hard drive unless you tell it to, e.g. to save a chart as a bitmap file. Data Format for Input This is how your data might look in a spreadsheet. Alphanumeric is O.K. for Block and Treatment. Copy your data (do not include the headers "Block," "Treatment," "Response") and click the appropriate button on the display. The tab character is the default column (field) separator, and it works for data that are copied from Excel spreadsheets. The program will read your data from the clipboard and perform the analysis. Block Treatment Response None Group I 262 None Group I 305 None Group I 297 None Group II 284 ... ... ... Testing The program has been tested against examples in Wayne W. Daniel, 1990. Applied Nonparametric Statistics, 2nd ed. Boston: PWS-KENT Publishing Company. Example 6.2, Kruskal-Wallis test; reproduces book answer Problem 6.7, Kruskal-Wallis test; reproduces book answer Example 7.1, Friedman test; reproduces book answer Example 7.2, Friedman test with aligned ranks; reproduces book answer Problem 7.3, Friedman test; reproduces book answer for chi square (12.25). W corrected for ties is 0.8167. The text shows 0.766 (no correction for ties) Note: This program's output does not constitute consulting engineering advice. Such advice can be provided only in person by an engineer who is registered to practice in your state. Levinson Productivity Systems, P.C. William A. Levinson, P.E., MBA Principal American Society for Quality CQE, CRE, CQM, CQA, SSBB Society of Manufacturing Engineers CMfgE, CEI 570-824-1986 Send Mail TheBoss@SPAMBLOCKct-yankee.com or wlevinso@SPAMBLOCKix.netcom.com IMPORTANT: delete "SPAMBLOCK" from your address line before sending. Spammers: see contractual terms of use regarding addresses in this domain. Home Page ct-yankee_nonparam_index
Gage Capability
ActiveX program to perform gage capability (reproducibility and repeatability) studies.
Gage Capability (Reproducibility and Repeatability) Gage Capability (Reproducibility and Repeatability) William A. Levinson, P.E., CQE This is a freeware (online ActiveX) program to perform gage studies. See Levinson and Tumbelty, 1997, SPC Essentials and Productivity Improvement: A Manufacturing Approach . It requires Internet Explorer 4 (Service Pack 2 or higher) or version 5 to operate. What it does Accepts data from the clipboard, e.g. data you copy from a spreadsheet. The data columns must contain the Operator, Specimen, Replicate, and Measurement. The first three (operator, specimen, and replicate) must be integers. The measurement must be a real number. The sample data file contains an example of the format, and you can use it to try the program. (Do not copy the column labels, copy A2..D121 to reproduce the results in SPC Essentials and Productivity Improvement, pp. 171-172) Performs a gage capability study by means of: the General Motors long form method (uses sample ranges and control chart factors) (other methods may be added later, e.g. Analysis of Variance variance components) Generates a range chart that shows sample ranges for each operator and specimen. For detection of outliers The bitmap chart can be saved for copying into reports ActiveX page with the program Help file for the program (gage_cap.hlp) Help file contents (gage_cap.cnt) Download the .hlp and .cnt files to have a Windows Help file with a table of contents Sample data in an Excel file (gage_cap.xls, version 5 95 for compatibility with older spreadsheets) The program has been marked as safe for initialization and scripting. It writes a file called gage_cap.txt to your hard drive; this is simply a copy of what you place on the clipboard. It does not write anything else to your hard drive unless you tell it to, e.g. to save a chart as a bitmap file. Note: This program's output does not constitute consulting engineering advice. Such advice can be provided only in person by an engineer who is registered to practice in your state. Levinson Productivity Systems, P.C. William A. Levinson, P.E., MBA Principal American Society for Quality CQE, CRE, CQM, CQA, SSBB Society of Manufacturing Engineers CMfgE, CEI 570-824-1986 Send Mail TheBoss@SPAMBLOCKct-yankee.com or wlevinso@SPAMBLOCKix.netcom.com IMPORTANT: delete "SPAMBLOCK" from your address line before sending. Spammers: see contractual terms of use regarding addresses in this domain. Home Page ct-yankee_gagecap_index
Statistical Trending And Reporting System
21 CFR Part 11 compliant trending tool that includes linear regression, shelf life estimation, graphical analysis, SPC SQC, and environmental trending.
STARS Integrative Solutions LLC :: Home :: Contact us :: Feedback :: Site Map | About us | Products | Services | Support | STARS | Search STARS The Statistical Trending And Reporting System ( STARS) is a fully validated software package designed to meet the trending and reporting needs of the Pharmaceutical laboratory. STARS is an easy to use 21 CFR Part 11 Compliant application. STARS is a database application that can be easily configured to work in any commercial database. STARS also leverages the power of SAS to perform several key analyses such as ANOVA, ANCOVA, and Linear Regression. STARS contains several modules, which can be purchased separately, that perform the most common trending and reporting functions required within Pharmaceutical laboratories. The four modules are: Stability, Release SPC, Environmental Monitoring and Annual Product Review. A description of the base product and each module is found below. Common Features to A ll Modules Universal Data Interface STARS is configured with an easy to use LIMS import routine that connects to all ODBC-compliant LIMS. All that is required is the addition of a View object within each LIMS for the user identified stability data fields. STARS can retrieve data from multiple LIMS environments within one project. STARS is designed to accept stability data directly from your LIMS but it can also accept stability data from a CSV-formatted text file, EXCEL file, MS-ACCESS database or SAS dataset. Data Editing Features STARS provides an easy to use Graphical User Interface that allows users to edit data in a spreadsheet like grid. The most common editing features are available such as Find Replace, Cut, Copy, Paste, etc. STARS also provides an integrated calculated column feature which allows users to create Excel-like formula columns. Statistical Graphical Analysis STARS utilizes the powerful SAS statistical analysis software to easily perform the complex calculation required during stability data analysis. Here are just a few of the standard calculations STARS: Analysis of Variance Linear Regression Weighted Regression Scatter Plots Residual Plots Identification of Potential Outliers In addition, STARS offers an Adhoc SAS procedure window that allows users to write and submit their own customized SAS programs. These Adhoc requests are fully audit trailed. Adhoc Report Generator STARS is configured with an Adhoc Reporting Tool that allows users to create their own custom reports. Users can select fields for reporting, identify sort and group by options as well as a SQL-like selection language for sub setting datasets. Users can save reports as templates that can be shared between other users and projects. Reports can be created in either RTF (Microsoft Word Document), html or PDF format. STARS generates many graphical plots to aid in the statistical analysis process. These plots are created as either PNG or ActiveX files. Custom Analysis STARS allows users to add their own custom Crystal Report templates or SAS procedures to a Custom menu. We also provide custom programming services for more complicated features such as specialized release and shelf life calculations, custom graphical analyses, and much more. 21 CFR Part 11 Compliance STARS has been designed and tested using GAMP guidelines. The Quality Assurance Program at Integrative Solutions specifies the production of Validation Master and Project Plans, Configuration Management, and Change Control. Functional Requirement and Design Specifications have been issued for STARS . Controlled System Test Specifications have been executed and Summary documents have been issued which detail the testing results. Validation protocols may be audited by appointment at the Integrative Solutions office in Towaco, NJ. STARS includes functionality to meet the Electronic Records and Electronic Signatures rules of 21 CFR Part 11 as they relate to "Closed" systems. STARS has multiple levels of security including password expiry. Each user can have different security rights. The full audit trail includes references to the date and time of the change, the user that made the change, the type of change made and a description of the change. Stability Module Adds These Features to the Base Product: Shelf life projections Release Limit Calculations Trend Analysis Outlier Detection Homogeneity of Variance Testing Projections based on one-sided or two-sided confidence intervals Can vary how limit-of -detection values are handled Performs Analysis of Covariance (ANCOVA) for pooling of multiple studies Reports and Graphs can be saved in either RTF, PDF or HTML formats Standard and Accelerated Conditions STARS determines shelf-life for standard conditions using the 95% confidence interval (upper, lower or two-sided). ANCOVA calculations for determining the validity of pooling multiple studies which are assigned a Model I, II, III, or IV designation according to ICH guidelines. Trend Analysis The trend analysis function in STARS allows you to enter an expiry period value and calculates a Release Limit range that the result should be in using either the 95% confidence interval or the method described in the article "Establishing Shelf Life, Expiry Limits, and Release Limits" by John Murphy and Jeffrey Hofer, Drug Information Journal, Vol. 36, pp. 769-781, 2002. Automatic Model Selection STARS has been designed to provide an Analysis of Covariance with an automated model selection routine. All you have to do is enter in the complete starting model and identify the batch term (if any) and STARS can determine the final model of significant terms in a few seconds. Release SPC Module Adds These Features to the Base Product: Control Charting Trend Analysis Process Capability Analysis including all Capability Indices such as Cp, Cpk, Pp, and Ppk SPC analysis including X-bar (Mean), X-bar and Range, X-bar and Standard Deviation, Range, Standard Deviation, Exception report, Frequency, Distribution, Histogram, Individuals chart, Moving average chart, Moving average range, Normality test, NP chart, Out-of-control list, P chart, Pareto charts, Primary control limits, R and R study, R chart, Robust chart analysis, CuSum, V-Mask, EWMA Reports and Graphs can be saved in either RTF, PDF or HTML formats Environmental Monitoring Module Adds These Features to the Base Product: -Scheduled Release in 2006 Annual Product Review (APR) Module Adds These Features to the Base Product: -Scheduled Release in 2006 Our Customers Click Here to Request Additional Information on STARS! Home | Aboutus | Contactus | Products | Services | Support | Feedback | Sitemap STARSDemo Copyright 2005 Integrative Solutions LLC. All rights reserved
2D Curve Fitting
Online curve fitting and data plotting software based on Pade (rational) approximants.
Online Structural Engineering Software | Beam Bending | Curve Fitting | Stress Analysis of Truss, Shell Plate | Buckling Software for Structures Welcome SOFTWARE FOR STRUCTURES is a software development, research and consulting firm. Our software goal is to have a website where structural engineers and analysts, educators, and students can find a collection of powerful, useful, and easy to use online calculations and models. Our specialty is analysis of structures: beams, trusses, columns, plates and shells. Our programs include the disciplines of civil, mechanical, spacecraft, aviation, chemical engineering, and science. We provide solutions to very common problems like bending of plates, statically determined and indeterminate (continuous) beams, stress analysis of trusses, buckling of plates and columns, as well as complicated problems of nonlinear behavior and stability of thin shells. In our online structural engineering software we use the typical methods for simple structures (beams and trusses) providing the clients with all main steps of the solution, which is especially helpful for student training. For solving complex problems, for instance problems of nonlinear shell theory, we apply our know-how approaches based on our previous research. We provide the best online curve fitting (data fitting) calculation, whose result is represented by graphs and simple-to-use formulas based on generalized Pade (rational) functions. The accuracy of data fitting can be managed by choosing values of correlation coefficient or error of approximation or number of coefficients of Pade function. This curve fitting calculation is getting popular among chemical, material and reliability engineers as well as experimental researchers. Bending of beams and plates, buckling of plates and columns are the most important parts of Structural, Civil and Mechanical Engineering courses at university level. Our online software could be used by students for self-training and is very helpful by completing assignments because it provides all main steps of solutions. SOFTWARE FOR STRUCTURES is located in Toronto, Ontario, Canada, and was formed in 2002. It is owned and operated by Alex Yevkin, Ph. D. in Structural Engineering, Doctor of Science in Applied Mathematics, and Gleb Yevkin, B.Sc. in Computer Science. In addition to software development, SOFTWARE FOR STRUCTURES provides consulting and research in the areas represented by our software. As you surf through our website, you may notice that all calculations are free. Please let us know by email: info@soft4structures.com what other software you would like to see developed. Bending of beams and plates on the elastic foundation is coming soon.
Sagata Ltd.
Develops and sells business statistics software, has a professional regression package with Microsoft Excel interface.
Sagata - Business Statistics Home | Store | Contact Us Quick Links S.R. Standard S.R. Pro Updates Announcements 83% customers recommend SR Pro! more Fully functional SR Pro Demo Version more Time-limited licensing more Sagata Regression Professional 2004 Professional regression software with the familiarity and comfort of Microsoft Excel. Special features: Categorical factors, interactive 3D surface plots, robust regression, powerful custom modeling options, automatic model searches... more details Training and Consulting Bring our elite and friendly staff on-site to help you with the efficient solution of business problems. more details Sagata Regression Professional 2004 Professional regression software with familiarity and comfort of Microsoft Excel. Special Features: Categorical Factors Interactive 3D Surface Plots Robust Regression Powerful Custom Modeling Options Automatic Model Searches more details Home | SR Standard | SR Pro | Updates | FAQs | News | Resources | ContactUs 2004 Sagata Ltd. All rights reserved. Read our privacy policy . Send us your feedback . Website design by Mile-End-Media
LeoStatistic
Data visualization and statistical analysis. Distribution histograms, curve and surface fitting, multivariate regression, near neighbors estimation etc.
Building histogram, curve fit, multivariate regression, data modeling software. LeoKrut Store Products Registration Service Career Links Management Contact . LeoCrystal - crystal growth simulation, LeoStatistic - data visualization and statistical analysis, LeoFetch - internet robot, LeoNetCDF - NetCDF editor for MS Windows, LeoPicture - Photoshop and image analyzer LeoStatistic software for data presentation, statistical analysis, marketing and prediction. Free download: LeoStatistic.zip or LeoStatistic.exe (selfextracting winzip file) Free 3 hours for testing of full version. Registration fee only from $9.98 Introduction Data Structure of data Import data Data manipulation Data visualization Statistics Data analysis Statistics Matrix of correlations Histograms of distribution Curve fit Peaks revealing Multivariate regression Target marketing Results presentation Legend title and axes Chart fashion Zoom and view point Preciseness selection Export results Inter and extrapolation Samples View function Histogram Taylor polynomials X-ray diffraction curve Fit curve in space Crystal growth Popular statistics and data analysis Introduction and authors soliciting Random numbers calculus Is market predictable? LeoStatistic - building histogram, curve fit, multivariate regression, data modeling software. Introduction Operation system: MS Windows 95 NT and higher. Version: 11.7 last modification at Aug. 26, 2005. Type: Commercial. Main features of LeoStatistic software application: Data Import data series (tables) from: database (MS Access for example) table or by custom SQL request; text file; copy paste from spreadsheet (MS Excel); get them from chart image or type in spreadsheet like data control. Operate more then one data series (tables) at the same time. Virtually unlimited * number of records to present and analyze. Recognition of calendar mm dd yyyy data format transferring it into yyyy.yyyy to use for market (currencies, shares, commodities) time series trend analyzing. Add and modify a parameters in data series by user defined formulas or simple incorporated schemes. Visual presentation and statistical analysis: Calculating matrix of correlations for all parameters in first data series and visually presenting them as a table of x-y charts. Building histograms of variable distributions comparing them with Student and Poisson probability densities. There is an option to calculate distributions conditioned to other parameters. Visual presentation in form of X-Y chart of correlation between two variables plus an ability to implement a variety of curve fitting schemes for approximation to find best matching formula. Three dimensional histogram for distribution of two variables. There is also an option to present it as a color map. Three dimensional, in perspective projection presentation of variable as a function of two arguments and multivariate approximation of it as a plane or parabola like surface. Linear and parabolic multivariate regression of number of arguments. Near neighbors method for multivariate estimation of value on the premise that closest in multidimensional space points have alike values. Calculation of probability score for chosen variable (response) to be more then given value for defining a pool of prospective customers. Results. Visualized data and abstract of statistical results are displayed on the screen in report-ready form. Detailed statistical formulas and coefficients are shown at the result panel. User has ability to copy paste screen chart as a bitmap picture into MS Office applications as well a content of result panel in the table format. There is an option to instantly create a MS Word document with a result chart and text content of the result panel. A calculation of value for the given set of arguments for active statistical scheme when available (few logical exclusions applied). A modeling of the array of arguments is defined in text file on the base of active statistical scheme with the option to sort results and save in text file. This option can be used for prediction of data behavior including selection of most perspective candidates (consumers). Interface. Transparent and self-explanatory user interface conveniently located at control panel of application. No more than three clicks are ever required to edit statistical schemes or presentation options. Screenshots of the LeoStatistic software: click on picture to enlarge Building histogram Distribution of two variables. Approximation (constructor style interface). 3D view. DOW trend. Signals revealing. Near neighbors method. Harmonic analysis. Fit with free format formula. Curve fit of crystal growth rate. Get data from image file. * Programmable limitation on the number of records is 232. (1010) Another limit of the software is time consumption and depends on the available memory and processor speed of the computer. For different statistical schemes times of calculations could be remarkable different. In general one can say that for less then thousand records any statistical schemes will perform practically instantly. Home LeoFiles Products Maverick Guestbook Links Service Contact Copyright by LeoKrut 2002-2005
Least Squares Method Program
A nonlinear least squares fitting program that handles input errors or a covariance matrix on each axis. The curve fitting can use many curves simultaneously and stick them together with their parameters or points, in many dimensions.
Least Squares Method Curve Fitting Program to download. Nonlinear Weighted Least Squares Regression Analysis. Multidimensional Least Squares Fitting Software. Errors in X and Y. LEAST SQUARES METHOD CURVE FITTING PROGRAM Brief description of the program. LSM program performs Least Squares Nonlinear Regression Analysis. The method is also called: Curve Fitting, Least Squares Fitting, Least Squares Method, Least Squares Estimation, Least Squares Approximation. The program fits parameters of curve(s) given analytically to given points. LSM program can carry out nonlinear regression analysis (curve fitting): in many dimensions, with input errors in the directions of all axes, using input covariances, if needed, using many curves approximated simultaneously, curves may be stuck with some their parameters as well as with some points. Tens of elementary functions are available (to create any curve equation). The goodness of fitting can be controled by the chi-sqr quantity. Fitted (estimated) points and their uncertainties can be shown. Data in spreadsheet format. Least Squares Nonlinear Regression Analysis, Curve Fitting Each function must have the form of an expression obtained by transferring all terms to one side of equation. Example: replace your fitting formula z = a1*x2 + a2*y + a3 with x3= a1*x1^2 + a2*x2 + a3 and write it in the involved form F(x1,x2,x3)=0, without the "=0" part: a1*x1^2 + a2*x2 + a3 - x3 Curve Fitting, Least Squares Method, Least Squares Fitting This form enables applying complicated curves that are not a graph of any function, applying complicated curve equations from which none of variables can be derived as well as transforming equations to be always computable. The last case may be useful when some point coordinate or a parameter value being changed during computation temporarily go beyond domain boundary. Nonlinear Least Squares Regression Analysis Use the LSM program especially when the point uncertainties are in many axes and they are all known, or point covariance matrix is known, or the problem is in more than two dimensions, or the curve is not a graph of any function (e.g. a circle), or the curve is given by an equation from which no variable can be derived, or you use a combination of curves stuck with points or parameters. Least Squares Method, Least Squares Estimation On the basis of input errors, the chi-sqr parameter and its standard deviation is calculated (chi-sqr expected value equals the number of degrees of freedom). If the chi-sqr value obtained is close to the number of degrees of freedom (i.e. the number of points minus the number of parameters), it is likely that the points and the point errors fit the model assumed. Curve Fitting, Least Squares Fitting, Least Squares Approximation The method used in LSM program gives exactly the same values of parameter uncertainties as "other programs not allowing X uncertainties" if in LSM program all input X (or X1, X2, ... for many dimensions) uncertainties are fixed at zero and input Y uncertainties are such that chi-sqr (from the menu item GInf) is equal to the number of degrees of freedom. Program description Comparison to "other programs" More precise description can also be found in readme file in the program package. LSM program requires MS-DOS 3.0 (or later) or Microsoft Windows 3.0 (or later 95 98 2000 XP). Please forward questions or suggestions to the author: janand@prz.edu.pl affiliation (in Polish) J. A. Mamczur Institute of Physics RzeszowUniversity ofTechnology Al. Powstancow Warszawy 6 35-959 Rzeszow, POLAND Exemplary approximation results Approximating curve - ellipse; Input error rectangles -(red); Output (estimated) error ellipses -(green). Two different approximating curves with common parameter (asymptote abscissa); Input covariance matrix - error ellipses (red). Least Squares Nonlinear Regression Analysis, Curve Fitting Each function must have the form of an expression obtained by transferring all terms to one side of equation! Every parameter must be denoted by a1, a2, a3, ..., and every point coordinate - by x1, x2, x3, ... (instead of x ,y, z, ...). Calculation time is significantly longer due to method nonlinearity caused by the assumption of input errors for all coordinates of points. Even in case of fitting a straight line, the regression is nonlinear. Curve Fitting, Least Squares Method, Least Squares Fitting Nonlinear Least Squares Regression Analysis Back to the top Downloading shareware - limited to the number of points used. Least Squares Method, Least Squares Estimation First read the Terms and then take it and try. Basic Package lsm.zip (0.2 MB) 2000 XP Package lsm2000.zip (0.3 MB) go to Program description go to Comparison If you try this shareware and find it useful, you are requested to register . Currently the registration is free of charge and listing to anywhere. Then you will have the program transformed to a full version. Curve Fitting, Least Squares Fitting, Least Squares Approximation Installation and use Unpack the contents of the package to a directory (named LSM for example). In order to work in Windows 3.x, it is recommended to use lsm_3.pif file as a main one, in 95 98 use lsm.exe, in 2000 XP use lsm2000.exe (lsm.exe use as a Demo). The program not even touches Windows registers. Adapting to newer systems The main program has been recompiled to avoid runtime error 200 when runnig on computers faster than 300 MHz. In Windows 2000 XP full screen is the recommended mode of displaying (switch with CtrlTab); unfortunately the mouse doesn't work, please use the keyboard. If error no 5 (file access denied) occurs on registration it is necessary to turn off "read only" attribute of lsm.exe file. Least Squares Estimation, Least Squares Approximation Registering (not concerning 2000 XP) Least Squares Nonlinear Regression Analysis, Curve Fitting To have the program transformed to a full version enter the code 0-0,3.0 (8 characters) Curve Fitting, Least Squares Method, Least Squares Fitting Nonlinear Least Squares Regression Analysis Least Squares Method, Least Squares Estimation Curve Fitting, Least Squares Fitting, Least Squares Approximation Back to the top IMPORTANT: READ CAREFULLY BEFORE DOWNLOADING SOFTWARE. Since the program is free now, the restrictions concerning non-commercial using and spreading the program are canceled. BY DOWNLOADING LSM PROGRAM YOU ARE AGREEING TO BIND YOUR COMPANY AND YOURSELF TO THE TERMS OF THIS AGREEMENT. A LICENSE TO USE THE SOFTWARE WILL NOT BE GRANTED UNLESS YOU AND YOUR COMPANY AGREE TO THE TERMS OF THIS AGREEMENT. DOWNLOADING AND INSTALLING THE PROGRAM WILL BE AN IRREVOCABLE ACCEPTANCE OF THE TERMS OF THIS AGREEMENT. YOU MAY: 1. use the registered version of the Program for evaluation purposes on a single computer or network, and only by a single user at a time regardless of the number of original copies of the Program included with the Program. If you wish to use the Program for more users, you will need an additional license for each user; 2. make one copy of the registered version of the Program for archive or back-up purposes. YOU MAY NOT: 1. use the Program or make copies of it except as permitted in this License; 2. translate, reverse engineer, decompile or disassemble the Program, except to the extent the foregoing restriction is expressly prohibited by applicable law; 3. rent, lease, assign or transfer the Program; 4. modify the Program or merge all or any part of the Program in another program. 5. make both the registered version of the Program and the registration code available over a network for multiple users, access, distribute them in any form or provide them in conjunction with any other product. Disclaimers LSM Program is provided without warranty of any kind, express or implied, and the user assumes the entire risk of using it. The author does not assume responsibility for any expense, damage or loss caused by your use of this software, however it comes down. All the registered trademarks used herein are registered. This notification is given in lieu of any specific list of trademarks and their owners, which would not be as inclusive and would probably take a lot longer to type. If you register software, we will assume that you are doing so having tested the shareware version and ascertained that it's suitable for your hardware and requirements. We cannot provide refunds for shareware registration if you subsequently change your mind. The shareware version is limited regarding the maximum number of used points. Nothing more in the shareware version is suppressed or crippled nor will suddenly stop working after a predetermined period of time. If something isn't working as you think it should in the shareware, this will not change in the registered version. No portion of the documentation for this software or any of its attendant files may be reproduced in whole or in part in any medium or form of transmission. Registering Registering this software buys you a single-user license to use it in perpetuity, subject to the terms discussed herein. This means that your registered software can only be used by one person at a time. You might, for example, have a copy on your computer at home and a copy on your computer at work. If you have taken reasonable precautions to ensure that no one else will use your software on one machine while you're working with the other, your use of the registered software is in keeping with the license you have purchased. A single-user license does not permit you to make the registered software available over a network for multiple users to access, to distribute it in any form or to provide it in conjunction with any other product. This license extends only to the registered software itself, and in no way affects any files or documents you might create with it. The registered cost of this software does not include payment for technical support. Since the program is free now, the restrictions concerning non-commercial spreading and using of the program are canceled. ... Back to downloading ... Back to the top creation date: 1998.01.01 last change: 2005.04.13 Key phrases: multidimensional nonlinear weighted least squares regression analysis, multidimensional nonlinear weighted least squares estimation, multidimensional nonlinear weighted least squares approximation, nonlinear weighted least squares method, nonlinear weighted least square method, nonlinear weighted least squares fitting, nonlinear weighted least square fitting, weighted least squares fit, weighted least square fit, non-linear least squares method, non-linear least square method, non-linear least squares fitting, non-linear least square fitting, non-linear least squares fit, non-linear least square fit, non-linear regression analysis, nonlinear least squares method, nonlinear least square method, nonlinear least squares fitting, nonlinear least square fitting, nonlinear least squares fit, nonlinear least square fit, fitting curve to points, fit curve to points, fitting a curve to points, fit a curve to points, fitting the curve to the points, fit the curve to the points, fitting curves to points, fit curves to points.
Oakdale Engineering
DataFit curve fitting (nonlinear regression) and data plotting software.
DataFit Curve Fitting and Data Plotting Software by Oakdale Engineering Oakdale Engineering News Contact Feedback Products DataFit DataFitX Services Support Consulting Ordering Order Information Order Online Fax Mail Order Form Oakdale Engineering develops DataFit curve fitting (nonlinear regression) and data plotting software, as well as DataFitX ActiveX curve fitting engine. In addition to browsing our web site in order to learn more about our products and services, we invite you download fully functioning evaluation copies of DataFit and DataFitX in order to see them in action before purchasing them . We are confident that you will see our products were designed with both accuracy and ease of use in mind. The philosophy at Oakdale Engineering is that the simplicity of the curve fitting process is just as important as achieving accurate results. Curve fitting is now easier to perform than ever. Packed with features , DataFit has become the tool of choice for thousands of users in companies and universities worldwide. Try a fully featured evaluation version free for 30 days to see why, or click here to order online now . The accuracy of DataFit has been verified with the Statistical Reference Datasets Project of the National Institute of Standards and Technology (NIST). DataFitX version 2.0 is a COM component (in-process DLL) that allows you to perform nonlinear curve fitting or cubic spline interpolation from within your program with only a few simple lines of code. It is the same powerful curve fitting engine as used and verified in DataFit software . Can be used with Visual Basic, Visual Basic .NET, Visual C++, Visual C++ .NET, Visual C .NET, Delphi, Excel, Access, VBScript, VBA enabled applications or any other development environment that supports COM. Try a fully featured evaluation version free for 30 days, or click here to order online now . | Home | Products | Services | Download | Order | Support | Contact | Copyright 1995-2005 Oakdale Engineering. All Rights Reserved. Page Last Modified: Sunday, September 11, 2005 Questions or problems regarding this web site should be directed to webmaster@curvefitting.com
Nonlinear Statistical Regression Analysis
General linear and nonlinear statistical regression analysis.
NLREG -- Nonlinear Regression Analysis Program NEWS NLREG has been selected as the "Editor"s Pick" by SoftSeek . NLREG is in use at hundreds of universities, laboratories, and government agencies around the world (over 20 countries). For a list of a few organizations using NLREG click here. If you have categorical variables, you may want to use a Decision Tree to model your data. Check out the DTREG Decision Tree Builder . You also should check out the News Rover program that automatically scans Usenet newsgroups, downloads messages of interest to you, decodes binary file attachments, reconstructs files split across multiple messages, and eliminates spam and duplicate files. NLREG is a powerful statistical analysis program that performs linear and nonlinear regression analysis, surface and curve fitting. NLREG determines the values of parameters for an equation, whose form you specify, that cause the equation to best fit a set of data values. NLREG can handle linear, polynomial, exponential, logistic, periodic, and general nonlinear functions. Unlike many "nonlinear" regression programs that can only handle a limited set of function forms, NLREG can handle essentially any function whose form you can specify algebraically. NLREG features a full programming language with a syntax similar to C for specifying the function that is to be fitted to the data. This allows you to compute intermediate work variables, use conditionals, and even iterate in loops. With NLREG it is easy to construct piecewise functions that change form over different domains. Since the NLREG language includes arrays, you can even use tabular look-up methods to define the function. Here is an example of an NLREG program for fitting a damped sine wave to some data: Title "Damped pendulum motion"; Variables Time,X; Parameter A,alpha,w,offset,Phase; Function X = A*exp(-alpha*Time)*sin(w*(Time-Phase))+offset; Plot; Data; [ data goes here ] NLREG performs true nonlinear regression analysis and curve fitting, it does not transform the function into a linear form. As a result, it can handle functions that are impossible to linearize such as: Y = Amplitude*sin(Freq*X+Phase) + Growth*exp(X) + Offset; Where "Amplitude", "Freq", "Phase", "Growth", and "Offset" are parameters whose values are to be determined by NLREG. Another advantage of handing the function in true nonlinear form is that the minimization of the sum of squared residual values (i.e., "least squares") is based on the true nonlinear value rather than some linearized transformation. In addition to computing the optimal values of the parameters to best fit the function to the data, NLREG can generate plots of the data points and the fitted equation. In addition, it can plot the distribution of residual values and produce a normal probability plot. NLREG also computes auxiliary statistics such as Student"s t, Prob(t), F, Prob(F), Durbin-Watson, and, optionally, correlation and covariance matrices. The Standard version of NLREG can fit up to 5 variables and parameters to the data observations. The Advanced version can handle up to 2000 variables and parameters. In addition, the Advanced version can generate 3D surface plots such as shown here: In addition to performing classic nonlinear regression, NLREG can be used to find the root or minimum value of a general multivariate, nonlinear function. It can also be used in a special form where the independent variable is omitted; an interesting application of this is " circular regression " where a circle is fitted to a set of data points. DLL (Dynamic Link Library) and COM object versions of NLREG are available for applications that want to call NLREG as an "engine" to perform regressions. Click here to see an example Visual Basic program that calls the NLREG COM Library. NLREG has been validated using the Statistical Reference Datasets developed by the National Institute of Standards and Technology. Download demonstration copy of NLREG. Download manuals for NLREG. Order NLREG. If you have data with categorical variables such as race, gender, marital status, malignant benign, etc., you may want to use a Decision Tree to model your data. Check out the DTREG Decision Tree Software . The author of NLREG is available for consulting on data modeling and nonlinear regression projects. Contact via e-mail for information.
Multiple Regression Components for Delphi
Programs for analytical applications. Includes technical support.
Statistical Software :: Multiple Linear Regression Technologies for Decision Makers Consulting | Development | Internet | Products | Tech News | Home StatisticalAnalysis Muliple Variable Regression Components for Delphi Programming Applied Analytic Systems' Multiple Regression Analysis components were designed so that a developer with little knowledge of statistics and some database application development skills, can program an application with full OLS regression analysis capabilities. The components contain all of the mathematics required for regression modeling analysis of data from datasets in which a relationship between the data in multiple datafields is suspected. Advanced Regression Modeling Analysis The MLR components support transformation of the data contained in database table fields. For any variable x in the regression model: y = b0 + b1x1 + ... + bnxn + e , possible transformations of xj include field1*field2 (product transformation) ln(field1) (log transformation) 1 field1 (multiplicative inverse transformation) field1k (kth power transformation) where field1 and field2 are any two fields within a database result set. Response variables can also be transformed to achieve a curvi-linear regression model. Modeling the data transformations is explained in the MLR Help file. References for Regression Analysis Before programming a regression application, review of regression theory would be very helpful. Both of the following texts are highly recommended as references for multiple variable regression techniques. The text by J. Wesley Barnes is more introductory in nature. Statistical Analysis for Engineers and Scientists by J. Wesley Barnes, 1994 Applied Regression Analysis by Norman R. Draper, Harry Smith, 1998 How the Components Work The initial version included a TTable descendent component (TMLRTable) class and a TQuery descendent (TMLRQuery) component class. Each of these required the presence of the Borland Database Engine on the target system. Version 2.0 replaces the TMLRTable and TMLRQuery with a single TDatasource descendent, TMLRDatasource, making the component set independent of the database engine. This new component can be used with any TDataset descendent which implements the typical dataset navigation methods, e.g. TADOTable TClientDataset TDBISAMTable Query TIBTable TTable Query TYourOwnTDatasetDescendent The TMLRDatasource component loads the data contained in its assigned Dataset property, and performs the developer-defined modeling and the associated required mathematical calculations. TMLRegress Features Instantaneously performs regression on any numeric data accessible through any TDataset compatible database engine. No need for your customers to to export data from your application's Paradox, dBase, or InterBase file formats to SPSS, SAS, Excel, Quattro Pro, or 1-2-3 to analyze. Scatter plots quickly show whether a linear data trend appears to be present among any of the control variables and the response variable. A variety of residual plots are available to access whether the general assumptions of a linear regression model are satisfied. Plots of residuals, y vs xi , for each i, and the cumulative distribution function can be viewed using the component plotting methods, or via another third-party graphing utility using the component properties. Can identify outlying data and predict the value of the dependent variable for different inputs of independent variable values. Delphi VCL Components allow developers to set all the parameters visually at design time if appropriate, or to develop complex models at run time. Sample project with multiple data tables and demo Object Pascal source code. TMLRegress Online-Tutorial demonstrates the building of a regression model with a TMLRTable component and five (5) lines of event-handler code. Please click here to take the regression tutorial. Consulting Assistance We recognize that, under any circumstance, programming multivariate regression applications is not the easiest development activity. Applied Analytic Systems is available to assist developers with integrating MLR components into their applications, for statistical modeling assistance, for custom statistical programming, and and for code review. In most cases, we can provide substantial assistance with three or four billable hours. For help, contact our Statistical Consulting Group by email at statistics@aasdt.com or by phone at 412.512.5965. TMLRegress Component Set Available As TMLRDatasource and TStatFieldList (also includes the TSLRDatasource Simple Regression Component). Current Version 2.0 License Unlimited Runtime Distribution Development Platform 32-Bit (Delphi 3.0, 4.0, 5.0, 6.0, and 7.0) Windows 95 98 ME, Windows NT 2000 XP Database Engine Requirements Any database engine that uses TDataset descendents which implement Open, Close, First, Last, and Next methods and have TFields of type ftFloat or ftInteger. Documentation Delphi-style help file, demo project, and tutorial. Per Developer Cost Single-User Licenses DCU Version - US $199.97 Source Code Version - US $299.97 Site Licenses View Source Code Site License info. Major Corporations, Agencies, Universities, mail purchase orders to: Applied Analytic Systems . Trialware Disks DCU Delphi 3,4,5 6 IDE-Only Trial Diskette Mailed within 48 hours - $39.95 . Please note your Delphi version (3, 4, 5, or 6). Online Orders Credit Card 1893 DCU for D3, D4, D5, or D6 [specify] 2876 Source Code for D3, D4, D5, D6, or D7 [specify] 4550 Source Code Site License Need more info? Call 412-512-5965 Applied Analytic Systems, Inc. Carnegie Office Park 600 North Bell Ave Bldg. 2, Suite 2700 Carnegie, PA 15106 Phone: 412.512.5965 FAX: 412.262.0932 All prices in US dollars. TMLRegress Copyright 1997-2003 Applied Analytic Systems Inc. Borland, Delphi, and C++ Builder are trademarks of Borland Inprise Corporation. Copyright 1996 - 2004 Applied Analytic Systems, Inc. Web Site Design by Companyweb.Net, Pittsburgh, PA
Hirosoft
Information about Epicure software for risk regression using non-linear models and complex rate(person-year) computations.
HiroSoft International Corporation Fast, interactive software for the analysis of medical, public health, epidemiologic,econometric, and reliability data Table of Contents: Overview of epicure, product information Platforms and Prices News and Updates Documentation Errata New Rate Files If you have comments or suggestions, email us at hirosoft@hirosoft.com Links: For music lovers try: http: www.sunhawk.com
FuReA
Software tools for regression analysis of fuzzy data. Simulate non-linear dependencies, detect outliers and observe results graphically.
fuzzy.ru Home fuzzy.ru has changed its owner This website has changed it owner and will be completely redesigned. Please change your bookmarks. Developed and supported by higher one . Last modified 31 Aug 2005 @537.
JMulTi
Time series analysis program, written in Java, to accompany book "Applied Time Series Analysis", by Helmut Lutkepohl and Markus Kratzig.
JMulTi
AlaVar
Freeware to compute the three Allan Standard Deviations of a time series.
AlaVAR : Allan Variance Software AlaVar 5.2 (September 2003) New in Version 5.2 : Computation of the Overlapping Hadamard Variance. Faster data loading. Tested with files greater than 300 MB. Faster computation, complete processing (4 variances + error bars) in less than one minute for data of 10 milion points. New look : toolbar and menu "a la MS Word". Progress bars to indicate the progression of work. Decimal separator in the data file is detected automatically. - Demo - Features : The program computes the three Allan Standard Deviations of a Time series : Sigma(tau) = Overlapping Allan Variance. MSigma(tau) = Modified Allan Variance. TSigma(tau) = Time STD = tau * MSigma(tau) sqrt(3). These functions are computed for Discrete Time series, with a fixed sampling period tau0. The error bar is computed for the values of Sigma(tau) for Five noise Types. Power Spectrum Density plot. Automatic detection of the noise type. Read numerical data from ascii files with optional text header. Data size is unlimited. Produce quality report plots. Customize plot : style, color, print preview, resolution control, legend, zoom, scroll, annotations. Copy, save and mail plots as images with many options : JPEG, PNG, GIF,PCX, Bitmap, MetaFile. Export plot data into TEXT, HTML, EXCEL and XML files. ON-LINE HELP For more information about the definition of the Allan STD's you may refer to : [1] J.Rutman : "Characterization of phase and frequency instabilities in precision frequency sources : fifteen years of progress". Proceedings of the IEEE, vol.66, n 9, Sept. 1978. [2] D. W. Allan : "Time and frequency (time domain) characterization, estimation and prediction of precision clocks and oscillators". IEEE trans. UFFC, vol UFFC - 34, n 6, Nov. 1987. [3] E.S. Ferre-Pikal et al. , "Draft revision of IEEE STD 1139-1988 standard definitions of physical quantities for fundamental frequency and time metrology -Random instabilities". IEEE International Frequency Control Symposium, pp. 338-357, 1997. The program was tested with the test suite data in reference [3]. Alavar52_setup.exe (1.94 MB) Older version is still here Alavar4.5_setup.exe (2.2 MB) Thanks for using AlaVar, I hope you find this program useful. Alaa Makdissi ALAVAR IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND. I DISCLAIM ALL WARRANTIES, EITHER EXPRESS OR IMPLIED, INCLUDING THE WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL I BE LIABLE FOR ANY DAMAGES WHATSOEVER INCLUDING DIRECT, INDIRECT, INCIDENTAL, CONSEQUENTIAL, LOSS OF BUSINESS PROFITS OR SPECIAL DAMAGES, EVEN IF I HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
Neuro: Dynamic Time Series Analysis
Features the visualization of the multi-channel, multi-frequency digitized data, discrimination, correlation analysis, spectrum, expected density and other functions.
Neuro: Dynamic Time Series Analysis System Neuro: The Dynamic Time Series Analysis System Contact: Some Software Neuro Download latest version Description: Time Series Analysis System for multi-channel multi-frequency digitized analog signals Processes data of generic format, any digitized frequency, any number of channels. Performs 5-mode discrimination, manual spike correction, as well as the following statistical functions: * Firing Rate Frequency * Interval Histogram * Amplitude Histogram * Spectrum, cross-spectrum and dynamic spectrum with time lag * Evaluation with Raster output * Expected Density * Decimation * Cross- and Auto- correlation * Cross- and Auto- correlation matrix System snapshots Multi-Channel, multi-frequency, multi-datatype Visualization Files: LAR130.NG original bioelectric signal LAR130_F.NG Fourier-filtered bioelectric signal LAR130.PT1 corresponding bioelectic potential LAR130.A00 original discriminated spike file LAR130_F.A00 filtered discriminated spike file Discrimination analysis Manual Correction of the Discrimination results Cross-correlation function (upper window) and auto-correlation function (lower window) Spectrum: original signal (above) and filtered (below) Auto-correlation matrix Download Neuro Current release is version 1.3.08c (May 1997) for Windows systems Tested on Windows 3.1, Windows 3.11, Windows 95, Windows 98, Windows NT, Windows 2000, Windows XP Technical requirements: IBM PC, Windows 3.x minimum Download from: USA, Chicago, IL (1.2 MB) Sign Guestbook View Guestbook Reports, Bugs, Feedback: Some Software Total visitors since March 2002 geovisit();
DEMETRA
Free user-friendly interface to Tramo Seats and X-12-Arima for automated applications and for detailed time series analysis.
Information Information DSIS - Seasonal Adjustment Information Advanced seasonal adjustment interface DEMETRA 2.0 Service Pack 1 - Release (May 2002) DOWNLOAD HERE After a careful comparison of several methods for Seasonal Adjustment, Eurostat has decided to focus its attention on two seasonal adjustment methods: Tramo Seats , an ARIMA model-based method, written by V. Gmez and A. Maravall and X-12-Arima of the US Census Bureau. These two methods have had to be implemented in a single interface, called "DEMETRA", in order to facilitate the application of these modern time series techniques to large-scale sets of time series and in the explicit consideration of the needs of production units in statistical institutes, especially Eurostat. Thus, DEMETRA has been developed to ease the access of non-specialists and specialists in time-series statistics to the packages Tramo Seats and X-12-Arima and to improve largely their user-friendliness. Demetra imposes a recognised seasonal adjustment policy, and follows standard practice of seasonal adjustment. DEMETRA contains two main modules: seasonal adjustment and trend estimation with an automated procedure (e.g. for unexperienced users or for large-scale sets of time series), and with a user-friendly procedure for detailed analysis of single time series. The automated module allows the fully automatic treatment of lists of up to thousands of time series. Every period (e.g. month, quarter) the system has to get the time series stored in a database, to apply to each series a given method that should be consistent with what was done before, to run the seasonal adjustment for the whole set of time series, to test if the results are satisfactory and to store the satisfactory results in the database. Thus, the interface proposes four statistical tools for a seasonal adjustment using default or customised parameters for a new automatic processing or using previous model settings including already estimated ARIMA and regression coefficients or with re-estimation of these coefficients. For doing this, DEMETRA provides features for storing the seasonal adjustment settings for each original time series in the database. These tools support a policy for reduced (e.g. only yearly) revisions of the seasonal adjustment models used. After the execution of the complete list of series, a general overview with important information on the modelling specifications and diagnostic statistics for all series is shown. For series facing some difficulties, a thorough and assisted examination is provided using up to two alternative models, more detailed diagnostic tables and graphs. The module for detailed analysis facilitates the comparison between the results corresponding to different model specifications for single time series in practical cases. DEMETRA includes the most important features of Tramo Seats (Nov'99 Sep'98) and X-12-Arima (0.2.8 release): pre-adjustment with automatic detection and correction of outliers, removing of calendar effects, automatic model identification selection, forecast, seasonal adjustment and trend estimation, revision history and sliding span analysis, and diagnostic checking. DEMETRA is a fully menu driven package running under Windows XP NT 2000 Me 98 95. It provides access to date in FAME, MS-EXCEL, ASCII, SAS and ORACLE EXPRESS databases. (The "namelist" object of FAME can be used.) DEMETRA was developed by EUROSTAT with participation of Jens Doss and Servais Hoffmann, Pierre Kelsen, Christophe Planas and Raoul Depoutot. DEMETRA 2.0 is an improvement for the look and user-friendliness. Some of the most important changes are: completely new presentation of the "Automated Module" projects new wizards for the creation of new projects and the SA processing adding removing of time series in a "Automated Module" project printing facilities (for graphs, tables, text files and quality reports) functions for reading, generating and translating input files in the original Tramo Seats and X-12-Arima formats (*.inp, *.spc files) customizable working directory (support for network-based installations), name and maximum size of log file AutoRecover function (automatic backup and recovery) includes project properties e.g. for title, author, keywords and comments context-sensitive help (will be completed with a future update of the "Demetra.hlp" file) update of X-12-Arima to last available release version 0.2.8 DEMETRA 2.0 (Service Pack 1) - Release besides corrections for bugs contains also new tools: access to data in Oracle Express databases (Personal Express 5 6, Express Server 5 6) enhanced FAME access: dramatically increased catalogue-retrieval speed, retrieves "formula" objects, handling of usergroup access rights, better use of log-file taylorable composite index for the sake of automatic processing business-cycle analysis using ARIMA-model-based calculation of the Hodrick-Prescott filter (Tramo Seats) automatic optimisation (reduction) of the number of trading day regressors (model) stability analysis for improving the yearly modelling expert system for a fully-automatic model for series with rejected adjustments more flexible and memory-saving management of projects with "very large-scale" datasets (for Fame of Express data) saving of calendar-effect corrected series (Tramo Seats) saving of parameters in original formats in the databases (for X-12-Arima and Fame databases, the format for the X-12-Arima Fame interface is used) possibility of saving Seats factors not as percentages but as "normal" factors modelling span for Tramo Seats smooth function for the determination of the critical value for the outlier detection (Tramo Seats, depending on the time series length) deletion or execution of several models at once in Detailed analysis module cut copy paste of models in Detailed analysis module and adaptation of the model names graphs for seasonal factors per period, and result series of business-cycle analysis, improved selections of series to be graphed Example of the "Automated Module" project presentation: Example of the DEMETRA seasonal adjustment quality report: How can one access time series in FAME databases with DEMETRA? Scenario 1: Your FAME programme and databases are on a Windows XP NT 2000 server: You will be able to directly access them from a connected Windows-based PC without any additional installations. Scenario 2: Your FAME programme and databases are on a UNIX server: You will be able to access them from a connected Windows-based PC. The "Demetra Fame Server" must be previously compiled and installed on the UNIX server. DEMETRA is freely available. Please read the legal notice while installing the software and note that Eurostat gives no warranty for the use of the programme. To help us further improving the DEMETRA programme and keep you informed of further work and upgrades, we would very appreciate your feedback (questions, comments, bug reports, suggestions for improvements) by writing to our Demetra Help-Desk in this Seasonal Adjustment interest group or you can send messages to the Help-Desk anonymously or self-register to the sites to get your personal login and password. Please refer to the developpers for methodological questions about Tramo Seats or X-12-Arima. Please refer to the Library section of this interest group to download DEMETRA and its user manual (If you are a new user, please give us your name, institution, e-mail address and mail address by writing to the responsible person mentioned at the Contact Information page of this interst group). This page has been created by Mr. Jens Doss and revised by Mr. Jean-Marc Museux.
CaterpillarSSA
Based on the model-free method of time series analysis Caterpillar-SSA (Singular Spectrum Analysis). The result of the Caterpillar-SSA processing is identification, analysis and forecast of additive components of time series (trends, periodicities, noise). The program can be applied to multivariate analysis forecasting and change-point detection.
Time series analysis and forecasting, Caterpillar SSA method Main Books Software Examples News About us Time series analysis and forecasting The site is devoted to 'Caterpillar' (another name is SSA - Singular Spectrum Analysis), a powerful method of time series analysis and forecasting. The 'Caterpillar'-SSA is a model-free technique of time series analysis. It combines advantages of other methods, such as Fourier and regression analyses, with simplicity of visual control aids. The basic 'Caterpillar'-SSA algorithm for analyzing one-dimensional time series consists of: Transformation of the one-dimensional time series to the trajectory matrix by means of a delay procedure (this gives the name to the whole technique); Singular Value Decomposition of the trajectory matrix; Reconstruction of the original time series based on a number of selected eigenvectors. Thus, the result of the 'Caterpillar'-SSA processing is a decomposition of the time series into several components, which can often be identified as trends, seasonalities and other oscillatory series, or noise components. This decomposition initializes forecasting procedures for both the original time series and its components. The method can be naturally extended to multidimensional time series and to image processing. The 'Caterpillar'-SSA ideas were independently developed in Russia (St. Petersburg, Moscow) and also in UK and USA (under the name of SSA; that is, Singular Spectrum Analysis). The method is a powerful and useful tool of time series analysis in meteorology, hydrology, geophysics, climatology and, according to our experience, in economics, biology, physics, medicine and other sciences; that is, where short and long, one-dimensional and multidimensional, stationary and nonstationary, almost deterministic and noisy time series are to be analyzed. Our group participates in developing the method and corresponding software from the middle of 90s. The site contains results of this development. They are: information on two books devoted to the method and the software that allows everyone to feel simplicity and efficacy of its applications. We are sure, that in a near future 'Caterpillar'-like methods will rank among the base methods of time series analysis and will be included in standard statistical software. GistaT Group Copyright 1996-2004 GistaT Group . All rights reserved.
Brodgar
Program package used for estimating common trends, seasonal components and cycles in short, non-stationary multivariate time series. Based on dynamic factor analysis.
Brodgar v2 Brodgar v2.4.8 Software Package for Data Exploration, Univariate Analysis, Multivariate Analysis and Multivariate Time Series Analysis INTERFACE TO R software Brodgar is used in our statistics course: "Analysing biological and environmental data" The statistical background of most techniques in Brodgar will be published as a 700 page book by Springer-Verlag in its prestigious series 'Statistics for Biology and Health': A.F. Zuur, E.N. Ieno and G.M. Smith . (Forthcoming). The Analysis of Ecological Data. Springer-Verlag. This is also our course material. Note: This book is independent of Brodgar. Key phrases for Brodgar course book: Data exploration (outliers, transformations, distributions): boxplots, dotplots, coplots, lattice graphs, conditional boxplots, histograms, pair plots. Univariate analysis: linear regression, generalised additive modelling (GAM), semi-parametric GAM, generalised linear modelling (GLM), regression and classification trees, mixed modelling, partial linear regression, index functions, design and interaction plots. Multivariate analysis: (partial) canonical correspondence analysis, discriminant analysis, (partial) redundancy analysis, permutation tests, db-RDA transformations, variance partitioning, principal component analysis, factor analysis, correspondence analysis, (non-metric) multidimensional scaling, index functions, clustering, Bray-Curtis ordination, multivariate tree models, Mantel test, Partial Mantel test, ANOSIM, BIOENV, BVSTEP. Time series analysis: structural time series, dynamic factor analysis, MAFA, regime shift analysis, chronological clustering, ARIMAX, spectral analysis, time lags, monthly plots, repeated Loess smoothing. Produced by Highland Statistics Ltd. Statistical courses, consultancy, data analysis and software development To contact us: Dr. A. F. Zuur 6 Laverock road, AB41 6FN Newburgh, United Kingdom Phone: +44 (0)1358 788177 or +44(0)7960 053461 Email: highstat@highstat.com http: www.highstat.com http: www.brodgar.com
ProdEff Technologies
Consulting company for Minitab Software in Indonesia.
Prodeff Technologies - Home Search............ Minitab User Gathering Comming Soon Minitab's Award for Best Defect Elimination in Manufacturing Winner: Amana Refrigeration, Maytag Honorable Mention: IMC Global Statistical 2003 Readers' Choice Award Winner: MINITAB QA QC 2003 Readers' Choice Award Winner: MINITAB PRODEFF TECHNOLOGIES was established to provide organizations with sophisticated tools and solutions to help them achieve significant improvements in PRODuctivity and EFFiciency. Our solution leaders's experience in working with many organizations shows that a lot of resources and time are wasted in working with formula and in performing calculations rather than analysis of data and improvement. In many cases, data used for analysis may also be inaccurate due to wrong calculations which could lead to wrong conclusions. With software such as MINITAB , organizations could focus their resources on important task that adds value. To ensure that our clients gain maximum value from various tools offered, PRODEFF TECHNOLOGIES also provides customized training to support implementation. We are committed to create a success story in each of our clients. MINITAB Helps Louisiana Hospital Improve Care and Save Money The Quest for QUALITY AMERICAN EXPRESS How three Eaton facilities used Six Sigma and MINITAB Statistical Software to cut costs MINITAB Balances the Scales of Justice MINITAB is a tool that Students will use in their future education and careers, A Story from American School in Japan Other Testimonial from Six Sigma Black Belts, Professors, Coach, etc MINITAB Statistical Software Release 14 MINITAB Statistical Software Release 14 offers many exciting new features such as: A powerful new graphics engine that delivers engaging results that offer tremendous insight into your data An effortless method to create, edit, and update graphs The ability to customize your menus and toolbars so you can conveniently access the methods you use most MINITAB Quality Companion Release 1.0 Quality Companion Release 1.0 is a dynamic project management solution that incorporates all the soft tools used in a quality improvement process into one, innovative software package. It helps you easily complete all the tasks related to developing, organizing, and managing your project and lets you devote more time and energy to what matters most the improvement process itself. MINITAB and the MINITAB logo are registered trademarks of Minitab Inc. QUALITY COMPANION and the QUALITY COMPANION logo are registered trademarks of Minitab Inc. Home | Products | Events | Resources | Contact Us Copyright Prodeff Technologies 2004
Minitab at Bath University
Documentation of Minitab procedures and software provided by the Bath University Computing Services.
BUCS: documentation University | Computing Services | Search | News | A-Z Index | Contact us Text only Computing Services Search: Home Services we offer Resources Support Email Web Contact us Need Help? Check the FAQ Introduction to Minitab Contents Introduction Minitab Overview Inputting Data Saving and Retrieving the Worksheet Logging and Printing a MINITAB Session Transferring Data Between Applications Storing and Executing Command Files Graphics Printing and Exporting Graphs Selecting the Output Device Customising the device configuration file. Worksheet Size Startup Macro Transferring Worksheets Between Machines Interrupting Minitab Using Minitab in Batch Mode Comments References Introduction Minitab is an easy-to-use package, used interactively on many computer systems to provide data manipulation and statistical analysis for small to medium sized datasets. Data are held in a temporary worksheet of rows and columns. (The columns usually represent the variables and the rows represent the observations.) We currently run two versions of Minitab at Bath. The UNIX machines midge and mary have Version 9.1 including Professional Graphics. We also have Version 10 for Microsoft Windows. In terms of facilities these two implementations are similar (Version 10 has some extra commands). The major difference is the user interface. Version 10 for Windows has a session window, which is identical to the UNIX session window, it also has a spreadsheet style data window and most commands can be selected from drop down menus. These drop down menus do help considerably with graph production but for statistical procedures it may still be quicker to type the commands into the session window, as you would in the UNIX version. The Microsoft Windows version is much slower than the UNIX version. The Student Edition of Minitab for Windows can be purchased from the book shop (ISBN 020159157X) for about 40. This is actually a hybrid between version 9.1 and 10 with a limited worksheet size and no matrix operations. It comes with a good manual and represents good value. This document concentrates on the UNIX implementation of Version 9.1 most of which applies to the Microsoft Windows version also. Minitab is fully described in Reference 1. Reference 4 provides a more elementary introduction to the Minitab package plus some introduction to statistical techniques and explanation of Minitab output. The example worksheets and data files referred to in the Minitab documentation are stored in the directory opt minitab9.1 data. The directory opt minitab9.1 student contains datasets from The Minitab Student Handbook[4]. The file README in that directory describes the datasets. A good way to learn about Minitab is to enter Minitab (see below) and type help overview. Minitab Overview The Minitab package is invoked by typing: minitab When Minitab is entered it displays a banner and the current Minitab message of the day followed by the standard Minitab prompt MTB . When you enter Minitab with the minitab command you have access to a worksheet which is initially unnamed. The worksheet holds columns of numbers or text, referred to as C1, C2 etc, constants (K1, K2) and matrices (M1, M2). Data are entered into these structures and manipulated, etc. The columns can be given informative names using the name command. The worksheet is not saved when Minitab is exited and must be saved explicitly by the user with the save command. Previously saved worksheets can be retrieved at the start of a session with the retrieve command. Only the first four letters of a Minitab command are significant; extra letters in the command are ignored as is extra text between the components of a command. Each command is typed on a new line. Some commands have subcommands; in which case the command is terminated with a semi-colon and a carriage return while subcommands are given one per line each terminated with a semi-colon. The final subcommand is terminated with a full stop. A short example session follows: retrieve 'example' let c3 = c1 + c2 let k1 = mean(c3) plot c3 against c2; title 'Example Plot'. save 'example' stop The retrieve command loads a worksheet which has had data entered into it at some previous time. Only the first four letters of the command are necessary, so this command could be just: retr 'example' The other commands are self- explanatory. Notice that the plot command has a subcommand, title. The command stop exits Minitab. Extensive help is available on line via the Minitab help command. Thus: help commands gives information on all Minitab commands. help overview Gives a more general discussion of various topics. Inputting Data Data can be entered into a worksheet during a Minitab session with the read and set commands. read expects one or more columns to be read in row by row into the specified columns. The data are terminated with end. read c1 c2 1 2.4 3 3.2 4 4.5 end The set command has extra features which allow regular sequences of numbers to be read in efficiently, but only acts on a single column. set c1 1:10 13 15 end 1:10 expands to 1,2,3,4,5,6,7,8,9,10 2(1:3) expands to 1,2,3,1,2,3 (1:3)2 expands to 1,1,2,2,3,3 Type help set for more details. Both read and set can be used with a filename to read the data from an ASCII data file instead of the keyboard. This file might have been created outside Minitab with a standard editor such as vi or xedit. Data can be space or comma separated. A format subcommand allows more complex data formats. If a single component filename is given with the read or set command, the suffix .DAT is assumed. If the search does not find the filename with suffix .DAT, the filename without the suffix is searched for. For example the command: read 'data' C1 C2 will first look for the file data.DAT and then for the file data. read and set have a FORTRAN-like format subcommand which can be used to define the format of data files. Saving and Retrieving the Worksheet The whole Minitab worksheet is saved using the save command. If no filename is given, the file minitab.MTW in your working directory is assumed. If a single component name is used, the suffix .MTW is added to the name. Saving the worksheet to an existing file causes the file to be overwritten. If the filename is given explicitly on the save command line, you are warned before the contents are overwritten if a file of the given name already exists. If, however, a filename is not specified (ie the default filename is assumed), the contents of that file are overwritten without warning. Worksheets cannot be appended to. An existing worksheet is loaded into Minitab using the retrieve command. The same filename conventions apply as for save, ie the default filename is minitab.MTW and the default filename suffix is .MTW. The filename without the default suffix is retrieved if the search for a filename with the suffix .MTW has failed. Retrieving an existing worksheet destroys the current worksheet without warning. When a worksheet is retrieved it is often useful to remind yourself what is stored in it by typing the info command. Logging and Printing a Minitab Session. The Minitab commands outfile and paper are available to log Minitab sessions. They both store a record of user input and Minitab output in a text file which can subsequently be printed. Inside Minitab give the outfile command with a file name. outfile 'log' When the session is ended with the Minitab command stop or the logging is terminated with the command nooutfile, a file called log.LIS is saved in the user's working directory. This can be printed from outside Minitab with the command: lpr log.LIS paper is similar to outfile but requires no filename (and ignores a filename without warning if one is given). The logged session is stored as an ASCII text file in the user's working directory; the pathname of the file PRINTER.LIS. Further use of outfile (or paper) with the same filename after a nooutfile (or nopaper) causes the new log to be appended to the existing file. So these commands can be used to log just those parts of the session you need. The journal and nojournal commands are used to log only the user input. This is useful for storing sequences of Minitab commands for later execution using execute (see Storing and Executing Command Files ). If a single component filename is given with journal, the suffix .MTJ is added. If no filename is given with this command, the file minitab.MTJ is created in the working directory. Transferring Data Between Applications The write command used with a file name will write the specified columns to a standard ASCII text file. write has a format subcommand. write 'data' c1-c10 Will write the first ten columns to a file called data.DAT in the user's working directory. This file could be used as input to another application such as a graph drawing program. The read command is used in exactly the same way to import data from an ASCII file. Storing and Executing Command Files Sequences of Minitab commands can be stored in a text file and then executed using the execute command; such files are known as exec macros. Command files can be created using an editor, or by using the journal or the store command. store takes input from the terminal and creates a text file. If no filename is given, both store and execute assume the file minitab.MTB in the working directory. If a single component filename is used, the suffix .MTB is added. If the search for a filename with the default suffix fails, Minitab searches for a file without a suffix. store overwrites an existing file of the same name. If the filename is given explicitly on the store command line, the user is warned before the contents are overwritten if a file of the given name already exists. If, however, a filename is not specified on the command line (ie the default filename is assumed), the contents of that file are overwritten without warning. In addition to the standard exec macros, described above, Minitab 9.1 has progressed to a much more powerful alternative macro language called %macros. These macros are stored with a .MAC suffix and are executed by giving the name of the macro with a % in front of it. For example: %weibplot c1 will execute a standard macro which produces a Weibull probability plot on the data in c1. To try this example you need to be on an X-terminal or equivalent and you will have to increase the default Minitab memory using the MINISIZE environment variable (see Worksheet Size ). Graphics Minitab 9.1 has two graphics modes, Standard Graphics and Professional Graphics. Professional Graphics can only be used if you work on an X-terminal or equivalent (such as a PC with the Exceed software). The Minitab default is to place you in Professional Graphics Mode when you start up. At Bath, to ensure that you start in Standard Mode the script which runs Minitab copies a startup macro file, called startup.MAC, to your current directory. This executes the single command gstd to switch to Standard Mode when you enter Minitab. If this file exists it is not overwritten. You can of course add your own startup commands to this file (see Startup Macro ). You can switch to Professional Graphics with the gpro command. You can switch back from Professional Graphics to Standard Graphics with the gstd command. Character plots (printer plots) can be displayed on any terminal by using commands such as plot, histogram, dotp, boxp. These will be saved in any log files along with results of statistical tests, etc. Some of these commands work in the same way even with Professional Graphics switched on, but others, such as plot, will have a different syntax. When in Standard Graphics mode, the old way of producing high resolution plots still works; ie using the goptions command to set the output device and commands such as gplot to produce the plot. However, the user is now recommended to use Professional Graphics instead. Printing and Exporting Graphs. This section assumes that you have switched to Professional Graphics by giving the command gpro and selected an output device using the hardcopy command (see below). The gsave subcommand of the graph drawing commands saves a copy of the graph in a minitab internal format. These graphs can be loaded at a future time and printed or exported in a number of standard formats. Minitab gives the graph the extension MGF. for example. plot c1 * c2; gsave 'example'. which will save the graph in as 'example.MGF'. The following commands take the MGF file as input. gview reloads a graph for viewing. gexport exports the graph in a format which is determined by the hardcopy command. gprint prints the graph to a printer in a format determined by hardcopy. Selecting the Output Device. The command hardcopy is used to select one of the following formats. PSC - Postscript or encapsulated PostScript (HP Laserjet, Apple Laserwriter, QMS Colorscript 10 Model 10p) LJT - HP Laserjet IID, IIID, and compatibles. HEW - HPGL format (HP7470x, HP7475, HP7550x ) LN3 - DEC LN03 or compatible CGM - Computer Graphics Metafile PJT - HP Paintjet XL or compatible for example hard 'psc' selects PostScript output. The most useful formats at Bath will be PostScript and CGM. For example to print a graph on the Library Laser Printer do the following. gpro plot c2*c1; gsave 'example'. hard 'psc' gprint 'example' To export a PostScript file for import into a document, save the graph and then give the commands... hard 'psc' gexport 'example' 'example.ps' This will save a PostScript file called example.ps which can be previewed with ghostview (gv) or printed to any PostScript printer (using lpr) or included in a document. The following example includes a Minitab graph in a LaTeX document. \documentclass[a4paper]{article} \usepackage{epsf} \begin{document} \begin{figure} \epsfysize=40mm \epsfbox[0 1 500 500]{example.ps} \end{figure} \end{document} In this example the Bounding Box has been determined using ghostview (gv). Customising the device configuration file. You might have noticed that the device PSC is described as 'PostScript or encapsulated PostScript'. The default is PostScript because this can be printed directly and imports into many packages without problems if you define a Bounding Box comment for it. Minitab will produce encapsulated PostScript as an alternative. This includes a BoundingBox comment and might import more easily into certain packages. Unfortunately you will need to do some customising of your Minitab setup to use this option. First take a copy of the file opt minitab9.1 newgraphics fig_cnfg.dat Next set the environment variable FIG_CNFG to point at this file. FIG_CNFG=$HOME minitab fig_cnfg.dat You could put this in your .bashrc. Edit the entry for PSC in this file. Change the line 'PSC. 2 3 2 2 90 70' to 'PSC. 2 3 3 2 90 70'. (see comments in the file for meaning of the various parameters) Worksheet Size. The default worksheet size is 10,000 which is large enough for 8,000 data items. If you need a larger worksheet size, set the environment variable MINISIZE before entering Minitab, eg: MINISIZE=100000 export MINISIZE Startup Macro. When Minitab starts up it looks for a macro file in the current directory called startup.MAC. This can be used to execute certain commands automatically every time you enter Minitab. Transferring Worksheets Between Machines. The Minitab worksheet is a binary file and cannot be transferred directly between machines unless they are binary compatible. Minitab provides an option to the save command which saves the whole worksheet in portable format. save 'work'; portable. This saves a file, called work.MTP, which can be transferred to another machine and retrieved as follows. retr 'work'; port. Interrupting Minitab The system command allows a UNIX command to be executed from within the Minitab session. For example: system ls invokes the UNIX ls command. Using Minitab in Batch Mode. Normally Minitab is used interactively. It is also possible to prepare a set of Minitab commands in a text file with an editor and submit this file to Minitab as standard input, eg: minitab batchjob batchjob.out The first command should be batch, and the last stop, otherwise the commands are more or less those which you would type in an interactive session. There are a number of commands which are useful in batch mode. These are described in the Minitab Reference Manual[1]. Comments Comments can be included with input to Minitab using or the command note; this allows explanatory text to be included in macro files and logged sessions. can appear anywhere in a command line; it causes the rest of the line to be taken as a comment and ignored. The note command, used at the beginning of a line, causes the whole line to be taken as a comment and ignored. References Minitab Reference Manual Release 9 Sowers Printing Company, Lebanon, PA, USA Minitab Graphics Manual Release 9 Sowers Printing Company, Lebanon, PA, USA Minitab Quality Control Manual Release 9 Sowers Printing Company, Lebanon, PA, USA The Minitab Student Handbook Ryan, Joiner and Ryan Duxbury Press (obtainable from most university bookshops) Company history Last update: 24 October 2002 Page maintained by bucs-web-mgt@bath.ac.uk Rate this page... How useful was this page to you? Very Mostly Fairly Not really Not at all Constructive comments? Email address (optional): ^Top Computing Services Copyright University of Bath Disclaimer Privacy Statement
Minitab Macros
Contains macros for the Minitab system, provided to StatLib by the Minitab Users Group.
Minitab Macros Minitab Macros This area contains macros for the Minitab system, provided to StatLib by the Minitab Users Group. There is a shar archive of all the macros available via FTP, gopher, WWW or e-mail. Beware that some of the macros still contain control characters (StatLib tried to fix as many as possible, but eventually we ran out of energy). In addition, the individual macros are available via WWW or Gopher. The software is not warranteed in any way. Unless otherwise stated the software is exactly what is provided by the submitters. All questions and comments should be directed to the submitter. Some of the entries are shar archives. If you don't know how to deal with a shar archive, send the message send shar from general for instructions. The minitab archive currently contains: readme.first The readme file provided by the minitab users group. See this first [27 Jul 94] (8k) mug17.shar A shar file of all the minitab user group macros. [27 Jul 94] (2000 kbytes) (Big!). MTBMAC The individual macros themselves. Not available via e-mail. Credit where credit is due If you use an algorithm, dataset, or other information from StatLib, please acknowledge both StatLib and the original contributor of the material. Last modified: Fri Jul 13 16:51:51 EDT 2001 By Pantelis Vlachos
Minitab
Statistical software package.
Welcome to Minitab.Com Minitab.com System Requirements Minitab.com works best when using the following browsers : Internet Explorer 5.0 and Netscape 6.0. Minitab.com work requires that client side Javascript is enabled on your system. Search Advanced Products | Training | Support | Company | Resources | Downloads | Contacts | Site Map Copyright 2005 Minitab Inc. All rights reserved. See Legal Page . Minitab's Privacy Policy
StatTools
Advanced statistical analysis add-in for Microsoft Excel. StatTools replaces Excel's stats function with 36 robust statistical procedures.
404 Page Not Found - Palisade Europe Home About Us 404 Page Not Found Welcome to Palisade The page you requested cannot be found. You may be interested in: PRODUCTS RISK ANALYSIS @RISK Order Now Custom VBA Macros Online Tutorial Testimonials Case Studies Articles Reviews Winston Training CD Special Offer for Crystal Ball Users @RISK in Industry: Six Sigma DecisionTools Suite DTS Used at Top MBA Schools @RISK for Project New Features in @RISK 4.1 for Project Online Tutorial @RISKAccelerator BestFit RISKview TopRank DECISION ANALYSIS PrecisionTree Online Tutorial OPTIMISATION Evolver Main Page New Features in Evolver 4.0 RISKOptimizer Online Tutorial Related Books Technical Corner Example Excerpt from Dec Making Book STATISTICS StatTools NeuralTools DEVELOPER KITS @RISK Developer's Kit BestFit Developer's Kit Evolver Developer's Kit RISKOptimizer Developer's Kit BOOKS Main Books Page New Books Palisade Books Learning Statistics with StatTools Decision Making Under Uncertainty with RISKOptimizer Decision Making Under Uncertainty with RISKOptimizer: A Training CD Financial Models Using Simulation and Optimization Financial Models Using Simulation and Optimization II Introduction to Financial Modeling with @RISK: A Training CD Decisions Involving Uncertainty: An @RISK Tutorial for the Petroleum Industry MORE... Trial Versions CORPORATE LICENSES Main Page Benefits Licensing Options Enterprise License Site License Divisional License Annual Lease Multi Desktop Network Licenses Which licensing option is right for you? Summary Software Contact Us PALISADE IN INDUSTRY @RISK and Six Sigma @RISK: The Perfect Six Sigma Companion Model: Electrical Circuit Analysis Model: Design of Experiments Model: Design of Experiments with Optimisation Case Study: DecisionTools Safeguards Precious Metal Refiner Case Studies DecisionTools Safeguards Precious Metal Refiner Her Majesty's Prison Service and @RISK Merck Uses @RISK for Value-at-Risk Steel Giant Uses @RISK to Manage Furnace Shutdown RDK Plays Key Role in Upstream Oil Gas Analysis @RISK, PrecisionTree Critical in Preparing for Volcano Eruption Using Monte Carlo Simulation for Pavement Cost Analysis @RISK Helps Utility Balance Acquisitions and More DecisionTools Streamlines Distribution Management from Hours to Minutes Utility Uses @RISK, Evolver to Manage Risks of High Stakes Contracts New RDK Slashes Run Time for Mammoth Utility Simulations Procter Gamble Uses @RISK and PrecisionTree Worldwide Our Customers Customer Testimonials @RISK BestFit @RISK Accelerator @RISK for Project RISKOptimizer Seminars Corporate Licenses Main Page Benefits Licensing Options Enterprise License Site License Divisional License Annual Lease Multi Desktop Network Licenses Which licensing option is right for you? Summary Software Contact Us TRAINING CONSULTING Training Main Consulting Services Live Web Training On-Site Training Regional Seminars Main Schedule Seminar Outlines Presenters Sites Rates Clients Testimonials Training CDs Introduction to Financial Modeling with @RISK Decision Making Under Uncertainty with RISKOptimizer ModelAssist @RISK 4.5 Online Tutorial @RISK for Project Online Tutorial PrecisionTree Online Tutorial RISKOptimizer Online Tutorial SHOPPING View Your Shopping Cart Help CONTACT US Contact Palisade Get a Free CD-ROM Search Site Map Employment at Palisade Consultants Consultants in the United States Consultants Worldwide Resellers Contact an International Reseller Interested in Becoming a Palisade International Reseller? Resellers in Europe About Palisade SUPPORT Technical Support Main Page Palisade HelpDesk Palisade Support Forums Palisade KnowledgeBase Tips Tricks Product Support Centers @RISK 4.5 for Excel @RISK 4.0 for Excel @RISK 3.5 for Excel @RISK 4.1 for Project @RISK 4.0 for Project @RISK 3.5 for Project DecisionTools Suite 4.5 RISKview 4.5 RISKview 4.0 BestFit 4.5 BestFit 4.0 PrecisionTree 1.0 TopRank 1.5 Evolver 4.0 RISKOptimizer StatTools 1.0 Updates @RISK 4.5 for Excel @RISK 4.0 for Excel @RISK 3.5 for Excel @RISK 4.1 for Project @RISK 4.0 for Project @RISK 3.5 for Project RISKOptimizer RISKview 4.5 RISKview 4.0 BestFit 4.5 BestFit 4.0 Evolver PrecisionTree TopRank StatTools 1.0 Maintenance Plans Main Page Software Registration Software Authorisation RELATED SITES Palisade US Mass Spectrometry NEWS Reviews @RISK 4.5 Pro Product Review from OR MS Today @RISK 4.5 Product Review from the Gartner Group Evolver 4.0 Professional: A product review @RISK 4.0 Professional @RISK 4.0 Professional: A product review @RISK arms Excel with risk analysis RISKOptimizer: Powerful tool eliminates much of the guesswork inherent to model derivation Complex business modeling made easy @RISK for Project delivers richer picture @RISK for Project review Top Products - data analysis software Tool for decision making Evolver answers questions that Excel can't DecisionTools Suite - Making business decisions with confidence Articles Combining Preference Theory and CAPM Efficient Frontier Investment and Risk Analysis Applied to the Petroleum Industry @RISK and HMOs Size Up Your Nest Egg with Monte Carlo Models Using Monte Carlo Simulation for Pavement Cost Analysis Why plain old spreadsheets are not enough Palisade takes add-in science to new heights Modeling a European put option Operational Research Software Texaco vs. Pennzoil: Modeling a Settlement in PrecisionTree Schedule Risk Analysis Simplified Planning for Retirement and @RISK Financial Analyses with DecisionTools Press Room Press Contacts Press Releases Trade Show Schedule Image Gallery Privacy Policy Newsletters
Unistat Ltd.
Makes and sells Unistat for Windows: comprehensive stand-alone statistical package that can also be an Excel add-in. A one stop solution for data handling, analysis, and presentation quality scientific graphics.
UNISTAT Statistical Package: Index UNISTAT Statistical Package Version 5.6 Unlimited Edition A comprehensive stand-alone statistical package that can also work as Excel add-in and a leading tool for data analysis and presentation quality scientific graphics since 1984. Light Edition Analyse and present small data sets with most commonly used procedures. Ideal for biomedical pharmaceutical research. Buy online now for only $300. Analysis of Bioassays Optional module; a complete and validated implementation of European Pharmacopoeia. Parallel line, slope ratio and quantal response methods, potency, fiducial limits, ED50. UNISTAT is a registered trademark of UNISTAT Ltd. Windows, Word, Excel, Office are trademarks of Microsoft Corporation. All other brand and product names are trademarks or registered trademarks of their respective holders. Copyright 1984-2005 UNISTAT Ltd. E-mail the Webmaster
statistiXL
Statistics add-in for Microsoft Excel. Includes univariate and multivariate tests such as ANOVA, Correlation, Regression, PCA, Factor and Discriminant Analysis.
statistiXL: Powerful data and statistical analysis software for Microsoft Excel Latest News statistiXL 1.5 Released! 2 February 2005 statistiXL 1.4 Released! 21 March 2004 statistiXL 1.4 Beta Available 1 March 2004 Volume Licensing Available 15 December 2003 statistiXL 1.3 Released. 2 November 2003 statistiXL Download a free trial Buy online now Welcome to statistiXL statistiXL is a powerful new data analysis package that runs as an add-in to Windows versions of Microsofts sophisticated Excel spreadsheet program. statistiXL has been entirely designed and written by scientists in order to meet the demanding needs of anyone requiring access to a robust, versatile statistical analysis package that is quick to learn and easy to use. You no longer need to spend hours with manuals just learning how to perform the analyses you need in order to get to the really important bit the results. With its wealth of features, Excel provides an ideal environment for data input, manipulation and calculation. By leveraging this familiar environment, statistiXL greatly extends this feature set to encompass high powered statistical analysis without the need to learn how to use an entirely new application from scratch. Data stored in existing Excel spreadsheets can instantly be subjected to a wide range of statistical tests (many frequently not seen in other analysis software) including Analysis of Variance (ANOVA) Cluster Analysis Contingency Tables Simple, Partial, Multiple and Canonical Correlation Linear and Circular Descriptive Statistics Classification and Grouping Discriminant Analysis Factor Analysis Goodness of Fit Tests such as Binomial, Circular, Normal and Poisson Simple and Multiple Linear Regression Nonparametric Tests such as Friedman, Kruskal-Wallis and Mann-Whitney Principal Component Analysis (PCA) Univariate and Multivariate t-Tests And because statistiXL outputs the results of its analyses straight into an Excel spreadsheet you can use the tools that you are already familiar with to arrange and format both textual and graphical output: changing fonts, rearranging cells, altering the scale on the axis of a graph etc etc. You can even subject the results tofurther analysis using either statistiXL or Excels numerous built in functions. For a detailed overview of the tools provided by statistiXL please check out the Features section of this site. If you would like to download a fully functional trial version of statistiXL you can do that here . The best places to ask questions about statistiXL and for other support issues are our Support Forums though you can always email us directly at support@statistixl.com if you prefer. The Forums also provide a place for you to request new features, or to suggest changes to existing features, that you would like to see in future versions of statistiXL. We trust that you will be impressed by the power and flexibility of statistiXL. Home | News | Features | Try Buy | Support | AboutUs statistiXL 2004
WinSTAT
An Excel Add-In providing statistical tests and diagrams. Demonstration download.
WinSTAT Statistics Add-In for Microsoft Excel the Statistics Add-In for Microsoft Excel Support Welcome! WinSTAT is the statistics Add-In for Microsoft Excel, and this is the place to find out all about it. Tired of your hard-to-use, need-to-be-a-fulltime-expert statistics package? Find out why WinSTAT is the program for you. Wondering if WinSTAT covers the functions and graphics you need? Let the function reference page surprise you, complete with sample outputs of tables and graphics for all functions. Still not convinced? There's no way to be sure until you've tried WinSTAT for yourself. We've got the demo download right here. We're certain that WinSTAT is in your future. Why not make the future happen? Order WinSTAT now. WinSTAT is a product of: R. Fitch Software email: WinSTAT, Statistics, Add-In, Addin, Add-On, add, in, Microsoft, Excel, statistical, software, graphics, tool, geometric, skewness, kurtosis, chi-square, crosstabs, frequencies, means, normal distribution, outliers, randomness, test, mcnemar, t-test, u-test, mann-whitney, wilcoxon, analysis, analysis of variance, anova, friedman, h-test, kruskal-wallis, q-test, cochran, repeated measures, cross-correlation, correlation, pearson, spearman, rank, partial, kendall, tau, box, whiskers, cumulative, pareto, quality control, charts, scatter, scatterplot, diagram, process, capability, cluster analysis, discriminant analysis, factor analysis, survival analysis, regression, multiple, polynomial, weighted, linear, histogram, dendogram, probability, plot, varimax, quartimax, kolmogorov-smirnow This might interest you as well: TeX format to Word and vice versa: Questions? Send email to .
SigmaXL
Pareto Pro is an add-in for Microsoft Excel 97, 2000 and XP, which allows you to create single and multiple charts. Performs analysis that will slice and dice data. Includes free demos and product list.
SigmaXL - A Leading Provider of User Friendly Excel Add-Ins for Statistical and Graphical Analysis SigmaXL Introducing SigmaXL Version 4.2, a powerful but easy to use Excel Add-In, that will enable you to Measure, Analyze, Improve, and Control your service, transactional, and manufacturing processes. This is the perfect tool for Six Sigma Green Belts, Black Belts, Quality and Business Professionals, Engineers, and Managers. Priced at $199*, SigmaXL is a fraction of the cost of any major statistical product, yet it has all the functionality most professionals need. More Download a 30-Day trial View a PowerPoint Demonstration of SigmaXL Pareto Pro An Add-In for Microsoft Excel 97 and later which allows you to create Basic (single) andAdvanced (multiple) Pareto charts. This software provides you with powerful tools to perform Pareto analysis, allowing you to easily slice and dice your data, quickly separating the vital few from the trivial many.Pareto Pro handles large data sets with ease accommodating up to 8000 unique items (levels) per category variable. More Download a 15-Day trial
XLSTAT
Data analysis and statistics add-in for Excel. Includes over 40 statistical and data analysis features for statistics experts, researchers, students, and teachers. Buy on-line or download trial version.
XLSTAT | Statistical software for MS Excel - Statistics and data analysis with MS Excel You want to analyze your data without having to shift it from one application to another You want to apply your skills in statistics to data in Excel format You want to boost Excel functionalities but keep the program easy to use You want simple, functional software to help train students in statistics and data analysis You want to save time and money XLSTAT is the leading data analysis and statistical solution for Microsoft Excel. The XLSTAT add-in offers a wide variety of functions to enhance the analytical capabilities of Excel, making it the ideal tool for your everyday data analysis and statistics requirements. XLSTAT runs on all Excel versions from version 97 to version 2003. July 22 2005 Addinsoft announces the release of version 1.8 of XLSTAT-PLS, the ideal solution for PLS and PCR regression with MS Excel. July 7 2005 Addinsoft announces it has signed distribution agreements with local distributors in Brazil and Korea. More news ... Because it is quick, reliable, easy to install and to use - and well-priced - XLSTAT is used today by more than 10,000 customers in businesses and universities, big and small, in over 70 countries throughout the world. XLSTAT can be purchased online on a highly secured site, anytime, anywhere. Both electronic and CD-Rom versions are available. Click here to purchase XLSTAT online via our secured servers Click here to download a fully functional trial version of XLSTAT All XLSTAT versions are available in English, French, German, Italian and Spanish. Support is provided in French, English, German and Spanish. Some of our customers: 1995 - I want to ... download XLSTAT have some support order XLSTAT check XLSTAT prices contact Addinsoft know more about XLSTAT know more about Addinsoft know about the services check customer references discover some Excel books discover some statistics books go back to the home page
Analyse-It
Statistical software integrated into Microsoft Excel for linear regression, anova, chi-square and other functions. Download evaluation.
Analyse-it statistical software, statistics add-in software for Microsoft Excel statistical software, statistics software. analyze-it or analyse-it. including multiple linear regression, anova, more. Analyze-it! statistical software add-in for Microsoft Excel. Easy to use statistics software. Why struggle with expensive difficult to use statistical software? Analyze-it statistics software includes multiple linear regression analysis, ANOVA (analysis of variance), and more. Follow the links on the right-side to read more about our statistics software, then why not download a free unrestricted 30-day evaluation and test-drive the Analyze-it statistical software, with statistics including: multiple linear regression analysis and ANOVA (analysis of variance) with your own data? Our statistics software More about the Analyze-it statistical software. Analyze-it General statistics software Descriptive statistics, ANOVA,group comparisons, chi-square, correlation multiple linear regression analysis. Analyze-it Clinical Laboratory statistics software Statistical software includes bias plots, method comparison, reference ranges, ROC curves, NCCLS imprecision linearity Multiple linear regression analysis... Statistical software... Statistics software... ANOVA statistics software Recommended statistics books links to other statistical web-sites 2000 see Legal notices Last updated: 10 Mar 2005
PSPP
Savannah page with mailing lists, CVS repository, bugs track list, task manager.
PSPP - Summary [Savannah] Login Status: Not Logged In Why Log In? Login via SSL New User via SSL This Page Clean Reload Printer Version Search in Projects People Support Bugs Tasks Patchs Hosted Projects Register New Project Full List Statistics Savannah Help Get Support Contributor Wanted Savannah Documentation User Docs (FAQ) Contact Us Developer Info Cryptographic software legal notice Anonymous CVS GNU Webmasters Documentation Organization Projects map www project GNU Project Coming Events Brave GNU World Free Software Directory Help GNU GNU Task List Dev Documentation Licenses List GNU Mirrors PSPP - Summary Public Areas Main | Homepage | Mailing Lists | CVS | Bugs | Tasks | Patches | Search Membership Info Project Admins: - Ben Pfaff - John Darrington 6 members [ View Members ] Group identification Id: 72 System Name: pspp Name: PSPP Group Type: Official GNU software Search in this Group in Bugs Tasks Patchs This project is part of the GNU Project. PSPP is a program for statistical analysis of sampled data. It interprets commands in the SPSS language and produces tabular output in ASCII, HTML, or PostScript format. PSPP development is ongoing. It already supports a large subset of SPSS's transformation language. Its statistical procedure support is limited but growing. License : GNU General Public License V2 or later Registration Date : Thu 02 15 01 at 18:09 Development Status : 3 - Alpha Public Areas: Quick Overview Project Homepage Project Memberlist (6 members) Project Members GPG Keyring Public Areas: Communication Tools Mailing Lists (3 public mailing-lists) Public Areas: Development Tools Source Code Manager: CVS Repository - Browse Sources Repository - Browse Web Pages Repository Bug Tracker (14 open bugs, 49 total) - Submit a Bug - Browse Open Bugs Task Manager (1 open task, 1 total) - Submit a Task - Browse Open Tasks Patch Manager (0 open patches, 1 total) - Submit a Patch - Browse Open Patches Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved. Powered by Savane CVS (before 1.3)
PSPP
Was Fiasco. For statistical analysis of sampled data; interprets commands in SPSS language, outputs tables in ASCII, HTML, PostScript. Description, FAQ, help wanted, news, manual. [Open Source, GPL]
PSPP - GNU Project - Free Software Foundation (FSF) PSPP | PSPP Home | News | Manual | FAQ | Help wanted! | Contributors | GNU Homepage | Announcement: Version 0.4.0 of PSPP is released on Aug 03, 2005 PSPP is a program for statistical analysis of sampled data. It interprets commands in the SPSS language and produces tabular output in ASCII, PostScript, or HTML format. PSPP development is ongoing. It already supports a large subset of SPSS's transformation language. Its statistical procedure support is currently limited, but growing. Source code for the latest release of PSPP is available at ftp: ftp.gnu.org pub gnu pspp . Older versions may be obtained from ftp: alpha.gnu.org gnu pspp . Development sources are available from CVS at http: savannah.gnu.org projects pspp . Questions and comments regarding PSPP can be sent to pspp-users@gnu.org . PSPP bug reports may be sent to bug-gnu-pspp@gnu.org or filed in the bug-tracking system at http: savannah.gnu.org bugs ?group=pspp according to your preference. Return to the GNU Project home page . Please send FSF GNU inquiries to gnu@gnu.org . There are also other ways to contact the FSF. Please send broken links and other corrections (or suggestions) to webmasters@gnu.org . Copyright 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc., 51 Franklin St - Suite 330, Boston, MA 02110, USA Verbatim copying and distribution of this entire article are permitted worldwide, without royalty, in any medium, provided this notice, and the copyright notice, are preserved. Updated: $Date: 2005 10 05 20:02:53 $ $Author: pbrunier $
Raynald's SPSS Tools
Archive of 350+ sample SPSS syntax, scripts and macros classified by purposes, as well as FAQ, Tips, Tutorials and a Newbie's Corner.
Raynald's SPSS Tools FAQ Syntax Macros Scripts Python Tips Links Keywords: powered by FreeFind Site Map Feedback Other languages Deutsch Espaol Francais Italiano Portugus Russian Do you love this site? Welcome to my SPSS pages! I started to use the SPSS software in 1992. Being an actuary , I use it mainly to screen data, analyze insurance claims severity and frequency, fit distribution functions to claims perform risk analysis using Monte Carlo methods and (unexpectedly...) analyze survey data. I also find SPSS's graphs features very powerful and useful to "visualize" the data. Since December 1998, I have participated to the SPSSX-L mailing list and the comp.soft-sys.stat.spss newsgroup. This has had the effect of increasing my knowledge of SPSS by a factor of about 25. I have learned from many strong SPSS'ers such as : John Hendrickx, Hector E. Maletta, Rolf Kjoeller and David Marso. In turn, I have answered about 2,100 questions posted to these two discussion groups. It is more fun to learn SPSS by answering real questions rather than just reading the books and "making up problems" to solve. I find the diversity of problems and situations encountered in these groups to be fascinating. (This probably tells you a lot about my "personality" ). See the Site Map for a bird's view of the site. Purpose s of this site The main purpose is to present useful code and techniques to increase productivity of all level of SPSS users.Your feedback is welcomed! I wrote most of the 675+ sample syntax , macros and scripts included in this site, to answer questions posted to the 2 groups mentioned above (or addressed directly to me by email). However, I also include pieces of code I got from those two sources, from SPSS AnswerNet or from the web. The site includes FAQ and Tips pages, a Newbie's Corner and more. See the Site Map to get the full picture :-) There is also a section to support the book SPSS Programming and Data Management . I am the author of that book published by SPSS. You may download a free acrobat version of the second edition. Share what you know, learn what you don't! I invite you to contribute to the improvement of this site. For instance, if you have a syntax, macro or script which does something not covered in this site, send me a copy (or send me the link) and I will add it with proper credit. Such code should be self contained, that is, it should either refer to (work on) one of the data file which comes with SPSS or contain dummy data (ideally using DATA LIST or INPUT PROGRAM statements) as well as a brief description of its purposes. Don't be shy! Upon request, I will not mention your name but simply state that it comes comes from an anonymous contributor. As a bonus, If I find the code can be improved on, I will send you a copy but will nevertheless credit you for the improved version (assuming you don't mind). You have nothing to lose! Help me make this the best possible SPSS site. Send me an email and include your code as an attachment. Topic suggestions for new syntax, macro, scripts, FAQ or Tips are also welcomed. Caveats This site is not sponsored by SPSS Inc. I am just an enthusiastic user of SPSS software. Although I am not sure of the legal significance of the following, I am stating it anyway (just in case it is necessary to protect rights of authors whose code is reproduced in these pages): "All code shown here remains the property of the original author, stated here or not. By downloading code from this site, you agree that you are fully responsible to ensure that the code meets your requirements and that the authors are not liable for any loss resulting from the use of such code." This being said, the code I wrote may be freely used or posted on your website (with credit) but may not be sold or otherwise distributed to third parties without written authorization. As far as the web site itself is concerned, it may not be copied without my written authorization. Have fun! Raynald Levesque Montreal, Canada "The best thing a man can do for his children is to love their mother" You are visitor number since April 5. 2001 This page was last updated on 13 11 2005 Raynald's SPSS Tools Raynald Levesque 2001-05
Rotation PRINCALS Solutions
Annotated example of how a solution of a non-linear principal components analysis (PRINCALS) can be rotated, using SPSS.
Rotation PRINCALS Solutions On the Rotation of Non-Linear Principal Components Analysis (PRINCALS) Solutions: Description of a Procedure Ruben Konig Published in ZUMA-Nachrichten 50, May 2002 Printable version (pdf) Please refer to this document as: Konig, Ruben (2002). On the Rotation of Non-Linear Principal Components Analysis (PRINCALS) Solutions: Description of a Procedure. ZUMA-Nachrichten, 26 (50), 114-120. In diesem Beitrag wird anhand eines Beispiels gezeigt, wie man in SPSS eine Lsung einer nicht-linearen Hautpkomponentenanalyse (PRINCALS) rotieren kann. This paper describes an example of how a solution of a non-linear principal components analysis (PRINCALS) can be rotated, using SPSS. 1. Being forced to go beyond ordinary principal components analysis Ordinary principal components analysis is a technique that can be used to explore the relationships within a group of numeric variables. As such it is a very potent technique, but it has two major drawbacks. a) It can only be used with numerical variables, and b) it can only be used assuming that the relationships between the variables are linear. Therefore, using ordinary principal components analysis to explore relationships that might not be linear, between variables of which the measurement level is uncertain, may be tricky. In such cases, non-linear principal components analysis may help. 1 However, non-linear principal components analysis has some disadvantages, too. One of these disadvantages is the fact that the programme PRINCALS, 2 that executes non-linear principal components analysis by alternating least squares, does not enable rotation to a simple structure. As a consequence, solutions with more than two components are very hard to interpret because they cannot be plotted on paper. This paper describes how the solution of a non-linear principal components analysis can still be rotated when data were originally intended to serve in an ordinary principal components analysis, but doubts about the measurement level or the linearity of relations have risen. However, the described procedure can only be used when none of the variables in the analysis is treated as a multiple nominal variable. 3 The procedure may be used for orthogonal rotation as well as for oblique rotation of the component loadings of the variables. When rotating orthogonally, it is also possible to rotate the object scores (component scores) for data reduction purposes. Below, you will find a) a very short and incomplete introduction to non-linear principal components analysis, and b) an annotated example of the rotation procedure in SPSS format. The rotation procedure contains variable names that were used in the research of Konig Renckstorf Wester (2001). It is evident that, in order to use the procedure yourself, you have to replace these variable names by the names of your own variables. 2. Non-linear principal components analysis Non-linear principal components analysis differs from ordinary principal components analysis in that it is possible to treat variables not only as numeric, but as ordinal or nominal variables as well. 4 The categories of all non-numerical variables are assigned a 'category quantification', on a numerical scale. These variables are in fact recoded to give them numerical properties. Of course, the measurement level of the variables restricts the choice of category quantifications. The categories of ordinal variables must be kept in their original order. 5 The category quantifications make it possible to treat the non-numerical variables as numerical variables and perform a principal components analysis. Where ordinary principal components analysis searches for an optimal mean squared correlation between the original variables and the components, non-linear principal components analysis searches for an optimal mean squared correlation between the variables recoded by the category quantifications, and the components. In the search for an optimal mean correlation between the recoded variables and the components, both the component loadings and the category quantifications are varied until the optimum is found. In ordinary principal components analysis only the component loadings are varied. Readers are explicitly referred to Van de Geer (1988), Gifi (1991), De Leeuw (1984), and SPSS (1990). 3. Annotated example of the rotation procedure in SPSS syntax format COMMENT INPUT VARIABLES FOR THIS ROTATION PROCEDURE ARE THE VARIABLES IN THE PRINCALS ANALYSIS (SEE BELOW) AND THE RESPONDENT-NUMBER (RESPNR). COMMENT FIVE-DIMENSIONAL NON-LINEAR PRINCIPAL COMPONENT ANALYSIS: * THE ANALYSIS INVOLVES SOME VARIABLES WITH FIVE, FOUR, AND TWO CATEGORIES * THE ANALYSIS INVOLVES ORDINAL AND SINGLE NOMINAL VARIABLES * THE UNROTATED OBJECT SCORES (COMPONENT SCORES) ARE SAVED AS THE VARIABLES: - noroto_1 (object scores on the first component) - noroto_2 (object scores on the second component) - noroto_3 (object scores on the third component) - noroto_4 (object scores on the fourth component) - noroto_5 (object scores on the fifth component) * THE CATEGORY QUANTIFICATIONS, SINGLE CATEGORY COORDINATES, AND COMPONENT LOADINGS ARE WRITEN TO THE MATRIX SYSTEM FILE 'file_a'. princals variables=v117 v118 v131 v132 v143 v152 v155 v162 v168 v171 v184 v228 (5) v138 v145 v147 v148 v150 v151 v153 v163 v166 v167 v170 v172 v175 (4) v142 (2) analysis=v117 v118 v131 v132 v145 v147 v148 v150 v151 v152 v153 v162 v163 v166 v167 v170 v171 v172 v175 v228 (ordi) v138 V142 v143 v155 V168 v184 (snom) dimension=5 maxiter=200 print=eigen quant loadings plot=none save=noroto matrix=out('file_a'). COMMENT SAVE THE UNROTATED OBJECT SCORES (COMPONENT SCORES) TOGETHER WITH THE RESPONDENT NUMBER (respnr) TO THE SYSTEMFILE 'file_b'. save outfile='file_b' keep=respnr noroto_1 noroto_2 noroto_3 noroto_4 noroto_5. COMMENT TO ROTATE THE COMPONENT LOADINGS, WE MAKE USE OF THE SPSS COMMAND 'FACTOR' (THE COMMAND USED TO PERFORM ORDINARY PRINCIPAL COMPONENTS ANALYSIS AND FACTOR ANALYSIS), BUT BEFORE WE CAN USE THIS COMMAND, WE HAVE TO PREPARE THE UNROTATED FACTOR LOADINGS. COMMENT FIRST, THE UNROTATED COMPONENT LOADINGS ARE READ FROM THE MATRIX SYSTEMFILE 'file_a'. get file='file_a'. select if ROWTYPE_="LOADING_". COMMENT SECOND, THE UNROTATED COMPONENT LOADINGS HAVE TO BE PREPARED FOR THE COMMAND 'FACTOR' BECAUSE FACTOR CANNOT READ THE LOADINGS IN THE FORMAT THEY ARE IN NOW; THEREFORE, ROWS AND COLUMNS HAVE TO BE INTERCHANGED, RESULTING IN A MATRIX IN WHICH THE ROWS REPRESENT THE COMPONENTS, AND THE COLUMNS REPRESENT THE VARIABLES IN THE ANALYSIS (RECODED BY THE CATEGORY QUANTIFICATIONS), WHEREBY: * THE NAMES OF THE VARIABLES IN THE ANALYSIS HAVE TO BE READ FROM THE VARIABLE 'VARNAME_' IN 'file_a' (NOW ACTIVE FILE) * THE COMPONENT LOADINGS OF THE VARIABLES IN THE ANALYSIS ON THE RESPECTIVE COMPONENTS HAVE TO BE READ FROM THE VARIABLES 'DIM1' TO 'DIM5' IN 'file_a' (NOW ACTIVE FILE). flip variables=DIM1 DIM2 DIM3 DIM4 DIM5 newnames=VARNAME_. COMMENT THIRD, A NEW VARIABLE 'ROWTYPE_' HAS TO BE CREATED WITH VALUE 'FACTOR'. string ROWTYPE_ (a8). compute ROWTYPE_='FACTOR'. COMMENT FOURTH, A NEW VARIABLE 'FACTOR_' HAS TO BE CREATED WITH THE NUMBER OF THE RESPECTIVE PRINCIPAL COMPONENTS AS VALUE. compute FACTOR_=$casenum. COMMENT FIFTH, THE UNROTATED COMPONENT LOADINGS PREPARED IN THIS WAY HAVE TO BE SAVED TOGETHER WITH THE NEW VARIABLES 'ROWTYPE_' AND 'FACTOR_' IN A SEPARATE SYSTEMFILE 'file_c'. save outfile='file_c' keep=rowtype_ factor_ v117 v118 v131 v132 v138 V142 v143 v145 v147 v148 v150 v151 v152 v153 V155 v162 v163 v166 v167 V168 v170 v171 v172 v175 v184 v228. COMMENT NOW THE COMPONENT LOADINGS ARE PREPARED TO BE INSERTED IN THE PROCEDURE 'FACTOR' AND STORED IN 'file_c'. COMMENT ORTHOGONAL ROTATION OF THE COMPONENT LOADINGS USING THE PROCEDURE 'FACTOR'. factor matrix=in(fac='file_c') criteria=iterate(100) format=sort rotation=varimax. COMMENT IN CASE YOU ONLY WANT TO INTERPRET THE COMPONENT STRUCTURE, YOU ARE READY NOW; IF YOU WANT TO USE THE COMPONENTS ANALYSIS FOR DATA REDUCTION, YOU WILL ALSO HAVE TO ROTATE THE OBJECT SCORES (COMPONENT SCORES), WHICH IS THE AIM OF THE COMMAND LINES BELOW. COMMENT TO ROTATE THE OBJECT SCORES (COMPONENT SCORES) WE HAVE TO USE THE 'MATRIX' PROCEDURE OF SPSS. COMMENT TO BE ABLE TO AFTERWARDS CHECK WHETHER OR NOT WE HAVE MADE MISTAKES WE WILL ROTATE THE COMPONENT LAODINGS A SECOND TIME WITH THE 'MATRIX' PROCEDURE, WHICH MEANS THAT WE HAVE TO PREPARE AND SAVE (IN THE SYSTEMFILE'file_d') THE UNROTATED COMPONENT LOADINGS FOR USE WITHIN 'MATRIX'. get file='file_a'. select if ROWTYPE_="LOADING_". save outfile='file_d' keep=VARNAME_ DIM1 DIM2 DIM3 DIM4 DIM5. COMMENT STARTING THE PROCEDURE 'MATRIX'. matrix. COMMENT CREATING THE MATRIX WITH THE UNROTATED OBJECT SCORES (COMPONENT SCORES) (MATRIX NAME: 'noroto'). get noroto file='file_b' variables=noroto_1 noroto_2 noroto_3 noroto_4 noroto_5. COMMENT CREATING A VECTOR WITH THE RESPONDENT NUMBERS CORRESPONDING TO THE UNROTATED OBJECT SCORES (VECTOR NAME: 'respnumb'). get respnumb file='file_b' variables=respnr. COMMENT CREATING THE MATRIX WITH UNROTATED COMPONENT LOADINGS (MATRIX NAME: 'norotv'). get norotv file='file_d' variables=DIM1 DIM2 DIM3 DIM4 DIM5. COMMENT CREATING A VECTOR WITH THE VARIABLE NAMES CORRESPONDING TO THE UNROTATED COMPONENT LOADINGS (VECTOR NAME: 'varnames'). get varnames file='file_d' variables=VARNAME_. COMMENT CREATING THE TRANSFORMATION MATRIX FOR ROTATION (MATRIX NAME: 'transfor') THIS MATRIX HAS TO BE COPIED FROM THE OUTPUT OF THE PROCEDURE FACTOR (CELLS ARE SEPARATED BY COMMAS AND COLUMNS BY SEMICOLONS) (NOTE THAT IF YOU CONFIGURED SPSS TO PRINT DECIMAL COMMAS INSTEAD OF DECIMAL POINTS IN ITS OUTPUT, YOU WILL HAVE TO CHANGE THESE DECIMAL COMMAS INTO DECIMAL POINTS). compute transfor= {.52094, .50920, .46218, .24348,-.44322; -.48895, .55874, .43577,-.41575, .29326; -.58812, .06618, .07917, .79650,-.09511; -.25018,-.56194, .54308,-.25321,-.51243; -.28474, .32920,-.54341,-.26333,-.66777}. COMMENT TO CHECK WHETHER MISTAKES WERE MADE, THE COMPONENT LAODINGS ARE ROTATED AGAIN (NAME OF RESULTING MATRIX: 'rotv'). compute rotv=norotv * transfor. COMMENT THE OUTPUT OF THIS MATRIX PROCEDURE HAS TO BE PRINTED AND COMPARED WITH THE OUTPUT OF THE PROCEDURE 'FACTOR' (ROWS ARE BEING LABELED BY THE NAMES OF THE VARIABLES). print rotv title="multiplication component loadings and transformation matrix" rnames=varnames. COMMENT ROTATION OF THE OBJECT SCORES (COMPONENT SCORES) OF THE RESPONDENTS (NAME OF RESULTING MATRIX: 'roto'). compute roto=noroto * transfor. COMMENT SAVING THE RESULTING MATRIX WITH OBJECT SCORES (COMBINED WITH RESPONDENT NUMBERS) AS ACTIVE FILE (FOR USE OUTSIDE THE PROCEDURE 'MATRIX'). save {respnumb,roto} outfile=* variables=respnr comp1 to comp5. COMMENT TERMINATING THE PROCEDURE 'MATRIX'. end matrix. COMMENT THE OBJECT SCORES ARE AVAILABLE NOW ON THE ACTIVE FILE AS THE VARIABLES 'comp1' TO 'comp5'. Contact Dr. Ruben Konig Department of Communication Science University of Nijmegen P.O.Box 9104 6500 HE Nijmegen Netherlands Tel.: +31 24 3615789 r.konig@mailbox.kun.nl http: oase.uci.kun.nl ~rkonig Notes 1 In case the non-linear principal components analysis shows that the variables are all of metric or near metric measurement level and that the relationships are linear or near linear, one can always choose whether to return to ordinary principal components analysis or not. (back to the text) 2 PRINCALS is incorporated as a procedure in the SPSS package Categories (SPSS 1990). However, PRINCALS is not available through the menus of SPSS for windows. It is only available as a syntax command. (back to the text) 3 See note 5. (back to the text) 4 It is important to note that the choice of measurement level is not only a matter of measurement level, but also of the relationships between variables (Van de Geer 1988; Gifi 1991; De Leeuw 1984). Of course, a nominal variable should not be treated as an ordinal or numeric variable, but it is fairly well possible to treat an ordinal or numeric variable as a nominal variable in the analysis. This, for instance, is needed when the relationship between variables is not monotonic, but curvilinear. (back to the text) 5 As to the category quantifications of nominal variables there are two possibilities. It is possible to compute only one set of category quantifications for a nominal variable, or to compute as many sets of category quantifications as there are components in the analysis. In the first case you treat the variable as a single nominal variable, whereas in the second case, you treat it as a multiple nominal variable (Van de Geer 1988; Gifi 1991; De Leeuw 1984). (back to the text) References Geer, J. P. van de, 1988: Analyse van kategorische gegevens [Analysis of categorical data]. Deventer, Netherlands: Van Loghum Slaterus. Gifi, A., 1991: Nonlinear Multivariate Analysis (Reprint with corrections). Chichester, England: John Wiley Sons. Konig, R. Renckstorf, K. Wester, F., 2001: On the Use of Television News: Routines in Watching the News. Pp. 147-171 in K. Renckstorf D. McQuail N. Jankowski (Eds.), Television News Research: Recent European Approaches and Findings. Berlin: Quintessenz Books. (A previous version of this article was published in Communications 23: 505-525). Leeuw, J. de, 1984: Canonical Analysis of Categorical Data (New edition). Leiden, Netherlands: DSWO Press. SPSS, 1990: SPSS Categories. Chicago, IL: Author.
Statistical Resources
Syntax for Polytomous logistic regression, Event history using SPSS, Macro programs for SPSS, Stata, R, SAS, for evaluating collinearity in models with interactions or nonlinear terms, Scripts.
Statistical Resources ... Statistical Resources Main themes Tools Miscellaneous Macro programs for: SPSS Stata R SAS [ main ][ tools ][ misc ][ SPSS ][ Stata ][ R ][ SAS ] Statistical Resources by John Hendrickx Main themes desmat Contrasts and interactions in SAS and Stata MCL Special restrictions in multinomial logistic regression. Sample programs in SPSS , SAS , Stata , R , GLIM and LIMPEP . Macro programs for Stereotyped Ordered Regression in Stata and SAS . Perturb Evaluate collinearity by adding random noise to variables. Works for categorical variables and non-regression models. Programs for SPSS , Stata and R . [ main ][ tools ][ misc ][ SPSS ][ Stata ][ R ][ SAS ]
SPSS Scripts
Information on downloadable SPSS scripts, SPSS OLE objects, Sax Basic language.
Spss Scripts Site - Information on Spss scripts, Sax Basic language, Scripts to download Sorry...your browser does not support frames. This site works only with frames. If you want any information, or you want to give me any advice on how to improve this site, send an e-mail to me .
How to Use SPSS to Study Ego-Centered Networks
Shows how analyses of networks is best done by starting with 2 data sets: (1) focal individuals and their networks; (2) network members and their ties with focal individuals. Shows how to link these 2 data sets to (a) calculate summary information on each network; (b) combine focal individual, tie, network data.
HOW TO USE SPSS HOW TO USE SPSS TO STUDY EGO-CENTERED NETWORKS Christoph Mller, Barry Wellman, and Alexandra Marin About the authors This is a pre-print version of our paper in Bulletin de mthodologies sociologiques (BMS), no. 64, octobre 1999, pp. 63-76. Abstract SPSS's data-handling facilities make it useful for studying ego-centered networks. Such networks are useful for studying a variety of subjects, such as social support, personal community, and an organization's relationships. We show how analyses of ego-centered networks are best done by starting with two data sets: (1) focal individuals and their ego-centered networks; (2) network members and their ties with focal individuals. We show how to link these two data sets to (a)calculate summary information about each ego-centered network; (b) combine focal individual, tie and network data. Note: This article has been developed from "How to Use SAS to Study Ego-Centered Net works" (Wellman 1992a), itself a thoroughly revised version of Wellman and Baker (1985). The Nature of Ego-Centered Network Data Many social network analysts study ego-centered networks, networks defined "Ptolemaically" from the standpoints of focal individuals ( Figure 1) . Ego-centered (or personal) network analyses are common in the study of community and social support (e.g., Wellman 1999), and they can be used for studying other matters such as corporate relations. Most ego-centered analyses have studied only the direct ties that focal individuals have with the members of their networks. A few analyses have studied the links that network members have among themselves, and a very few have studied a focal individual's indirect ties, such as their ties to the friends of their friends. This article presents some ways of using SPSS software to analyze ego-centered networks. SPSS is one of the most widely-used software packages in the social sciences. It has been crucial in facilitating do-it-yourself research using individuals as discrete units of analysis. (Wellman 1998). However, quantitative studies of ego-centered network data are more complicated than survey research that use individuals as units of analysis. Network analysts must keep track of several different types of information (Campbell and Lee 1991): Characteristics of focal individuals (e.g., their gender or ethnicity); Characteristics of ties between focal individual and network members. These may be relational characteristics (e.g.,each network member's frequency of contact), relational contents (e.g., the extent to which a network member provides emotional aid), or relational types (e.g., whether a network member is a friend, neighbor, workmate or relative of a focal individual). Characteristics of the network members with whom focal individuals have ties (e.g., their gender or ethnicity); Network composition, the aggregated characteristics of the network members and ties in each ego-centered network (e.g., the mean frequency of contact that the members of a network have with a focal individual, the proportion of network members providing emotional aid); Network structural characteristics (e.g., the overall density of ties in a network, the number of clusters in a network). FIGURE 1 ( back ) We deal here only with the basic and most common case: studying first-order, direct ties between focal individuals and their network members. In such analyses, a basic set of problems is how to store and link individual, tie and network data in useful and efficient ways. This article describes some ways of using SPSS to handle these matters. The basic procedure is to.... Store alter and tie data in one tiewise data set; Store ego and network structure data in a separate netwisedata set; Use the same NETID variable and values in the two data sets to identify the focal individuals; Use SPSS's AGGREGATE and MATCH FILES procedures to link the data. Constructing Original Data Sets Tiewise: In tiewise data sets, the characteristics of alters include both their personal characteristics (such as age and gender) and their tie characteristics (such as a sibling relationship). By definition, a focal individual and a network member have exactly one tie, although a single tie often contains multiple role relationships. Even though the tie is between the focal individual and the network member, for computational purposes you can treat network members as "possessing" the characteristics of their ties with focal individuals. This makes it possible to store both network member and tie variables in one data set (arbitrarily called TIE in this article). Netwise: By definition, focal individuals are at the centers of their own ego-centered networks (Figure 1). Thus focal individuals not only have personal characteristics such as gender and ethnicity, they have networks with different densities, numbers of clusters, etc. Hence, analysts can store information about focal individuals and their networks in the same records of a netwise data set (arbitrarily called NET in this article). However, it is often more useful to use the procedures described in this article to compute data about the composition of networks. Data Entry: One special condition for data entry must be met. The otherwise separate tiewise and netwise data sets must each contain the same variable (arbitrarily called NETID in this article) that uniquely identifies each focal individual. In the tiewise data set, the NETID variable uniquely identifies the ego-centered network to which each network member belongs. If several network members belong to the same network, each of the network members will have the same NETID number. In the tiewise data set, the NETID variable is used to produce summary information about each network and to join this summary information with the information about focal individuals that is in the netwise data set. In the netwise data set, the NETID variable uniquely identifies the focal individual and his her network. ( Note on importing data . ) Each tie in the TIE data set should also have a unique TIEID. This is necessary for tie-wise analysis. A useful trick is to create the TIEID variable from a combination of TIENUM and NETID. TIENUM uniquely identifies the members of each network, numbering them within each network from "1,2,3, ... N". By combining the NETID and the TIENUM variables you get one new unique TIEID number for each tie in the entire data set (e.g., "14115") where the first three digits (e.g., "141") represent the NETID of the ego and the last two digits (e.g., "15") represent the TIENUM. Thus TIEID "14115" represents tie 15 of ego 141. At times this can give you useful information as when you want to identify the ties in all the networks that have very high frequencies of contact with focal individuals. (NETID * 100) + TIENUM =TIEID The "Aggregate" Procedure The SPSS AGGREGATE procedure computes summary statistics such as means across groups of cases and produces a new SPSS system file containing one case for each group. The variables of this aggregated file are the summary measures. This feature allows analysts to produce network compositional data such as the mean frequency of contact for each network, the percentage of network members who provide emotional support, and the number of network members who provide emotional support. (Note: Use separate working copies of the original data sets while doing data transformations so that you can always go back to your original variables in case you make a mistake or change your mind. To use the AGGREGATE procedure, three sets of information must be specified: The name of the new aggregated file: The OUTFILE statement defines and creates a new summary data set from the statistics that you want to have computed from specific TIE variable(s). We arbitrarily call this file: TIESUM. The variable(s) that define(s) the aggregated group: The BREAK subcommand defines the aggregated group. Each break group corresponds to one case in the new aggregated file. The BREAK statement specifies the variable(s) by which records will be grouped when computing statistics. The functions that create the new aggregated variable(s): Use regular SPSS commands to create new variables in the output file. Apply commands such as SUM or MEAN to variables in the TIE data set to create summary variables in the TIESUM output data set (see example below). This approach allows analysts to produce summary statistics for each ego-centered network. For example, instead of computing the mean frequency of contact for the entire sample of ties, analysts can compute separate means for each focal individual's network. Example Information about 343 network members is stored in the TIE file (the example is from Wellman 1992b). The following SPSS procedure creates the new outfile data set TIESUM, containing summary information about the 29 networks to which these 343 network members "belong". Note: Do not use the numbers in the above example ("1.", etc.) in your SPSS statement. They are merely guides to the explanation that follows this note. 1. GET FILE="C:\TIE.SAV". AGGREGATE 2. OUTFILE="C:\TIESUM.SAV" 3. BREAK=netid 4. mftf pemaid mctage = MEAN (ftf emaid ctage) sftf semaid = SUM (ftf emaid). 5. EXECUTE. 6. GET FILE="C:\TIESUM.SAV". VARIABLE LABELS mftf "mean ftf contact" pemaid "pct of emotional aid" etc. (Note: Other SPSS subcommands, such as MISSING or PRESORTED, are not discussed in this article.) Explanations: 1. The "GET FILE=" command indicates your input file, in this example: "C:\TIE.SAV". Always specify the file with a complete path (drive and directory) and enclose it in single or double quotation marks. ( back ) 2. In the second step you define an output file where aggregated data will be stored. The OUTFILE statement directs SPSS to create and store a new data set: "TIESUM.SAV". This data set will contain the summary statistics requested in the AGGREGATE procedure for each value of NETID (that is, each network). ( back ) 3. The BREAK subcommand specifies that statistics are to be computed separately for each value of the variable NETID. This is the crucial step. Since each of the 343 network members has one of 29 NETID values, summary statistics for each of the 29 networks will be computed for the variables listed in the fourth step of the procedure (see the next paragraph). Thus the BREAK statement transforms tie information into by-network summaries: one summary for each of the 29 ego-centered networks. ( back ) (Note on sorting your data file . ) 4. In this fourth step, there are three tie-level variables in the tie data set to be aggregated: the frequency of a network member's contact with ego, whether a network member provides emotional aid (defined as 0=no support, 1=provides support), and a network member's age. (Note: This "0 1" coding is a handy tool for using means to calculate the proportion of network members (or ties) who posses a given characteristic such as "provides emotional aid".) Each new variable in the aggregated file is created by applying an aggregate function to a variable in the active input file (here the active file is called "TIE.SAV"). SPSS requires that these new variables be entered in the same order as their tiewise counterparts in the statement that follow the "=" sign. If PEMAID is the second new variable to be defined, then EMAID must be the second source variable mentioned after the equal sign ("="). If you scramble the order or omit a variable name, your output will be horribly wrong. Even, it can be unobtrusively wrong. The new variables in the TIESUM data set are created by the MEAN and SUM operations. In the example, these are the mean frequency of contact of an ego with all network members, the percentage of an ego's network members who provide support, the mean age of the members of an ego's network, the total frequency of contact an ego has with network members, and the number of an ego's network members who provide support. Thus the new variable MFTF is computed by "=MEAN (ftf)", referring to the variable defined in the tiewise data set. Similarly, totals of variables can be computed by the SUM operation: "[newvarlist] = SUM [oldvarlist]". Thus SFTF equals the total amount of contact that all members of an ego-centered network have with its focal individual. In this example, we adopt the convention of keeping the variable names the same in both the TIE and TIESUM data set, except that they are preceded by either a "M" (mean) or "S" (sum or total). We also use a "P" prefix for mean variables that have been calculated from 0 1 binary codes in the tiewise data set. (Note on aggregating percentages ). The mean in such cases is also the proportion of ties in a network that have a particular characteristic, such as the proportion of ties that provide emotional aid. Although you can choose any names you want for such variables, conventions such as these help to keep track of things by associating the original tiewise variables with the newly-created netwise summary variables. These new variables are netwise summaries of the tiewise information for each focal individual. Thus, MFTF equals the mean face-to-face contact between a focal individual and the members of his her network. Since emotional support was coded 0 1 in TIE, the proportion of ties in each network that provide it are computed by the MEAN operation and exported as the PEMAID variable in the new TIESUM file. In another example, a new SFTF variable is created by the SUM operation of the initial FTF variable, representing the total amount of face-to-face contact between each focal individual and all members of his her network. AGGREGATE can also output other summary statistics. For example, you can calculate the standard deviation "SD (variable list)" to measure the SES and age heterogeneity of ego-centered networks. ( back ) 5. Some SPSS procedures use the EXECUTE command to force data reading. ( back ) 6. As the AGGREGATE procedure by default creates new variables without any labels, we recommend immediately using the usual SPSS labeling procedures to name the aggregated variables, as is done here. Note that in order to operate with the new file "TIESUM.SAV", you have to make it the active file: GET FILE="C:\TIESUM.SAV".( back ) Network Size Use AGGREGATE to calculate network size. One method is to create a new variable defined by the "N" function that counts the number of cases in a break group. AGGREGATE OUTFILE="C:\TIESUM.SAV" BREAK=netid netsize=N. This new variable, netsize represents the weighted numbers of all entries for each break group, that is in our example, for each network. Similarly, the function "NU" computes the unweighted numbers. Another method for calculating network size is to copy NETID to a new variable (arbitrarily called TEMP here) so that you can recode it without destroying it. (Use NETID for this because it should never have missing values.) Recode TEMP so that all non-missing values ="1". If you include TEMP in your AGGREGATE procedure, the SUM of TEMP will be the size of each network: AGGREGATE OUTFILE="C:\TIESUM.SAV" BREAK=netid netsize = SUM (temp). Using the same approach with more recoding will provide more specialized counts, such as the number of kin. Network Composition The approach described above has provided information about the composition of each ego-centered network. You can now use the "TIESUM.SAV" file directly to compare networks. In this example we use CORRELATIONS to correlate the mean frequency and total amount of face-to-face contact in each network with the proportion of network members who provide emotional aid. GET FILE = "C:\TIESUM.SAV". CORRELATIONS VARIABLES=mftf sftf pemaid. Linking Tie Information with Information about Focal Individuals and Network Structure With a "MATCH FILES" statement, you can combine the newly-created TIESUM data set with the NET data set that contains information about focal individuals and the structure of their networks. SPSS does this by "match merging" the TIESUM and NET data sets. It combines records that have the same value for the network identification variable (NETID). That is why analysts must make sure during data entry that both TIESUM and NET contain matching NETID values. NETID is in the original NET data set. It also is carried over automatically from TIE to TIESUM when it is used in the BREAK subcommand of the AGGREGATE procedure. Sort both files you want to merge by the break variable specified in the BY command. If you run the AGGREGATE procedure immediately before the MATCH FILES procedure, then AGGREGATE will sort the cases itself. In any case, we recommend sorting both input files by the break variable (e.g., NETID, in ascending order) before you run a MATCH FILE procedure. If you save your data sorted "by netid," you will not have to sort it again. GET FILE="C:\NET.SAV". SORT CASES BY netid (A). SAVE OUTFILE= "C:\NET.SAV" COMPRESSED. GET FILE="C:\TIESUM.SAV". SORT CASES BY netid (A). MATCH FILES TABLE=* FILE="C:\NET.SAV" BY netid MAP. SAVE OUTFILE= "C:\NETALL.SAV" COMPRESSED. The preceding commands create a new netwise data set named "NETALL.SAV" formed by the merger of the TIESUM and NET data sets. The star symbol in " TABLE=*" indicates that the table of the new outfile "NETALL.SAV" is defined by your active system file (the one you recalled last), in our example "TIESUM.SAV". SPSS allows you to apply the MAP subcommand, which displays a list of variables in the new data set, their order, the file from which they came, and their original names. The MAP subcommand follows the BY subcommand. SPSS also allows you to apply the KEEP command " KEEP=[varlist]" to keep only those variables that you need for the present operation in the active file. This saves computer time. Or, if more convenient, you can use the DROP command to exclude unneeded variables. (...) MATCH FILES TABLE=* FILE="C:\NET.SAV" RENAME= (oldvar=newvar) BY NETID DROP=mftf MAP. SAVE OUTFILE = "C:\NETALL.SAV" COMPRESSED. Now you are in a position to examine such matters as the relationship between focal individuals' gender (originally located in NET) and the percentage of emotional aid in their networks (created in TIESUM): GET FILE="C:\NETALL.SAV". CORRELATIONS VARIABLES=gender pemaid. You can also use information about focal individuals to study subsamples of networks. For example, the following will do correlations only for the networks of men: GET FILE="C:\NETALL.SAV". TEMPORARY. SELECT IF (gender EQ 1). CORRELATIONS VARIABLES=mftf sftf pemaid. The TEMPORARY command ensures that the SELECT IF statement will only be applied to the operation that follows it. If you want to export your selected data into a separate file of male cases only ("MEN.SAV"), then you do not need to apply the TEMPORARY command: GET FILE="C:\NET.SAV". SORT CASES BY netid (A). SAVE OUTFILE= "C:\NET.SAV" COMPRESSED. GET FILE="C:\TIESUM.SAV". SORT CASES BY netid (A). MATCH FILES TABLE=* FILE="C:\NET.SAV" BY netid MAP. SELECT IF (gender EQ 1). SAVE OUTFILE= "C:\MEN.SAV" COMPRESSED. Another possibility is to apply the SPLIT FILE procedure. For example, to get separate sets of correlations for men and women, first sort the cases BY GENDER: GET FILE="C:\NETALL.SAV". SORT CASES BY gender. SPLIT FILE BY gender. CORRELATIONS VARIABLES=mftf sftf pemaid. If you apply the SPLIT FILE command, either remember to turn it off after the procedure ("SPLIT FILE off") or use the TEMPORARY command for every SPLIT FILE procedure. Integrating Tiewise, Individual and Network Analysis Analysts may also want to retain the tiewise organization of the TIE data set, but supplement it with information about focal individuals (NET data) and network structure (NETALL data). For example, Wellman (1992b) needed to know the gender of focal individuals and of network members in order to compare ties between men, between women, and between men and women. The sample size in this example is 343 ties and not the 29 networks produced through the AGGREGATE and MATCH FILES examples described above. In this example, the NETALL data set is merged with the tiewise TIE data set to form a new data set arbitrarily called TIEFOCAL. As in the preceding example, "MATCH FILES BY netid" associates the appropriate records in TIE and NETALL data sets (which itself includes the NET data). (Here too, you have to take care that both input files are pre-sorted by the same variable.) In this situation, if the focal individual has 10 ties, the information from NETALL will be copied 10 times and merged with each network member's record. The merged TIEFOCAL data set will have 343 records, like TIE, but it will be larger because the focal individual's information and the summary information (both stored in NETALL) is repeated for each member of his her network. GET FILE="C:\NETALL.SAV". SORT CASES BY netid (A). SAVE OUTFILE= "C:\NETALL.SAV" COMPRESSED. GET FILE="C:\TIE.SAV". SORT CASES BY netid (A). SAVE OUTFILE= "C:\TIE.SAV" COMPRESSED. GET FILE="C:\NETALL.SAV". SORT CASES BY netid (A). MATCH FILES TABLE=* FILE="C:\TIE.SAV" BY netid. SAVE OUTFILE="C:\TIEFOCAL.SAV" COMPRESSED. Notes 1. This approach will work only if the original TIE data set is used and not the summary TIESUM data set that AGGREGATE creates. 2. This will work only if similar variables in the original TIE and NETALL data sets have different names. Otherwise, disaster can strike as when a TIE variable named SEX in the TIE data set (network member's sex) is merged with a NET variable named SEX in the NETALL data set (focal individual's sex). We suggest using consistent, unique prefixes (e.g., TSEX and FSEX) in the original TIE and NET data sets. If similar variables in both data sets have the same name, rename them applying the SPSS subcommand: " RENAME=(oldvar=newvar)" following the FILE subcommand when you merge your data sets. For example, if both data sets contain the variable SEX, rename the variable in the TIE.SAV file using the following commands: GET FILE="C:\NET.SAV" SORT CASES BY netid (A) . MATCH FILES TABLE=* FILE="C:\TIE.SAV" RENAME=(sex=tsex) BY NETID. 3. You can reduce the size of the merged TIEFOCAL data set by using a KEEP or DROP statement to limit the number of variables that will be merged. This is especially useful in reducing the size of the NETALL data set because its variables will be repeated for many (TIE) records when TIEFOCAL is created. Capabilities and Limitations 1. It is easy to link summary data to information about the characteristics of focal individuals. Moreover, you need not make linkage decisions ahead of time. At any time, analysts can choose to combine different characteristics of focal individuals and networks. It is also easy to focus on the ties or networks of specific types of focal individuals (such as men). 2. To identify focal individuals, ties, and networks that have high or low values on a specific variable, use the "SELECT IF (variable=value)" command for analyses. For example, Wellman and Wortley (1990) used this option to identify those focal individuals whose networks provide very high or low levels of emotional support. Precede each SELECT IF, SPLIT FILE or DO IF command by the TEMPORARY command, unless you want to export data in a separate file. Alternatively, you can split specific files while using the AGGREGATE procedure. To do it this way, do not use the SPLIT FILE command, but define the variable(s) to be split (e.g., "gender") as the break variable(s) ahead of any other variable(s). AGGREGATE will produce one file, but with separate output for each value of the break variable. 3. Keeping two separate data sets is more efficient than combining tie and network data into one set because it avoids the repetition of individual, tie, and network information. Moreover, separate tie and network data sets permit doing more efficient computer runs when only one data set is needed. 4. The general approach described here can be extended. For example, Wellman and Wellman (1992) linked TIE and NET data with a third data set containing information about marital relationships. They used SAS software with multiple UNIVARIATE and MERGE procedures to accomplish this (Figure 2). Applying the AGGREGATE and MATCH FILES procedures for SPSS described in this paper would also do this. FIGURE 2 5. The confirmatory statistics produced by SPSS (such as correlation coefficients and their associated significance levels) assume that each record is an independent unit of analysis (Wellman 1998). This may not be the case in ego-centered network analysis. To be sure, focal individuals and networks often are independent units. Hence analyses using NET and TIESUM rarely have this problem. However, the ties of a focal individual are inherently not independent from each other; they are clustered in the focal individual's network. Therefore, a sample of many focal individuals' ties -- as stored in TIE or TIEFOCAL -- is not a fully independent sample even if the focal individuals were sampled independently. The variance in such data sets should be lower than in a fully independent sample. It may be possible to treat a tiewise data set as a cluster sample. A relatively new method, multilevel analysis (often done as hierarchical linear modeling) promises to help deal with this problem (Bryk and Raudenbush 1992; Snijders 1994; Frank and Wellman 1998; Thomse and van Tilburg 1998; Van Diujn, van Busschbach and Snijders 1998). 6. It is difficult to use SPSS or SAS to calculate measures of whole network structure without writing specialized matrix routines. Use UCINET (Borgatti, Everett and Freeman 1999) or MULTINET (Richards 1994) instead. Analysts then can add structural measures calculated with these programs to the NET data set for further analyses using SPSS or SAS. Footnotes 1) Procedures and syntax presented in this article have been tested for SPSS for Windows versions 6.1.2., 7.0, 7.5 and 8.0, as well as for "SPSS 6.1 for Power Macintosh". There may be slightly different notations for other SPSS versions, including versions for mainframes. If your ego and alter data are initially stored in the same data set, you will first have to separate them into two data sets, as described by Wolf (1993). It is better to enter the data at the start in separate tiewise and netwise data sets. ( back ) 2) Importing data 2a) There is no problem if the data entry and editing are done within SPSS. But if you edited your original data set in Microsoft Word and saved it in "tab-delimited" format, you may have some problems importing your data set into SPSS using the "File Read ASCII data" menu item. It may be helpful to run the data entry directly from your SPSS syntax file using the following command: GET TRANSLATE FILE="C:\filename" TYPE=TAB MAP. 2b) Or, you can change the filename extension ".txt" to ".dat" using the DOS copy command "copy C:\filename.txt C:\filename.dat". This procedure eliminates unwanted special characters of the "Microsoft Word" program and allows you to import your data using the SPSS menu bar. 2c) If you use "Windows EXCEL",save the data as "single sheet" in "EXCEL 4" format and import them with the following SPSS command: GET TRANSLATE FILE="C:\filename.xls" TYPE=XLS MAP FIELDNAMES. The FIELDNAMES statement forces the data entry procedure to read the first row of the EXCEL file as variable names. ( back ) 3) Unlike the SAS UNIVARIATE procedure, you do not have to sort your input file, because SPSS does this by routine. However, storing the data permanently in one specific order can save time and avoid problems. In our example, we would normally store by the ascending values of the NETID variable so that focal individual 1 comes first, focal individual 2 comes second, and focal individual 343 comes last. The commands are SORT CASES BY netid . SAVE OUTFILE="filename" COMPRESSED" . As long as you do not save your file again, it will remain sorted "by netid" every time you recall it with the GET FILE command. ( back ) 4) SPSS also allows you to compute percentages for non-binary variables, using the following functions: "PGT (varlist, value)" for percentages "greater than" the specified value, "PIN (varlist, value1, value2)" for percentages of cases "between value1 and value2", or ... PLT (for cases "less than ...") or ... POUT (for cases "not between value1 and value2"). For example, the statement " pgtctage = PGT(ctage 40)" computes the percentage of all cases where the variable "ctage" has a value greater than "40", i.e., the percentage of network members in each network who are older than 40 years. ( back ) References Borgatti, Stephen, Martin Everett and Linton Freeman. 1999. UCINet 5 for Windows. Natick, MA: Natick Analytic Technologies. Bryk, Anthony and Stephen Raudenbush. 1992. Hierarchical Linear Models: Applications and Data Analysis Methods. Newbury Park: Sage. Campbell, Karen and Barrett Lee. 1991. "Name Generators in Surveys of Personal Networks." Social Networks 13 (Sept.): 203-22. Frank, Kenneth and Barry Wellman. 1998. "Network Capital in a Multi-Level World: How Individuals, Ties and Networks Provide Social Support in Contemporary Communities." Presented to the Conference on Social Networks and Social Capital, Durham, NC, October. Snijders, Tom. 1994. "Multilevel Methods for Analyzing Relational Data." Presented to the International Conference on Personal Relationships. Groningen, Neth., July. SPSS. User's Guide . Many editions. Chicago: SPSS. Richards, William. 1994. Multinet. Burnaby, BC, Canada: Department of Communication Studies, Simon Fraser University. Thomse, Fleur and Theo van Tilburg. 1998. "The Importance of Being Close Together: Contextual Effects of Neighbouring Networks on the Exchange of Instrumental Support Between Older Adults and Their Proximate Network Members in the Netherlands." Working Paper. Department of Sociology, Free University of Amsterdam, April. Van Diujn, Martijtje, Jooske van Busschbach and Tom Snijders. 1998. "Multilevel Analysis of Personal Networks as Dependent Variables." Working Paper. Interuniversity Center for Sociological Theory and Methodology, University of Groningen, Netherlands. May. Wellman, Barry. 1988. "The Community Question Re-evaluated." Pp. 81-107 in Power, Community and the City, edited by Michael Peter Smith. New Brunswick, NJ: Transaction. Wellman, Barry. 1992a: How to use SAS to Study Egocentric Networks. Cultural Anthropology Methods Newsletter, June 1992: 6-12. Wellman, Barry. 1992b. "Men in Networks: Private Communities, Domestic Friendships." Pp. 74-114 in Men's Friendships, edited by Peter Nardi. Newbury Park, CA: Sage. Wellman, Barry. 1998. "Doing It Ourselves: The SPSS Manual as Sociology's Most Influential Recent Book." Pp. 71-78 in Required Reading: Sociology's Most Influential Books, edited by Dan Clawson. Amherst: University of Massachusetts Press. Wellman, Barry. 1999. Networks in the Global Village. Boulder, CO: Westview. Wellman, Barry and Susan Gonzalez Baker. 1985. "Using SAS Software to Link Network, Tie and Individual Data." Connections 8 (2-3): 176-87. Wellman, Barry, Ove Frank, Vicente Espinoza, Staffan Lundquist and Craig Wilson. 1991. "Integrating Individual, Relational and Structural Analysis." Social Networks 13 (Sept.): 223-50. Wellman, Beverly and Barry Wellman. 1992. "Domestic Affairs and Network Relations." Journal of Social and Personal Relationships 9 (August): 385-409. Wolf, Christof. 1993. "Egozentrierte Netzwerke: Datenorganisation und Datenanalyse." ZA-Informationen 32: 72-94. About the authors Christoph Mller, University of Berne, Switzerland, Institut for Sociology . (for email see the Disclaimer ). Christoph Mller's work has been part of a research project studying ego-centered social networks of "Virtual Communities", directed by Prof. Dr. Bettina Heintz, University of Mainz, Germany. Research grants have been provided by the Swiss National Foundation. Barry Wellman, University of Toronto, Canada Centre for Urban and Community Studies , 455 Spadina Avenue, Toronto Canada M5S 2G8. email: wellman@chass.utoronto.ca Wellman's work has been supported by the Social Sciences and Humanities Research Council of Canada. Alexandra Marin, University of Toronto, Canada Centre for Urban and Community Studies , 455 Spadina Avenue, Toronto Canada M5S 2G8. email: alexandra.marin@utoronto.ca Marin's work has been supported by the Social Sciences and Humanities Research Council of Canada. ( back to the top ) -- Index. last updated 12.7.99, revised 9.11.2002 by chm Contact - Disclaimer - Copyright .
Medical Statistics Using SPSS
This is an on-line course on medical statistics. You may download the databases needed to follow step by step the examples in the text.
Medical Statistics Medical Statistics Using SPSS: an Introductory Course by Gareth Parry Medical Care Research Unit , School of Health Related Research, University of Sheffield Altamiro da Costa Pereira Biostatistics and Medical Informatics Oporto Medical School University of Oporto This is an on-line course on medical statistics. A well known software package is used to help understand some of the basic concepts of this discipline. You may download the databases needed to follow step by step the examples in the text. Web version: Armando Teixeira Pinto , Biostatistics and Medical Informatics Start Course
Statistical Services FAQs
Contains about 50 Frequently Asked Questions on SPSS. Including some on converting data from to SAS
ITS Research Consulting: Documentation About Research Consulting Documentation Tutorials Software Services Outside Resources Contact Us Research Consulting Documentation While our FAQs , documents , and tutorials can answer many of your questions, you may also wish to visit some of the resources listed below to investigate more esoteric and or advanced topics. Please note that items marked with the icon are only available to University of Texas students, faculty, and staff and will either require that you provide an EID or require that you are connected to the UT campus network (that is, on either a campus computer, or a home computer that is connected via Telesys). Mathematical Software Answers CPLEX CPLEX FAQs at UT IMSL Fortran Numerical Libraries IMSL C Numerical Libraries IMSL online documentation IMSL FAQs and useful tips from Visual Numerics Maple Maple FAQs at UT Maple FAQs at Waterloo Maple Maple Manuals, Guides, Books Mathematica Mathematica FAQs at UT Mathematica FAQs at Wolfram Research Help on using Graphics in Mathematica Matlab Matlab FAQs at UT Mathworks Matlab Documentations Statistical Software Answers ITS Statistical FAQs A searchable index of questions frequently asked by our clients. Includes general statistical topics, as well as software-specific questions for AMOS, HLM, Lisrel, Minitab, Mplus, SAS, SPSS. ITS Document Rack Our document rack contains answers that are longer and more detailed than material found in the FAQs, but shorter than tutorials. CISED Index to Statistics A bibliographic database of applied and theoretical statistical literature from the University of Wisconsin at Madison. MINITAB Answers The MINITAB website provides a list of the most frequently asked MINITAB support questions and their answers. SAS Online Documentation Provides full documentation of SAS software, including the data step and STAT procedures such as regression, ANOVA, categorical data analysis, multivariate procedures, and more. For each SAS STAT procedure, syntax rules and examples are provided. SAS Tech Support Search the Technical Support Site at sas.com SPSS Answer Net Search for answers to SPSS questions with the same database used by SPSS technical support. SPSS FTP site Contains fixes, scripts, macros, and sample data sets. Plus: Have you ever wondered exactly what equations SPSS uses to calculate a Wilcoxon sign-rank test, to perform a K-means cluster analysis, or to produce a Greenhouse-Geisser test of within-subject effects? Now you can find out in the SPSS algorithms document. SUGI Proceedings Provides full text of presentations made at the conference of SAS Users' Group International, including such topics as: "How to Use the Data Step Debugger," "Web Publishing in SAS Software," "Anyone can learn PROC TABULATE," "PROC MEANS: More than just your average procedure," "Using Macro functions," "Determining curvilinear relationships in PROC REG," "Getting started with PROC LOGISTIC," "Custom design of complicated block experiments," and more. Virtual Statistical Community A forum for UT researchers to find statistical resources, meet other statistical and methodological thinkers, and form research partnerships. Contains a searchable database of members and their areas of expertise. US Research Consulting Documentation Last updated April 1, 2005. Copyright 2002-05, Information Technology Services at The University of Texas at Austin . All rights reserved. For privacy concerns read our privacy policy . Send questions or comments regarding this page to statmath@its.utexas.edu . Send computing questions to the ITS Help Desk or call (512) 475-9400. URL: http: www.utexas.edu its rc answers index.html
UCLA Resources on SPSS
Contains Textbook examples, Library, Code Fragments, FAQ, streaming video presentations on SPSS
Resources to help you learn and use SPSS Stat Computing SPSS Resources to help you learn and use SPSS Learning SPSS SPSS Starter Kit Classes and Seminars Learning Modules Frequently Asked Questions Statistical Analyses What statistical analysis should I use? Textbook Examples (see also Statistics Books for Loan ) Paper Examples Web Books Annotated Output Advanced Usage Library Code Fragments News What's New on the ATS SPSS site Statistical Consulting News! Join the ATSstat mailing list Important Links Where to use SPSS? How to get SPSS? Installing, Customizing, Updating SPSS SPSS Manuals Links by Topic Data Management Analysis of Variance Regression Logistic Regression Use Google to search our SPSS pages for Site Map Report an error on this page UCLA Researchers are invited to our Statistical Consulting Services We recommend others to our list of Other Resources for Statistical Computing Help These pages are Copyrighted (c) by UCLA Academic Technology Services The content of this web site should not be construed as an endorsement of any particular web site, book, or software product by the University of California
Listserv Logs for SPSSX-L Mailing List
Archives of all posts to the SPSSX-L mailing list since May 1987
Listserv logs for SPSSX-L@www2.marist.edu Listserv logs for SPSSX-L@www2.marist.edu as of 17 Nov 2005 11:16:54 last - change filename filetype Articles lrecl nrecs date time Remarks -------- -------- -------- ----- ----- ------------------- ------- SPSSX-L LOG0508 1 79 59 2005-08-12 14:31:39 Access to SPSS SPSSX-L LOG0507 346 541 37430 2005-07-25 21:02:56 Fri, 1 Jul 2005 08:29:24 +0200 SPSSX-L LOG0506 492 998 46869 2005-06-30 23:29:29 Tue, 31 May 2005 21:09:15 -0700 SPSSX-L LOG0505 651 1126 65429 2005-05-31 20:51:50 Sun, 1 May 2005 14:41:40 -0400 SPSSX-L LOG0504 554 868 55609 2005-04-30 23:16:29 Thu, 31 Mar 2005 22:57:41 -0800 SPSSX-L LOG0503 581 757 52117 2005-03-31 21:58:25 Tue, 1 Mar 2005 01:10:27 -0500 SPSSX-L LOG0502 531 998 49615 2005-02-28 23:16:11 Tue, 1 Feb 2005 10:38:19 +0100 SPSSX-L LOG0501 461 1133 42601 2005-01-31 22:27:37 Sat, 1 Jan 2005 19:28:17 -0500 SPSSX-L LOG0412 422 1330 38900 2004-12-30 23:19:53 Wed, 1 Dec 2004 09:25:50 +0300 SPSSX-L LOG0411 403 967 37589 2004-11-30 20:39:05 Sun, 31 Oct 2004 15:33:15 -0500 SPSSX-L LOG0410 499 1195 47884 2004-10-31 19:48:15 Fri, 1 Oct 2004 13:27:47 +0700 SPSSX-L LOG0409 423 897 38906 2004-09-30 21:26:01 Wed, 1 Sep 2004 15:16:08 +1000 SPSSX-L LOG0408 521 870 48117 2004-08-31 20:07:00 Sun, 1 Aug 2004 11:45:50 +0200 SPSSX-L LOG0407 410 926 39182 2004-07-31 13:09:53 Wed, 30 Jun 2004 23:39:13 -0400 SPSSX-L LOG0406 402 1165 36735 2004-06-30 20:23:01 Tue, 1 Jun 2004 07:43:35 -0400 SPSSX-L LOG0405 457 787 40311 2004-05-29 13:04:50 Sat, 1 May 2004 12:15:43 +0100 SPSSX-L LOG0404 432 820 35651 2004-04-30 19:11:27 Thu, 1 Apr 2004 08:39:04 +0200 SPSSX-L LOG0403 608 950 53332 2004-03-31 21:13:43 Mon, 1 Mar 2004 17:17:35 +1100 SPSSX-L LOG0402 619 1416 58732 2004-02-29 23:13:48 Mon, 2 Feb 2004 10:47:19 +0100 SPSSX-L LOG0401 605 701 56214 2004-01-30 17:54:47 Fri, 2 Jan 2004 19:10:56 +0800 SPSSX-L LOG0312 275 780 22135 2003-12-30 11:19:43 Mon, 1 Dec 2003 00:59:56 -0500 SPSSX-L LOG0311 390 647 33212 2003-11-30 03:18:13 Sat, 1 Nov 2003 10:43:22 -0500 SPSSX-L LOG0310 473 1742 40720 2003-10-31 18:28:38 Wed, 1 Oct 2003 14:17:51 +1000 SPSSX-L LOG0309 489 935 43850 2003-09-30 18:26:11 Mon, 1 Sep 2003 01:26:04 -0400 SPSSX-L LOG0308 507 648 42244 2003-08-31 21:55:52 Fri, 1 Aug 2003 00:03:30 -0400 SPSSX-L LOG0307 605 756 54299 2003-07-31 21:34:51 Tue, 1 Jul 2003 06:10:29 +0000 SPSSX-L LOG0306 470 998 40811 2003-06-30 23:54:09 Sun, 1 Jun 2003 15:57:19 +0100 SPSSX-L LOG0305 481 864 39217 2003-05-31 18:27:51 Thu, 1 May 2003 11:26:40 +0300 SPSSX-L LOG0304 352 990 28977 2003-04-30 22:19:23 Tue, 1 Apr 2003 11:38:48 +0200 SPSSX-L LOG0303 466 896 39430 2003-03-31 20:17:35 Sat, 1 Mar 2003 00:08:09 -0600 SPSSX-L LOG0302 497 1024 41242 2003-02-28 20:51:32 Sat, 1 Feb 2003 06:42:01 -0500 SPSSX-L LOG0301 480 1024 37504 2003-01-31 20:57:58 Wed, 1 Jan 2003 15:24:18 -0500 SPSSX-L LOG0212 354 980 27765 2002-12-31 18:47:46 Mon, 2 Dec 2002 14:26:15 +1000 SPSSX-L LOG0211 445 603 35188 2002-11-30 22:48:21 Fri, 1 Nov 2002 09:52:50 +0000 SPSSX-L LOG0210 362 1023 28027 2002-10-31 22:10:36 Tue, 1 Oct 2002 09:56:43 +0200 SPSSX-L LOG0209 398 674 35757 2002-09-30 18:27:46 Sun, 1 Sep 2002 11:03:07 -0700 SPSSX-L LOG0208 318 822 23890 2002-08-31 18:22:02 Thu, 1 Aug 2002 14:46:29 +1000 SPSSX-L LOG0207 369 799 28917 2002-07-31 16:17:16 Mon, 1 Jul 2002 07:44:57 +0200 SPSSX-L LOG0206 391 990 31654 2002-06-30 14:41:32 Sat, 1 Jun 2002 07:55:12 -0400 SPSSX-L LOG0205 305 990 24460 2002-05-31 15:32:51 Wed, 1 May 2002 07:06:26 -0400 SPSSX-L LOG0204 445 798 32930 2002-04-30 19:39:31 Mon, 1 Apr 2002 10:20:11 -0600 SPSSX-L LOG0203 381 731 29339 2002-03-29 13:53:19 Fri, 1 Mar 2002 11:50:39 -0500 SPSSX-L LOG0202 404 940 33889 2002-02-28 21:35:31 Fri, 1 Feb 2002 07:34:39 -0000 SPSSX-L LOG0201 354 668 27678 2002-01-31 23:43:58 Tue, 1 Jan 2002 12:08:07 +0100 SPSSX-L LOG0112 247 760 22433 2001-12-31 23:23:55 Sat, 1 Dec 2001 09:07:59 +0100 SPSSX-L LOG0111 342 824 27417 2001-11-30 21:11:58 Wed, 31 Oct 2001 22:42:15 -0700 SPSSX-L LOG0110 458 715 39438 2001-10-31 22:18:24 Mon, 1 Oct 2001 08:33:23 -0500 SPSSX-L LOG0109 367 724 32795 2001-09-30 12:24:42 Sat, 1 Sep 2001 20:09:32 -0400 SPSSX-L LOG0108 315 992 27337 2001-08-31 20:42:53 Tue, 31 Jul 2001 22:04:18 -0700 SPSSX-L LOG0107 332 766 27141 2001-07-31 23:49:46 Sun, 1 Jul 2001 16:15:15 +0900 SPSSX-L LOG0106 356 789 28477 2001-06-30 22:01:58 Fri, 1 Jun 2001 11:36:15 +0800 SPSSX-L LOG0105 289 790 21991 2001-05-31 23:14:44 Tue, 1 May 2001 11:47:49 GMT0BST SPSSX-L LOG0104 343 440 28098 2001-04-30 18:21:51 Sun, 1 Apr 2001 03:29:26 -0600 SPSSX-L LOG0103 373 560 32183 2001-03-31 19:54:34 Thu, 1 Mar 2001 09:06:34 +0100 SPSSX-L LOG0102 359 459 35190 2001-02-28 20:56:08 Thu, 1 Feb 2001 11:13:25 +0100 SPSSX-L LOG0101 303 692 23008 2001-01-31 23:07:29 Sat, 1 Jan 2000 13:47:26 -0500 SPSSX-L LOG0012 283 624 22600 2000-12-29 13:26:45 Fri, 1 Dec 2000 11:05:04 -0600 SPSSX-L LOG0011 343 501 26147 2000-11-30 22:38:34 Wed, 1 Nov 2000 09:36:04 +0100 SPSSX-L LOG0010 344 736 28428 2000-10-31 18:45:19 Sun, 1 Oct 2000 14:24:01 +0800 SPSSX-L LOG0009 244 825 18961 2000-09-30 23:37:31 Fri, 1 Sep 2000 11:42:58 +0200 SPSSX-L LOG0008 298 486 23196 2000-08-31 13:31:13 Tue, 1 Aug 2000 08:18:24 -0500 SPSSX-L LOG0007 295 731 17328 2000-07-31 17:29:03 Sun, 2 Jul 2000 19:42:09 -0400 SPSSX-L LOG0006 354 994 21170 2000-06-30 14:57:51 Thu, 1 Jun 2000 11:25:06 +0200 SPSSX-L LOG0005 259 687 15556 2000-05-31 23:27:07 Mon, 1 May 2000 10:42:51 -0500 SPSSX-L LOG0004 311 609 15424 2000-04-29 20:23:26 Sat, 1 Apr 2000 08:17:39 +0100 SPSSX-L LOG0003 375 606 20660 2000-03-31 21:17:30 Wed, 1 Mar 2000 09:20:52 -0500 SPSSX-L LOG0002 408 636 22828 2000-02-29 23:29:37 Tue, 1 Feb 2000 14:35:47 GMT SPSSX-L LOG0001 237 727 13034 2000-01-31 17:59:15 Sun, 2 Jan 2000 16:53:43 PST SPSSX-L LOG9912 289 656 18956 1999-12-30 20:35:33 Fri, 26 Nov 1999 11:20:42 +0100 SPSSX-L LOG9911 395 946 21243 1999-11-30 20:51:25 Mon, 1 Nov 1999 10:04:53 -0000 SPSSX-L LOG9910 372 916 19743 1999-10-31 22:21:06 Fri, 1 Oct 1999 02:14:45 -0400 SPSSX-L LOG9909 284 663 15682 1999-09-30 18:16:00 Wed, 1 Sep 1999 10:42:27 +0200 SPSSX-L LOG9908 290 777 15150 1999-08-31 18:46:16 Sun, 1 Aug 1999 15:28:05 +1000 SPSSX-L LOG9907 271 632 15108 1999-07-31 16:40:01 Wed, 30 Jun 1999 23:33:32 -0500 SPSSX-L LOG9906 314 541 17051 1999-06-30 19:50:24 Tue, 1 Jun 1999 12:02:25 +0200 SPSSX-L LOG9905 344 518 19628 1999-05-31 03:18:36 Thu, 29 Apr 1999 12:21:01 -0500 SPSSX-L LOG9904 531 288 28733 1999-04-30 19:28:21 Wed, 31 Mar 1999 22:02:49 -0700 SPSSX-L LOG9903 515 593 26207 1999-03-31 23:41:20 Sun, 28 Feb 1999 22:12:01 -0600 SPSSX-L LOG9902 395 992 19299 1999-02-28 20:44:28 Mon, 1 Feb 1999 17:02:26 +1100 SPSSX-L LOG9901 373 299 17117 1999-01-31 23:15:10 Thu, 31 Dec 1998 08:43:33 -0500 SPSSX-L LOG9812 220 992 9834 1998-12-31 11:40:52 Tue, 1 Dec 1998 09:57:16 -0000 SPSSX-L LOG9811 323 204 16466 1998-11-30 13:30:52 Sat, 31 Oct 1998 21:01:59 PST SPSSX-L LOG9810 459 414 26096 1998-10-31 14:11:01 Wed, 30 Sep 1998 23:33:23 -0700 SPSSX-L LOG9809 436 447 20343 1998-09-30 21:17:20 Mon, 31 Aug 1998 13:16:01 -0700 SPSSX-L LOG9808 414 363 19882 1998-08-31 19:13:45 Sat, 1 Aug 1998 18:19:50 +0800 SPSSX-L LOG9807 350 684 16492 1998-07-31 22:42:48 Tue, 30 Jun 1998 18:37:55 -0500 SPSSX-L LOG9806 384 853 15749 1998-06-30 20:04:29 Wed, 27 May 1998 08:36:37 +0200 SPSSX-L LOG9805 386 146 18705 1998-05-31 19:21:19 Fri, 1 May 1998 10:56:21 +1000 SPSSX-L LOG9804 505 597 22352 1998-04-30 20:40:24 Fri, 27 Mar 1998 03:54:11 +0900 SPSSX-L LOG9803 512 286 23926 1998-03-31 23:52:38 Fri, 27 Feb 1998 12:38:59 GMT SPSSX-L LOG9802 398 623 18621 1998-02-28 19:05:44 Fri, 30 Jan 1998 15:43:03 GMT SPSSX-L LOG9801 341 465 16987 1998-01-31 23:28:46 Thu, 1 Jan 1998 17:56:44 -0500 SPSSX-L LOG9712 332 405 14437 1997-12-31 15:30:04 Mon, 1 Dec 1997 05:03:34 -0500 SPSSX-L LOG9711 390 215 17075 1997-11-30 22:28:31 Tue, 28 Oct 1997 20:43:01 -0800 SPSSX-L LOG9710 485 188 23292 1997-10-31 13:07:57 Wed, 1 Oct 1997 06:38:30 +0100 SPSSX-L LOG9709 431 237 19944 1997-09-30 17:47:20 Mon, 1 Sep 1997 11:00:00 PDT SPSSX-L LOG9708 353 111 14154 1997-08-31 20:41:45 Fri, 1 Aug 1997 01:24:38 -0700 SPSSX-L LOG9707 286 255 12637 1997-07-31 21:58:54 Tue, 1 Jul 1997 08:44:06 OET SPSSX-L LOG9706 454 177 23698 1997-06-30 22:09:39 Fri, 30 May 1997 16:29:10 GMT SPSSX-L LOG9705 432 368 17993 1997-05-31 22:59:29 Tue, 29 Apr 1997 14:16:00 GMT SPSSX-L LOG9704 482 511 21193 1997-04-30 21:29:35 Tue, 1 Apr 1997 08:27:33 +0800 SPSSX-L LOG9703 504 118 23445 1997-03-31 18:31:52 Fri, 28 Feb 1997 20:33:01 -0600 SPSSX-L LOG9702 474 117 20044 1997-02-28 20:28:10 Fri, 31 Jan 1997 21:44:55 -0600 SPSSX-L LOG9701 427 102 18106 1997-01-31 23:35:34 Wed, 1 Jan 1997 08:17:24 GMT SPSSX-L LOG9612 325 135 15243 1996-12-31 22:07:56 Mon, 2 Dec 1996 10:18:15 EST SPSSX-L LOG9611 133 113 6701 1996-11-29 22:49:30 Fri, 1 Nov 1996 09:47:13 GMT SPSSX-L LOG9610 70 137 2161 1996-10-31 23:15:24 Tue, 1 Oct 1996 02:34:22 -0500 SPSSX-L LOG9609 78 340 2829 1996-09-30 13:30:18 Mon, 2 Sep 1996 14:32:16 +0000 SPSSX-L LOG9608 82 188 2667 1996-08-30 15:41:20 Thu, 1 Aug 1996 01:36:48 -0400 SPSSX-L LOG9607 354 87 12660 1996-07-31 09:11:55 Tue, 25 Jun 1996 10:12:16 -0400 SPSSX-L LOG9606 375 427 13453 1996-06-30 18:03:02 Fri, 31 May 1996 15:19:06 GMT SPSSX-L LOG9605 382 140 14202 1996-05-31 23:17:50 Tue, 30 Apr 1996 17:39:09 +0100 SPSSX-L LOG9604 329 213 11493 1996-04-30 21:55:13 Mon, 1 Apr 1996 09:00:20 +0000 SPSSX-L LOG9603 406 289 15301 1996-03-31 08:05:51 Thu, 29 Feb 1996 11:00:31 -0600 SPSSX-L LOG9602 430 88 15551 1996-02-29 19:29:01 Thu, 1 Feb 1996 07:40:36 -0500 SPSSX-L LOG9601 394 850 13761 1996-01-31 21:26:02 Tue, 2 Jan 1996 08:45:45 GMT SPSSX-L LOG9512 227 87 7918 1995-12-30 21:37:07 Fri, 1 Dec 1995 08:42:03 +0100 SPSSX-L LOG9511 335 122 12457 1995-11-30 21:24:05 Tue, 31 Oct 1995 22:06:32 MST SPSSX-L LOG9510 367 160 14482 1995-10-31 20:32:01 Sat, 30 Sep 1995 23:51:25 GMT SPSSX-L LOG9509 327 98 11648 1995-09-30 14:32:05 Thu, 31 Aug 1995 17:44:06 GMT SPSSX-L LOG9508 349 104 12391 1995-08-31 16:34:05 Tue, 1 Aug 1995 18:29:25 KDT SPSSX-L LOG9507 260 276 10490 1995-07-31 16:46:46 Sat, 1 Jul 1995 14:05:06 +0100 SPSSX-L LOG9506 342 155 14143 1995-06-30 17:24:55 Thu, 1 Jun 1995 07:32:22 +0000 SPSSX-L LOG9505 53 83 4184 1995-05-31 12:32:44 Mon, 1 May 1995 10:15:46 +0100 SPSSX-L LOG9504 29 120 948 1995-04-30 06:51:36 Thu, 1 Apr 1993 14:23:19 -0700 SPSSX-L LOG9503 113 179 3979 1995-03-31 18:40:29 Tue, 28 Feb 1995 23:29:31 MST SPSSX-L LOG9502 246 81 8668 1995-02-28 19:28:18 Tue, 31 Jan 1995 17:03:19 GMT SPSSX-L LOG9501 243 156 8535 1995-01-31 23:23:02 Mon, 2 Jan 1995 19:42:07 +0100 SPSSX-L LOG9412 220 82 9085 1994-12-30 23:56:00 Wed, 30 Nov 1994 23:38:16 EST SPSSX-L LOG9411 188 80 8076 1994-11-30 06:41:53 Mon, 31 Oct 1994 15:10:49 GMT SPSSX-L LOG9410 239 82 9667 1994-10-31 20:30:28 Fri, 30 Sep 1994 22:44:55 -0700 SPSSX-L LOG9409 214 80 8476 1994-09-30 11:48:41 Wed, 31 Aug 1994 23:46:07 GMT SPSSX-L LOG9408 163 86 5719 1994-08-31 20:40:19 Mon, 1 Aug 1994 09:51:06 GMT SPSSX-L LOG9407 209 113 8562 1994-07-31 23:11:21 Fri, 1 Jul 1994 00:36:13 GMT SPSSX-L LOG9406 262 433 10053 1994-06-30 19:18:29 Tue, 31 May 1994 23:24:56 CDT SPSSX-L LOG9405 242 81 7963 1994-05-31 13:47:03 Thu, 28 Apr 1994 05:07:07 GMT SPSSX-L LOG9404 196 151 7807 1994-04-30 05:03:22 Wed, 30 Mar 1994 11:57:43 GMT SPSSX-L LOG9403 217 80 8557 1994-03-31 20:20:35 Tue, 1 Mar 1994 09:32:26 GMT SPSSX-L LOG9402 116 81 4560 1994-02-28 19:26:19 Tue, 1 Feb 1994 15:50:12 GMT SPSSX-L LOG9401 126 80 4846 1994-01-31 16:50:51 Mon, 3 Jan 1994 01:26:11 GMT SPSSX-L LOG9312 90 81 3004 1993-12-30 22:10:15 Wed, 1 Dec 1993 01:37:42 GMT SPSSX-L LOG9311 111 132 3855 1993-11-30 23:42:03 Mon, 1 Nov 1993 14:14:33 +0000 SPSSX-L LOG9310 120 85 4214 1993-10-31 21:54:55 Fri, 1 Oct 1993 11:51:57 GMT SPSSX-L LOG9309 114 80 3929 1993-09-30 16:13:17 Tue, 31 Aug 1993 18:10:40 GMT SPSSX-L LOG9308 97 149 3191 1993-08-31 18:43:11 Tue, 3 Aug 1993 15:01:00 EST SPSSX-L LOG9307 79 80 2780 1993-07-30 04:37:30 Thu, 1 Jul 1993 08:42:01 MEZ SPSSX-L LOG9306 91 80 3372 1993-06-30 13:15:10 Tue, 1 Jun 1993 11:42:23 GMT SPSSX-L LOG9305 77 80 2349 1993-05-29 00:16:40 Sun, 2 May 1993 23:22:11 EDT SPSSX-L LOG9304 78 81 3268 1993-04-30 20:32:05 Thu, 1 Apr 1993 12:22:49 EST SPSSX-L LOG9303 75 80 2796 1993-03-31 12:12:33 Mon, 1 Mar 1993 17:02:25 WET SPSSX-L LOG9302 51 80 1542 1993-02-27 05:13:33 Mon, 1 Feb 1993 13:47:07 GMT SPSSX-L LOG9301 56 80 2282 1993-01-30 16:02:00 Tue, 5 Jan 1993 00:26:57 GMT SPSSX-L LOG9212 42 80 1594 1992-12-31 16:21:30 Wed, 2 Dec 1992 17:04:39 GMT SPSSX-L LOG9211 68 80 2467 1992-11-30 20:36:15 Sun, 1 Nov 1992 11:23:16 -0800 SPSSX-L LOG9210 58 79 1883 1992-10-30 22:10:21 Thu, 1 Oct 1992 14:20:16 EDT SPSSX-L LOG9209 53 80 2439 1992-09-29 19:01:01 Tue, 1 Sep 1992 22:42:00 CDT SPSSX-L LOG9208 55 80 2075 1992-08-31 15:36:20 Sat, 1 Aug 1992 23:39:58 EDT SPSSX-L LOG9207 76 80 2612 1992-07-31 20:23:23 Wed, 1 Jul 1992 15:09:05 CET SPSSX-L LOG9206 87 80 3332 1992-06-30 18:44:54 Mon, 1 Jun 1992 09:21:00 EDT SPSSX-L LOG9205 78 80 4496 1992-05-31 20:32:30 Sun, 3 May 1992 17:35:49 CDT SPSSX-L LOG9204 65 80 4186 1992-04-30 00:12:42 Wed, 1 Apr 1992 09:06:40 EST SPSSX-L LOG9203 64 80 2280 1992-03-30 17:19:27 Sun, 1 Mar 1992 01:30:25 -0800 SPSSX-L LOG9202 32 80 1348 1992-02-29 18:46:31 Fri, 31 Jan 1992 19:21:50 CST SPSSX-L LOG9201 44 80 1350 1992-01-31 14:57:46 Thu, 9 Jan 1992 02:08:25 GMT SPSSX-L LOG9112 34 80 1764 1991-12-23 10:33:33 Sun, 1 Dec 1991 09:58:00 CST SPSSX-L LOG9111 49 80 1894 1991-11-30 21:33:39 Fri, 1 Nov 1991 16:25:00 EST SPSSX-L LOG9110 34 80 1216 1991-10-30 04:46:20 Tue, 1 Oct 1991 12:26:08 CDT SPSSX-L LOG9109 50 80 1648 1991-09-27 12:23:59 Mon, 2 Sep 1991 10:53:27 MET SPSSX-L LOG9108 18 80 548 1991-08-29 17:00:39 Thu, 1 Aug 1991 10:14:26 LCL SPSSX-L LOG9107 28 80 1655 1991-07-31 15:50:47 Mon, 1 Jul 91 13:46:25 EDT SPSSX-L LOG9106 33 80 983 1991-06-29 23:17:39 Mon, 3 Jun 91 19:06:01 MES SPSSX-L LOG9105 76 80 5603 1991-05-31 12:44:47 Wed, 1 May 91 09:33:08 EDT SPSSX-L LOG9104 128 80 8671 1991-04-30 16:44:40 Mon, 1 Apr 91 22:10:24 EST SPSSX-L LOG9103 116 80 7764 1991-03-29 04:49:58 Fri, 1 Mar 91 09:41:24 gmt SPSSX-L LOG9102 29 80 1140 1991-02-28 09:01:29 Fri, 1 Feb 91 11:19:29 MST SPSSX-L LOG9101 43 79 1324 1991-01-31 14:27:12 Wed, 2 Jan 91 14:03:46 CST SPSSX-L LOG9012 26 79 755 1990-12-21 17:04:55 Sat, 1 Dec 90 21:01:31 EST SPSSX-L LOG9011 53 80 3193 1990-11-30 23:24:04 Thu, 1 Nov 90 08:36:00 CST SPSSX-L LOG9010 87 80 4161 1990-10-31 19:06:15 Mon, 1 Oct 90 08:42:38 EST SPSSX-L LOG9009 47 80 1842 1990-09-30 23:13:35 Wed, 5 Sep 90 13:15:40 EST SPSSX-L LOG9008 35 80 896 1990-08-29 15:01:09 Thu, 2 Aug 90 15:59:00 CDT SPSSX-L LOG9007 31 80 1697 1990-07-27 11:51:02 Mon, 2 Jul 90 14:22:32 EDT SPSSX-L LOG9006 25 80 759 1990-06-29 18:36:45 Mon, 4 Jun 90 13:22:00 EDT SPSSX-L LOG9005 19 80 807 1990-05-30 00:04:40 Tue, 1 May 90 16:00:00 EDT SPSSX-L LOG9004 22 80 768 1990-04-28 21:12:37 Tue, 3 Apr 90 11:28:13 IST SPSSX-L LOG9003 37 80 2224 1990-03-30 13:17:01 Wed, 28 Feb 90 23:47:09 MST SPSSX-L LOG9002 51 80 1682 1990-02-28 00:07:57 Thu, 1 Feb 90 22:52:00 CST SPSSX-L LOG9001 37 80 1200 1990-01-31 09:35:59 Tue, 2 Jan 90 11:26:12 PST SPSSX-L LOG8912 46 80 1414 1989-12-28 23:58:20 Mon, 4 Dec 89 15:52:00 MET SPSSX-L LOG8911 20 80 660 1989-11-30 18:06:30 Thu, 9 Nov 89 14:03:00 CDT SPSSX-L LOG8910 18 80 853 1989-10-30 23:41:31 Tue, 3 Oct 89 08:56:08 EST SPSSX-L LOG8909 54 80 1538 1989-09-30 19:50:20 Mon, 4 Sep 89 15:55:21 CDT SPSSX-L LOG8908 31 80 2870 1989-08-28 16:02:46 Tue, 1 Aug 89 11:28:00 EDT SPSSX-L LOG8907 26 80 884 1989-07-31 17:14:40 Wed, 5 Jul 89 22:32:02 LCL SPSSX-L LOG8906 25 80 1161 1989-06-30 21:02:55 Thu, 1 Jun 89 06:31:00 EDT SPSSX-L LOG8905 39 80 1140 1989-05-31 17:02:04 Tue, 2 May 89 01:41:00 CDT SPSSX-L LOG8904 72 80 1833 1989-04-29 12:06:52 Fri, 31 Mar 89 13:37:00 EST SPSSX-L LOG8903 41 80 1153 1989-03-27 12:15:56 Wed, 1 Mar 89 20:21:00 MST SPSSX-L LOG8902 22 80 1167 1989-02-28 02:22:39 Thu, 2 Feb 89 14:38:23 GMT SPSSX-L LOG8901 11 80 406 1989-01-26 09:22:01 Mon, 9 Jan 89 10:04:54 LCL SPSSX-L LOG8812 37 80 1025 1988-12-31 00:27:31 Thu, 1 Dec 88 13:26:57 GMT SPSSX-L LOG8811 27 79 907 1988-11-30 22:46:02 Tue, 1 Nov 88 08:53:00 HST SPSSX-L LOG8810 19 80 653 1988-10-31 12:50:41 Thu, 13 Oct 88 09:45:42 +0200 SPSSX-L LOG8809 26 80 706 1988-09-29 07:52:28 Fri, 2 Sep 88 11:08:20 bst SPSSX-L LOG8808 25 80 766 1988-08-31 08:29:26 Sat, 30 Jul 88 00:39:19 EST SPSSX-L LOG8807 27 80 848 1988-07-28 16:49:34 Fri, 1 Jul 88 14:41:00 N SPSSX-L LOG8806 46 80 1043 1988-06-30 13:31:43 Wed, 1 Jun 88 20:26:01 DK SPSSX-L LOG8805 47 80 1722 1988-05-31 13:41:34 Mon, 2 May 88 11:06:50 GMT SPSSX-L LOG8804 53 80 2363 1988-04-29 04:15:01 Tue, 5 Apr 88 16:15:05 EDT SPSSX-L LOG8803 5 79 384 1988-03-07 09:33:18 Thu, 3 Mar 88 10:57:44 MET SPSSX-L LOG8802 23 80 1744 1988-02-22 16:12:20 Mon, 1 Feb 88 10:40:56 MET SPSSX-L LOG8801 29 80 921 1988-01-29 14:09:45 Tue, 5 Jan 88 16:39:53 EST SPSSX-L LOG8712 9 78 200 1987-12-19 18:22:50 Tue, 01 Dec 87 10:59:10 EST SPSSX-L LOG8711 13 78 230 1987-11-23 11:04:37 Sun, 01 Nov 87 22:53:40 CST SPSSX-L LOG8710 6 78 82 1987-10-29 18:31:10 Thu, 1 Oct 87 01:47:33 LCL SPSSX-L LOG8709 5 78 122 1987-09-30 22:49:53 Fri, 25 Sep 87 14:45 EDT SPSSX-L LOG8707 4 79 204 1987-07-31 17:40:06 Mon, 13 Jul 87 12:00:01 cdt SPSSX-L LOG8706 1 79 13 1987-06-16 17:57:12 SPSS PC+ Data Entry II. SPSSX-L LOG8705 2 79 56 1987-05-11 17:40:20 Mon, 11 May 87 15:46:31 CDT Index of lists available on LISTSERV@www2.marist.edu Owners of SPSSX-L@www2.marist.edu: HARRY@VM.Marist.Edu A. Harry Williams LSVMAINT@LISTSERV.UGA.EDU Subscription request - Confirmation will be mailed Please fill in form: Your name: Your email address: ADSM-L - ADSM: Dist Stor Manager ADSM-R - ADSM Requirements List CICS-L - CICS List CMS-PIPELINES - CMSTSO Pipelines Discussion List CONCORD-L - The Concord Coalition Discussion List DRP-L - Disaster Recovery Plan for Computing Services EMERG-L - Emergency Services Discussion List ETHICS-L - Discussion of Ethics in Computing HDR-PPL - Header-People Discussion IA-ADS - IA's ADS Discussion IA-FRS - IA's FRS Discussion IA-HRS - IA's HRS Discussion IA-ONC - IA's Oncourse Discussion IA-SIS - IA's SIS Discussion IBMTCP-L - IBM TCP IP List INTERM-L - Marist Internation Discussion JOBFOX-L - News from Career Services LANSRV-L - IBM LAN Server LIAISON - Network Sites Liaison LINKFAIL - Link failure announcements LINUX-390 - Linux on 390 Port MAIL-L - Mail Discussion List MBA-L - MBA Student curriculum discussion MVS-OE - MVS OpenEdition MVS-UTIL - MVS-UTIL MVS Utilities MUS-L - MUSIC SP User discussion list NSM-L - IBM Network Station NETV-L - IBM's NETView discussion list NODMGT-L - Node Management Discussion PAGE-L - IBM Page Printers tips and Problems Discussion List PEROT - Discussion of campaigning for President by H. Ross Perot PUBADM-L - Teaching Public Administration RISKS - Risks List SAS-L - SAS(r) Discussion SPSSX-L - SPSSX(r) Discussion TSO-REXX - TSO REXX Discussion List VAL-L - Valentine Michael Smith's commentary VM-REXX - VM SP REXX Language Discussion List VM-UTIL - VM Utilities Discussion List VMY2K-L - VM Year 2000 issues WINSTON - Churchill Center list XEDIT-L - VM System Editor List INDEPENDENTS96 - 1996 Independant campaign ZOS-SKILLS - z OS Mainframe Skills for the Future subscribe unsubscribe List keyword description Enter a single keyword that can occur anywhere in item (Currently limited to items since 1 Jan 1998 ) Since: Enter a single keyword that can occur anywhere in item (Currently limited to items since 1 Jan 1998 ) Since: End of page
An Introduction to Logistic Regression
A comprehensive tutorial including hands-on application for beginners, intermediate and advanced users. SPSS is used.
StatLab: Logistic Regression An Introduction to Logistic Regression John Whitehead Department of Economics Appalachian State University whiteheadjc@appstate.edu Why use logistic regression? The linear probability model The logistic regression model Interpreting coefficients Estimation by maximum likelihood Hypothesis testing Evaluating the performance of the model Some potential problems and solutions Writing up results Hands-on Applications Beginner Intermediate Advanced Powerpoint Slide Show References
SPSS On-Line Training Workshop
Contains about 40 Quick Time Movies describing many aspects of SPSS.
SPSS Training Main Page SPSS On-Line Training Workshop Table of Contents Overview of Analysis Data Editor Output Program Editor Chart Editor Analysis Projects Welcome to the SPSS (Statistical Package for Social Sciences) on-line training workshop. This on-line workshop assumes no previous knowledge of SPSS. However, if you are an experienced user, please browse through the Table of Contents and select the material that is appropriate for you . . . Carl Lee Felix Famoye How to obtain a copy of SPSS PC software? Before you begin, we recommend that you obtain a copy of SPSS PC software and install it in your computer, so that you will be able to work through the practice with us. If you are only browsing through the workshop material, no SPSS software is required. How to obtain a copy of QuickTime Movie Player? In order to play the movie clips, you need the QuickTime Movie Player. If you do not have the QuickTime Player, you can download this freeware from the Apple Computer Home Page , then install it on your system. How do I start the workshop? This will link you to a list of pages and corresponding movie clips to help you master SPSS. In the upper left of each page is a list of all major links in this site. You can click on any of the titles to move to that section. Any suggestions or comments are welcome and can be submitted by pressing the contact us button. You can contact Dr. Lee or Dr. Famoye directly by e-mail by clicking on their names in the left column. Happy learning!!! To help us improve the presentation, your feedback is always important. Before you leave this site, please give us your suggestions and or comments. 1999 Dr Carl Lee, Dr Felix Famoye, Central Michigan University. Joyce Sharp, student assistant. All rights reserved.
SPSS, Inc. SPSS Inc.
Develops, markets, supports integrated line of statistical software products that let users effectively bring marketplace and enterprise data to bear on decision-making. Business intelligence, especially data mining, as well as three vertical markets: survey and market research, quality improvement and scientific research. Comprehensive data mining technology and analytic applications for enhanced decision making. Develops, markets and supports integrated line of statistical software products. Product line, investor relations and careers are featured. (Nasdaq: SPSS) Helps organizations turn data into insight through predictive analytics. Features products, applications, online store, events, news and contact information.
SPSS, Data Mining, Statistical Analysis Software, Predictive Analysis, Predictive Analytics, Decision Support Systems [ Skip Global Navigation ] Search Worldwide Offices Store View Cart | Home | Software and Solutions | Services | Customers | Support | Training | Downloads | Partners | Company | Welcome to SPSS.com. Click here to login or register. Enabling the Predictive Enterprise Is your organization a Predictive Enterprise ? By integrating predictive analytics into its daily operations, an organization becomes a Predictive Enterpriseable to direct and automate decisions to meet business goals and achieve measurable competitive advantage. Find out why SPSS is uniquely qualified to help your organization become a Predictive Enterprise SPSS predictive analytics deliver measurable ROI. Learn what Nucleus Research's recent study on SPSS solutions revealed. Download a copy of the full report. Papers and Demos Papers Butler Group praises SPSS' Enterprise Platform for Predictive Analytics Butler Group confirms benefits insurance companies gain from PredictiveClaims Customer Story Compendium details leading organizations' use of predictive analytics Bloor Research praises Clementine's leadership in data mining market Demos Evaluate SPSS for Windows statistical analysis software Collect market research data anywhere easily Entryware Create, deploy predictive data mining models in Clementine Events Online Seminar: Upgrading to ShowCase Suite 7.0, Nov 29, US Register today Online Seminar: mrPaper and mrScan Demonstration, Nov 30, US Register today Online Seminar: mrInterview Demonstration, Dec 1, US Register today Online Seminar: Text Analysis for Surveys Demonstration, Dec 8, US Register today Online Seminars: The Power of Data Mining Series (archived recordings) Download today More Events News IBM Corp. Named SPSS Partner of the Year at Annual SPSS User Conference Read more SPSS and Information Builders Partner to Assist Richmond Police Department in Forecasting Crime Read more SPSS Reports Record Revenues in 2005 Third Quarter Read more PressReleases | NewsRoom | PressContacts Solutions For Your Industry Education Financial Services Government Insurance Retail Survey and Market Research Telecommunications Technologies Analytical Applications Data Mining Market Research ShowCase for the IBM iSeries Text Mining Statistical Analysis Web Analytics SPSS Family Make smarter decisions more quickly using comprehensive statistical software. More Info | Evaluation | Buy SPSS hosted the world's largest data mining event in May. Read more and view event photos. As Crime Fighters Study Data, SPSS Steps In SPSS featured in Investor's Business Daily Read article New! PredictiveClaims Resolve insurance claims faster and detect fraud at an earlier stage. ContactUs | TermsandConditions | PrivacyPolicy | MyProfile | WorldwideOffices | SiteMap Copyright 2005, SPSS Inc. All rights reserved. SPSS Inc. Headquarters, 233 S. Wacker Drive, 11th floor Chicago, Illinois 60606
Statistics Departments and Units
List compiled by Gordon Smyth, Department of Mathematics, University of Queensland.
Statistical Science Web: Departments Home Statistics Departments and Units Statistics Research Groups in Australia . Gordon Smyth, Walter and Eliza Hall Institute of Medical Research. Statistics Departments and Units in New Zealand . Gordon Smyth, Walter and Eliza Hall Institute of Medical Research. Statistics Departments in the UK and Ireland . Denis Mollison, Heriot-Watt University. Virtual Library: Statistics . Worldwide list of statistics groups by country. Graduate Degrees in Statistics . Schools granting graduate degrees in statistics who respond to email. Mostly US and Canadian but some Australian. Mitchell Watnik, University of California, Davis. Help Home - About Us - Contact Us Copyright Gordon Smyth 1996-2005. Last modified: 24 June 2005
Statistics groups outside the Netherlands
Listed by the Netherlands Society for Operational Research.
Statistics groups outside the Netherlands Statistics groups outside the Netherlands Australia Australian Bureau of Statistics Australian Institute of Health and Welfare Australian National University, Department of Statistics and Econometrics CSIRO Mathematical and Information Sciences Macquarie University, Department of Statistics Monash University, Applied Statistics University of Melbourne Department of Mathematics Statistics University of New England School of Mathematical and Computer Sciences University of Newcastle, Department of Statistics University of Queensland, Department of Mathematics University of Queensland, Department of Mathematics with links to other Statistics Departments and Units in Australia University of Sydney Mathematics and Statistics University of Western Australia, Department of Mathematics Brazil University of Sao Paulo, Department of Statistics Canada Dalhousie University, Department of Mathematics Statistics and Computing Science McMaster University, Department of Mathematics and Statistics Queen's University, Department of Mathematics and Statistics Simon Fraser University, Department of Mathematics Statistics Statistics Canada University of Guelph, Mathematics and Statistics Department University of Ottawa, Mathematics and Statistics Departments University of Toronto, Department of Statistics University of Victoria, Department of Mathematics and Statistics University of Windsor, Department of Mathematics and Statistics York University Department of Mathematics Statistics Europe Athens University of Economics and Business -- Greece Dokuz Eylul University, Department of Statistics -- Turkey Dortmund University, Department of Statistics -- Germany Eidgenossischo Technische Hochschule Zurich -- Switzerland Ecole Polytechnique Federale de Lausanne, A.C. Davison's Chair of Statistics -- Switzerland Ecole Polytechnique Federale de Lausanne, Chair of Applied Statistics -- Switzerland Ecole Polytechnique Federale de Lausanne, Chair of Statistics -- Switzerland Institute of Statistics and Econometrics of The Humboldt-University, Berlin -- Germany Irish Central Statistics Office Italian National Institute of Statistics (ISTAT) Katholieke Universiteit Leuven - Belgium Lund University Lund Institute of Technology - Department of Mathematics -- Sweden Statistics Netherlands Stockholm School of Economics - Department of Economic Statistics -- Sweden Trinity College, Dublin, Department of Statistics -- Ireland Universite Catholique de Louvain -- Belgium University of Turku, Department of Statistics. Includes information on other statistics programs in Finland. University of Cologne, with information about Statistics in Germany. University of Neuchatel -- Switzerland University of Ulm, Department of Statistics -- Germany University of Vienna, Department of Statistics, Op. Research, and Comp. Science -- Austria Israel Hebrew University of Jerusalem, Department of Statistics Technion Israel Institute of Technology, Statistics Laboratory Tel Aviv University, Department of Statistics and Operations Research University of Haifa, Department of Statistics Mexico Colegio de Postgraduados - Program of Statistics New Zealand Massey University, The Department of Statistics Otago University University of Auckland, Department of Statistics Victoria University Waikato University United Kingdom City University, Department of Actuarial Science and Statistics Durham Statistics Group IACR - Rothamsted and Long Ashton Lancaster University, Centre for Applied Statistics Lancaster University, Department of Mathematics and Statistics University of Bath, Statistics Group University of Cambridge, Statistical Laboratory University of Edinburgh, Department of Mathematics Statistics University of Glasgow, Department of Statistics University of Leeds, Department of Statistics University of Oxford, Department of Statistics University of Southampton, Department of Social Statistics University of Sussex, School of Mathematical Sciences United States Bowling Green State University, Department of Applied Statistics and Operations Research Bowling Green State University, Department of Mathematics and Statistics Carnegie Mellon Statistics Department Case Western Reserve University, Statistics Department Case Western Reserve University, Department of Epidemiology Biostatistics Central Connecticut State University, Department of Mathematical Sciences Clemson University, Statistics and Probability Colorado State University, Department of Statistics Columbia School of Public Health, Division of Biostatistics Columbia University, Department of Statistics Cornell University, Biometrics Unit Cornell University, Cornell Statistics Center Cornell University, Department of Operations Research Duke University, Institute of Statistics and Decision Sciences George Mason University, Computational and Statistical Sciences George Mason University, Department of Statistics George Washington University, Department of Statistics Georgia Tech, Master of Science in Statistics program Harvard University, Department of Statistics Harvard University, Biostatistics Department Florida State University, Department of Statistics Iowa State University, Department of Statistics Kansas State University, Department of Statistics Miami University, Oxford, OH, Department of Mathematics and Statistics Michigan State University, Department of Statistics and Probability Montana State University, Statistical Program New Jersey Institute of Technology, Department of Mathematics New York University, Department of Statistics and Operations Research Northern Illinois University, Division of Statistics Northwestern University, Department of Statistics North Carolina State University, Department of Statistics Ohio State University, Department of Statistics Old Dominion University, Department of Mathematics and Statistics Oregon State Univesity, Department of Statistics Penn State, Department of Statistics Rollins School of Public Health at Emory University, Department of Biostatistics Southern Methodist University, Department of Statistical Science Stanford University, Department of Statistics Temple University, Department of Statistics Texas AM University, Department of Statistics University of Alabama, Applied Statistics program University of Alabama Birmingham, Department of Biostatistics University of Arkansas, Department of Mathematical Sciences University of California, Los Angeles, Department of Biostatistics University of California, San Francisco, Division of Biostatistics University of Central Florida, Department of Statistics University of Chicago, Statistics Department University of Colorado, Health Sciences Center, Department of Preventive Medicine and Biometrics University of Connecticut, Department of Statistics University of Florida, Department of Statistics University of Georgia, Department of Statistics University of Idaho, Division of Statistics University of Illinois, Urbana-Champaign, Department of Statistics University of Illinois, Department of Math, Statistics, and Computer Science (Chicago) University of Iowa, Department of Statistics and Actuarial Science University of Maryland, Baltimore County, Department of Mathematics and Statistics University of Massachusetts, Amherst, Department of Mathematics and Statistics University of Michigan, Department of Statistics University of Minnesota, School of Statistics University of Missouri at Columbia, Department of Statistics University of New Mexico, Department of Mathematics and Statistics University of North Carolina, Chapel Hill, Department of Statistics University of Oregon, Decision Sciences Department University of Pittsburgh, Department of Statistics University of Rochester, Department of Biostatistics University of Rochester, Department of Statistics University of South Florida, Department of Epidemiology and Biostatistics University of South Carolina, Department of Statistics University of Tennessee, Department of Statistics University of Vermont, Department of Biostatistics University of Vermont, Department of Statistics University of Virginia, Division of Statistics University of Washington Department of Statistics University of Wisconsin Madison, Statistics Department Virginia Polytechnic Institue and State University, Department of Statistics Washington University, Division of Biostatistics Wright State University Department of Mathematics and Statistics Yale University Department of Statistics 11-04-2000 Info:
Departments, Divisions and Schools of Statistics
List maintained at Helsinki University.
Korkeakoulut www Departments, Divisions and Schools of Statistics Austria Graz University of Technology - Institute for Statistics University of Vienna - Dept. of Statistics, OR, and Computer Science Technical Reports Index only Belgium Universit Libre de Bruxelles - Service de Mathmatiques de la Gestion Universite Catholique de Louvain Danmark University of Copenhagen - The Department of Theoretical Statistics University of Aarhus Department of Theoretical Statistics Finland University of "Jyvaskyla" - Department of Statistics University of Tampere - Department of Mathematical Sciences, Statistics Unit University of Turku, Department of Statistics. Includes information on other statistics programs in Finland. University of Oulu University of Vaasa . France Ecole des Mines de Paris - Centre de Geostatistique Le service WWW de l'ENSIMAG School of Statistics and Economic Management Institut National de la Statistique et des tudes conomiques (INS) IMAG - Equipe Statistique et Modlisation Stochastique FACULTE DE MEDECINE - Universit de Nantes Institut Universitaire de Technologie - STID (Dpartement Statistique et Traitement Informatique des Donnes Modelisation Stochastique et Statistique Universite Paris-Sud - CNRS URA D 0743 Informatique - Statistique Medicale - Univ. de Nancy Germany Dortmund University, Department of Statistics, Germany Reporte des FB Statistik University of Heidelberg StatLab StatLab Heidelberg Abstracts (by author) 30. Jan. 96 Institute of Statistics and Econometrics of The Humboldt-University, Berlin Papers DISCUSSION PAPERS OF INTERDISCIPLINARY RESEARCH PROJECT 373 DISCUSSION-PAPERS University of Cologne, Germany, with information about Statistics in Germany. Discussion Papers in Statistics and Econometrics Universitt Mannheim - Fakultt fr Volkswirtschaftslehre und Statistik University of Ulm, Ulm Germany -- Department of Statistics Publications Ireland Trinity College, Dublin Ireland -- Department of Statistics Papers Index only Italy Bologna - Dipartimento di Scienze Statistiche dell'Universita' di Bologna -Department of Statistical Science of University of Bologna Cineca - Servizio Imformazioni del CINECA (Information service CINECA) Cineca - Statistica e Analisi Dati (Statistics and Data Analysis) University "Ca'Foscari" of Venice - Department of Statistics University of Venice - Department of Statistics - c o Dipartimento di Scienze Statistiche dell'Universita' di Perugia (c o Department of Statistics Science of the University of Perugia) Netherlands Delft University of Technology Statistics, Prob. Theory and Op. Research OverviewPub91-93.html (empty) Statistics Netherlands Norway SAND - (Statistical Analysis of Natural Resource Data) Geostatistics group at the Norwegian Computing Centre The Norwegian Institute of Technology - Department of Mathematical Sciences, Statistics Group. Preprints etc.(Statistics) University of Oslo - Department of Mathematics Poland Technical University of Wroclaw Institute of Mathematics, including statistics. Spain University of Valladolid - Department of Statistics and Operations Research University of the Basque Country Department of Statistics and Econometrics (EA-III) Sweden Royal Institute of Technology (KTH) Department of Mathematical Statistics University of Linkping Department of Statistics University of Linkping - Department of Statistics Publications Index only Stockholm School of Economics - Department of Economic Statistics Recent Working Papers in Economic Statistics Lund University Lund Institute of Technology - Department of Mathematics Publications at the Department of Mathematical Statistics Warning: This page is under construction! Switzerland Eidgenossische Technische Hochschule Zurich Research Reports List of "Research Reports" Ecole Polytechnique Federale de Lausanne - Chair of Applied Statistics Publications and Research Reports with Abstracts by Members of the Chair Ecole Polytechnique Federale de Lausanne - Chair of Statistics United Kingdom University of Liverpool - Statistics and Computational Mathematics. Durham Statistics Group University of Southampton - Centre for Survey Data Analysis Technical Report Series University of Southampton - Department of Social Statistics Publications (index) Lancaster University Department of Mathematics and Statistics MATHEMATICS DEPARTMENT TECHNICAL REPORTS (index) University of Exeter - Department of Mathematical Statistics and Operations Research University of Leeds Department of Statistics Some research reports available on-line University of Bath - Statistics Group. BIOSS - Biomathematics and Statistics Scotland University of Birmingham - CTI Centre for Mathematics and Statistics The City University Department of Actuarial Science and Statistics Departmental Research Papers Index only Publications in academic year 1993-94 Index only De Montfort University - Department of Medical Statistics Heriot-Watt University - Actuarial Mathematics and Statistics University of Edinburgh - Department of Mathematics and Statistics Preprints University of Nottingham - Mathematics Department and statisticians. Publications (index) University of Reading - Applied Statistics Publications (index) University of Sheffield - School of Mathematics and Statistics University of Bristol - Department of Mathematics: Statistics group Bristol Statistics Group Technical report archive ) University of Glasgow Department of Statistics Oxford University - Department of Statistics University of Cambridge Statistical Laboratory University of Cambridge Statistical Laboratory Home Page Statistical Laboratory Research Reports Series University of Sussex School of Mathematical Sciences Research Reports (index) University of Kent at Canterbury - Institute of Mathematics and Statistics IMS Technical Reports United States Temple - Department of Statistics (gopher) Brigham Young University - Department of Statistics. Virginia Commonwealth University - Department of Mathematical Sciences Tulane University - Department of Mathematics Harvard - School of Public Health Biostatistics Biostatistics Papers and Technical Reports California State University, Hayward Teaching materials and resources Kent State University - Applied Statistics New Jersey Institute of Technology, Department of Mathematics Old Dominion - Mathematics and Statistics Department University of Pennsylvania - Statistics Department at the Wharton School Recent Publications and Technical Reports University of Oregon Decision Sciences Department Research Yale University Department of Statistics Preprints University of Rochester Department of Biostatistics Florida State University Department of Statistics Harvard - Department of Statistics University of Tennessee, Department of Statistics University of Chicago - Department of Statistics Technical Reports List Cornell University, Department of Operations Research School of ORIE Technical Reports (10 88 - present) Carnegie Mellon Statistics Department Department of Statistics Technical Reports University of Maryland Baltimore County - Department of Mathematics and Statistics Faculty Technical Reports University of Minnesota - Division of Biostatistics Department of Statistics University of Illinois at Urbana-Champaign Technical Reports Index State University of New York at Albany - Department of Mathematics and Statistics Stanford University Department of Statistics Index of Technical Reports by Date University of Connecticut, Department of Statistics Technical Reports George Mason University Computational and Statistical Sciences Arizona State University - Measurement, Statistics, and Methodological Studies Program UMASS, Amherst, Department of Mathematics and Statistics University of California, Berkeley - Department of Statistics Technical Reports Florida State University University of Michigan - Department of Statistics Ohio State University Department of Statistics Texas AM University Department of Statistics Technical Reports University of Florida - Department of Statistics University of Illinois Department of Statistics University of Minnesota - School of Statistics Technical report archive Colorado State University Department of Statistics Technical Reports, Papers, Theses Dissertations University of Virginia, Division of Statistics Publications and FTP site Indiana University - School of Medicine, Division of Biostatistics. Southern Methodist University Department of Statistics University of Alabama Birmingham, Department of Biostatistics University of Chicago Grad School of Business - Statistics, Econometrics and Quality Management The American University - Department of Mathematics and Statistics Department of Applied Statistics and Operations Research Bowling Green State University, Department of Mathematics and Statistics. Faculty Research and Selected Publications (index only) Medical College of Wisconsin - Division of Biostatistics University of California, San Francisco Division of Biostatistics UCSF Biostatistics Technical Reports (index only) University of Washington - Biostatistics Department University of Wisconsin - Madison - Biostatistics Department Washington University, Division of Biostatistics University of Alabama, Applied Statistics program Northeastern University - Center for Digital Signal Processing University of Rhode Island - Department of Computer Science and Statistics Technical Reports West Virginia University - Department of Statistics and Computer Science Auburn University - Department of Discrete and Statistical Sciences George Mason University Department of Statistics The Center for Computational Statistics Technical Report Series George Washington University Department of Statistics Technical reports (index only) Duke University Institute of Statistics and Decision Sciences Technical report archive Kansas State University Department of Statistics Clemson University, Statistics and Probability Northern Illinois University, Division of Statistics Online Technical Reports, Abstracts and Research Papers University of Massachusetts Amherst - Department of Mathematics and Statistics University of Nebraska-Lincoln - Department of Mathematics and Statistics University of Missouri at Columbia Department of Statistics University of Kentucky - Department of Statistics Johns Hopkins University - Department of Mathematical Sciences. Oregon State Univesity Department of Statistics Iowa State University - Department of Statistics and Statistical Laboratory TITLES OF TECHNICAL REPORTS Rockefeller University's - Sequence Analysis Facility Rice University - Department of Statistics Rollins School of Public Health at Emory University, Department of Biostatistics University of Michigan - Department of Biostatistics Selected Publications (list) Columbia University Department of Statistics Technical Reports University of Michigan Department of Statistics Technical Reports Louisiana State University - Department of Experimental Statistics Technical Reports Penn State Department of Statistics Technical Reports Purdue University - Department of Statistics University of South Carolina Department of Statistics Technical Reports University of South Carolina Department of Statistics University of California, Los Angeles - Statistics Group. Technical report archive University of Florida Department of Statistics University of Georga, Department of Statistics Technical reports University of Iowa, Department of Statistics and Actuarial Science Technical reports University of North Carolina, Chapel Hill, Department of Statistics Technical reports (index) University of Washington Department of Statistics Technical report archive University of Washington - Department of Statistics Technical reports University of Wisconsin - Madison - Statistics Department Technical reports Iowa State University Department of Statistics Indiana University - Center for Statistical and Mathematical Computing New York University - Statistics and Operations Research Department Publications by Faculty Michigan State University - Department of Statistics and Probability University of Arkansas, Department of Mathematical Sciences Research Reports University of Michigan - The Center for Statistical Consultation and Research The Center For Statistical Consultation And Research CSCAR Online Documentation University of Missouri-Rolla - Department of Mathematics and Statistics Montana State University Department of Mathematical Sciences North Carolina State University Department of Statistics Canada University of Calgary - Balducci's Actuarial Home Page Concordia University - Department of Mathematics and Statistics Mathematics Statistics List of Technical Reports University of Western Ontario - Department of Statistical and Actuarial Sciences University of Guelph - Department of Mathematics and Statistics York University Department of Mathematics Statistics University of Waterloo - Department of Statistics and Actuarial Science Technical Reports (ABSTRACTS) University of Alberta - Department of Mathematical Sciences Dalhousie University - Department of Mathematics, Statistics and Computing Science University of Windsor - Department of Mathematics and Statistics University of Montreal - Department of Operations Research Queen's University, Deaprtment of Mathematics and Statistics Memorial University of Newfoundland - Department of Mathematics and Statistics Simon Fraser University - Department of Mathematics Statistics Simon Fraser University University of Ottawa - Department of Mathematics and Statistics Working Papers Faculty of Administration University of Ottawa McMaster University - Department of Mathematics and Statistics University of Manitoba - Department of Statistics University of Toronto, Department of Statistics The Department of Statistics Technical Report Series Australia Australian National Division of Statistics University of Queensland, Department of Mathematics University of Newcastle, Department of Statistics University of New England Department of MSCS University of New South Wales - Australian Graduate School of Management CSIRO - Division of Mathematics and Statistics James Cook University - Department of Mathematics and Statistics Monash University, Statistics Section, Mathematics Department Research Papers of Rob J Hyndman University of Sydney Mathematics and Statistics publications (plus grants) Research Reports University of Western Australia, Department of Mathematics Reports University of Melbourne Department of Statistics Research publications 1991-1993 Research preprints 1994 Research preprints 1995 Macquarie University Department of Statistics Recent Research Papers New Zealand Otago University Massey University FIMS Research Reports: Preprint Series Victoria University Victoria University of Wellington - Institute of Statistics and Operations Research University of Waikato - Department of Mathematics and Statistics Publications (lista) RESEARCH REPORTS (lista) University of Auckland - Department of Statistics Singapore National University of Singapore - Department of Mathematics (including Statistics) Japan Osaka University - Department of Mathematical Science (Statistical Mathematics Group) All lists of Preprint Series (S). Republic of Korea ChungBuk National University - Department of Statistics Hallym University - Department of Statistics
Oxford University Department of Statistics Links
Statistics Departments in the UK and other countries.
Oxford University Department of Statistics - Links LINKS - Statistics Departments In the UK ALLSTAT A mailing list for Statisticians (based in the U.K.) University of Aberdeen (Mathematical Sciences) University of Bath Statistics Group. BIOSS Biomathematics and Statistics Scotland Birkbeck College, University of London IACR (Institute of Arable Crops Research) University of Birmingham CTI Centre for Mathematics and Statistics University of Bristol Department of Mathematics: Statistics group University of Cambridge Statistical Laboratory; including the Markov Chain Monte Carlo preprint collection and a Minitab macro library. City University Department of Actuarial Science and Statistics De Montfort University Department of Medical Statistics University of Durham Department of Statistics University of Edinburgh Department of Mathematics and Statistics University of Exeter Department of Mathematical Statistics and Operations Research University of Glasgow Department of Statistics Heriot-Watt University Actuarial Mathematics and Statistics University of Kent at Canterbury Lancaster University Department of Mathematics and Statistics Lancaster University Centre for Applied Statistics University of Leeds Napier University (Mathematics Statistics) University of Liverpool Statistics and Computational Mathematics. University of Nottingham Mathematics Department and statisticians. The Open University Department of Statistics Oxford University Department of Statistics University of Paisley (Mathematics Statistics) University of Plymouth (School of Mathematics Statistics) University of Portsmouth (School of Mathematical Studies) University of Reading Applied Statistics University of St Andrews (School of Mathematical Computational Sciences) University of Sheffield School of Mathematics and Statistics University of Southhampton Centre for Survey Data Analysis University of Southhampton Department of Social Statistics University of Strathclyde (Statistics Modelling Science) University of Sussex (School of Mathematical Sciences) University of Wales, Cardiff (School of Mathematics: Statistics Group) Around the World programs | courses | research | people | contact | events | ftp | consulting | local | home
Academic Departments
A browseable world map with links to statistics departments.
UCLA Department of Statistics
GOSSET
A general-purpose program for experimental designs, by N. J. A. Sloane and R.H. Hardin. Free download of beta-test C source files.
Gosset home page GOSSET: A GENERAL-PURPOSE PROGRAM FOR DESIGNING EXPERIMENTS N. J. A. Sloane and R. H. Hardin Internet and Network Systems Research Center, ATT Shannon Labs, Florham Park, N.J. 07932-0971 U.S.A. This is the home page for Gosset. It contains sections called OVERVIEW OF GOSSET GETTING THE FILES INSTALLATION UPDATES AND BUG FIXES APPLICATIONS FOR FURTHER INFORMATION COPYRIGHT Last modified May 07, 2003. This replaces the "README" file that was included with older releases of Gosset. OVERVIEW OF GOSSET Gosset is a flexible and powerful program for constructing experimental designs. It runs under Unix, Linux and Mac OS X. The following are some of its features. Variables may be discrete or continuous (or both). Discrete variables may be numeric or symbolic (or both). Continuous variables may range over a cube or a ball (or both). The variables may be required to satisfy linear equalities or inequalities. The model to be fitted may be any low degree polynomial (e.g. a quadratic). Much more general models can also be used - see Section 3.12 of the manual. The number of observations is specified by the user. The design may be required to include a specified set of points. (so a sequence of designs can be found, each of which is optimal given that the earlier measurements have been made). The region where the model is to be fitted need not be the same as the region where measurements are to be made (so the designs can be used for extrapolation). The following types of designs can be requested: I-, A-, D- or E-optimal, the same but with protection against loss of one trial, or packings (if no model is available). Blocked designs and designs with correlated errors can also be obtained. The algorithm is powerful enough to routinely minimize functions of 1000 variables (e.g. can find optimal or nearly optimal designs for a quadratic model involving 12 variables). An extensive library of precomputed optimal designs is included for linear and quadratic designs in the cube, ball and simplex, involving up to 14 variables. The user does not have to specify starting points for the search. The user also has control over how much effort is expended by the algorithm, and can if desired monitor the progress of the search. Applications so far include VLSI production, conductivity of diamond films, growth of protein crystals, flow through a catalytic converter, laser welding, etc. Gosset is described in more detail in the following documents. R. H. Hardin and N. J. A. Sloane, "Gosset: A General-Purpose Program for Constructing Experimental Designs (Second Edition)" [ postscript file ], 2003. (Also included with the source files.) [When viewing this postscript file with ghostview, set the "PageSize" option, the 6th button at the top, to "Letter" rather than "Automatic" or "BBox"] R. H. Hardin and N. J. A. Sloane, "A New Approach to the Construction of Optimal Designs", J. Statistical Planning and Inference, vol. 37, 1993, pp. 339-369 [ Abstract , postscript or pdf ]. R. H. Hardin and N. J. A. Sloane, "Computer-Generated Minimal (and Larger) Response Surface Designs: (I) The Sphere" ( Abstract , pdf , ps ). R. H. Hardin and N. J. A. Sloane, "Computer-Generated Minimal (and Larger) Response Surface Designs: (II) The Cube" ( Abstract , pdf , ps ). GETTING THE FILES For a limited time you can download a beta-test version of Gosset at no charge. We are doing this for several reasons: to collect feedback from users to collect information about applications to encourage the use of Design of Experiments in industry Of course, "anything free comes with no guarantee". If you download the program, please send email to Neil Sloane at this address: njas@research.att.com , giving your name, affiliation, and postal address, for our records. If you find it useful in some real application, or teaching a course, we would like to get some comments. For example, a real-life example of how you used it (of course, change any proprietary data). If you publish anything that makes use of a design that was partly obtained using Gosset, please cite Gosset, just as you would acknowledge a design that a colleague constructed for you. The citation could read something like this: R. H. Hardin and N. J. A. Sloane, GOSSET: A general-purpose program for designing experiments, www.research.att.com ~njas gosset . Also we would appreciate it if you could inform us about such a paper. The files can be obtained from the ftp site ftp: ftp.research.att.com You need to obtain two files: index.html (this file) and codemart.cpio (about 5 megabytes) Go to directory "dist", then "njas", then "gosset", where you will find the files. Warning: it seems to take some browsers a long time to find this site! Memo to colleagues: if you are inside the Labs firewall, you need to set "Use Passive FTP (for firewall and DSL modem compatibility)" This setting is under Tools Internet Options Advanced INSTALLATION The following instructions are an updated version of those in Section 9 of the manual. System administrators please note: if you are installing gosset for multiple users, the instructions are slightly different - see below . INSTALLING A PRIVATE COPY OF GOSSET First choose a base directory for gosset. Subdirectories will be created off this for work on individual problems. Place the files index.html (this file) and codemart.cpio in the base directory. Change directory to the base directory. To print the manual, which is about 130 pages long, type $ lp manual.ps (possibly replacing "lp" by your local printer command, e.g. "lpr"). (If you view this postscript file with ghostview, set the "PageSize" option, the 6th button at the top, to "Letter" rather than "Automatic" or "BBox") Extract everything in codemart.cpio : $ cpio -icu codemart.cpio (some users have found that it is necessary to use $ cpio -iu codemart.cpio instead) and compile several files: $ cc -w M*.c -o gosset -lm $ rm * vtrace * vvv * moments * interp (The latter command is needed only if you already had a copy of gosset. It removes some out-of-date files.) The archive file codelib.a does not need to be touched. To find a design, start by entering gosset : $ gosset The program responds by asking you to name a working subdirectory: please type 'cd something' to name a local directory for your work At this point you will probably enter the specifications for a new design - see Sects. 2, 3, .... of the manual. INSTALLING GOSSET FOR MULTIPLE USERS First choose a directory for the gosset source files, say u g sources. Place index.html and codemart.cpio in u g sources Change directory to u g sources. To print the manual, which is about 130 pages long, type $ lp manual.ps (possibly replacing "lp" by your local printer command, e.g. "lpr"). (If you view this postscript file with ghostview, set the "PageSize" option, the 6th button at the top, to "Letter" rather than "Automatic" or "BBox") Extract everything in codemart.cpio : $ cpio -icu codemart.cpio (some users have found that it is necessary to use $ cpio -iu codemart.cpio instead) and compile several files: $ cc -DGOSSETSRC=\" u g sources\" -DCODELIB=\" u g sources\" M*.c -o gosset -lm which will create a version of gosset that expects the source files to be in u g sources. The escapes are necessary on the quotes, because they are part of the definition. The executable file gosset can be moved anywhere, say into usr local bin , and can be executed from anywhere. Be warned, however - working directories will be created by gosset wherever the user is, instead of from a single base directory. So the user must exercise some discipline when invoking gosset, to avoid chaos in the directory structure. If gosset was already installed on your system, users should execute $ rm vtrace vvv moments interp in each working subdirectory, to remove out-of-date files. The archive file codelib.a does not need to be touched. When someone wants to find a design, they change to a base directory (typically $HOME gosset), from which working subdirectories will be created, and enter gosset: $ gosset The program responds by asking them to name a working subdirectory: please type 'cd something' to name a local directory for your work At this point they will probably enter the specifications for a new design - see Sects. 2, 3, .... of the manual. UPDATES AND BUG FIXES The current version (May 07 2003) incorporates several changes to fix error messages produced by different C compilers. As C compilers have evolved they have become more picky. Running Gosset often produces harmless but irritating warning messages from the C compiler. To avoid this, we recommend that you compile the source files with cc -w (as shown above) and that you run Gosset with the command: gosset 'cflags -w' If you forget, and just run "gosset", start by typing cflags -w and we also usually type compiler=gcc prompt % Bill Kappele (Bill(AT)mathoptions.com) has written a graphical interface that creates an input file for Gosset. It can be run in Windows or Unix Linux. A Tcl Tk interpreter is required. It can be found on his website APPLICATIONS There have been three kinds of applications: Applications to industrial problems (It is inevitable that the most spectacular applications do not get published!) J. Hagen, M. Heinen and W. Salber: DOE in der Optimierung von Ottomotoren mit vollvariabler Ventilsteuerung; paper for the conference "Design of Experiments in der Motorenentwicklung", Haus der Technik, Dec. 2001. Charles W. Carter has used Gosset successfully in designing several experiments. Optimization of Resist Formulation and Processing with Disulfone Photo Acid Generators Using Design of Experiments, O. Nalamasu, A. Freeny, E. Reichmanis, N.J.A. Sloane and L. F. Thompson, ATT Bell Labs Memorandum, 1993. Applications to theoretical understanding of optimal designs R. H. Hardin and N. J. A. Sloane, "Computer-Generated Minimal (and Larger) Response Surface Designs: (I) The Sphere" ( Abstract , pdf , ps ). R. H. Hardin and N. J. A. Sloane, "Computer-Generated Minimal (and Larger) Response Surface Designs: (II) The Cube" ( Abstract , pdf , ps ). Several other papers are in preparation. Applications to mathematical problems Packing Lines, Planes, etc.: Packings in Grassmannian Space [ Abstract , postscript , pdf ], J. H. Conway, R. H. Hardin and N. J. A. Sloane, Experimental Math., 5 (1996), pp. 139-159. Codes (Spherical) and Designs (Experimental), R. H. Hardin and N. J. A. Sloane, Different Aspects of Coding Theory, ed. A. R. Calderbank, AMS Series Proceedings Symposia Applied Math., Vol. 50, 1995, pp. 179-206. McLaren's Improved Snub Cube and Other New Spherical Designs in Three Dimensions [ Abstract , postscript , pdf ] [note: Fig. 1a and Fig. 1b are in separate files] R. H. Hardin and N. J. A. Sloane, Discrete and Computational Geometry, 15 (1996), pp. 429-441. Minimal-Energy Clusters of Hard Spheres [ Abstract , postscript , pdf ] [note: Fig. 11 , Fig. 12 and "photos" of the putatively optimal clusters of 4 to 10 and 13 to 20 spheres are in separate files], by N. J. A. Sloane, R. H. Hardin, T. S. Duff and J. H. Conway, Discrete Computational Geom., 14 (1995), pp. 237-259. Expressing (a^2 + b^2 + c^2 + d^2 )^2 as a Sum of 23 Sixth Powers [ Abstract , postscript , pdf ], R. H. Hardin and N. J. A. Sloane, Journal of Combinatorial Theory, Series A, 68 (1994), pp. 481-485. Also DIMACS Technical Report 93-54, August 1993. New Spherical 4-Designs [ Abstract , postscript , pdf ], R. H. Hardin and N. J. A. Sloane, Discrete Mathematics, 106 107 (1992), pp. 255-264, (Topics in Discrete Mathematics, vol. 7, "A Collection of Contributions in Honour of Jack Van Lint", ed. P. J. Cameron and H. C. A. van Tilborg, North-Holland, 1992.). Spherical Designs in Four Dimensions (Extended Abstract) [ Abstract , pdf , ps ], N. J. A. Sloane, R. H. Hardin and P. Cara, Proceedings Information Theory Workshop (Paris, April 2003), 2003. FOR FURTHER INFORMATION For further information contact N. J. A. Sloane Information Sciences Research Center Room C-233 ATT Shannon Labs 180 Park Avenue Florham Park NJ 07932-0971 USA Email address: njas@research.att.com fax: 973 360 8178 COPYRIGHT NOTICE Gosset was developed at ATT during 1991-2003 by R. H. Hardin and N. J. A. Sloane, and is copyright 1991-2003 by R. H. Hardin and N. J. A. Sloane. See also: Neil Sloane's home page home | people | projects | research areas | resources |
DESIGN Package for GAP
A package for classifying, partitioning and studying block designs in GAP 4.3 by Leonard H. Soicher. Free download in .tar.gz format, documentation in PDF.
DESIGN Package for GAP DESIGN 1.1 Package for GAP 4.4 Author: Leonard H. Soicher Language: GAP Operating System: Unix Current version archive: design1r1.tar.gz (for GAP 4.4 and DTRS External Representation Protocol 2.0) README file Manual (including installation instructions): HTML | PDF Note: If you are running DESIGN 1.1 under a Unix version of GAP4.4.5 or above, then replace the file pkg grape lib grape.g in your GAP root directory by this file . Description DESIGN is a GAP package for classifying, partitioning and studying block designs.
Matroids and Signed Graphs
Definitions, examples and representability problems compiled by Steve Pagano.
Matroids and Signed Graphs Matroids and Signed Graphs Introduction and some notes What is a matroid? Some common examples of matroids Circuits, bases, rank, closure Duality Minors Representability Connectivity Okay, so now that I have these basics, what the heck is a signed graph? All right, what are you trying to find out about signed graphs and their associated matroids? Have you found anything interesting yet? Any good references for all this stuff? Home | Matroids | Fiction
Matroid Miscellany
References, sources and open problem, collected by Thomas Zaslavsky.
Matroid Miscellany Matroid Miscellany by Thomas Zaslavsky Sources A list of places where you can get introduced to matroid theory at any level you wish. Problems Some open problems . Matroid Theory: Where to Find It Out Speedy easy introduction: Steve Pagano's Matroids page. Short technical introductionss: Robin J. Wilson, "An introduction to matroid theory", American Mathematical Monthly Vol. 80 (1973), pp. 500-525. Robin J. Wilson, "Matroid theory", Ch. 9 of Introduction to Graph Theory, Academic Press, New York-London, 1972; 2nd edn., Academic Press, New York-London, 1979; 3rd edn., Longman, London, and Wiley, New York, 1985. Translated into Russian (1977; 1st edn.) and Polish (1985; 2nd edn.). For a thorough introduction: James Oxley, Matroid Theory, Oxford University Press, Oxford, 1992. The best introductory book. An exceptionally fine textbook. It doesn't cover everything (which would have been impossible); see the next two items for articles that make up the major omission. Thomas Zaslavsky, "The Mbius function and the characteristic polynomial", Ch. 7 in: White, Theory of Matroids. Introduces an important aspect omitted by Oxley. Thomas Brylawski and James Oxley, "The Tutte polynomial and its applications", Ch. 6 in: White, Matroid Applications. Much more of the same important aspect omitted by Oxley, extending Zaslavsky's chapter. Henry Crapo, "Examples and basic concepts", Ch. 1 in: White, Theory of Matroids. Georgio Nicoletti and Neil White, "Axiom systems", Ch. 2 in: White, Theory of Matroids. An overview of many of the multiplicity of "cryptomorphisms" (equivalent but seemingly wildly different ways to define matroids); an antidote to the "Let (E, X) be a matroid" style of pseudo-definition. Advanced books and articles (very selective): Joseph P.S. Kung, "Extremal matroid theory", in: Neil Robertson and Paul Seymour, eds., Graph Structure Theory (Proc. Conf., Seattle, 1991), pp. 21-61. Contemporary Math., Vol. 147. American Mathematical Society, Providence, R.I., 1993. The founding paper. Joseph P.S. Kung, "Critical problems", in: Joseph E. Bonin, James G. Oxley, and Brigitte Servatius, eds., Matroid Theory (Proc. Conf, Seattle, 1995), pp. 1-127. Contemporary Math., Vol. 197. American Mathematical Society, Providence, R.I., 1996. Extremely thorough. Neil White, ed., Theory of Matroids, Cambridge University Press, Cambridge, 1986. Neil White, ed., Combinatorial Geometries, Cambridge University Press, Cambridge, 1987. Special topics and special types of matroids. Neil White, ed., Matroid Applications, Cambridge University Press, Cambridge, 1992. Highly specialized topics, except for Ch. 6 (see above). Most important: Anders Bjrner, "Homology and shellability of matroids and geometric lattices", Ch. 7; Anders Bjrner and Gnter M. Ziegler, "Introduction to greedoids", Ch. 8. D.J.A. Welsh, Matroid Theory, Academic Press, London, 1976. A thorough survey of the state of the theory at that time; out of date but still a valuable reference, not superseded. Important related topic: Anders Bjrner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Gnter M. Ziegler, Oriented Matroids, Cambridge University Press, Cambridge, 1993. To students of oriented matroids, this is The Book. Best Viewed With Any Browser Last modified 2001 Aug 23 My home page .
Matroids and Signed Graphs
Introduction and web notes by Steve Pagano.
Matroids and Signed Graphs Matroids and Signed Graphs Introduction and some notes What is a matroid? Some common examples of matroids Circuits, bases, rank, closure Duality Minors Representability Connectivity Okay, so now that I have these basics, what the heck is a signed graph? All right, what are you trying to find out about signed graphs and their associated matroids? Have you found anything interesting yet? Any good references for all this stuff? Home | Matroids | Fiction
Coxeter Matroids
Alexandre Borovik's introductory notes, examples and research.
Cxeter Matroids Coxeter Matroids I study Coxeter matroids. The concept of a Coxeter matroid is exteremely versatile. Coxeter matroids appear in Topology, Geometry, Applied Combinatorics in many different disguises. But one of many equivalent definitions of a Coxeter matroids is really simple and intuitive. This is the concept of a matroid polytope . Picture by Maria Borovik . Next: Matroid Polytope
Coxeter Matroids
Neil White's research papers (mainly PS).
Papers on Coxeter Matroids Research Papers on Coxeter Matroids : ( What the heck are Coxeter Matroids?) Coxeter Matroids of Gelfand et al. Seattle Matroid Conf., 1995, .ps file without figures, 9 pp. Boundaries of Coxeter Matroids coauthored with Borovik and Gelfand, 1996, .ps file, 12 pp. Exchange Properties for Coxeter Matroids and Oriented Matroids coauthored with Borovik and Gelfand, .ps file, 18 pp. Lattice of Flats and Its Underlying Flag Matroid Polytope coauthored with Borovik, Gelfand, and Vince, .ps file, 15 pp. Coxeter Matroid Polytopes coauthored with Borovik and Gelfand, .ps file, 12 pp. Symplectic Matroids coauthored with Borovik and Gelfand, .ps file, 21 pp. Representations of Matroids in Semi-Modular Lattices coauthored with Borovik and Gelfand, .ps file, 13 pp. Combinatorial Flag Varieties coauthored with Borovik and Gelfand, .ps file, 25 pp. Orthogonal Matroids coauthored with Vince, .ps file, 21 pp. Oriented Lagrangian Matroids coauthored with Booth, Borovik and Gelfand, .ps file, 18 pp. Lagrangian Pairs and Lagrangian Orthogonal Matroids coauthored with Booth and Borovik, .pdf file, 13 pp.
Who's Who in Combinatorics
Part of the Combinatorics Net.
Who's Who(1) Who's Who in Combinatorics List of World Combinatorics Exchange [ Mirror Site in Germany ] The Graph Theory White Pages The Graph Theorists' Home Page Guide Complete List (A - Z) A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A Abramov, Sergei A. http: www.ccas.ru ~zavar abrsa sabramov@ccas.ru Alladi, Krishnaswami http: www.math.ufl.edu ~alladi alladi@math.ufl.edu Almkvist, Gert Mailing address gert@maths.lth.se Alon, Noga http: www.math.tau.ac.il ~noga noga@math.tau.ac.il Amdeberhan, Tewodros http: www.math.temple.edu ~tewodros tewodros@math.temple.edu Anderson, Laura http: www.math.tamu.edu ~landersn Laura.Anderson@math.tamu.edu Andersson, Pontus http: www1.cs.columbia.edu ~sanders graphtheory people random.cgi?Andersson,+Pontus Andrews, George http: www.math.psu.edu andrews andrews@math.psu.edu Askey, Richard A. http: www.math.wisc.edu ~askey askey@math.wisc.edu Athanasiadis, Christos A. http: www1.cs.columbia.edu ~sanders graphtheory people random.cgi?Athanasiadis,+Christos+A. caa@math.uoc.gr Back to the top
UK Combinatorial Mathematicians
A list maintained by the British Combinatorial Committee.
British Combinatorial Bulletin, part A List A Combinatorial Mathematicians based in Britain A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | | V | W | | | Z A Aghaei, Morteza Sussex Alassiry, Tem Royal Holloway Allen, Stuart M. Cardiff Al-Kharoosi, Fatma QMUL Al-Meaither, M. Royal Holloway Anderson, Dr. Ian Glasgow Annand, Marie L. Aberdeen Anthony, Dr. Martin H.G. LSE, London Antilla, M. UCL,London Appa, Dr. G. LSE, London Arhin, Mr. J. QMUL Arrowsmith, Prof. David K. QMUL, London Ashton, James Royal Holloway B Babbage, Dr. S. Vodafone Group RD Bailey, Prof. R.A. QMUL Bailey, Mr. R.F. QMUL, London Ball, Prof. Keith M. UCL, London Barany, Prof. Imre UCL, London Barnea, Dr. Yiftach Royal Holloway Bate, Julia Royal Holloway Bedford, Dr. David Keele Beker, Prof. Henry J. Royal Holloway Bell, Dr. Francis K. Stirling Bending, Dr. Thomas D. Middlesex Biggs, Prof. Norman L. LSE, London Blackburn, Prof. Simon Royal Holloway Blackwell, C. Royal Holloway Boase, Mansur Cambridge Bogacka, Dr. B. QMUL Bollobs, B Dr Cambridge Bone, Dr. Nicholas Vodafone Group RD Borg, Peter Open Borovik, Dr. Alexandre V. UMIST Bowler, Dr. Andrew Birkbeck, London Bray, Dr. John QMUL Brightwell, Prof. Graham R. LSE, London Bryant, Dr. Roger M. UMIST Burrows, Dr. Brian L. Staffordshire Butkovic, Dr. Peter Birmingham Byott, Dr. Nigel P. Exeter C Cameron, Prof. Peter J. QMUL, London Camina, Dr. Alan R. East Anglia Campbell, Dr. Colin M. St. Andrews Campbell, Duncan Dundee Campbell, Dr. Peter St. Andrews Cariolaro, David Reading Catarino, Paula Essex Chapman, Dr. Robin J. Exeter Chetwynd, Prof. Amanda G. Lancaster Choi, Su-Jeong Royal Holloway Christopoulos, Chris Royal Holloway Cid, Dr. Carlos Royal Holloway Ciechanowicz, Dr. Zbigniew Chez Royal Holloway Clarke, Dr. Francis W. Swansea Clarke, Geoffrey M. Kent Cohen, Dr. Stephen D. Glasgow Constable, Robin L. St. Andrews Cook, Dr. R.J. Swansea Cooper, Dr. Colin King's College, London Cooper, Prof. S. Barry Leeds Cosh, Ben Goldsmith's, London Crampton, Dr. Jason Royal Holloway Croft, Dr. Hallard T. Cambridge Crouch, Dr. Simon Hewlett-Packard Cryan, Dr. Mary Edinburgh Csornyei, Ms. Marianna UCL, London Curtis, Dr. Robert T. Birmingham D Dagger, Dr. Stuart W.S. Aberdeen Damerell, Dr. R. Mark Royal Holloway Davies, Prof. Roy O. Leicester Daykin, Dr. David E. Reading Deineko, Dr. Vladimir Warwick Dent, A. Royal Holloway Dolan, Dr. Alan K. Open Dugdale, Dr. J. Keith Reading Duncan, Dr. Andrew J. Newcastle Dye, Prof. Roger H. Newcastle Dyer, Prof. Martin Leeds Dzamonja, Dr. M. East Anglia E Eagle, Philip Royal Holloway Easton, Sarah J. Staffordshire Edwards, Dr. Keith J. Dundee Elder, Murray St. Andrews Ellison, Leigh Glasgow Elsholtz, Dr. Christian Royal Holloway Emmett, Lynn East Anglia Erlebach, Dr. T. Leicester Essam, Prof. John W. Royal Holloway Evans, Dr. David M. East Anglia Evans, Dr. Edward A. St.Mary's U. C. Everett, Prof. M. G. Greenwich F Falconer, Prof. Kenneth J. St. Andrews Fenner, Dr. Trevor I. Birkbeck, London Firby, Dr. Peter A. Exeter Fleischmann, Prof. Peter Kent Forbes, A.D. Open G Galbraith, Dr. Steven Royal Holloway Garcia, Paul Open Gardiner, Dr. Anthony D. Birmingham Georgiou, Nicholas LSE Gibson, Dr. J. Keith Birkbeck, London Gilder, John. UMIST Gillett, Dr. Raphael T. Leicester Gilmour, Dr. S. G. QMUL Glass, Prof. Celia A. City Godsave, Diane Vodafone Group RD Goldberg, Dr. Leslie A. Warwick Goldberg, Dr. Paul W Warwick Goodall, Dr. Andrew J. Oxford Gordon, Dr. Neil A. Hull Gowers, Prof. W. Tim Cambridge Grannell, Prof. Michael J. Open Green, Prof. B. Bristol Griggs, Prof. Terence S. (Terry) Open Grimm, Uwe Open Gutin, Prof. Gregory Royal Holloway H Haigh, Claude W. Swansea Haight, Dr. John A. UCL, London Haji Naim, Abdul Ghani Royal Holloway Hauser, Dr. Raphael Oxford Henderson, Matthew Reading Heneghan, Chris Royal Holloway Hetherington, Timothy J. Nottingham van den Heuvel, Jan LSE Hierons, Dr. Robert M. Brunel Higgins, Dr. Peter M. Essex Hill, Prof. Ray Salford Hilton, Prof. Anthony J.W. Reading Hines, P. Royal Holloway Hirschfeld, Prof. James W.P. Sussex Hobbs, J.D. Open Hoffman, Michael Leicester Hoffman de Visme, Ivan Charterhouse School Holmes, Dr. B. Birmingham Holroyd, Dr. Fred C. Open Hopkins, H. Royal Holloway Howard, Dr. John LSE Huczynska, Dr. Sophie St. Andrews Hughes, Prof. Daniel R. QMUL, London Hughes Jones, Dr. R. (Dick) Kent Hunter, Gordon J.A. St Mary's U. C. Hurley, Steve Cardiff I Irving, Dr. Robert W. Glasgow J Jackson, Prof. Bill Queen Mary, London Jackson, Dr. Penelope S Stirling James, Prof. Gordon D. ICL, London Jarrett, David F. Middlesex Jefferies, Dr. Nigel P. Vodafone Group RD Jennings, Dr. Sylvia London South Bank Jerrum, Dr. Mark Edinburgh Jha, Dr. Vikram Glasgow Caledonian Johnson, Dr. Jeffrey H. Open Johnson, Dr. Matthew Durham Johnson, Dr. J. Robert QMUL Johnston, Amy Royal Holloway Johnstone, Dr. W. Roy Reading Jones, Prof. Gareth A. Southampton K Keedwell, Dr. A. Donald Surrey Kemp, Prof. David St Andrews Kemp, Dr. Freda St Andrews Kenneth, R East Anglia King, Dr. Oliver H. Newcastle King, Prof. Ronald C. Southampton Kisil, V.V. Leeds Koller, Angela Brunel Kovalenko, I UNL Krasikov, Dr. Ilia Brunel Krokhin, Andrei Durham Ku, Mr. C.Y. QMUL Kudla, Caroline Royal Holloway Khn, Dr. D. Birmingham Kurtz, Cornelius East Anglia Kusuma, Josephine QMUL L Laczkovich, Prof M UCL Lamb, Dr. John D. Aberdeen Larman, Prof. David G. UCL, London Lawson, Dr. Mark V. Heriot-Watt Laycock, Dr. P.J. UMIST Leader, Dr. I.B. Cambridge Leese, Dr. Robert Oxford Liebeck, Prof. M. Imperial College, London Li'enart, E. Goldsmiths, London Linton, Dr. Stephen A. St. Andrews Lloyd, Dr. E. Keith Southampton Lockett, Ms. D.C. QMUL Lodwick, Ms. R.K. QMUL Loizou, Prof. George Birkbeck, London Lovegrove, Graham J. Open Luczak, Dr. Malwina LSE M Macdonald, Prof. I.G. QMUL, London Macpherson, Prof. H. Dugald Leeds Makroglou, Dr. Athena Portsmouth Manlove, Dr. David Glasgow Manning, Stephanie M. Vodafone Group RD Manns, Mr. Tom Portsmouth Marsh, Dr. Robert J. Leicester Martin, K. Royal Holloway Martin, Nigel Durham Martin, Dr. Russell Warwick Mavron, Prof. Vassili C. Aberystwyth Maynard, Dr. Philip East Anglia McAlpine, Kenneth M. Abertay McCabe, Dr. John H. St. Andrews McDiarmid, Prof. Colin J.H. Oxford McDonough, Dr. Thomas P. Aberystwyth McKee, Dr. James Royal Holloway McMullen, Prof. Peter UCL, London Michalopoulos, I. Royal Holloway de Mier, Dr. Anna Oxford Mitchell, Prof. Chris J. Royal Holloway Mitchell Dr. Jane M.O. Open Mitra, Prof. Gautam Brunel Morris, Prof. Alun O. Aberystwyth Muller, Haiko Leeds Mller, Dr. T. W. QMUL Murphy, Dr. Sean P. Royal Holloway Myers, J.S. Cambridge N Nelson, Roy Open Ng, S. Royal Holloway Noble, Dr. Steven Brunel Norman, Dr. Chris W. Royal Holloway Nuebling, Herwig East Anglia O O'Connor, Dr. John J. St. Andrews Olsen, Dr. Lars St. Andrews Osthus, Dr. D. Birmingham O'Toole, L. Royal Holloway P Page, Tom Royal Holloway Panov, Taras Manchester Parker, Dr. C.W. Birmingham Parks, David Open Paterson, Prof. Kenny Royal Holloway Paterson, Maura Royal Holloway Paterson, Prof. Mike Warwick Payne, Prof. Roger W. Rothamsted Pearce, Prof. S. Clifford Kent Pebody, Dr. L. Cambridge Perkins, Dr. Stephanie Glamorgan Petridis, George Cambridge Philpotts, Adam R. Nottingham Pikhurko, Oleg Cambridge Pinch, Dr. Richard G.E. GCHQ, Cheltenham Piper, Prof. Fred Royal Holloway Piper, Greg East Anglia Potts, Prof. Chris N. Southampton Powell, Dr. Susan LSE, London Pratt, F Staffordshire Preece, Prof. Donald A. Queen Mary, London; also Kent Preiss, Prof. D.P. UCL, London Prellberg, Dr. Thomas QMUL Prince, Dr. Alan R. Heriot-Watt Pu, Dr. Ida Goldsmiths, London Q Quinn, Dr. Kathleen A.S. Open R Rackham, Laurence Royal Holloway Raman, Prof. R. Leicester Ray, Prof. Nigel Manchester Rees, Prof. Sarah E. Newcastle Rees, David H Kent Reuter, A. Imperial Riordan, Dr. O. Cambridge Robertshaw, Dr. Andrew Glamorgan Robertson, Prof. Edmund F. St. Andrews Rogers, Prof. C. Ambrose UCL, London Roney-Dougal, Dr. Colva M. St. Andrews Rooney, Dr. Joe Open Rowley, Dr. Christopher A. Open Rowley, Dr. Peter J. UMIST Rowlinson, Prof. Peter Stirling Rudd, Jason QMUL Rudloff, C. East Anglia Ruskuc, Dr. Nik St Andrews Russell, P.A. Cambridge Rutherford, Dr. Carrie London South Bank Rymer, Dr. Neil W. Bangor S Salhi, A. Essex Sanders, A.J. Cambridge Sandling, Dr. Robert Manchester Sands, Dr. Arthur D. Dundee Saxl, Dr. Jan Cambridge Scott, Dr. Alex D. UCL, London Scott, Dr. J. Leicester Severini, Dr. Simone York Sezgin, S. UCL, London Shah, Illana Royal Holloway Shareef. F. QMUL, London Shakhlevich, Natasha Leeds Shaw, Prof. (Emer) Ron Hull Shawe-Taylor, Prof. John S. Southampton Shreeve, Richard I. Royal Grammar School Siemons, Dr. I. Johannes East Anglia Singerman, Prof. David Southampton Singmaster, Prof. David B. London South Bank Smith, Prof. Derek H. Glamorgan Sng, Colin Glasgow Soicher, Dr. Leonard H. QMUL, London Spencer, Claire Reading Stark, Dr. D. S. QMUL von Stengel, Dr. Bernhard LSE Stewart, Prof. Iain A Durham Stirling, Dr. David S.G. Reading Stratmann, Dr. Bernd St Andrews Stratton, Dr. Anthony E. Exeter Strusevich, Dr. V. A. Greenwich T Talbot, Dr. J.M. UCL Talbot, Dr. Richard F. Staffordshire Tarzi, Dr. S. QMUL Thiel, Dr. Stefan Vodafone Group RD Thomas, Dr. A. D. Swansea Thomas, Dr. Rick M. Leicester Thomason, Prof. Andrew G. Cambridge Thompson, Katie East Anglia Treacher, Helen East Anglia Truss, Prof. John K. Leeds V Valenca, Paula Royal Holloway Vmos, Prof. Peter Exeter Vernitski, Alexei Essex Vincent, Robert East Anglia Vowden, Dr. Barry J. Kent Vuskovic, Kristina Leeds W Wagner, Peter Cambridge Walker, Dr. Grant Manchester Walker, Keith Keele Walker, Prof. Michael Vodafone Group RD Royal Holloway Wallace, B Royal Holloway Walters, Dr. Mark Cambridge Wanless, Dr. Ian Oxford Waters, R.J. Nottingham Waters, Steven Glasgow Caledonian Watson, Adam QMUL Watts, Ivor Open Webb, Dr. Bridget S. Open Welham, Sue Rothamsted Welsh, Prof. Dominic J.A. Oxford Wensley, Dr. Christopher D. Bangor Whitaker, Roger Cardiff White, Dr. Lynda V. ICL, London Whitty, Prof. Robin W. London South Bank Wild, Prof. Peter R. Royal Holloway Williams, Prof. H. Paul LSE Wilson, Prof. Robert A. QMUL Wilson, Dr. Robin J. Open Wisewell, Dr. Laura UCL Woodall, Dr. Douglas R. Nottingham Woodcock, Dr. Christopher F. Kent Wright, Professor Chris Middlesex Wright, R. Vodafone Ltd Wu, Taoyang QMUL Z Zalesskii, Prof. A.E. East Anglia Zsak, Dr. Andras Cambridge Zverovich, Dr. Vadim West of England To the Top of the page To the BCB Home page Last change: 14March2005 Send comments to: bcb@maths.lse.ac.uk .
Home Pages of Combinatorial People and Groups
Personal home pages of combinatorialists.
Home pages of combinatorial people and groups Home pages of combinatorial people and groups Please join us here: Here are the personal home pages of combinatorialists, graph theorists, and others with an interest in discrete mathematics. If you would like to add your name to the list, email your full name and the URL of your page to the managing editor Ian Wanless . Our intent here is to facilitate the exchange of information. - The Editors People: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z Groups Individuals A Adelberg, Arnold Adin, Ron Albertson, Michael O. Al-Hawary, Talal Alizadeh, Feliz Allouche, Jean-Paul Amdeberhan, Tewodros Anderson, Ian Anstee, Richard Archdeacon, Dan Ardila, Federico Arsham, Hossein Ashlock, Dan Athanasiadis, Christos Atkinson, Mike B Bailey, Rosemary Bang-Jensen, Jrgen Beck, Matthias Bedford, David Beezer, Rob Bender, Ed Bending, Thomas Benschop, Nico F Bergeron, Franois Bergeron, Nantel Bertsekas, Dimitri P. Bessenrodt, Christine Bezrukov, Sergei Bhatti, Faqir M. Billey, Sara Billington, Elizabeth Blackburn, Simon R. Blok, Rieuwert Bluskov, Iliya Bona, Miklos Bonato, Anthony Bonnington, Paul Boros, Endre Bousquet-Melou, Mireille Brandstadt, Andreas Brandt, Stephan Bressoud, David M. Brualdi, Richard Brundage, Michael Burgiel, Heidi Burstein, Alex Butler, Lynne C Cahit, Ibrahim Calkin, Neil Callan, David Cameron, Peter Caro, Yair ? Caughman, John S. Cazaran, Jilyana Chappell, Glenn G. Chee, Yeow Meng Cherowitzo, William Chlebus, Bogdan Chouikha, Abd Raouf Chow, Timothy Chung, Fan Chvtal, Va154ek Clark, Francis Clarke, Bob Colbourn, Charlie Collins, Karen L. Comellas, Francesc Conder, Marston Conflitti, Alessandro Coolsaet, Kris Cooper, Joshua N. Cordovil, Raul Cowen, Lenore Cullinane, Steven H. D van Dam, Edwin Damiani, Ernesto Daven, Michael S. De Clerck, Frank Dejter, Italo J. Delest, Maylis De Loera, Jesus A. Denise, Alain DeVos, Matt Deza, Michel Diaconis, Persi Dinitz, Jeff Dinneen, Michael J. Dohmen, Klaus Duval, Art E Egge, Eric S. Egecioglu, mer Ehrenborg, Richard Elder, Murray Elizalde, Sergi Ellingham, Mark Ellis, Robert B. Ellis-Monaghan, Joanna A. Elliot, Jason W Eppstein, David Erickson, Jeff Erickson, Martin Eriksson, Kimmo Eu, Sen-Peng Exoo, Geoff F Farley, Jonathan D. Farr, Jeff Farrugia, Alastair Fauser, Bertfried Fedou, Jean-Marc Felsner, Stefan Fiedler, Bernd Fields, Joe Fill, James A. Fiol, Miguel Angel Flajolet, Philippe Foata, Dominique Fomin, Fedor Fomin, Sergey Forge, David Fraenkel, Aviezri Frasser, Carlos Frieze, Alan Froncek, Dalibor Fredi, Zoltan G Gallian, Joseph Grtner, Bernd Gauthier, Bruno Ge, Gennian Gernert, Dieter Gessel, Ira Gethner, Ellen Ghorpade, Sudhir R. Godbole, Anant P. Goddard, Wayne Goddyn, Luis A. Godsil, Chris Golumbic, Martin Gopalakrishnan, K. Gottlieb, Eric Gring, Frank Grable, David ? Grood, Cheryl Grossman, Jerrold W. Guignard-Spielberg, Monique Gustedt, Jens Gutin, Z. Gregory H Haas, Ruth Hajiabolhassan, Hossein Han, Guoniu Harris, Mitch Hstad, Johan Heise, Werner Helmberg, Christoph Hemaspaandra, Lane Hetyei, Gabor van den Heuvel, Jan Hindman, Neil Hirschfeld, James Hobbs, Arthur M. Hochstaettler, Winfried Hosten, Serkan Hough, Dave Hurlbert, Glenn I Isaak, Garth J Jackson, David Jacobson, Mike Jacobson, Sheldon H. Jaffe, Benjamin David Jerrum, Mark Jha, Pranava K. K Kano, Mikio Kartik, Krishnan S. Kelarev, Andrei Key, Jennifer Kharaghani, Hadi Kingan, Sandra Kitaev, Sergey Klavzar, Sandi Klerlein, Joe Knopfmacher, Arnold Knuth, Donald E. Kohnert, Axel Kolountzakis, Mike Kolpakov, Roman Kotsireas, Ilias S. Koukouvinos, Christos Kozlov, Dmitry Krattenthaler, Christian Kreher, Donald L. Krob, Daniel Kndgen, Andr Kuperberg, Greg L Larsen, Michael Lascoux, Alain Lassalle, Michel Laue, Reinhard Lauri, Josef Lawrencenko, Serge Lazebnik, Felix van Leeuwen, Marc Lenart, Cristian LeVan, Mike Li, Ji Lieby, Paulette Linusson, Svante Lisonek, Petr Loeb, Daniel Lovsz, Lszl Lygeros, Nik M Martin, Bill Martin, Jeremy Martin, Keith Martin, Quintin Martin Martin, Ryan R Martins, Ernesto Queiros Vieira Mazzocca, Francesco McGuire, Gary McKay, Brendan McKee, Terry A. McNamara, Peter Mendelsohn, Eric Merino, Criel Merris, Russell Mier, Anna de Mihailovs, Alec Mohan, R.N. Mohar, Bojan Moll, Victor H. Morvan, Michel Moscato, Pablo Moura, Lucia Mutlu, Uenal ? Myers, Amy Myrvold, Wendy N Naik, Ranjan N. Narayan, Darren Neumaier, Arnold Nguyen, ThanhVu H. Niederhausen, Heinrich Nishizeki, Takao Nowakowski, Richard O Odlyzko, Andrew Oellermann, Ortrud Offer, Alan Oliveira, Joseph S. Onn, Shmuel Ono, Ken Ostergard, Patrick P Pachter, Lior Pak, Igor Panario, Daniel Parberry, Ian Paule, Peter Pekec, Aleksandar Pike, David Pikhurko, Oleg Pisanski, Tomaz Pizaa, Miguel Angel Postnikov, Alex Prisner, Erich Proctor, Robert Prodinger, Helmut Propp, Jim Proskurowski, Andrzej Prosper, Vincent Pudlk, Pavel Q Quattrocchi, Gaetano Quistorff, Jrn R Radziszowski, Stanislaw Rall, Doug Ramamurthi, Radhika Ramanan, Gurumurthi, ? Rambau, Jrg Readdy, Margaret Reading, Nathan Recski, Andrs Reid, K. B. (K. Brooks Reid) Reif, John Reifegerste, Astrid Reiner, Vic Reingold, Edward Riese, Axel Robins, Gabriel Robins, Sinai Roby, Tom Rojas, Joseph Maurice Rosas, Mercedes H. Rote, Gnter Royle, Gordon Rubalcaba, Robert R. Ryjacek, Zdenek S Sagan, Bruce Sali, Attila Sarkozy, Gabor ? Savage, Carla Scheinerman, Edward Schmutz, Eric Sciriha, Irene Seberry, Jennifer Selkow, Stanley Sinha, Kishore Servatius, Brigitte Shahriari, Shahriar Shauger, Stephen E. Shaw, Ron Shearer, James B. Skiena, Steven Sloane, Neil J. A. Smith, Jonathan D.H. Soh, Sun Tae Soicher, Leonard H. Sottile, Frank Song, Hong-Yeop Specht, Eckard Spence, Edward Stacho, Ladislav Staddon, Jessica Stadler, Peter F. Stanica, Pantelimon Stanley, Richard Stark, Dudley Steel, Mike Steingrimsson, Einar Stinson, Doug Stockmeyer, Paul K. Stoichev, Stoicho D. Stout, Quentin F. Strausz, Ricardo Street, Anne Sudakov, Benny Sun, Zhi-Wei T Terwilliger, Paul Tanenbaum, Paul Tarannikov, Yuriy Thibon, Jean-Yves Thiele, James S. ? Thiele, Torsten Tinhofer, Gottfried Tittman, Peter Toft, Bjarne Tonchev, Vladimir Traldi, Lorenzo Trenkler, Marin Trotter, William T. U V Van Aken, Troy D. ? Vance, Todd D. ? Vazirani, Monica Velucchi, Mario Vijayakumar, Ambat Vinokur, Alex Voloshin, Vitaly Ivanovich Vrto, Imrich Vu, Van H. Vuillon, Laurent W Wachs, Michelle Wagner, David G. Wagner, Dorothea Walsh, Matt Wang, Yi Wanless, Ian Ward, Mark Daniel Wei, Ruizhong Weihe, Karsten Weintraub, Andrs Welker, Volkmar West, Douglas B. White, Neil L. Wild, Marcel Wilf, Herbert S. Williams, Lauren van Willigenburg, Stephanie Wilson, David Wilson, Mark Winkel, Rudolf Woeginger, Gerhard Woldar, Andrew Wormald, Nick Wu, Jian-Liang Wu, Shiquan X Xiang, Qing Xu, Jun-Ming Xu, Ke Y Yong, Alexander Z Zanella, Corrado Zeilberger, Doron Zmor, Gilles Zeng, Jiang Zhang, Cun-Quan Ziegler, Gnter Zuther, Joerg The links marked with a question mark appear to be broken. Please tell us if you know how to fix them. Groups The Department of Discrete and Statistical Sciences , Auburn, Alabama, USA. Centre for Discrete Mathematics and Theoretical Computer Science, University of Auckland, New Zealand. The Universitat Politecnica de Catalunya (Barcelona) Departament de Matematica Aplicada i Telematica Research Group on Graph Theory and Combinatorics Algorithmische und Diskrete Mathematik , TU Berlin Laboratoire Bordelais de Recherche en Informatique , Bordeaux, France. The Discrete Mathematics Group in Eindhoven Research group on "Incidence Geometry" , Ghent University, Belgium The Algorithms Project at INRIA (France) The British Combinatorial Committee The Centre for Discrete and Applicable Mathematics , London School of Economics, London, UK. The combinatorics group in Gothenburg, Sweden. The Institut Gaspard Monge Universit de Marne-la-Vallee, Marne La Vallee, France. Laboratoire d'Informatique Algorithmique : Fondements et Applications , University Paris 7 and CNRS, France Laboratoire de Combinatoire et d'Information Mathematique du Universite de Quebec a Montreal , Montreal, Canada. Centre for Discrete Mathematics and Computing , University of Queensland, Brisbane, Australia. The Department of Combinatorics and Optimization , University of Waterloo, Waterloo, Canada. Combinatorial Potlach , in the area of Puget Sound, North America. Discrete structures , Zurich, Switzerland. E-JC Home
Links to Combinatorial Conferences
Compiled by Douglas B. West.
Links to Combinatorial Conferences Links to Combinatorial Conferences Visits since May 20, 2003: FastCounter by bCentral Open problems pages (more than 30 problems pages now posted) Conference Series Archives Conferences in 2006 Sep 1-4, Belgrade, Serbia Montenegro, Topics in Mathematical Analysis and Graph Theory (satellite conference to ICM) Jul 10-15, DIMATIA Center, Charles University, Prague, 6th Czech-Slovak Intl Symposium on Combinatorics, Graph Theory, Algorithms and Applications (Dedicated to Jarik Nesetril on his 60th birthday) Jul 2-5, University of Iceland, Reykjavik, Iceland, 21st European Conference on Operational Research (EURO XXI 2006) Jun 25-28, University of Victoria, Victoria, British Columbia, Canada, (13th) SIAM Conference on Discrete Mathematics (DM06) Jun 22-24, University of Bergen, Bergen, Norway, 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006) Jun 19-30, University of Montreal, Montreal, Quebec, Canada, Combinatorial Optimization: Methods and Applications Jun 19-24, University of Illinois, Urbana, IL, Conference on Stochastic Networks Jun 19-23, San Diego, California, 18th Annual International Conference on Formal Power Series and Algebraic Combinatorics Jun 5-9, PfalzAkademie in Lambrecht (Cologne Twente Workshop), Germany, CTW 2006 - Theory and applications of graphs and combinatorial optimization in the wide sense May 24-27, Menorca Island, Spain WEA 2006 - Fifth International Workshop on Experimental Algorithms Apr 22-27, IPM, Tehran, Iran, Design Theory, Graph Theory, and Computational Methods Apr 20-22, Technical University of Denmark, Copenhagen, Denmark, 1st Nordic Optimization Symposium Apr 10-12, University of Aveiro, Aveiro, Portugal, Aveiro Workshop on Graph Spectra Mar 27-29, European Cultural Center, Delphi, Greece, 22nd European Workshop on Computational Geometry (EWCG'06) Mar 20-24, Valdivia, Chile, LATIN'2006, Latin American Theoretical INformatics Mar 20-24, St.Anne's College, University of Oxford, UK, Mathematics of Constraint Satisfaction: Algebra, Logic, and Graph Theory Mar 13-17, Punta del Este, Uruguay, 2006 IEEE Information Theory Workshop (ITW 2006) Jan 22-24, Radisson Hotel, Miami, FL, ACM-SIAM Symposium on Discrete Algorithms (SODA) Conferences in 2005 Dec 14-18, Tunghai University, Taichung, Taiwan, Special Sessions in Graph Coloring (7 invited one-hour speakers, 12 invited half-hour speakers) at the Joint Intl Conf of the AMS and the Taiwan Mathematical Society Dec 2-4, Auburn University, Auburn AL, Intl Conf on Statistics, Combinatorics, Mathematics, and Applications Nov 26, TU Darmstadt, Darmstadt, Germany, A Saturday on Discrete Mathematics in Darmstadt Nov 19, Seattle University, Seattle WA, Combinatorial Potlatch 2005 Nov 18-24, Nankai University, Tianjin, China (Nov 18-20), and Northwestern Polytechnical University, Xi'an, China (Nov 22-24), China-Japan Joint Conference on Discrete Geometry Nov 12, Saint Lawrence University, Canton, New York, Graph Theory Day 50 (no web site) Nov 10-12, Dobczyce (Krakow), Poland, 14th Workshop "3in1" Graphs 2005 (no web site) Oct 31, Budapest, Hungary, 50th Birthday Celebration of the Hungarian Method Oct 27-30, University of West Georgia, Carrolton, GA, Integers Conference 2005 (in celebration of the 70th birthday of Ron Graham) Oct 26-28, ENST, Paris, France, Fifth ALIO EURO Conference on Combinatorial Optimization Oct 21-23, University of Nebraska, Lincoln, NE, AMS 2005 Fall Central Section Meeting (Meeting 1011), Special sessions in Graph Theory and Special sessions in Combinatorial Matrix Theory Oct 21-22, Carnegie-Mellon University, Pittsburgh, PA, Frieze Fest 2005, A Workshop to Celebrate the 60th Birthday of Alan Frieze (on probabilistic combinatorics and randomized algorithms) Oct 7-9, Rochester Institute of Technology, Rochester, NY, 19th Midwest Conference on Combinatorics, Cryptography and Computing (MCCCC) Oct 7, Royal Flemish Academy of Belgium for Science and the Arts, Brussels, Belgium, Coding Theory and Cryptography (Academy Contact Forum) Oct 6-7, Eivissa, Ibiza, Spain, Third Workshop on Approximation and Online Algorithms (WAOA 2005) Oct 3-5, Porto, Portugal, 3rd International Workshop on Mining Graphs, Trees, and Sequences (MGTS 2005) Sep 23-24, Middle Tennessee State University, Murfreesboro, TN, MIGHTY XLI - 41st MIdwest GrapH TheorY Meeting Sep 18-23, Ettore Majorana Foundation and Centre for Scientific Culture, Erice, Sicily, Italy, Second International Workshop on Mathematics and Democracy: Voting Systems and Collective Choice Sep 18-23, University of Zielona G'ora, Zielona G'ora, Poland, 11th Workshop on Graph Theory CID (Colorings, Independence, and Domination) Sep 18-21, Ballarat, Victoria, Australia, 16th Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) Sep 13-23, Centre de Recerca Matematica, Barcelona, Recent Trends of Combinatorics in the Mathematical Context (EMS Marie Curie Advanced Training Course, B. Bollobas and J. Nesetril, lecturers) Sep 12-16, Hyeres, Var, France, ICGT'05 - 7th French International Colloquium on Graph Theory Sep 12-14, Limerick, Ireland, GD 2005 - 13th International Symposium on Graph Drawing Sep 10, Worcester Polytechnic Institute, Worcester, Massachusetts, Discrete Math Days in the Northeast Sep 7-9, University of Bremen, Germany, Discrete and Combinatorial Optimization (OR 2005) Sep 5-9, Universit degli Studi della Basilicata, Potenza, Italy, Summer School on Combinatorial Geometries (courses in Graph Theory and Cryptology Finite Geometry Sep 5-9, Technische Universitt, Berlin, Eurocomb05 - European Conference on Combinatorics, Graph Theory, and Applications Sep 4-9, Tatransk Strba, High Tatras, Slovakia, 14th Workshop on Cycles and Colourings Aug 22-24, University of California, Berkeley, CA, 8th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2005) and 9th. International Workshop on Randomization and Computation (RANDOM'2005) Aug 20-26, Anogia Conference Center, Anogia, Crete, Algebraic and Geometric Combinatorics (Euroconferences in Mathematics on Crete) Aug 18-20, McMaster University, Hamilton, Ontario, Canada, Franco-Canadian Workshop on Combinatorial Algorithms Aug 16-19, Kunming, Yunnan, China, COCOON'05 - 11th Annual International Computing and Combinatorics Conference Aug 15-17, University of Waterloo, Waterloo, Canada, WADS 2005 - 9th Workshop on Algorithms and Data Structures Aug 10-12, University of Windsor, Windsor, Ontario, Canada, 17th Canadian Conference on Computational Geometry Aug 1-5, Poznan, Poland, 12th Intl Conf. on Random Structures and Algorithms Jul 24-29, Instituto Nacional de Matematica Pura e Aplicada, Rio de Janeiro 25th Coloquio Brasileiro de Matematica , with Special Sessions in Combinatorics Jul 17-23, Spelman College, Atlanta, GA, DIMACS Satellite Reconnect Conference on Mathematics of Medical Imaging Jul 10-15, University of Durham and Open University, Durham, England, 20th British Combinatorial Conference Jul 8-10, University of Durham, Durham, England, ACiD 2005 - First Algorithms and Complexity in Durham Workshop Jul 5-9, Huazhong (Central China) Normal University, Wuhan, China, Wuhan International Conference on Graph Structure Theory Jul 5-7, University of Greenwich, London, England, 3rd International Symposium on Applications of Graph Theory, AGT05 Jul 4-8, IT University of Copenhagen, Copenhagen, Denmark, Summer School on Shortest Paths Jun 23-25, Metz, France, WG 2005 - 31st International Workshop on Graph-Theoretic Concepts in Computer Science Jun 20-25, Keio University, Yokohama, Japan, Japan Workshop on Graph Theory and Combinatorics 2005 (in honor of Hikoe Enomoto's 60th birthday) Jun 20-25, Taormina, Sicily, FPSAC'05 - 17th Annual International Conference on Formal Power Series and Algebraic Combinatorics Jun 12-18, Montclair State Univ, Upper Montclair, NJ, DIMACS Satellite Reconnect Conference on Mathematics of Elections and Decisions Jun 9-12, MSRI, Berkeley, CA, Short course on Geometric Combinatorics Jun 8-10, Technische Universitt, Berlin, IPCO XI - Integer Programming and Combinatorial Optimization Jun 6-8, Area della Ricerca di Pisa, Italy, 21st Annual Symposium on Computational Geometry Jun 1-4, Netzeband, Germany, Spring School in Enumerative Combinatorics (for students) May 23-27, Universit Libre de Bruxelles, One-week course on Polytope Constructions, lecturers Gnter M. Ziegler and Michael Joswig (contact pleroy@ulb.ac.be if interested) May 21-23, Carnegie-Mellon University, Pittsburgh, PA, WaterMellon Workshop on Extremal Graph Theory (U. Waterloo Carnegie-Mellon U.) May 18-20, University of Cologne, Germany, CTW 2005: Cologne Twente Workshop on Graphs and Combinatorial Optimization May 17-20, University of Colorado at Denver, CO, Graph Theory with Altitude (in honor of Joan P. Hutchinson's 60th Birthday) May 16-19, Caesarea Rothschild Institute, University of Haifa, 5th Haifa Workshop on Interdisciplinary Applications of Graph theory, Combinatorics, and Algorithms Honoring Michael O. Rabin May 12-14, University of Alabama, Huntsville, AL, Eighteenth Cumberland Conference Apr 30-May 1, University of Wisconsin, Madison, WI, Brualdi-fest: Linear Algebra, Graph Theory and Combinatorics Apr 27-29, Rio de Janeiro, Brazil, GRACO 2005, 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics Apr 18-22, MSRI, Berkeley, CA, Models of Real-World Random Networks Apr 17-19, Northwestern University, Evanston, IL, DIMACS Workshop on Large-Scale Games Apr 16-17, University of Minnesota, Minneapolis, 1st Graduate Student Combinatorics Conference Apr 16, Saginaw Valley State University, University Center, MI, MIGHTY XL - 40th MIdwest GrapH TheorY Meeting Apr 3-10, Thurnau, Germany, ALCOMA05: Algebraic Combinatorics and Applications Apr 2-3, University of Delaware, Newark, DE, AMS Special Session on Probabilistic Paradigms in Combinatorics Mar 7-11, Florida Atlantic University, Boca Raton, FL, 36th Southeastern International Conference on Combinatorics, Graph Theory, and Computing Mar 7-11, University of Florida, Gainesville, FL, Third International Conference on Permutation Patterns Mar 7-11, MSRI, Berkeley, CA, Phase Transitions in Computation and Reconstruction Mar 7-9, Humboldt University, Berlin, Germany, Learn- Workshop on Random Graphs and Probabilistic Methods Feb 25-26, University of Memphis, Memphis, TN, Paul Erdos Conference Jan 31-Feb 4, MSRI, Berkeley, CA, Markov chains in algorithms and statistical physics Jan 31-Feb 4, DIMACS Center, Piscataway, NJ, DIMACS Workshops on Bounded Rationality and Information Markets Jan 23-25, Vancouver, British Columbia, Canada ACM-SIAM Symposium on Discrete Algorithms (SODA05) Jan 5, Atlanta, GA, Special Session in Graph and Design Theory , Joint Mathematics Meetings, 1003rd AMS Meeting Archive This archive contains the pointers as they were when active. Pages for old conferences are likely to have expired, but the listing of dates and locations, etc., may be of use for historical purposes. Conferences in 2004 Conferences in 2003 Conferences in 2002 Conferences in 2001 Conferences in 2000-1997 Conference Series Archives Archive sites for conference series provide a valuable record. Links for several appear below. Archives include such things as lists of talks, participants, and abstracts; even sometimes photos. If anyone knows of archive sites for other conference series in discrete mathematics, please let me know (send information to west @ math . uiuc . edu). The community would also appreciate volunteers to set up such sites. I can post an address here so past attendees can contact the volunteer to offer material (printed material saved by past attendees can be scanned and posted). Good candidates for such sites would be EuroComb, AWOCA (Australasian Worshop on Combinatorial Algorithms), CTW (Graphs and Combinatorial Optimization), Ontario Combinatorics Workshops, the Cumberland Conference on Combinatorics and Computing, the Clemson Mini-Conference, the MCCCC, the Southeastern International Conferences, Graph Theory Day in New York, etc. I'm sure there are also many other series that would benefit from having such sites. ACCOTA (Combinatorial and Computational Aspects of Optimization, Topology and Algebra) BADMath (Bay Area Discrete Mathematics Days) BCC (British Combinatorial Conferences) CC (Workshop on Cycles Colourings - High Tatras) COCOON (Combinatorics and Computing) (maintained by Michael Ley) Combinatorial Potlatch (Puget Sound area, maintained by Rob Beezer) CoNE - Combinatorists of New England (series ended after 45 meetings - archive by Ruth Haas) CombinaTexas (maintained by Catherine Yan) DIMACS Reconnect Conferences DIMACS Special Years , all DIMACS Workshops Discrete Mathematics in New England (maintained by Karen Collins) FPSAC (Formal Power Series and Algebraic Combinatorics) GD (Graph Drawing) (maintained by Roberto Tamassia) LATIN (Latin American Theoretical INformatics MIGHTY (MIdwest GrapH TheorY) (maintained by Jay Bagga) MOPTA (McMaster Optimization Conference) MSRI Workshops (Mathematical Sciences Research Institute NSF-CBMS Regional Research Conferences (Conference Board of the Mathematical Sciences) SIAM Discrete Mathematics , SIAM Discrete Algorithms WADS (Workshop on Algorithms and Data Structures)
Forthcoming Conferences in Discrete and Applicable Mathematics
Maintained by the Centre for Discrete and Applicable Mathematics, London School of Economics.
Forthcoming conferences and other meetings CentreforDiscrete andApplicableMathematics Forthcoming conferences and other meetings related to research in CDAM 2005: November | December 2006: January | February | March | April | May | June | July | - | September | - | - | - Some other lists of meetings and conferences on the web: London Mathematics Seminars - http: www.city.ac.uk sems mathematics londseminars.html ; AMS Mathematics Calendar - http: www.ams.org mathcal ; LMS Meetings - http: www.lms.ac.uk meetings ; British Combinatorial Committee - http: www.maths.qmw.ac.uk ~pjc bcc conferences.html ; Doug West's Links to Combinatorial Conferences - http: www.math.uiuc.edu ~west meetlist.html ; The Probability Web - http: www.mathcs.carleton.edu probweb ; Institute of Statistics and Decision Sciences - http: www.isds.duke.edu research conferences . November 2005 26November A Saturday on Discrete Mathematics in Darmstadt Darmstadt, Germany Further information: http: www.mathematik.tu-darmstadt.de ~joswig DMSD.html . 27-30November ICDM '05, The 5th IEEE International Conference on Data Mining New Orleans, Louisiana Further information: http: www.cacs.louisiana.edu ~icdm05 . December 2005 2-4December SCMA 2005 FIM XII, International Conference on Statistics, Combinatorics, Mathematics and Applications 12th Annual Conference of the Forum for Interdisciplinary Mathematics Auburn, Alabama Further information: http: www.stat.auburn.edu scma2005 . 5December 5th Columbia Optimization Day New York City, New York Further information: http: www.corc.ieor.columbia.edu meetings c5 c5.html . 5-9December 30th ACCMCC, Australasian Conference in Combinatorial Mathematics and Combinatorial Computing Brisbane, Australia Further information: http: www.maths.uq.edu.au cdmc 30accmcc.html . 19-21December 10th IMA International Conference on Cryptography and Coding Cirencester, U.K. Further information: http: www.cs.bris.ac.uk Research CryptographySecurity Cirencester index.html . January 2006 16-19January CATS 2006, Computing: The Australasian Theory Symposium Hobart, Australia Further information: http: www-staff.it.uts.edu.au ~cbj cats06 . 22-24January SODA06, ACM-SIAM Symposium on Discrete Algorithms Miami, Florida Further information: http: www.siam.org meetings da06 . 25January Open University Winter Combinatorics Meeting Open University, Milton Keynes, U.K. Further information: http: puremaths.open.ac.uk combin . February 2006 8-10February MATHMOD, 5th IMACS Symposium on Mathematical Modelling Vienna, Austria Further information: http: www.mathmod.at . March 2006 13March FAWN 2006, 1st International Workshop On Foundations And Algorithms For Wireless Networking Pisa, Italy Further information: http: ares.insa-lyon.fr fawn2006 . 20-24March LATIN'06, Latin American Theoretical INformatics Valdivia, Chile Further information: http: www.latin06.org . 20-24March International Workshop on Mathematics of Constraint Satisfaction: Algebra, Logic and Graph Theory Oxford, U.K. Further information: http: www.cs.rhul.ac.uk home green mathscsp . 27-29March EWCG 2006, 22nd European Workshop on Computational Geometry Delphi, Greece Further information: http: cgi.di.uoa.gr ~ewcg06 . April 2006 10-12April Aveiro Workshop on Graph Spectra Aveiro, Portugal Further information: http: ceoc.mat.ua.pt awgs2006 . 10-12April EuroGP2006, 9th European Conference on Genetic Programmingand EvoCOP2006, 6th European Conference on Evolutionary Computation in Combinatorial Optimization Budapest, Hungary Further information: http: evonet.lri.fr eurogp2006 . 20-22April 1st Nordic Optimization Symposium Copenhagen, Denmark Further information: http: www.nordicmps.org . May 2006 8-19May CANT2006, Combinatorics, Automata and Number Theory Lige, Belgium Further information: http: www.cant2006.ulg.ac.be . 24-27May WEA 2006, Fifth International Workshop on Experimental Algorithms Menorca Island, Spain Further information: http: www.lsi.upc.edu ~wea . 29-31May ISNN 2006, Third International Symposium on Neural Networks Chengdu, Sichuan, China Further information: http: www2.acae.cuhk.edu.hk ~isnn2006 . June 2006 5-9June CTW 2006, Cologne-Twente Workshop on Graphs and Combinatorial Optimization PfalzAkademie, Lambrecht, Germany Further information: http: www.uni-duisburg.de FB11 disma CTW2006 . 8-12June CSR 2006, International Computer Science Symposium in Russia St. Petersburg, Russia Further information: http: logic.pdmi.ras.ru ~csr2006 . 20-22June AAIM'06, 2nd International Conference on Algorithmic Aspects in Information and Management Hong Kong, China Further information: http: www.cs.cityu.edu.hk ~aaim06 . 22-24June WG 2006, 32nd International Workshop on Graph-Theoretic Concepts in Computer Science Bergen, Norway Further information: http: www.ii.uib.no wg06 . 25-28June SIAM Conference on Discrete Mathematics Victoria, British Columbia, Canada Further information: http: www.siam.org meetings dm06 . 25-1July Combinatorics 2006 Ischia (Naples), Italy Further information: http: www.dma.unina.it ~combinatorics2006 . 26-29June WOWMOM 2006, 7th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks Niagara-Falls Buffalo, New York Further information: http: ieee-wowmom.cse.buffalo.edu . July 2006 2-5July EURO XXI, 21st European Conference on Operational Research Reykjavik, Iceland Further information: http: www.euro2006.org . 3-5July SIROCCO 2006, 13th Colloquium on Structural Information and Communication Complexity Chester, U.K. Further information: http: sirocco06.csc.liv.ac.uk . 6-8July SWAT 2006, 10th Scandinavian Workshop on Algorithm Theory Riga, Latvia Further information: http: www.lumii.lv swat . September 2006 1-4September International Mathematical Conference, Topics in Mathematical Analysis and Graph Theory Belgrade, Serbia Further information: http: magt.etf.bg.ac.yu . 4-7September ANTS 2004, Fifth International Workshop on Ant Colony Optimization and Swarm Intelligence Brussels, Belgium Further information: http: iridia.ulb.ac.be ants2006 . 13-15September IWPEC 2006, International Workshop on Parameterized and Exact Computation Zrich, Switzerland Further information: http: www.iwpec.org . CDAM Homepage . Copyright London School of Economics Political Science 2005 Last modified: Tue Nov 15 11:45:52 GMT 2005 Send comments to webmaster
Conferences on Combinatorics
Listed at the Combinatorics Net.
Conferences on Combinatorics Conferences on Combinatorics 2007 19th Formal Power Series and Algebraic Combinatorics (FPSAC'07) Tianjin, China 2006 International Congress of Mathematicians August 22-30, 2006 Madrid, Spain http: www.icm2006.org Satellite conferences include: Associative and non-associative algebraic structures and applications, 18-20 August 2006, Oviedo, Asturias, Spain. Geometry and topology of low dimensional manifolds, 31 August - 2 September 2006, Burgo de Osma, Spain. Trends and topics in the future of combinatorial and computational geometry, 31 August - 5 September 2006, Alcal de Henares, Spain. Workshop on Geormetric and Topological Combinatorics, 31 August - 5 September 2006, Alcal de Henares, Spain. Noncommutative Algebra, 31 August - 6 September 2006, Granada, Spain. 18th International Conference on Formal Power Series Algebraic Combinatorics June 19 - 23, 2006 San Diego, USA more 2005 49th Annual Meeting of the Australian Mathematical Society September 26-30, 2005 Perth, WA, Australia European Conference on Combinatorics, Graph Theory and Applications September 5 - 9, 2005 Technische University, Berlin The Eleventh International Computing and Combinatorics Conference August 16-19, 2005 Yunnan, China The 54th Sminaire Lotharingien de Combinatoire April 3 - 6, 2005 Lucelle, France more 2004 The Third International Congress of Chinese Mathematicians December 17-22, 2004 Hong Kong, China http: www.ims.cuhk.edu.hk conference iccm2004 New Zealand Institute of Mathematics its Applications (NZIMA) December 13-18, 2004 New Zealand http: www.nzima.auckland.ac.nz more Links to past conferences 2003 2002 2001-1998 Related Websites Isaac Newton Institute for Mathematical Sciences Mathematics Calendar maintained by AMS. Conference information maintained by the British Combinatorial Committee BCC Conference information maintained by SIAM Activity Group on Discrete Mathematics Conference information maintained by World Combinatorics Exchange Conference information maintained by Electronic Colloquium on Computational Complexity Conference information maintained by Douglas B. West SIAM Conferences International Conference on Formal Power Series and Algebraic Combinatorics
Conferences in Combinatorics and Related Areas
Maintained by the British Combinatorial Committee.
Conferences in Combinatorics and Related Areas Combinatorics and related conferences Conferences supported by BCC | Main conference list | Institutes | Other sources of information From January 2005, there is an archive of past conferences available. More details about past British Combinatorial Conferences can be found on the BCC archives . Please email me (p.j.cameron at qmul.ac.uk) with details of conferences in combinatorics and related areas for inclusion here. Conferences organised or sponsored by the BCC Oxford-Warwick-London meeting on Combinatorics and Statistical Mechanics, London, England, UK, 11 November 2005: Web page Open University Winter Combinatorics Meeting, Milton Keynes, England, UK, 25 January 2006: Web page Oxford-Warwick-London meeting on Combinatorics and Statistical Mechanics, Oxford, England, UK, 7 February 2006: Web page Oxford-Warwick-London meeting on Combinatorics and Statistical Mechanics, Warwick, England, UK, 3 May 2006: Web page Two-day combinatorics meeting, Reading, England, UK, 17-18 May 2006 21st British Combinatorial Conference, Reading, England, UK, 8-13 July 2007: Web page 22nd British Combinatorial Conference, St Andrews, Scotland, UK, 5-10 July 2009 Main conference list November 2005 Oxford-Warwick-London meeting on Combinatorics and Statistical Mechanics, London, England, UK, 11 November 2005: Web page European Conference on Complex Systems, Paris, France, 14-18 November 2005: Web page 6th Symposium on Algebra and Computation (AC2005), Tokyo, Japan, 15-18 November 2005: Web page China-Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory, Nankai University (Tianjin) and Northwestern Polytechnical University (Xi'an), China, 18-24 November 2005: Web page Combinatorial Potlatch, Seattle, WA, USA, 19 November 2005: Web page A Saturday on Discrete Mathematics in Darmstadt, Darmstadt, Germany, 26 November 2005: Web page ICDM'05 (International Conference on Data Mining), Houston, TX, USA, 27-30 November 2005: Web page December 2005 Statistics, Combinatorics, Mathematics and Applications (12th annual conference of the Forum for Interdisciplinary Mathematics), Auburn, AL, USA, 2-4 December 2005: Web page 5th Columbia Optimization Day, New York, NY, USA, 5 December 2005: Web page 30th Australasian Conference in Combinatorial Mathematics and Combinatorial Computing, Brisbane, Australia, 5-9 December 2005: Web page "Summer school" in model theory, Leeds, England, UK, 12-17 December 2005: Web page 10th IMA International Conference on Cryptography and Coding, Cirencester, England, UK, 19-21 December 2005: Web page 2nd workshop on Coverings, Selections and Games in Topology, Lecce, Italy, 19-22 December 2005: Web page January - July 2006 Logic and Algorithms (Newton Institute programme), Cambridge, England, UK, 16 January - 7 July 2006: Web page . Provisional workshop programme (see individual entries for contact details): Finite and algorithmic model theory, Durham, England, UK, 9-13 January 2006; Logic and databases, Cambridge, England, UK, 27 February - 3 March 2006; Mathematics of constraint satisfaction: Logic, algebra and graph theory, Oxford, England, UK, 20-24 March 2006; New directions in proof complexity, Cambridge, England, UK, 10-13 April 2006; Constraints and verification, Cambridge, England, UK, 8-12 May 2006; Games and verification, Cambridge, England, UK, 3-7 July 2006. January 2006 Logic and Algorithms: Finite and algorithmic model theory, Durham, England, UK, 9-13 January 2006: Web page CATS 2006 (Computing: The Australasian Theory Symposium) Hobart, Tas., Australia, 16-19 January 2006: Web page SODA06 (ACM-SIAM Symposium on Discrete Algorithms), Miami, FL, USA, 22-24 January 2006: Web page Open University Winter Combinatorics Meeting, Milton Keynes, England, UK, 25 January 2006: Web page February 2006 Oxford-Warwick-London meeting on Combinatorics and Statistical Mechanics, Oxford, England, UK, 7 February 2006: Web page MATHMOD (5th IMACS Symposium on Mathematical Modelling), Vienna, Austria, 8-10 February 2006: Web page Noncommutative algebra (in honour of Lance W. Small's 65th birthday), email ezelmano(AT)math.ucsd.edu or atsimpson(AT)ucsd.edu Logic and Algorithms: Logic and databases, Cambridge, England, UK, 27 February - 3 March 2006: Web page March 2006 Lattice-Ordered Groups and f-Rings, Gainesville, FL, USA, 9-11 March 2006: Web page FAWN 2006 (1st International Workshop on Foundations and Algorithms for Wireless Computing), Pisa, Italy, 13 March 2006: Web page One-day combinatorics conference, Oxford, England, UK, 15 March 2006 G3 (Geometric Group Theory on the Gulf Coast), Mobile, AL, USA, 16-19 March 2006: Web page Logic and Algorithms: Mathematics of constraint satisfaction: Logic, algebra and graph theory, Oxford, England, UK, 20-24 March 2006: Web page LATIN'06, (Latin American Theoretical INformatics), Valdivia, Chile, 20-24 March 2006: Web page EWCG 2006 (22nd European Workshop on Computational Geometry), Delphi, Greece, 27-29 March 2006: Web page Boise Extravaganza in Set Theory, Boise, ID, USA, 31 March - 2 April 2006: Web page April 2006 Spring lecture series and conference: Geometric Group Theory, Fayetteville, AR, USA, 5-8 April 2005: Web page Aveiro Workshop on Graph Spectra, Aveiro, Portugal, 10-12 April 2006: Web page EuroGP2006 and EvoCOP2006 (Genetic Programming; Evolutionary Computation in Combinatorial Optimization), Budapest, Hungary, 10-12 April 2006: Web page Logic and Algorithms: New directions in proof complexity, Cambridge, England, UK, 10-13 April 2006: Web page 1st Nordic Optimization Symposium, Copenhagen, Denmark, 20-22 April 2006: Web page May 2006 Oxford-Warwick-London meeting on Combinatorics and Statistical Mechanics, Warwick, England, UK, 3 May 2006: Web page Logic and Algorithms: Constraints and verification, Cambridge, England, UK, 8-12 May 2006: email vardi(AT)cs.rice.edu Combinatorics, Automata and Number Theory, Lige, Belgium, 8-19 May 2006: Web page Two-day combinatorics meeting, Reading, England, UK, 17-18 May 2006 WEA 2006 (Fifth International Workshop on Experimental Algorithms), Menorca, Spain, 24-27 May 2006: Web page ISNN 2006 (International Symposium on Neural Networks), Chengdu, Sichuan, China, 29-31 May 2006: Web page June 2006 CTW 2006 (Cologne-Twente Workshop on Graphs and Combinatorial Optimization), Lambrecht, Germany, 5-9 June 2006: Web page CSR 2006 (International Computer Science Symposium), St Petersburg, Russia, 8-12 June 2006: Web page Groups and related structures (honoring Koichiro Harada on his 65th birthday), Columbus, OH, USA, 12-14 June 2006: email solomon(AT)math.ohio-state.edu Fourth International Conference on Pattern-Avoiding Permutations, Reykjavik, Iceland, 12-16 June 2006: Web page FPSAC'06 (Formal Power Series and Algebraic Combinatorics), San Diego, CA, USA, 19-23 June 2006: Web page AAIM'06 (Algorithmic Aspects in Information and Management), Hong Kong, China, 20-22 June 2006: Web page WG 2006, (International Workshop on Graph-Theoretic Concepts in Computer Science), Bergen, Norway, 22-24 June 2006: Web page International Conference on Topology and its Applications, Aegion, Greece, 23-26 June 2006: Web page SIAM Conference on Discrete Mathematics, Vancouver, BC, Canada, 25-28 June 2006: Web page Combinatorics 2006, Ischia, Italy, 25 June - 1 July 2006: Web page July-September 2006 International Congress of Mathematicians, Madrid, Spain, 22-30 August 2006: Web page . Satellite conferences include (see individual entries for contact details): 6th Meeting on Game Theory and Practice, Zaragoza, Spain, 10-12 July 2005 Associative and non-associative algebraic structures and applications, Oviedo, Asturias, Spain, 18-20 August 2006 CIMPA School on Optimization and Control, Oviedo, Spain, 28 August - 8 September 2005 Geometry and topology of low dimensional manifolds, Burgo de Osma, Spain, 31 August - 2 September 2006 Trends and topics in the future of combinatorial and computational geometry, Alcal de Henares, Spain, 31 August - 5 September 2006 Workshop on Geormetric and Topological Combinatorics, Alcal de Henares, Spain, 31 August - 5 September 2006 Noncommutative Algebra, Granada, Spain, 31 August - 6 September 2006 Topics in mathematical analysis and graph theory (in occasion of the golden jubilee of Publ. Fac. Electr. Engrg. - Series Math.), Belgrade, Serbia, 1-4 September 2006 Groups in geometry and topology, Mlaga, Spain, 4-8 September 2006 EACA2006 (X Encuentro de lgebra Computacional y Aplicaciones), Sevilla, Spain, 7-9 September 2006 Conference on routing and location, Puerto de la Cruz, Tenerife, Spain, 14-17 September 2006 July 2006 21st European Conference on Operational Research, Reykjavik, Iceland, 2-5 July 2006: Web page SIROCCO 2006 (Structural Information and Communication Complexity, Chester, England, UK, 3-6 July 2005: Web page Logic and Algorithms: Games and verification, Cambridge, England, UK, 3-7 July 2006: email cps(AT)inf.ed.ac.uk 21st Summer Conference on Topology and its Applications, Statesboro, GA, USA, 6-9 July 2006: Web page ICM satellite conference: 6th Meeting on Game Theory and Practice, Zaragoza, Spain, 10-12 July 2005: Web page Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications (for the 60th birthday of Jarik Nesetril), Prague, Czech Republic, 10-15 July 2006: Web page 6th international conference on industrial data mining, Leipzig, Germany, 14-15 July 2006: Web page August 2006 Topology and Computer Science (in honour of Peter Collins and Mike Reed), Oxford, England, UK, 7-10 August 2006 Prague Topological Symposium, Prague, Czech Republic, 13-19 August 2006: Web page ICM satellite conference: Associative and non-associative algebraic structures and applications, Oviedo, Asturias, Spain, 18-20 August 2006: Web page ICM satellite conference: CIMPA School on Optimization and Control, Oviedo, Spain, 28 August - 8 September 2005: Web page ICM satellite conference: Geometry and topology of low-dimensional manifolds, Burgo de Osma, Spain, 31 August - 2 September 2006: Web page ICM satellite conference: Trends and topics in the future of combinatorial and computational geometry, Alcal de Henares, Spain, 31 August - 5 September 2006: Web page ICM satellite conference: Workshop on Geometric and Topological Combinatorics, Alcal de Henares, Spain, 31 August - 5 September 2006: Web page ICM satellite conference: Noncommutative Algebra, Granada, Spain, 31 August - 6 September 2006: email pjara(AT)ugr.es September 2006 ICM satellite conference: Topics in mathematical analysis and graph theory (in occasion of the golden jubilee of Publ. Fac. Electr. Engrg. - Series Math.), Belgrade, Serbia, 1-4 September 2006: Web page ANTS 2004 (Ant Colony Optimization and Swarm Intelligence), Brussels, Belgium, 4-7 September 2006: Web page ICM satellite conference: Groups in geometry and topology, Mlaga, Spain, 4-8 September 2006: Web page ICM satellite conference: EACA2006 (X Encuentro de lgebra Computacional y Aplicaciones), Sevilla, Spain, 7-9 September 2006: email castro(AT)us.es Finite Geometries (Second Irsee Conference), Kloster Irsee, Germany, 10-16 September 2006: Web page IWPEC 2006 (International Workshop on Parameterized and Exact Computation), Zrich, Switzerland, 13-15 September 2006: Web page ICM satellite conference: Conference on routing and location, Puerto de la Cruz, Tenerife, Spain, 14-17 September 2006: Web page January - July 2007 Analysis on Graphs and its Applications (Newton Institute Programme), 8 January - 29 June 2007: Web page . Workshops (provisional): Analysis on graphs and other discrete structures, 8-12 January 2007 Quantum graphs, their spectra and applications, 2-5 April 2007 Graph models of mesoscopic systems, wave-guides and nano-structures, 10-13 April 2007 Analysis on graphs and fractals (at Gregynog), 27 May - 1 June 2007 Round-up meeting, 25-29 June 2007 January 2007 Analysis on Graphs and its Applications: Analysis on graphs and other discrete structures, Cambridge, England, UK, 8-12 January 2006 (provisional) April 2007 Analysis on Graphs and its Applications: Quantum graphs, their spectra and applications, Cambridge, England, UK, 2-5 April 2007 (provisional) Analysis on Graphs and its Applications: Graph models of mesoscopic systems, wave-guides and nano-structures, Cambridge, England, UK, 10-13 April 2007 (provisional) May 2007 Analysis on Graphs and its Applications: Analysis on graphs and fractals, Gregynog, Wales, UK, 27 May - 1 June 2007 (provisional) June 2007 Analysis on Graphs and its Applications: Round-up meeting, Cambridge, England, UK, 25-29 June 2007 (provisional) July - August 2007 Bayesian Nonparametric Regression: Theory, Methods and Applications (Newton Institute programme), Cambridge, England, UK, 30 July - 24 August 2007: Web page July 2007 21st British Combinatorial Conference, Reading, England, UK, 8-13 July 2007: Web page July 2009 22nd British Combinatorial Conference, St Andrews, Scotland, UK, 5-10 July 2009 Institutes Alfrd Rnyi Institute of Mathematics , Budapest, Hungary Centra de Recerca Matemtica , Bellaterra, Catalonia, Spain Centre de Recherches Mathmatiques , Montral, PQ, Canada DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), Piscataway, NJ, USA EIDMA (Euler Institute for Discrete Mathematics and Applications), Eindhoven Twente Delft, The Netherlands Institut de Mathmatiques de Luminy , Luminy, France International Centre for the Mathematical Sciences , Edinburgh, Scotland, UK Isaac Newton Institute , Cambridge, England, UK Mathematical Sciences Research Institute , Berkeley, CA, USA Mathematisches Forschungsinstitut Oberwolfach , Oberwolfach, Germany Max Planck Institut Informatik , Saarbrucken, Germany New Zealand Institute of Mathematics its Applications , Auckland, New Zealand Other sources of information CDAM conference list (discrete and applicable mathematics) Group Pub Forum (group theory and related areas; now somewhat out of date) The Combinatorics Net Graph Theory White Pages (now very out of date) American Mathematical Society's Mathematics Calendar SIAM Activity Group in Discrete Mathematics Douglas West's Links to Combinatorial Conferences Conferences of Interest for Complexity People by ECCC (now extremely out of date) CODES, Prochaines confrences (with deadlines!) Peter Cameron p.j.cameron at qmul.ac.uk 17 November 2005 BCC homepage
Conferences and Meetings in Discrete Mathematics
Part of the Electronic Journal of Combinatorics.
Forthcoming Conferences in Combinatorics Conferences in Discrete Mathematics We used to maintain a list of forthcoming conferences in combinatorics, discrete mathematics and related areas. Then we realised we were pointlessly duplicating the efforts of other people. So instead we recommend that if you are after such information you consult one of these pages: Peter Cameron's conference page Doug West's conference page E-JC Home
EUROCOMB 2005
European Conference on Combinatorics, Graph Theory, and Applications. Technische Universitt, Berlin, Germany; 5--9 September 2005.
EUROCOMB 2005 Last modified: Fri Mar 4 14:33:07 CET 2005
FPSAC '05
17th Annual Conference on Formal Power Series and Algebraic Combinatorics. Taormina, Sicily, Italy; 20--25 June 2005.
FPSAC '05 FRAME NOT SUPPORTED
BCC2005
20th British Combinatorial Conference. Durham, UK; 10--15 July 2005.
BCC2005 Conference 20th British Combinatorial Conference Sunday 10 July - Friday 15 July, 2005 The 2005 BCC was organised jointly by The University of Durham and The Open University, and was held at Durham. The web pages on this site are those of the 2005 BCC as at July 2005. The 2007 BCC will be held at the University of Reading from 8th to 13th July 2007. Local Organiser: Anthony Hilton (Reading) Address: Department of Mathematics, University of Reading, Whiteknights, PO Box 220, Berkshire, RG6 6AX, UK. Telephone: +44 (0)118 9318989 Fax: +44 (0)118 9313423 email: A.J.W.Hilton@reading.ac.uk web: http: www.personal.rdg.ac.uk ~smx05mj bcc2007 Send mail to M.J.Grannell@open.ac.uk with questions or comments about this web site. Last modified: 27 07 05
GRACO 2005
2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Rio de Janeiro, Brazil; 27--29 April 2005.
GRACO 2005 GRACO2005 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics April 27-29, 2005 Angra dos Reis (Rio de Janeiro), Brazil Home Invited Speakers Papers Proceedings Important Dates Location Program Committees Sponsors Participants Pictures Full Papers GRACO2005 is an international forum for researchers in all areas of combinatorics, graphs and algorithms. Topics include algorithms and data structures analysis of algorithms approximation algorithms combinatorial optimization complexity computational biology cryptography enumerative combinatorics graph theory polyhedral combinatorics randomized algorithms The proceedings of GRACO2005 were published are published in volume19 of the Electronic Notes in Discrete Mathematics . The first symposium in the series took place in Fortaleza, Brazil, in 2001. About 80 papers, from 20 different countries, were submitted. All the extended abstracts appeared as volume7 of the Electronic Notes in Discrete Mathematics . Selected full papers were published in the special volume 141 of Discrete Applied Mathematics . GRACO2005 poster, in PDF format URL of this site: http: www.ime.usp.br graco2005 Last modified: Thu Sep 1 14:50:15 BRT 2005
Thirteenth Midwestern Conference on Combinatorics, Cryptography and Computing,
Illinois State University, Normal, Illinois, USA; 14--16 October 1999. Abstracts (DVI,PS).
MCCCC SECOND ANNOUNCEMENT FINAL ANNOUNCEMENT (Updated 10.6.99) Thirteenth Midwestern Conference on COMBINATORICS, CRYPTOGRAPHY, AND COMPUTING Thursday, Oct. 14 - Saturday, Oct. 16, 1999 at Illinois State University, Normal, Illinois You are warmly invited to participate in the Thirteenth Midwestern Conference on Combinatorics, Cryptography, and Computing to be held October 14-16, 1999 at Illinois State University, Normal, Illinois. The aim is to bring together researchers in all areas of pure and applied combinatorics, including graph theory, design theory, enumeration, cryptography and combinatorial computing. The conference will feature six invited one-hour lectures. There will also be sessions for 20-minute contributed papers. INVITED SPEAKERS Joseph Gallian , University of Minnesota-Duluth, Graph Labelings Jeannette Janssen, Dalhousie University, List-Colourings of Edges and the Asymptotics of Vizing's Conjecture Rolf Rees, Memorial University of Newfoundland, A Survey of Results on Mandatory Representation Designs Christopher Rodger , Auburn University, Graph Amalgamations and their Uses Douglas Stinson , University of Waterloo, Combinatorial Methods for Traceability John van Rees , University of Manitoba, Enumeration of Inequivalent Binary Self-Dual Codes of Length 32 and 34 To retrieve the abstracts in dvi mode mc4abstracts.dvi To retrieve the abstracts in ps mode mc4abstracts.ps SCHEDULE SECOND CALL FOR PAPERS: Authors who wish to contribute 20-minute talks are invited to submit an abstract of at most 300 words. We prefer abstracts to be written in LaTeX, but any reasonable electronic form is preferable to a "hard copy." To ensure consideration, abstracts should be e-mailed by October 1, 1999. They will be reviewed by the organizing committee and all acceptances will be promptly confirmed by e-mail. All invited speakers will be asked to contribute versions of their talks for inclusion in one volume of the Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC), and other speakers are invited to submit their papers for inclusion in the same volume. Acceptance will depend upon usual refereeing standards, though it should be noted that survey papers will also be welcome if they closely follow survey talks presented at the conference. For consideration, papers should be submitted to Saad El-Zanati (address below) by December 31, to avoid the Y2K bug. The submitted papers will be edited for JCMCC by Saad El-Zanati and Roger Eggleton. DEADLINES: Early Registration: Sept. 17, 1999 Most Hotel Rooms: Sept. 22, 1999 Submission of Abstracts: Oct. 1, 1999 Note: Abstracts received after Oct. 1 will continue to be considered while there are time slots available in the program. REGISTRATION: Conference registration fees are $85 if paid prior to September 17, 1999. Late registration fees are $100. Registration fees are reduced to $30 for unemployed or retired mathematicians and graduate students. There will be no additional charge for the Conference banquet, social functions, or abstract volume. You may register by mail or e-mail. E-mail registration is encouraged, you will need to send your registration fee by regular mail. REGISTRATION BY MAIL: Complete the enclosed registration form and mail with check payable to: ISU Math Department (in U.S. dollars only). Please return form to: MCCCC Department of Mathematics Campus Box 4520 Illinois State University Normal, IL 61790-4520 ASSISTANCE: The following telephone numbers are provided in case you require assistance. Mathematics Dept.: (309) 438-8781 Saad El-Zanati: (309) 438-5765 (office) Emergency: (309) 888-9809 (home) CONFERENCE LOCATION: All conference events will be held at the ISU campus in Normal. A map of ISU will be enclosed with your registration receipt. LOCAL INFORMATION: Visit the websites of ISU and Bloomington-Normal . TRAVEL: Bloomington-Normal is easily accessible to visitors. It is located at the intersection of three interstate highways (I-55, I-74 and I-39), is served by the Central Illinois Regional Airport , and is linked with Chicago and St. Louis by Amtrak . HOTEL ACCOMMODATIONS: We have a limited number of rooms reserved at the hotels listed below. Please indicate that you are with the Midwestern Combinatorics Conference. With the exception of Best Western, all other hotels request that reservations be made prior to Sept. 22. Hotel (in Normal) Phone Single Double Best Western , University Inn 6 Trader Cir. Indoor Pool, Continental Breakfast Complimentary Van Service to Central Illinois Regional Airport Complimentary Van Service to and from Conference (Rooms will be held until all have been reserved) (309) 454-4070 $39 $49 Holiday Inn Express Suites Hotel 1715 Parkway Plaza Dr Indoor Pool Fitness Center ... Complimentary Van Service to Central Illinois Regional Airport (309) 862-1600 $79 $85 Jumer Hotels Chateau Jumer's Drive @ N. Veterans Pkwy Indoor Pool Fitness Center ... (309) 662-2020 $85 $95 Motel 6 1600 N. Main St (309) 452-0422 $35 $41 Super 8 Motel 2 Traders Cir. Continental Breakfast (309) 454-5858 $42 $53 Hotel (in Bloomington) Phone Single Double Comfort Inn 500 Brock Dr, Bloomington Continental Breakfast (309) 828-6000 $57 $57 *** There are other hotels in the Bloomington-Normal area. FOR FURTHER INFORMATION PLEASE CONTACT: Dr. Saad El-Zanati 4520 Mathematics Department Illinois State University Normal, IL 61790-4520 ORGANIZING COMMITTEE: Saad El-Zanati, Chair Roger Eggleton Charles Vanden Eynden Michael Plantholt Wal Wallis Shailesh Tipnis Douglas West REGISTRATION FORM Thirteenth Midwestern Conference on COMBINATORICS, CRYPTOGRAPHY, AND COMPUTING October 14 - October 16, 1999 Illinois State University, Normal, Illinois NAME ______________________________________________________________ ORGANIZATION _____________________________________________________ ADDRESS ___________________________________________________________ CITY ________________________ STATE __________ ZIP CODE _________ DAY PHONE __________________ EVENING PHONE __________________ EMAIL___________________________________ NAME OF HOTEL WHERE STAYING _____________________________________ ARE YOU PRESENTING A PAPER? YES _____ NO _____ TOTAL ENCLOSED $ ____________________
Symmetric Functions and Macdonald Polynomials
A central topic of study in Algebraic Combinatorics. Isaac Newton Institute for Mathematical Sciences, Cambridge, England; January-June 2001.
INI Programme SFM Institute Home Page Programmes Web-Seminars Programme Home Seminars Workshops Participants Long Stay Short Stay Additional Links Contacts Mailing List Isaac Newton Institute for Mathematical Sciences Symmetric Functions and Macdonald Polynomials 8 Jan - 6 Jul 2001 Organisers: Professor P Hanlon (Michigan), Professor IG Macdonald (QMW), Professor AO Morris (Aberystwyth) Programme theme The importance of symmetric functions and the representation theory of Hecke algebras and the symmetric groups derives in part from their applicability in a wide range of scientific and mathematical disciplines. Within the theory of symmetric functions, this programme will focus on a particular topic, the Macdonald polynomials, which have especially wide-ranging mathematical interconnections. The goal of the program will be to unify the diverse approaches to the study of these polynomials. n the 1980's, I.G.Macdonald formulated a series of conjectures which predicted the constant terms of expressions that involve an important new class of symmetric functions called the Macdonald polynomials. Since their introduction, these conjectures and polynomials have been a central topic of study in Algebraic Combinatorics. Of particular note has been the variety of approaches used in efforts to solve the conjectures or to find an algebraic or geometric interpretation for the Macdonald polynomials themselves. Different approaches involve double affine Hecke algebras, homology of nilpotent Lie algebras, generalized traces of Lie algebra representations and diagonal actions of the symmetric group on polynomial rings in two sets of variables. In this programme we will attempt to unify these different approaches to the Macdonald Conjectures in a way that allows for a significant interpretation of the Macdonald polynomials and settles some of the outstanding conjectures that have resulted from this work. Links with other areas such as algebraic geometery, Lie algebras, non-commutative algebra, mathematical physics and mathematical statistics will be emphasised. Workshops will be arranged in order to foster existing and potential applications in these and other subjects.
Recent Advances in Statistical Designs and Reltaed Combinatorics
University of Athens, Greec; 7-9 July 2003.
RECENT ADVANCES IN STATISTICAL DESIGNS AND RELATED COMBINATORICS
Random Structures
Two linked workshops within the Computation, Combinatorics and Probability programme at the Isaac Newton Institute, Cambridge, UK. Part I: Combinatorial and Computational Aspects of Statistical Physics; 26--30 August 2002. Part II: Random Graphs and Structures; 2--6 September 2002.
RANDOM STRUCTURES Isaac Newton Institute for Mathematical Sciences, Cambridge, UK RANDOM STRUCTURES comprising the linked workshops COMBINATORIAL COMPUTATIONAL ASPECTS OF STATISTICAL PHYSICS (26 - 30 AUGUST 2002) RANDOM GRAPHS STRUCTURES (2 - 6 SEPTEMBER 2002) in association with the Newton Institute programme entitled Computation, Combinatorics and Probability (29 July to 20 December 2002) Programme Abstracts Participants Organisers: Bla Bollobs, (Memphis), Martin Dyer (Leeds), Mark Jerrum (Edinburgh), Alan Sokal (New York) and Peter Winkler (Bell Labs) Theme of Workshop: The heading "random structures" is intended to cover both the finite (random graphs, partial orders, etc.) and infinite (configurations of some physical model on an infinite lattice). Our aim is to bring together combinatorialists, probabilists, physicists and theoretical computer scientists to engage in an interdisciplinary meeting that will study random structures from various directions. Structure: There will be two linked workshops: Combinatorial and computational aspects of statistical physics and Random graphs and structures. The overarching theme that unites these two is that of phase transition, broadly interpreted. A rough distinction between the two workshops might be that the first deals with phase transitions in infinite systems (e.g., the Ising model on the 2-dimensional square lattice), and the second with "phase transitions" in finite structure (e.g., random graphs or random partial orders). However, this distinction is certainly not intended to be a hard-and-fast. Computational questions - such as the extent to which phase transitions may coincide with the boundary between tractable and intractable - will certainly be addressed. Tentative Participants: B Bollobs, GR Brightwell, ME Dyer, L Goldberg, G Grimmett, S Janson, MR Jerrum, J Kahn, M Karonski, M Karpinski, WS Kendall, C McDiarmid, B Pittel, D Randall, P Tetali, A Thomason, E Vigoda, P Winkler. Location and Cost The conference will take place at the Newton Institute and accommodation for participants will be provided in single study bedrooms with shared bathroom at Wolfson Court . The workshop package, costing 715, includes accommodation, breakfast and dinner from dinner on Monday 26 August until breakfast on Saturday 7 September 2002, and lunch and refreshments during the days that lectures take place. Numbers will be restricted to about 80 participants. This event has been awarded MathFIT support provided by the London Mathematical Society and EPSRC. Application Form: Please complete and return the application form to Tracey Andrew . Closing Date for the receipt of applications is 30 April 2002 Further information Please e-mail your enquiries to Tracey Andrew Travel and Local Information How to reach the Newton Institute | Local Information | Computation, Combinatorics and Probability programme | Newton Institute Home Page |
Lattice Path Combinatorics and Discrete Distributions
Dedicated to the memory of Istvan Vincze. Athens, Greece; 5--7 June 2002.
5TH LATTICE PATH COMBINATORICS AND DISCRETE DISTRIBUTIONS
FPSAC'97
9th International Conference on Formal Power Series and Algebraic Combinatorics. Dedicated to the Memory of Marcel-Paul Schtzenberger. Institut fr Mathematik, University of Vienna, Austria; 14--18 July 1997.
FPSAC'97 9-th International Conference on Formal Power Series and Algebraic Combinatorics FPSAC'97 July 14 - 18, 1997 Institut fr Mathematik University of Vienna Vienna , Austria This Conference is Dedicated to the Memory of Marcel-Paul Schtzenberger ********************************************************************** Link to the other conferences of this series Topics Conference program Official languages Invited Speakers Call for papers and posters : deadline expired Open problem session : cancelled Software demonstrations : deadline expired Program committee Participant support Location Hotels Practical Information - How to get to the Institut fr Mathematik, the hotel, the Studentenheim Further information Organizing committee Sponsors Registration Touristic information about Vienna and Austria A map of Vienna (the Institut fr Mathematik is located in the triangle formed by Boltzmanngasse, Whringerstrae, and the third street, which happens to be Strudlhofgasse; the hotel is located north of that, outside the map) and a map of Austria Cultural Program in Vienna for July and August Topics Algebraic and bijective combinatorics and their relations with other parts of mathematics, computer science and physics. Conference program Invited lectures , contributed presentations , poster session , problem session and software demonstrations . Official languages The official languages of the conference are English and French. Invited Speakers Martin Aigner (Germany) Jonathan Borwein (Canada) Andreas Dress (Germany) Tony Guttmann (Australia) Mark Haiman (USA) Masaki Kashiwara (Japan) Michel Mendes France (France) Rodica Simion (USA) Anatoliy Vershik (Russia) Call for papers and posters Authors are invited to submit extended abstracts of at most twelve pages before November 15, 1996. Preferred way of submission is by sending one postscript file by email to fpsac97@risc.uni-linz.ac.at . If an author is not able to send a postscript version of her his extended abstract, four copies of the extended abstract should be mailed to Peter Paule, Chairman of the Program committee of FPSAC '97, RISC , Johannes Kepler Universitt , A-4040 Linz, AUSTRIA. The submitted papers should begin with a summary written in the two official languages of the conference (translations will be provided if necessary). Authors should indicate the mode of presentation which they consider appropriate for their paper : lecture or poster session. The notifications of acceptance or rejection are scheduled for the beginning of March 1997. The authors whose papers will have been accepted for a lecture or a poster presentation will have the possibility to submit a complete version of their work to a special issue of the journal "Discrete Mathematics," devoted to the conference FPSAC '97. The deadline for submission to the special issue is September 1, 1997. Open problem session Contributions to the problem session are invited in advance of the conference dates. If possible, problems should be submitted by e-mail to the address fpsac97@risc.uni-linz.ac.at . Software demonstrations Demonstrations of software relevant to the topics of the conference are encouraged. People interested in giving a software demonstration should submit a paper as described above, including the hardware requirements, before January 15, 1997, by email to fpsac97@risc.uni-linz.ac.at . Program committee Nantel Bergeron (Canada) Francesco Brenti (Italy) David Bressoud (USA) Mireille Bousquet-Mlou (France) Omar Foda (Australia) Sergey Fomin (USA, Russia) Ian Goulden (Canada) Tomas Kepka (Tchechia) Sergey Kerov (Russia) Christian Krattenthaler (Austria) Bernard Leclerc (France) Marc Noy (Spain) Peter Paule (Austria; Chairman) Marko Petkovsek (Slovenia) Victor Reiner (USA) Jeff Remmel (USA) Christophe Reutenauer (Canada) Bruno Salvy (France) Volker Strehl (Germany; Chairman) Itaru Terada (Japan) Dominic Welsh (England) Participant support Limited funds are available for partial support of participants, in particular for students and scientists from Eastern countries. Requests should contain a letter of recommendation and include the estimated transportation and living expenses as well as the amount of support available from other sources. All requests should be sent in duplicate by January 15, 1997 to the following address : Christian Krattenthaler, Chairman of the Organizing committee of FPSAC '97, Institut fr Mathematik , Universitt Wien , Strudlhofgasse 4, A-1090 Vienna, AUSTRIA. Location The conference will take place at the Institut fr Mathematik of the Universitt Wien . The Institut fr Mathematik is located 10 minutes walking distance from the city center. The first talk is scheduled on July 14, 1997 at 9:00 a.m. Hotels Rooms have been blocked for the participants of the conference at Hotel**** Kaiser Franz Joseph (at the special rates of 660 ATS single room, 880 ATS double; this includes breakfast; the hotel is 15 minutes by tram from the Institut fr Mathematik) and at the Studentenheim Strudlhofgasse (at the rates of 210 ATS single, 330 ATS double; without breakfast, there are shared bath and shower facilities, and common kitchens where breakfast or other small meals could be prepared; the Studentenheim is directly opposite the Institut fr Mathematik). If you want to book a room at a hotel on your own, then you may contact the Wiener Tourismusverband, Obere Augartenstrae 40, A-1020 Vienna, Austria, Tel. +43 1 21114 or http: info.wien.at e hotel index.htm . However, do not contact the Hotel Kaiser Franz Joseph directly if you want to get the above rates. The Austrian currency is Austrian Schilling (ATS). Depending on the current exchange rate, 1 US dollar is roughly 11 Austrian Schilling. As a general rule, all prices in Austria include tax, so do, in particular, the above hotel rates. N.B. It is important for the Hotel Kaiser Franz Joseph that you book before April 30, 1997. We cannot guarantee reservations that are made after that date; be aware that summer is the main tourist season in Vienna. If you are going to stay at the Studentenheim, then, please, bring your own towels. Further information For any question, just write to fpsac97@radon.mat.univie.ac.at . Organizing committee Peter Kirschenhofer (Leoben) Christian Krattenthaler (Vienna; Chairman) Daniel Krob (Paris) Helmut Prodinger (Vienna) Sponsors The conference FPSAC'97 is supported by the European Commission for Science, Research and Development (TMR Euroconference Programme), Bank Austria, Bundesministerium fr Wissenschaft, Stadt Wien, Wiener Fremdenverkehrsverband. Registration Until April 30, 1997, the regular registration fee is 2000 ATS. A reduced fee of 1000 ATS is offered for students (with verification, such as a letter from the advisor). These fees will be 3000 ATS and 1500 ATS, respectively, if the registration is made after April 30, 1997. The registration fee covers all instruction, program materials, refreshment breaks, a copy of the conference proceedings, a concert on Monday, a reception in the city hall on Tuesday, and a "Heurigenabend" (conference dinner) on Thursday. To register, please mail or FAX a completed copy of the registration form to C. Krattenthaler, FPSAC'97, Institut fr Mathematik, Universitt Wien, Strudlhofgasse 4, A-1090 Vienna, AUSTRIA; FAX: +43 1 31367-4040 or +43 1 310 63 47. Please, also indicate whether you will attend the "Heurigenabend" on Thursday, July 17, 1997.
Diskrete Mathematik 2002
Technischen Universitt Dresden; 3--4 October 2002 (English German).
DMV - Fachgruppe Diskrete Mathematik - Symposium Diskrete Mathematik 2002 Diskrete Mathematik 2002 Symposium an der Technischen Universitt Dresden 3. 4. Oktober 2002 Tagungsheft (.ps) Tagungsheft (.pdf) Fotos vom Symposium Pictures taken during the symposium
Designs, Codes, Cryptography and Graph Theory (DCCG) 2001
Second Lethbridge Workshop on Designs, Codes, Cryptography and Graph Theory: a combination of instructional lectures and research sessions. Lethbridge, Alberta; July 9-14, 2001.
DCCG Workshop, Lethbridge, July 2001 Your browser is not frames capable. See no-frame version of this page.
Computation, Combinatorics and Probability
Isaac Newton Institute for Mathematical Sciences, Cambridge, UK; August -- December 2002.
INI Programme CMP Institute Home Page Programmes Web-Seminars Programme Home Seminars Workshops Participants Long Stay Short Stay Additional Links Contacts Mailing List Background Isaac Newton Institute for Mathematical Sciences Computation, Combinatorics and Probability 29 Jul - 20 Dec 2002 Organisers: Professor Martin Dyer (Leeds), Professor Mark Jerrum (Edinburgh), Dr Peter Winkler (Bell Labs) Programme theme As Computer Science has matured as a discipline, its relationships with mathematics have become both more wide ranging and more profound. The programme will explore two particularly fruitful interfaces between computer science and mathematics, namely those with combinatorics and probability theory. Although no interdisciplinary work within the broad area delineated by the title will be excluded, the following themes will receive special emphasis. Randomised algorithms. The design and analysis of algorithms that make random choices; also deterministic algorithms when run on random instances.The theoretical basis here includes the study of parameters connected with random walks on graphs and the relationships between them. "Phase transitions" in statistical physics and computer science. The rigorous treatment not only of infinite random systems,but also of (infinite sequences of) finite systems that exhibit phenomena akin to phase transitions. Particular attention willbe paid to the link between phase transitions and computational (in)tractability. Random graphs and structures. The analysis of finite random structures,of which the Erdos-Renyi random graph model is the primal example.Algorithmic aspects will receive special attention. Probabilistic analysis of distributed systems. The study of the behaviour of distributed systems in the absence of global control. Specific topics include contention resolution protocols and Nash equilibria of agents in networks (the Internet).The theoretical basis here includes Lyapunov functions and game theory.
Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities
Aims to bring together researchers in theoretical computer science and mathematics. Topics include trees, stochastic processes, large deviations, branching processes, random walks, discrete probability, enumerative and analytical combinatorics, analysis of algorithms, performance evaluation, and combinatorial optimization. Versailles, France, September 18-20, 2000.
mathinfo2000 Colloque Informatique et Mathmatiques : Algorithmes, Arbres, Combinatoire, Probabilits ( Appel communications ) Colloquium on Mathematics and Computer Science : Algorithms, Trees, Combinatorics and Probabilities ( Call For Papers ) September 18-20, 2000 Universit de Versailles Saint Quentin-en-Yvelines 45, avenue des Etats-Unis 78035 Versailles cedex - France Scientific Committee Organisation Committee Electronic mail : mathinfo@prism.uvsq.fr Scope of the Colloquium Call For Papers Appel a communications (postscript) Invited papers Sponsors List of accepted papers Scientific program Version francaise Important dates : March 15, 2000 : Deadline for submission of papers (10 pages). May 24, 2000 : Decision of the scientific committee June 15, 2000 : Final version of accepted papers Official languages : English and French Registration Accomodation Conference site LAMA
Colloquium on Combinatorics
Otto-von-Guericke-Universitt, Magdeburg, Germany; 15--16 November 2002.
Colloquium on Combinatorics Ihr Browser kann diese Seite leider nicht anzeigen!
Coding, Cryptography and Combinatorics
Huang Shan City, China; 23--28 June 2003.
Welcome to CCC Workshop Announcement CCC2003 will be cancelled. Proceedings will be published as planed. The detailed instruction on preparation of the full papers will be given soon. Information on Proceedings Download the abstracts of submissions here . Check the instruction on preparation of the full papers here . Organized by University of Science and Technology of China Email: ccc2003@ustc.edu.cn
NZIMA Conference in Combinatorics and its Applications
Joint with the 29th Australasian Conference in Combinatorial Mathematics and Combinatorial Computing (29th ACCMCC). Lake Taupo, New Zealand; 13--18 December 2004.
Joint Conference The 2004 NZIMA Conference in Combinatorics and its Applications http: www.nzima.auckland.ac.nz and The 29th Australasian Conference in Combinatorial Mathematics and Combinatorial Computing (29th ACCMCC) http: www.maths.uq.edu.au ~db CMSA cmsa.html Conference Webpage: http: www.nzima.auckland.ac.nz combinatorics conference.html Venue: Copthorne-Manuels Conference Centre http: www.copthornemanuels.co.nz Lake Taupo http: www.laketauponz.com New Zealand Date: 13th-18th December, 2004 (6 Days) PROGRAMME ( Adobe Acrobat Pdf File ) BOOK OF ABSTRACTS AND PROGRAMME ( Adobe Acrobat Pdf File ) THE WEEK AT A GLANCE LIST OF PARTICIPANTS NEWS ARTICLE FROM LOCAL NEWSPAPER (Taupo Times, Friday Dec 17, 2004, Page 3) PHOTOS FROM CONFERENCE (Click on photo for full resolution version) Invited Plenary Speakers Dan Archdeacon - University of Vermont Rosemary Bailey - Queen Mary, University of London Richard Brualdi - University of Wisconsin Darryn Bryant - University of Queensland Peter Cameron - Queen Mary, University of London Maria Chudnovsky - Princeton University and CMI Bruno Courcelle - Bordeaux University Jim Geelen - University of Waterloo Bert Gerards - CWI and Eindhoven University of Technology Catherine Greenhill - University of New South Wales Bojan Mohar - University of Ljubljana Bruce Richter - University of Waterloo Neil Robertson - Ohio State University Paul Seymour - Princeton University Alan Sokal - New York University Robin Thomas - Georgia Institute of Technology Carsten Thomassen - Technical University of Denmark Tom Tucker - Colgate University Mark Watkins - University of Syracuse Dominic Welsh - Oxford University Sponsored by: New Zealand Institute of Mathematics and its Applications (NZIMA) Australian Mathematical Society (AustMS) Centre of Discrete Mathematics and Theoretical Computer Science (CDMTCS) Topics: Graph Theory Matroid Theory Design Theory Coding Theory Enumerative Combinatorics Combinatorial Optimization Combinatorial Computing and Theoretical Computer Science Combinatorial Matrix Theory Location: Lake Taupo, New Zealand http: www.laketauponz.com Located at the heart of New Zealand's North Island (3.5hrs drive south of Auckland), the Lake Taupo district is an area of considerable beauty and diversity, offering a wide range of activities, adventures and scenic opportunities. Often described as the jewel in the crown of the North Island, Lake Taupo is set amidst clean, green countryside, spectacular mountain scenery, beautiful native bush and some of the largest pine forests in the Southern Hemisphere. The Conference Venue is Copthornes-Manuels, a Hotel and Conference Centre located on the foreshore of Lake Taupo in the township of Taupo (Population 20,310). Taupo (a popular holiday spot) is an easy day-trip from renowned tourist destinations: Rotorua (Geothermal hotspot) http: www.rotoruanz.com , Waitomo Caves http: www.new-zealand.com WaitomoCaves , Tongariro National Park (a World Heritage Site) http: www.doc.govt.nz Explore 001~National-Parks Tongariro-National-Park index.asp , and the art deco city Napier http: www.napier.govt.nz . Organising Committee: NZIMA Paul Bonnington ACCMCC Brendan McKay ACCMCC Ian Wanless NZIMA Geoff Whittle The joint conference was organised by the Combinatorial Mathematics Society of Australasia http: www.maths.uq.edu.au ~db CMSA cmsa.html , and the New Zealand Institute of Mathematics and its Applications http: www.nzima.auckland.ac.nz .
Combinatorial Aspects of Hyperplane Arrangements
MSRI, Berkeley, CA, USA; 1--5 November 2004.
SITE MAP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . SEARCH . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . SHORTCUT: Choose a Destination... Calendar Programs Workshops Summer Grad Workshops Seminars Events Announcements Residence Program Math Circles BAMO Application Materials Visa Information Propose a Program Propose a Workshop Policy on Diversity MSRI Alumni Archimedes Society Why Give to MSRI Ways to Give to MSRI Donate to MSRI Planned Gifts FAQ Mission Governance Staff Member Directory Contact Us Directions For Visitors Pictures Library Computing SGP Video Lectures MSRI in the Media Emissary Newsletter Outlook Newsletter Subscribe to Newsletters Books, Preprints, etc. Federal Support Corporate Affiliates Sponsoring Publishers Foundation Support Academic Sponsors HOME ACTIVITIES AT MSRI PROPOSALS APPLICATIONS ALUMNI DEVELOPMENT ABOUT MSRI COMMUNICATIONS SUPPORT SPONSORS Calendar Programs Workshops Summer Graduate Workshops Seminars Events Announcements Past Projects Math Circles BAMO Combinatorial Aspects of Hyperplane Arrangements November 01, 2004 to November 05, 2004 Organized By: Eva Maria Feichtner, Philip Hanlon, Peter Orlik, Alexander Varchenko Parent Programs: Hyperplane Arrangements and Application This workshop will be part of MSRI's Special Semester in Hyperplane Arrangements and Applications. The combinatorial data associated with an arrangement of hyperplanes has proven to be core data for many algebraic and topological issues in arrangement theory. Conversely, the occurrence of certain combinatorial structures in arrangement theory has inspired research on generalizations in purely combinatorial settings. The following topics will be central to the presentations and discussions during this workshop: combinatorial models for arrangements oriented matroids combinatorics of arrangement compactifications phylogenetic trees topology of partially ordered sets combinatorial representation theory random walks on arrangements Confirmed speakers: Christos Athanasiadis Helene Barcelo Ken Brown Graham Denham Persi Diaconis Eva-Maria Feichtner Phil Hanlon Dmitry Kozlov Nikolai Mnev Alexander Postnikov Jessica Sidman Richard Stanley Hiroaki Terao Sasha Varchenko Anatoly Vershik Volkmar Welker Monday, November 1 8:30 - 9:15 Registration 9:15 - 9:30 Welcome and Introduction 9:30 - 10:30 Ken Brown Hyperplane face semigroups and their algebras. 10:30 - 11:00 Morning Tea (Sixth floor) 11:00 - 12:00 Persi Diaconis Are there q-deformations of hyperplanes that are useful for shuffling? 12:00 - 2:00 Lunch Break 3:00 - 4:00 Jessica Sidman, MSRI Evans Lecture: Equations defining subspace arrangements. 4:15 5:00 Richard Stanley, MSRI Evans Lecture The characteristic polynomial of a hyperplane arrangement. Tuesday, November 2 8:10 - 9:10 Bernd Sturmfels: Introduction to Matroid Polytopes 9:30 - 10:30 Eva-Maria Feichtner Nested set complexes in geometric combinatorics. 10:30 -11:00 Morning Tea (Sixth floor) 11:00 - 12:00 Dmitry Kozlov Combinatorics of DeConcini-Procesi resolutions of the real permutation action. 12:00 - 2:00 Lunch Break 2:00 - 3:00 Nicolai Mnev Combinatorial stratifications of the Grassmanians: algebraic geometry and combinatorial fiber bundles. 3:00 - 3:30 Afternoon Tea (Sixth floor) 3:30 - 4:00 Federico Ardila Bergman complexes and Coxeter arrangements. 4:14 - 4:45 Carsten Schultz Cohomology rings of complex projective arrangements. 4:45 - 5:45 Reception (Sixth floor) Wednesday, November 3 9:30 - 10:30 Michel Broue Reductive groups over a field of x elements, x an indeterminate. 10:30 - 11:00 Morning Tea (Sixth floor) 11:00 - 12:00 Alexander Varchenko: The flag variety structure for solutions of the Bethe ansatz equations. 12:15 12:45 Laura Stevens Combinatorics of rational functions and PBW expansions of the canonical U(n-)-valued differential form. 12:45 5:00 No scheduled talks Thursday, November 4 9:30 - 10:30 Richard Stanley Hyperplane arrangements and special relativity. 10:30 -11:00 Morning Tea (Sixth floor) 11:00 - 12:00 Volkmar Welker Real rootedness and unimodality in discrete geometry. 12:00 - 2:00 Lunch Break 2:00 - 3:00 Alexander Postnikov Hyperplane arrangements and ideals generated by powers of linear forms. 3:00 - 3:30 Afternoon Tea (Sixth floor) 3:30 - 4:00 Patricia Hersh Some remarks on modular elements in lattices. 4:15 - 5:15 Anne Shepler Reflection Groups and Modular Invariant Theory. Friday, November 5 9:30 - 10:30 Christos Athanasiadis Catalan and Narayana numbers for Weyl groups. 10:30 - 11:00 Morning Tea (Sixth floor) 11:00 - 12:00 Hiroaki Terao On the multi-free arrangements. 12:00 - 2:00 Lunch Break 2:00 - 3:00 Alexandru Suciu A look at right-angled Artin groups 3:00 - 3:30 Afternoon Tea (Sixth floor) Currently Available Videos Ken Brown, Hyperplane Face Semigroups and their Algebras. November 01, 2004, 09:30 AM to 10:30 AM Persi Diaconis, Are there Q-deformations of Hyperplanes that are Useful for Shuffling? November 01, 2004, 11:00 AM to 12:00 PM Bernd Sturmfels, Introduction to Matroid Polytopes. November 02, 2004, 08:10 AM to 09:10 AM Eva Feichtner, Nested Set Complexes in Geometric Combinatorics. November 02, 2004, 09:30 AM to 10:30 AM Dmitry Kozlov, Combinatorics of DeConcini-Procesi Resolutions ofthe Real Permutation Action. November 02, 2004, 11:00 AM to 12:00 PM Nicoli Mnev, Combinatorial Stratifications of the Grassmanians: Algebraic Geometry and Combinatorial Fiber Bundles. November 02, 2004, 02:00 PM to 03:00 PM Federico Ardila, Bergman Complexes and Coxeter Arrangements. November 02, 2004, 03:30 PM to 04:00 PM Carsten Schultz, Cohomology Rings of Complex Projective Arrangements. November 02, 2004, 04:15 PM to 04:45 PM Michel Broue, Reductive Groups Over a Field of X Elements, X an Indeterminate November 03, 2004, 09:30 AM to 10:30 AM Laura Stevens, Combinatorics of Rational Functions and PBW Expansions of the Canonical U(n_)-valued Differential Form. November 03, 2004, 12:15 PM to 12:45 PM Richard Stanley, Hyperplane Arrangements and Special Relativity. November 04, 2004, 09:30 AM to 10:30 AM Volkmar Welker, Real Rootedness and Unimodality in Discrete Geometry. November 04, 2004, 11:00 AM to 12:00 PM Alexander Postnikov, Hyperplane Arrangements and Ideals Generated by Powers of Linear Forms. November 04, 2004, 02:00 PM to 03:00 PM Patricia Hersh, Some Remarks on Modular Elements in Lattices. November 04, 2004, 03:30 PM to 04:00 PM Anne Shepler, Reflection Groups and Modular Invariants Theory. November 04, 2004, 04:15 PM to 05:15 PM Christos Athanasiadis, Catalan and Narayana Numbers for Weyl Groups. November 05, 2004, 09:30 AM to 10:30 AM Hiroaki Terao, On the Multi-Free Arrangements. November 05, 2004, 02:00 PM to 03:00 PM Alexandru Suciu, A Look at Right-Angled Artin Groups. November 05, 2004, 02:00 PM to 03:00 PM For more information: Questions about this workshop should be sent either by email to msri-workshops@msri.org or by regular mail to: Combinatorial Aspects of Hyperplane Arrangements Mathematical Sciences Research Institute 17 Gauss Way, Berkeley, CA 94720-5070. USA The Institute is committed to the principles of Equal Opportunity and Affirmative Action. Back to Workshop Listing Want to be kept updated on upcoming events? Then Click Here to Subscribe to Our Newsletters! HOME | ACTIVITIES AT MSRI | PROPOSALS APPLICATIONS | ALUMNI DEVELOPMENT | ABOUT MSRI | COMMUNICATIONS | SPONSORS AFFILIATES Copyright 2005 All Rights Reserved. Mathematical Sciences Research Institute. Privacy Policy Legal Information Contact Us
Colloquium on Combinatorics
Otto-von-Guericke-Universitt, Magdeburg, Germany; 12--13 November 2004.
Kolloquium ber Kombinatorik Ihr Browser kann diese Frame-Seite leider nicht anzeigen! Diese Frame-Seite besteht aus den Komponenten balken.htm und start.htm
MCCCC 18
Eighteenth Midwest Conference on Combinatorics, Cryptography and Computing. Rochester Institute of Technology, NY, USA; 28--30 October 2004.
MCCCC at RIT Golisano College of Computing Information Sciences College of Science RIT Dept. of Mathematics Statistics Welcome! The Rochester Institute of Technology is proud to host the Midwest Conference on Combinatorics, Cryptography and Computing. From this page you can link to the current website, or see what happened in previous years. Please select one of the links below. 19th MCCCC (October, 2005) 18th MCCCC (October, 2004) Copyright RIT Department of Mathematics and Statistics
Extremal Combinatorics II
DIMACS DIMATIA Rnyi Working Group. DIMACS Center, Rutgers University, Piscataway, NJ, USA; 18--20 October 2004.
DIMACS DIMATIA Rnyi Working Group on Extremal Combinatorics II DIMACS DIMATIA Rnyi Working Group on Extremal Combinatorics II Second Meeting Dates: Monday, October 18 - Wednesday, October 20, 2004 DIMACS Center, CoRE Building, Rutgers University, Piscataway, NJ Organizers: Jnos Komls, Rutgers University, komlos@math.rutgers.edu Endre Szemerdi, Rutgers University, szemered@cs.rutgers.edu The Rnyi Institute Home Page DIMACS DIMATIA Renyi Working Group on Extremal Combinatorics Main Page DIMACS DIMATIA Renyi Tripartite Partnership Workshop Announcement Call for Participation List of Participants Program Papers and Slides Group Pictures Information on Accommodations Information on Travel Arrangements Parking Permit Parking permits will be available at the registration table on the day of the workshop. Please park in lot 64 located between the CoRE Building and the Werblin Recreation Center. Important Reimbursement Information Attendees who have been offered support should keep two rules in mind. Reimbursement for air travel can only be made for travel on US Flag Carriers, REGARDLESS OF COST. (For example, travel on airlines such as United, Continental, USAir, and others that are United States based are allowable. Travel on airlines such as Lufthansa, SAS, Air Canada and other airlines based outside the US cannot be reimbursed by DIMACS.) The second rule to keep in mind is to get original receipts for all reimbursable expenses. If you're coming from abroad, check the latest visa requirements (they are changing all the time) and get an early start on obtaining a visa. Other Workshops DIMACS Homepage Contacting the Center Document last modified on October 21, 2004.
Combinatorial Structure of Intractable Problems
2nd COMBSTRU Workshop. Venice, Italy; 20--22 September 2004.
2nd COMBSTRU Workshop 2004 Organized and sponsored by
Combinatorics '04
Capomulini, Catania, Sicily, Italy; 12--18 September 2004.
Combinatorics '04 Combinatorics '04 The international conference Combinatorics '04 will be organized by CataniaCombinatorics in Capomulini (Catania, Italy) from the 12th to 18th of September 2004. Sponsored by University of Catania Comune di Acireale APT di Catania Deadlines Registration: July 31, 2004 Submission of Abstract: July 31, 2004 Arrival: September 12, 2004 Home | ObjectiveandMainTopics | Committees | InvitedSpeakers | Listofparticipants | FormatoftheConference | AbstractSubmission | Proceedings | Programme | FeesandRegistration | TravelandAccomodation | Pictures
Latin-American Conference on Combinatorics, Graphs and Applications
Santiago, Chile; 16--20 August 2004.
Latin-American Conference on Combinatorics, Graphs and Applications home | committees | invited speakers | program | participants | submissions | registration | accomodation | @ | Organization: Department of Industrial Engineering , Faculty of Physical and Mathematical Sciences, University of Chile Department of Mathematical Engineering , Faculty of Physical and Mathematical Sciences, University of Chile Sponsored by: Millennium Science Nucleus "Complex Engineering Systems", Chile Millennium Science Nucleus "Information and Randomness", Chile Centre for Mathematical Modeling, University of Chile About the Conference: This meeting is a forum for researchers and practitioners working on various aspects of combinatorial optimization, integer programming, linear programming and graph theory. It will be held in the Engineering School, University of Chile (Beauchef 850, Santiago, Chile). The official language will be English. The aim of the Conference is to present recent advances in theory, computation, and applications of these areas, in order to contribute to an important development of these topics in our region. Conference themes: Themes and application areas include, but are not limited to, the following topics: Combinatorial optimization and computational complexity: linear, integer, mixed and stochastic programming; multicriteria optimization; approximation algorithms; coding theory and cryptology; 0-1 matrices; metaheuristics. Graph theory and matroids: algorithms; network flows; random graphs; intersection graphs; perfect graphs. Applications of OR: biology; finance and economics; scheduling; forestry; supply chain management; logistics; location; airlines; telecommunications; transportation; vehicle routing; production planning; queuing and inventory.
COCOON 2004
Tenth International Computing and Combinatorics Conference. Jeju Island, Korea; 17--20 August 2004.
COCOON 2004 Tenth International Computing and Combinatorics Conference (COCOON 2004) August 17-20, 2004 Ramada Plaza Jeju Hotel, Jeju Island, Korea Sponsored by Korea Advanced Institute of Science and Technology Korea Science and Engineering Foundation Korea Information Science Society Important Dates: Submission of Papers: February 15, 2004 Notification of Acceptance: April 17, 2004 Final Camera-Ready Version: May 8, 2004 Early Registration: June 20, 2004 Late Registration: July 25, 2004 Conference: August 17-20, 2004 Organization Invited Speakers Conference Program (PDF) (HTML) Photo Gallery Documents: Call for Papers: TXT file , PS file , PDF file Accepted Paper List (46 papers): HTML , PDF LNCS Author Instructions The proceedings are published by Springer-Verlag as a LNCS volume 3106 . Registration Registration Fees Until June 20 After June 20 On-Site Regular 400,000 WON (US$ 350) 460,000 WON (US$ 400) Full Time Student 290,000 WON (US$ 250) 350,000 WON (US$ 300) Registration fee covers the cost of a copy of the proceedings, coffee breaks, a reception, a banquet, lunches, and a tour of Jeju island. Note that a small overhead is included for payment in US Dollars. Transportation Tour Information Tour Map of Jeju (PDF) Jeju Island - Official Provincial Website Life in Korea: Jeju Island Tour2Korea - Jeju Highlight An Introduction to Korean Language Korean Visa Information Foreign Exchange Rate Weather Forecast (Yahoo weather) Past Conferences: 9th COCOON, COCOON 2003 : Big Sky, MT, USA 8th COCOON, COCOON 2002 : Singapore 7th COCOON, COCOON 2001 : Guilin, China Previous COCOON COCOON 2005: Kunming Further Information If you have any question and request, do not hesitate to ask us. Fax number is +82-42-869-3510 and e-mail address is cocoon04@jupiter.kaist.ac.kr .
CAAN 04
Workshop on Combinatorial and Algorithmic Aspects of Networking. Banff International Research Station (BIRS), Alberta, Canada; 5--7 August 2004.
CAAN 04 Workshop on Combinatorial and Algorithmic Aspects of Networking Workshop on Combinatorial and Algorithmic Aspects of Networking CALL FOR PAPERS August 5th - 7th, 2004 Banff International Research Station (BIRS) Program Schedule The Internet because of its size, decentralized nature, and loosely controlled architecture provides a hotbed of challenges that are amenable to mathematical analysis and algorithmic techniques. This workshop brings together mathematicians, theoretical computer scientists and network specialists. This fast growing area is an intriguing intersection of Computer Science Graph Theory Game Theory Networks. Original research papers are solicited. The list of topics for the conference includes, but is not limited to: Economics, Game Theory and the Internet Geometric Routing Web Caching Combinatorics Tomography Peer-to-peer systems Graph Theory Web Graph Data Stream analysis Statistical Distributions Optimization as they relate to Networks in general and the Internet in particular. The workshop will be organized as a series of talks with time for focused discussions. We solicit general participation and invite presentations on all aspects of networking challenges that can be addressed using techniques from theoretical computer science and mathematics. The goal of of the workshop and working group is to foster interdisciplinary collaborations among researchers in this field. Poster for the conference. Full size version Submissions Authors should send an extended abstract in PostScript format by May 10, 2004 (Extended deadline). The extended abstract should not exceed 12 pages in length on letter-size paper using 11 point or larger font. Submissions are open using the SIGACT electronics submission server. Submission Deadline: May 10, 2004 (Extended deadline) Notification Deadline: June 4, 2004 Submissions are open using the SIGACT electronics submission server. A post-proceedings volume with revised full workshop papers will be published in the Springer Lecture Notes in Computer Science series. BIRS The Banff International Research Station (BIRS) is a collaborative effort of the Pacific Institute for the Mathematical Science (PIMS, Canada) and the Mathematical Sciences Research Institute (MSRI, Berkeley, USA). Located in beautiful Banff, Alberta, Canada, BIRS hosts mathematical workshops for forty weeks of the year, principally in five- or two- day formats. The objective of these workshops is to foster collaboration and creativity in various areas of mathematics and computer science. BIRS is part of the Banff Centre , an international centre for the creative arts. Participation in the workshops at BIRS is by invitation only. As space is limited, we can only guarantee an invitation for one co-author for each paper. Program Committee Azer Bestavros, Boston University, USA Anthony Bonato, Wilfrid Laurier University, Canada Andrei Broder, IBM Research, USA Herv Brnnimann, Polytechnic University, USA Adam Buchsbaum, ATT Labs, USA Edith Cohen, ATT Labs, USA Erik Demaine, MIT, USA Luisa Gargano, University of Salerno, Italy Ashish Goel, Stanford University, USA Angele Hamel, Wilfrid Laurier University, Canada (Organizing Comm. Chair) Monika Henzinger, Google, USA Jeannette Janssen, Dalhousie University, Canada David Karger, MIT, USA Srinivasan Keshav, University of Waterloo, Canada Alejandro Lopez-Ortiz, University of Waterloo, Canada (Program Chair) Bruce Maggs, Carnegie Mellon University, USA Rajeev Motwani, Stanford University, USA Ian Munro, University of Waterloo, Canada Tim Roughgarden, University of California at Berkeley, USA Christos Papadimitrou, University of California at Berkeley, USA David Peleg, Weizmann Institute, Israel Torsten Suel, Polytechnic University, USA Eli Upfal, Brown University, USA Alessandro Vespignani, Laboratoire de Physique Theoretique, France
Geometric Combinatorics
IAS Park City Mathematics Institute Summer Session. Park City, Utah, USA; 11--31 July 2004.
IAS Park City Mathematics Institute Institute for Advanced Study Park City Mathematics Institute about us | contact information | archives 2006 Research Program Participants 2006 PCMI Proceedings, Lectures and Notes PCMI@MathForum PCMI Mathematics Education pages at The Math Forum Math Science Partnership Project PD 3 IAS Park City Mathematics Program (PCMI) is an outreach program of the School of Mathematics , Institute for Advanced Study Princeton, New Jersey. The flagship activity of the Park City Mathematics Institute is an annual summer session, where undergraduate and graduate students, high school educators, college faculty, and researchers meet to exchange information and insight about mathematics. Please note that program and application information regarding our 2006 program in Low Dimensional Topology will be available December 1st, 2005. Thank you for your patience. pcmi 2006 June 25 July 165 2006 in Park City, Utah. Research Topic Low Dimensional Topology Education Topic Mathematics Knowledge for Teaching Research Organizers Tomasz Mrowka, MIT Peter Oszvath, Columbia University Clay Senior Scholars in Residence Yakov Eliashberg,, Stanford University Robion Kirby, University of California Berkeley Education Coordinators Gail Burrill, Michigan State University Joan Ferrini-Mundy, Michigan State University Daniel Goroff, Harvard University Carol Hattan, Skyview High School, Vancouver, WA James King, University of Washington 2006 Program Details Upcoming PCMI Programs 2007 Statistical Mechanics Dates July 1-21, 2007 Organizers Scott Sheffield, University of California Berkeley Thomas Spencer, Institute for Advanced Study 2008 Analytic and Algebraic Geometry Dates (to be announced) Organizers Scott Sheffield, University of California Berkeley Thomas Spencer, Institute for Advanced Study PCMI Program Staff C. Herbert Clemens The Ohio State University PCMI Program Director Catherine Giesbrecht Institute for Advanced Study Program Administrator Carleen Inderieden University of Utah Project Coordinator Abigail Stewart University of Utah Office Assistant About the IAS Park City Mathematics Institute About the Institute for Advanced Study About the School of Mathematics at the Institute for Advanced Study Acknowledgements The Institute for Advanced Study and the IAS Park City Mathematics Institute (PCMI) wish to thank the following generous contributors: The National Science Foundation, Education and Human Resources Directorate (Math Science Partnership Initiative), grant no. 0314808 The National Science Foundation, Division of Mathematical Sciences, grant no. 9900969 The Starr Foundation The State of New Jersey The National Security Agency The George S. and Delores Dor Eccles Foundation The Wolfensohn Family Foundation Mr. and Mrs. Charles Jaffin The Spencer Foundation The Clay Mathematics Institute* Chautauqua Workshop Programs With appreciation to : The University of Utahs Department of Mathematics *The Clay Mathematics Senior Scholars 2005 Recent Software Donations: Wolfram Research, makers of Mathematica MathWorks, makers of MATLAB Maplesoft, makers of Maple Key Curriculum Press, makers of Geometers Sketchpad and Fathom Texas Instruments, makers of Cabri Geometry
PP'04
2nd Annual International Conference on Permutation Patterns. Malaspina University-College, Nanaimo, British Columbia, Canada; 5--9 July 2004.
Malaspina University-College Department of Mathematics 2nd Annual International Conference on Permutation Patterns PP'04 July 5-9, 2004 Nanaimo, British Columbia, Canada Go to Updated Program You can now register by fax or e-mail Send submissions to westj@mala.bc.ca Second Announcement - Registration opens Topics The unifying theme of the conference is permutation patterns. The topics addressed will include enumeration questions, excluded pattern questions, study of the involvement order, algorithms for computing with permutation patterns, applications and generalizations, etc. Web site The conference website is at www.mala.ca math pp Speaker The keynote speaker will be Miklos Bona of the University of Florida. Registration The registration fee will be $100 CAD for registration by 1 April 2004, and $150 thereafter. It is now possible to register by fax or mail via the conference website: www.mala.ca math pp Submissions Participants interested in giving a talk at the conference are invited to submit an abstract of between one and six pages by 1 April 2004. These should be sent to the local organizer at westj@mala.bc.ca. Proceedings A special volume connected to the conference will be published in the journal Annals of Combinatorics. All submissions to the special volume will be treated as ordinary journal submissions and will be refereed according to the usual high standards. Social program Aside from the academic program we plan a full social program that will give participants an opportunity to enjoy the spectacular location of central Vancouver Island. Accommodation A block of rooms has been reserved in university residences across the road from the main conference site; these are very modestly priced at 30 CAD night. Unfortunately only single rooms will be available. There is one bathroom for every two rooms. There are also several good hotels in downtown Nanaimo, about 3 kilometres away, with which we have negotiated good rates. More information is available on the conference web site (http: www.mala.ca math pp StudentResidence.htm, http: www.mala.ca math pp Hotels.htm) The conference is being organized as a satellite of the 16th Annual Conference on Formal Power Series and Algebraic Combinatorics, which will be at the University of British Columbia, June 28 - July 2. Committee: Michael Albert, University of Otago (New Zealand) Einar Steingrimsson, Chalmers Institute of Technology (Sweden) Zvezdelina Stankova, Mills College (California) Julian West, Malaspina University-College (Canada) Location The conference will take place in Nanaimo, British Columbia, Canada . [ Discover Malaspina ] Produced by the Media Relations Publications Department Copyright 2003 Malaspina University-College
FPSAC'04
16th Annual International Conference on Formal Power Series and Algebraic Combinatorics. University of British Columbia, Vancouver, BC, Canada; 28 June -- 2 July 2004.
Page not found Page not found Sorry, the page you requested was not found on this server, or is currently unavailable. You may want to try the following: Start at our home page PIMS revamped its website on March 30, 2005 and has reorganized the information within to make it easier to find. Go to the PIMS homepage Addresses are case sensitive If you typed in the URL, ensure that it was entered correctly. Web addresses on this server are case sensitive. Use search to find the page 2005 Pacific Institute for the Mathematical Sciences
Retrospective in Combinatorics
Honoring the 60th birthday of Richard P. Stanley. Massachusetts Institute of Technology, USA; 22--26 June 2004.
Stanley Conference Home Contacts Program Festschrift Photo album NEW In Partnership with MIT Department of Mathematics Clay Mathematics Institute National Science Foundation Expired pages Registration Request support Submit titles abstracts Travel info maps Accommodations Banquet June 22-26, 2004 Massachusetts Institute of Technology Last updated: January 23, 2004
SIAM Conference on Discrete Mathematics (DM04)
Discrete mathematics is a branch of the mathematical sciences, with a wide range of challenging research problems and important applications in industry. Nashville, TN, USA; 13--16 June 2004.
SIAM Conference on Discrete Mathematics Site best viewed with IE 6.0, Netscape 6.0, or Mozilla 1.4 or better Sponsored by the SIAM Activity Group on Discrete Mathematics (SIAG DM) About the Conference Discrete mathematics is a branch of the mathematical sciences, with a wide range of challenging research problems and important applications in industry. Discrete mathematics has applications to all fields of computer science, and to the physical and biological sciences. It is used extensively in telecommunications, information processing and manufacturing, and many businesses and industries use techniques of discrete optimization to improve the efficiency of their operations. Discrete mathematics is a dynamic field in both theory and applications. Researchers in discrete mathematics have established important connections with mainstream areas of pure and applied mathematics, and as a consequence, research techniques and problems are drawn from a wide range of different fields, including algebra, topology, geometry, probability, analysis, and logic. The purpose of this conference is to highlight the major theoretical advances in the field, the development of new tools for discrete mathematics, and the most significant of the new applications of discrete mathematics to problems arising in industry and business. The conference also seeks to bring together participants from the many different environments where discrete mathematics is developed and applied. Conference Themes Discrete mathematics: Combinatorics Graph theory and matroids Combinatorial algorithms Coding theory and cryptology Ordered sets and its connections to other disciplines, including: Computer science Computational biology Optimization Geometry Topology Organizing Committee Mark Ellingham (chair), Vanderbilt University Rob Calderbank, ATT Labs - Research William Cook, Georgia Institute of Technology Jim Haglund, University of Pennsylvania Penny Haxell, University of Waterloo, Canada Monika Henzinger, Google, Inc Rolf Mhring, Technische Universitt, Berlin, Germany Ron Shamir, Tel Aviv University, Israel William T. Trotter, Georgia Institute of Technology Douglas B. West, University of Illinois with input from officers of the SIAG DM: Derek Corneil, University of Toronto, Canada Nathaniel Dean, Texas Southern University Gary MacGillivray, University of Victoria, Canada Invited Plenary Speakers What Makes a Finite Network High-Dimensional: Random Graph Scaling for Finite Graphs Jennifer Chayes, Microsoft Research Transportation and Integer Programming Martin Grtschel, Konrad-Zuse-Zentrum fr Informationstechnik Berlin (ZIB), DFG-Forschungszentrum "Mathematik fr Schlsseltechnologien," and Technische Universitt Berlin, Germany Complex Networks, Search Algorithms, and the Evolution of the Web Jon Kleinberg, Cornell University Internet Vulnerabilities: A Look at Some Problems and Possible Solutions Tom Leighton, Massachusetts Institute of Technology and Akamai Technologies, Inc. The Structure of Claw-Free Graphs Paul Seymour, Princeton University Tropical Geometry and Its Applications Bernd Sturmfels, University of California, Berkeley Old Problems and New Results in Coding Theory Alexander Vardy, University of California, San Diego A Word Count Statistic in Computational Biology Michael Waterman, University of Southern California Funding Agency SIAM and the conference organizing committee wish to extend their thanks and appreciation to the National Science Foundation for their support of this conference. Acknowledgement SIAM acknowledges the support provided by Vanderbilt University. In particular, SIAM thanks the Department of Mathematics for hosting the Sunday night reception, the Microcomputer Laboratories of the College of Arts and Science for providing email access, and the Science and Engineering Library for providing library facilities. Invited Minisymposia Mike Albertson Graph Colorings Alexander Barg Geometric and Combinatorial Methods in Coding Theory Anne Bergeron Genome Rearrangements Tom Bohman and Benny Sudakov Probabilistic Combinatorics Andreas Brandstdt Clique-width of Graph Classes: Properties, Related Concepts, Applications Francesco Brenti and Greg Warrington Combinatorics of Kazhdan-Lusztig Polynomials, Schubert Varieties and Lie Algebras Guantao Chen and Xingxing Yu Cycles and Paths in Graphs, I and II Eddie Cheng Stable Sets and Stable Multisets Fan Chung Title TBA Jeff Erickson Computational Geometry Luis Goddyn and C.Q. Zhang Flows and Colorings James Haglund, Jennifer Morse and Jeffrey Remmel Macdonald Polynomials and the Combinatorics of Diagonal Harmonics, I and II Sorin Istrail SNPs, Haplotypes, and Disease Associations Andre Kndgen and Dhruv Mubayi Extremal Combinatorics Gary MacGillivray Graph Homomorphisms John Maharry Graph Minors Lucia Moura and Brett Stevens Design Theory James Oxley Matroid Theory Frank Ruskey Sequencing of Combinatorial Objects Lszl Szkely and Farhad Shahrokhi Discrete Geometry, I and II William T. Trotter Ordered Sets 4 13 04 Dynamic menus by
Brazilian Symposium on Graphs,Algorithms and Combinatorics
Fortaleza, Cear State, Brazil; 17--19 March 2001.
Brazilian Symposium on Graphs, Algorithms and Combinatorics in conjunction with CIMPA School on Algorithms and Combinatorics March 17-19, 2001, Fortaleza, Cear State , Brazil webdesigner
17th Cumberland Conference
Combinatorics, Graph Theory and Computing. Middle Tennessee State University, Murfreesboro, TN, USA; 20--22 May 2004.
17th Cmberland Conference The 17th Cumberland Conference on Combinatorics, Graph Theory, and Computing May 20 to May 22, 2004 Thursday, May 20 1:00 pm - 5:30 pm Friday, May 21 8:00 am - 5:30 pm Saturday, May 22 8:00 am - 11:30 am Principal Speakers Organizing Committee Invited Speakers Abstracts Schedule Registration Directions Shuttle Info Accommodations Parking Info Conference Aim The Cumberland Conference on Graph Theory, Combinatorics and Computing is an annual meeting of the discrete mathematics community in the southeast. The Conference brings together internationally known researchers, college faculty, students, industrial mathematicians, and computer scientists in an environment conducive to the interchange of ideas and leading to opportunities for collaborative research. Everyone is welcome to attend. As there is no registration fee, the Cumberland Conference is a convenient opportunity for students and faculty, especially those from smaller institutions, to meet and interact with others who are interested and active in research in various areas of discrete mathematics. Organizing Committee Curtis K. Church Middle Tennessee State University cchurch@mtsu.edu Rong Luo Middle Tennessee State University rluo@mtsu.edu Mary Martin Middle Tennessee State University mmartin@mtsu.edu Donald Nelson Middle Tennessee State University dnelson@mtsu.edu Suk Jai Seo Middle Tennessee State University sseo@mtsu.edu Xiaoya Zha Middle Tennessee State University xzha@mtsu.edu Rebecca Zijlstra Middle Tennessee State University rzijlstr@mtsu.edu Parking Info You may park in the big parking lot on MTSU Blvd. across from the Business and Aerospace Building (BAS) where the conference is being held. You will not need a parking permit. This conference is sponsored by: NATIONAL SECURITY AGENCY with additional support from MIDDLE TENNESSEE STATE UNIVERSITY Office of Sponsored Programs, College of Basic and Applied Sciences, Department of Mathematical Sciences; and Brooks Cole, Duxbury, Wadsworth Publishing; Addison Wesley Benjamin Cummings Publishing. Last updated May 20, 8:00 am
13th Ontario Combinatorics Workshop
Royal Military College of Canada, Kingston, Ontario, Canada; 6--7 May 2004.
13th Ontario Combinatorics Workshop - Royal Military College of Canada National International Conferences Symposia The Principal The Registrar Arts Science Engineering Continuing Studies Continuing Studies Campus St-Jean-sur-Richelieu Graduate Studies and Research The Language Centre Canadian Forces Management Development School Land Force Technical Staff Programme Centre for Space Research Institute for the Environment Conferences and Workshops 13th Ontario Combinatorics Workshop May 6-7, 2004, Royal Military College, Kingston Queen's University Royal Military College The 13th Ontario Combinatorics Workshop will be hosted by the Royal Military College and Queen's University on May 6-7, 2004, at the Royal Military College. The meeting is intended to be informal; participants are encouraged to present a short talk (30 min.) on their current or future research. Graduate students, postdocs and young researchers are especially encouraged to talk in this comfortable and friendly meeting! Supervisors, please encourage your graduates students to attend and speak. There are limited support funds available for students from out of town who speak at the workshop. All areas of combinatorics and discrete mathematics are included! Opportunities for discussion and joint research will be emphasized. There is no registration fee. There will be two plenary speakers: Shlomo Hoory (University of Toronto), and Bruce Reed (McGill University). The remainder of the two days is reserved for contributed talks. Directions: You can use this map to find your way around Kingston. By car, the best way to get to the hotel is to exit the 401 at highway 15 (exit 623), head south and turn right at highway 2 (where the road ends). After the bridge, the left lane becomes Ontario street; Princess street is at the second light on Ontario street, and the Waterfront Holiday Inn is on the left, just before the lake. All talks will be in the Currie Building, Room C-200. You can use this campus map for location. From the Holiday Inn, it is a 20 minute walk following Ontario Street which becomes the Lasalle causeway bridge; the Memorial Arch marks the entrance of RMC on the right just after the bridge (by car, you need to drive further up, to the traffic light, and then turn right to enter RMC). The Currie building is item 17 on the map, just in front of the parade square (item 5), and room C-200 is on the western end of the building. Lunch (ranging from $3.00 to $10.00) is available at the Mess (item 4 on the map); participants can also use the 2-hour lunch break to go to a downtown restaurant. Schedule and abstracts of talks Schedule of events , Submit a talk, Hotels, Financial support for students, etc Organizers Sebastian Cioaba , Lucien Haddad , David Gregory , Claude Tardif , David Wehlau . Contact Claude Tardif Royal Military College (613) 541-6000 x6649 FAX: (613) 541-6584 Claude.Tardif@rmc.ca 13th Ontario CombinatoricsWorkshop May 6-7, 2004 Important Dates April 6 last day hotel Holiday Inn is holding rooms for the conference. April 16 deadline for students to apply for financial support. April 19 notification of financial support. April 23 final abstracts due for OCW. May 6-7 OCW 2004. Location: Royal Military College, Kingston, Ontario Peter Rodney Book Prize The best talk given by a student at the Ontario Combinatorics Workshop will be awarded the Peter Rodney Memorial Book Prize. This prize of a book and memorial book plate is given in honour of Dr. Peter Rodney (1965-1995). Dr. Peter Rodney graduated from McGill University, and then obtained his Masters and Ph.D degrees in Combinatorics, from the University of Toronto. He graduated in 1993 and went on to do postdoctoral research at the University of Vermont. He then continued to work in both the public and private sectors, using discrete mathematics, cryptography, and number theory. He had a deep appreciation for probability theory and was an avid card player. He died unexpectedly at the age of 30. His friends and family created a fund in his memory whose proceeds finance this book prize. Submitting an Abstract to OCW Please send an abstract or intend to speak at OCW by Friday April 16. Final abstract are due by Friday April 23. Send abstracts to: Claude Tardif( Claude.Tardif@rmc.ca ). Accommodations Holiday Inn 2 Princess Street, Kingston, phone:(613) 549-8400 http: www.hikingstonwaterfront.com holidayinn.cfm 20 rooms will be held for the conference until April 6, after that it will depend on availability. conference rate: $145 a night per room for one or two people. booking: identify yourself as being with the Ontario Combinatorics Workshop 2004 , by phone: (613) 549-8400 Ext. 2660 or 1-800-HOLIDAY. Sharing a room at the Holiday Inn We can put you in touch with another person in order to share a room (The price is half!). Please, e-mail Claude Tardif Claude.Tardif@rmc.ca ; he will be happy to put you in touch with a roomate. Other hotels in Kingston Site Map Date Modified: 2005 08 09 Important Notices
Postgraduate Combinatorial Conference 2004
Aimed at current research students in all areas of combinatorics and discrete mathematics. Queen Mary, University of London, UK; 20--22 April 2004.
Postgraduate Combinatorial Conference 2004 -- Main Page 15th Postgraduate Combinatorial Conference 20th - 22nd April 2004, Queen Mary, University of London -Home- Register Information Participants Programme Photos Finding Us Links Contact NEW: PCC2005 webpage now on line! Click here . Conference photos available! If you can bear to look, click here . Invited Speakers: Andrew Thomason (University of Cambridge) Pseudo-random graphs and graph minors John Truss (University of Leeds) Representing words in automorphism groups Bridget Webb (Open University) Infinite designs Use the links on the left for more information about the conference. Site last updated: 27th October 2004
Working Applications of Discrete Mathematics
Centre for Discrete Mathematics and Computing, University of Queensland, Brisbane, Australia; 14--16 January 2004.
Mathematics Disclaimer Mathematics All of UQ News and Events General Information Student Information Staff Information Visitor Information Research Information Club Infinity People Seminars Positions Vacant Sitemap Select a quick link: Other Mathematics Links MathSciNet School of Physical Sciences Faculty of EPSA About UQ my.UQ mySI-net Programs and Courses UQ News UQ Experts UQ Images Organisational Units Staff Web Page You have requested the document http: www.maths.uq.edu.au ~ejb workshopJan04.html. This is a staff web area hosted on a University of Queensland web server. Please be advised that the web pages within this area are NOT officially endorsed by The University of Queensland. The University accepts no responsibility or liability for the contents of this area. This message has been displayed in accordance with the University's Internet Code of Practice , which forms a part of the Handbook of University Policies Procedures . Please note that you will need to enable cookies in your browser in order to proceed. to continue, or to the Mathematics home page. privacy | feedback 2004 The University of Queensland, Brisbane, Australia ABN 63 942 912 684 CRICOS Provider No: 00025B Authorised by: Head of School Maintained by: webmaster@sps.uq.edu.au Last Updated - Today 09:31pm
ANALCO04
The First Workshop on Analytic Algorithmics and Combinatorics. Held in conjunction with ALENEX04 and SODA04. New Orleans, LA, USA; 10 January 2004.
The First Workshop on Analytic Algorithmics and Combinatorics The First Workshop on Analytic Algorithmics and Combinatorics (ANALCO04) The First Workshop on Analytic Algorithmics and Combinatorics (ANALCO04) will be held in New Orleans on January 10, 2004, at the Astor Crowne Plaza Hotel. The aim of the ANALCO workshop is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures. We invite both papers that study properties of fundamental combinatorial structures that arise in practical computational applications (such as permutations, trees, strings, tries, and graphs) and papers that address the precise analysis of algorithms for processing such structures, including: average-case analysis; analysis of moments, extrema, and distributions; and probabilistic analysis of randomized algorithms. Submissions that present significant new information about classic algorithms are welcome, as are analyses of new algorithms that present unique analytic challenges. We also invite submissions that address tools and techniques for the analysis of algorithms and combinatorial structures, both mathematical and computational. The scientific program will include ample time for discussion and debate of topics in this area. This workshop precedes the ACM-SIAM Symposium on Discrete Algorithms (SODA04) being held January 11-13, 2004. The workshop will take place on the same day as the Sixth Annual Workshop on Algorithm Engineering and Experiments (ALENEX04). Since researchers in both fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop. The proceedings of ALENEX and ANALCO will be published as a single volume. A paper that has been reviewed and accepted for presentation at SODA is not eligible for submission to ANALCO. We recognize, however, that some research projects spawn multiple papers that elaborate on different aspects of the work. We are willing to respond to inquiries about SODA, ALENEX, and ANALCO papers that may overlap. Inquires regarding ANALCO may be sent to workshop organizer Bob Sedgewick at rs@cs.princeton.edu . The ANALCO workshop is supported by SIAM (Society for Industrial and Applied Mathematics) and SIGACT (ACM Special Interest Group on Algorithms and Computation Theory). Program Committee Kevin Compton, University of Michigan Luc Devroye, McGill University, Canada Mordecai Golin, The Hong Kong University of Science and Technology, Hong Kong Hsien-Kuei Hwang, Academia Sinica, Taiwan Robert Sedgewick (chair), Princeton University Wojciech Szpankowski, Purdue University Brigitte Valle, Universit de Caen, France Jeffrey S. Vitter, Purdue University Invited Plenary Speaker Philippe Flajolet, INRIA, France Theory and Practice of Probabilistic Counting Algorithms Submissions Authors are invited to submit 10-page extended abstracts by 5:00 PM EDT, September 19, 2003. To submit a paper for consideration, please e-mail a Postscript (.ps) or PDF (.pdf) version of the paper to Bob Sedgewick at rs@cs.princeton.edu . Notification of acceptance or rejection will be sent by the end of November 2003. The deadline for receipt of papers in final version will be included in the acceptance notification. Presenters must have submitted the final versions of their papers in order to be able to present them at the workshop. 9 4 03
KolKom'03
Combinatorics Colloquium (Kolloquium ber Kombinatorik). Otto-von-Guericke-Universitt, Magdeburg, Germany; 14--15 November 2003 (English German).
Kolloquium ber Kombinatorik: Willkommen Welcome Universitt Magdeburg - Fakultt fr Mathematik kolkom@uni-magdeburg.de For more information please KLICK on the poster. For more information please KLICK on the poster. kolkom@uni-magdeburg.de
EACAC2
The Second East Asian Conference on Algebra and Combinatorics. Kyushu University, Nishijin, Sawara-ku, Fukuoka, Japan; 17--21 November 2003.
The Second East Asian Conference on Algebra and Combinatorics EACAC2 (The Second East Asian Conference on Algebra and Combinatorics): An International Conference of Kyushu University 21st Century COE Program November 17-21, 2003 Kyushu University Research and International Exchange Plaza (Nishijin, Sawara-ku, Fukuoka, Japan) Guided Excursion Trips (November 13, 2003) Local Travel Information (Revised November 12, 2003) Information for Speakers (November 4, 2003) Program (dvi file, October 30, 2003) Click here to see the Second Announcement Purpose This conference aims to bring together researchers around eastern Asian area in all aspects of Algebra, Combinatorics and related topics to share their recent research results with one another. The main theme will focus on, but not exclusively, Lie algebras, vertex operator algebras, commutative algebras, finite groups, association schemes, codes, designs, finite geometries, physical combinatorics, combinatorial representation theory (just to name a few) and their interactions. (The First EACAC was held in Taipei in September, 2001.) Conference Program The conference will consist of invited talks and contributed talks. Special sessions for several topics will be organized. All the lectures will be delivered in English. Call for Papers Authors are invited to submit, before August 31, 2003, abstracts of no more than 1 page to either any member of the organizing committee of each country (see the e-mail addresses below) or to the address: eacac2@math.kyushu-u.ac.jp. Abstracts should preferably be prepared in Latex and submitted by e-mail (In case that it is submitted to a member of the committee of each country, we appreciate it very much if it is also sent to the following additional address by using c.c.: eacac2@math.kyushu-u.ac.jp). Conference Registration The registration form will be available soon from the conference homepage . Location and Travel The conference will take place at Kyushu University Research and International Exchange Plaza (Nishijin, Sawara-ku, Fukuoka, Japan). The conference is scheduled to start on November 17, 2003 at 9 AM. Accommodation Detailed information will be available in the second announcement which will be ready by the spring of 2003. Further Information All travel and local information may be found via the conference homepage . Questions regarding the technical program and or regarding travel and local arrangements should be directed to one of the following e-mail addresses: eacac2@math.kyushu-u.ac.jp (conference e-mail address), or bannai@math.kyushu-u.ac.jp, or munemasa@math.is.tohoku.ac.jp The postal address is: EACAC2, c o Eiichi Bannai, Graduate School of Mathematics, Kyushu University, Hakozaki 6-10-1, Higashi-ku, Fukuoka, 812-8581, Japan. (Phone 81-92-642-2751, Fax (department office) 81-92-642-2778.) Central Committee Eiichi Bannai (Fukuoka) Ming-Chang Kang (Taipei) Jin-Ho Kwak (Pohang) Harald Niederreiter (Singapore) and Zhe-Xian Wan (Beijing) Committee of each country (* means to chair the committee): China: Z. X. Wan*, B. Chen, H. Shen, J. Zhang, C. M. Zong (wan@it.lth.se, chenstation@yahoo.com, haoshen@online.sh.cn, zhang@pku.edu.cn, cmzong@math.pku.edu.cn) Japan: E. Bannai*, A. Munemasa* and K. Shinoda* (There are about 20 more members in the committee of Japan.) (bannai@math.kyushu-u.ac.jp, munemasa@math.is.tohoku.ac.jp, shinoda@mm.sophia.ac.jp) Korea: J. H. Kwak*, Y. J. Choie, S. J. Kang, D. S. Kim, S.Y. Song (jinkwak@postech.ac.kr, yjc@postech.ac.kr, soccerkang@hotmail.com, dskim@mail.kaist.ac.kr, sysong@iastate.edu) Philippines: J. M. Balmaceda*, (joey@up.edu.ph) Singapore: H. Niederreiter*, S. Ling, S. L. Ma, (nied@math.nus.edu.sg, matlings@nus.edu.sg, matmasl@nus.edu.sg) Taiwan: M.C. Kang*, G. J. Chang, S. J. Cheng, T. Huang, X. D. Zhu (kang@math.ntu.edu.tw, gjchang@math.ntu.edu.tw, chengsj@math.ntu.edu.tw, thuang@math.nctu.edu.tw, zhu@ibm28.math.nsysu.edu.tw)
Combinatorics in Cambridge
Celebrating the 60th birthday of Bla Bollobs. University of Cambridge, UK; 4--7 August 2003.
Combinatorics in Cambridge Combinatorics in Cambridge August 4th to 7th 2003 celebrating Bla Bollobs's 60th birthday "Combinatorics in Cambridge" is a conference to be held in Cambridge from August 4th to August 7th, 2003. All interested are warmly invited to attend. The meeting is timed to coincide with the 60th birthday of Bla Bollobs, and the themes will be those of his mathematical interests: extremal combinatorics, random combinatorics and functional analysis. A series of around thirty lectures will given by invited speakers. Among those anticipated to be taking part in the meeting are Yousef Alavi, Noga Alon, Jzsef Beck, Christian Borgs, Neil Calkin, Jennifer Chayes, Chen Beifang, Chen Chuanping, Ernie Cockayne, Ralph Faudree, Trevor Fenner, Ehud Friedgut, Alan Frieze, Laszl Gerencser, Roland Hggkvist, Svante Janson, Jeff Kahn, Gil Kalai, Michal Karonski, Gyula Katona, Jeong-Han Kim, Alexandr Kostochka, Michael Krivelevich, Felix Lazebnik, Nati Linial, Lasl Lovsz, Tomasz Luczak, Wolfgang Mader, Colin McDiarmid, Vitali Milman, Keika Mynhardt, Jarik Nesetril, Vlado Nikiforov, Boris Pittel, Hans-Jrgen Prmel, Vojta Rdl, Pierre Rosenstiehl, Cecil Rousseau, Andrzej Rucinski, Dick Schelp, Miki Simonovits, Greg Sorkin, Vera Ss, Angelika Steger, Benny Sudakov, Endre Szemerdi, Jim Tattersall, Simon Tavare, Carsten Thomassen, Bjarne Toft, Tom Trotter, Lior Tzafriri, Dominic Welsh, John Wierman, Pete Winkler together with many of Bollobs's students, past and present: Keith Ball, Jozsi Balogh, Graham Brightwell, Keith Carne, Jonathan Cutler, Tristan Denley, Reinhard Diestel, Ted Dobson, Stephen Eldridge, Tim Gowers, Andrew Harris, Penny Haxell, Hugh Hind, Alice Hubenko, Guoping Jin, Yoshi Kohayakawa, Imre Leader, Henry Liu, Balazs Montagh, Rob Morris, Alexis Papaioannou, Jonathan Partington, Luke Pebody, Jamie Radcliffe, Charles Read, Oliver Riordan, Amites Sarkar, Alex Scott, Alan Stacey, Tamas Szabo, Andrew Thomason, K.Tillekeratne, David Weinreich, Jerzy Wojcziechowski, Colin Wright. Location The academic part of the meeting will take place in the Centre for Mathematical Sciences , in which DPMMS (the Department of Pure Mathematics and Mathematical Statistics) is located. For travel information click here . Accommodation Trinity College will house conference participants, as well as hosting the banquet and other social events. Accommodation is mostly in single rooms. For more information click here . Registering Details of conference charges and of how to register can be found here . Schedule A timetable of the lectures and of other conference events may be viewed here as details emerge. Enquiries Enquiries about the conference may be directed by email to belabash@dpmms.cam.ac.uk or by fax to +44 1223 337920. Organized by: Keith Carne, Tim Gowers, Imre Leader, Oliver Riordan, Andrew Thomason. Supported by: The London Mathematical Society, Trinity College, The British Combinatorial Committee, DPMMS. Conference pictures Click here to see pictures of the conference. (Added 2 Sep 2004) Last modified: 11:58 Fri 6 Jun 2003
FPSAC'03
15th Anniversary International Conference on Formal Power Series and Algebraic Combinatorics. Linkping University, Sweden; 23--27 June 2003.
FPSAC 2003 Home Registration Submit Papers Accommodation Invited Speakers Program committee Organizing committee Program Open problems Travel info Slide Show Sponsors FPSAC SFCA International Conferences FPSAC 2004, June 28-July 2 in Vancouver, Canada FPSAC 15th Anniversary International Conference on Formal Power Series and Algebraic Combinatorics FPSAC'03 June 23 - 27, 2003 Linkping University (Sweden) Group picture of FPSAC'03 White paper of FPSAC'03 First Announcement Second announcement Third announcement Summerschool Chairmans song Posters in PDF-format click here This page is update by Carina Appelskog 2004-02-26
BCC19
The 19th British Combinatorial Conference. Bangor, Wales, UK; 29 June -- 4 July 2003.
BCC19 Home Page University of Wales, Bangor - School of Informatics BCC19 Home Page 19th British Combinatorial Conference Sunday 29 June - Friday 4 July, 2003 Facilities for delegates Arrival arrangements (revised 25th June) Invitation to Bangor and Poster The 9 Invited Speakers, their Titles and Abstracts Contributed talks (plus instructions to authors) Registration information Booking form (plus links to some local hotels ). Programme D.E. Littlewood's Obituary by A.O.~Morris and C.C.H.~Barker {\it Bull. London Math. Soc.} {\bf 15} (1983) 56-69 (reproduced by permission of the London Mathematical Society). BCC Links to Combinatorics pages; other conferences; etc. Bangor views - - Tourism Links - - Travel Links - - Local walks Conference concert - - Excursions Financial Support - - from the London Mathematical Society and the Institute of Combinatorics and its Applications. (20 11 03) Film of Brendan McKay's contributed talk appears briefly in the BBC Horizon programme The Bible Codes . (20 06 03) List of Delegates and schedule of Contributed Talks . (17 06 03) See the Travel Links page for rail and fery timetables. (16 06 03) Library, Sports Centre, and Computing facilities . Local Organiser: Chris Wensley e-mail: bcc2003@informatics.bangor.ac.uk Address: 19th British Combinatorial Conference, School of Informatics, University of Wales, Bangor, Dean Street, Bangor, North Wales, LL57 1UT, U.K. Web: http: www.informatics.bangor.ac.uk public mathematics bcc2003 Tel: + 44 (0) 1248 382686 Fax: + 44 (0) 1248 361429 School of Informatics home page Mathematics home page U. W. Bangor home page Latest modification to this page: 21 11 03
Postgraduate Combinatorial Conference 2003
University of Nottingham, UK; 25--27 March 2003.
Postgraduate Combinatorial Conference 2003 14th Postgraduate Combinatorial Conference 25th - 27th March 2003, University of Nottingham -Home- Register Information Programme Photos Maps Links Contact Invited Speakers: Jan van den Heuvel London School of Economics Fred Piper Royal Holloway, University of London John Talbot University of Oxford Use the links on the left for more information about the conference. Photos from the conference are now available.
BCC - Past Conferences
This page provides information about each of the BCC series of conferences.
BCC - Past Conferences British Combinatorial Conferences British Combinatorial Conferences are currently held every two years, and are run by the British Combinatorial Committee . This page provides information about each of the conferences. You can also read an article by Norman Biggs on "British Combinatorics in Ancient Times (1969 - 1977)" , reproduced from the 1997 British Combinatorial Bulletin. (BCC1) University of Oxford, 7-10 July 1969 (BCC2) Royal Holloway College, London, 4-10 July 1971 (BCC3) University of Oxford, 3-7 July 1972 BCC(4) University College of Wales, Aberystwyth, 2-6 July 1973 BCC5 University of Aberdeen, 14-18 July 1975 BCC6 Royal Holloway College, London, 11-15 July 1977 BCC7 University of Cambridge, 13-17 August 1979 BCC8 University College, Swansea, 20-24 July, 1981 BCC9 University of Southampton, 11-15 July, 1983 BCC10 University of Glasgow, 22-26 July, 1985 BCC11 Goldsmiths College, London, 13-17 July, 1987 BCC12 University of East Anglia, Norwich, 3-7 July 1989 BCC13 University of Surrey, Guildford, 8-12 July 1991 BCC14 University of Keele, 5-9 July 1993 BCC15 University of Stirling, 3-7 July 1995 BCC16 Queen Mary and Westfield College, London, 7-11 July, 1997 BCC17 University of Kent at Canterbury, 12-16 July, 1999 BCC18 University of Sussex, Brighton, 2-6 July, 2001 BCC19 University of Wales, Bangor, 30 June - 4 July, 2003 BCC20 University of Durham, 11-15 July, 2005 (organised jointly with the Open University) BCC21 University of Reading, 9-13 July, 2007 Details Conference on Combinatorial Mathematics and its Applications University of Oxford, 7-10 July 1969 75 participants. List of talks Proceedings: Combinatorial Mathematics and its Applications. Edited by D. J. A. Welsh. Academic Press, London New York, 1971. x+364 pp. Back to list of conferences Royal Holloway College, London, 4-10 July 1971 17 participants. List of talks No proceedings published. Back to list of conferences Conference on Combinatorial Mathematics University of Oxford, 3-7 July 1972 41 participants. List of talks Proceedings: Combinatorics. Edited by D. J. A. Welsh and D. R. Woodall. The Institute of Mathematics and its Applications, Southend-on-Sea, 1972. x+363 pp. Back to list of conferences British Combinatorial Conference University College of Wales, Aberystwyth, 2-6 July 1973 86 participants. Invited talks: H. Lneburg, Affine planes of rank 3 C. St. J. A. Nash-Williams, The denumerably infinite case of the marriage problem W. T. Tutte, Some polynomials associated with graphs J. H. van Lint, Equidistant point sets Published in: Combinatorics. Edited by T. P. McDonough and V. C. Mavron. London Mathematical Society Lecture Note Series, 13. Cambridge University Press, Cambridge, 1974. v+204 pp. The talks by H. Lneburg and C. St. J. A. Nash-Williams do not appear in this volume. List of contributed talks Contributed papers: In same volume. Back to list of conferences 5th British Combinatorial Conference University of Aberdeen, 14-18 July 1975 117 participants. Invited talks: C. Berge, A theorem related to the Chvatal conjecture G. A. Dirac, Structural properties and circuits in graphs P. Erds, Problems and results in graph theory and combinatorial analysis F. Harary, The foremost open problems in generalized Ramsey theory L. Lovsz, Covers, packings, and some heuristic algorithms R. Rado, The selection of disjoint subsets of given sets W. T. Tutte, The dichromatic polynomial R. M. Wilson, Decompositions of complete graphs into subgraphs isomorphic to a given graph E. M. Wright, The asymptotic enumeration of unlabelled graphs W. T. Tutte was unable to give his talk. Published in: Proceedings of the Fifth British Combinatorial Conference. Edited by C. St.J. A. Nash-Williams and J. Sheehan. Congressus Numerantium, No. XV. Utilitas Mathematica Publishing, Inc., Winnipeg, Man., 1976. viii+96 pp. List of contributed talks Contributed papers: In same volume. Back to list of conferences 6th British Combinatorial Conference Royal Holloway College, London, 11-15 July 1977 209 participants. Invited talks: F. Buekenhout, What is a subspace? Peter J. Cameron, Extensions of designs: variations on a theme J. Conway, Graphical Games with Pieces P. W. Kasteleyn, Phases on Countable Graphs L. Lovsz, Flats in matroids and geometric graphs D. K. Ray-Chaudhuri, Combinatorial characterization theorems for geometric incidence structures N. J. A. Sloane, Binary codes, lattices and sphere-packing A. T. White, Graphs of groups on surfaces D. R. Woodall, Zeros of chromatic polynomials Published in: Combinatorial Surveys. Edited by Peter J. Cameron. Academic Press, London New York, 1977. vii+226 pp. ISBN 0-12-157150-5. The talks by J. Conway and P. W. Kasteleyn do not appear in this volume. List of contributed talks No contributed papers volume. Back to list of conferences 7th British Combinatorial Conference University of Cambridge, 13-17 August 1979 159 participants. Invited talks: N. L. Biggs, Resonance and reconstruction A. Gardiner, Symmetry conditions in graphs D. J. Kleitman, Extremal hypergraph problems W. Mader, Connectivity and edge-connectivity in finite graphs Vojtech Rdl (speaker) and Jaroslav Nesetril, Partition theory and its applications J. J. Seidel, Strongly regular graphs J. A. Thas, Geometries in finite projective and affine spaces Carsten Thomassen, Long cycles in digraphs with constraints on the degrees Dominic Welsh, Colouring problems and matroids Vojtech Rdl was unable to attend. Published in: Surveys in Combinatorics. Edited by Bla Bollobs. London Mathematical Society Lecture Note Series, 38. Cambridge University Press, Cambridge, 1979. vii+261 pp. ISBN 0-521-22846-8 List of contributed talks No contributed papers volume. Back to list of conferences 8th British Combinatorial Conference University College, Swansea, 20-24 July, 1981 86 participants. Invited talks: Lszl Babai, On the abstract group of automorphisms Lowell W. Beineke, A tour through tournaments or bipartite and ordinary tournaments: a comparative survey Bla Bollobs, Random graphs R. L. Graham (speaker) and F. R. K. Chung, Recent results in graph decompositions F. J. MacWilliams, Some connections between designs and codes Fred Piper (speaker) and Henry Beker, Shift register sequences R. W. Robinson, Counting graphs with a duality property G. C. Shephard (speaker) and Branko Grnbaum, The geometry of planar graphs John G. Thompson, Ovals in a projective plane of order 10 John G. Thompson was unable to attend. Published in: Combinatorics. Edited by H. N. V. Temperley. London Mathematical Society Lecture Note Series, 52. Cambridge University Press, Cambridge, 1981. iii+190 pp. ISBN 0-521-28514-3 List of contributed talks No contributed papers volume. Back to list of conferences 9th British Combinatorial Conference University of Southampton, 11-15 July, 1983 182 participants. Invited talks: J.-C. Bermond (speaker), J. Bond, M. Paoli and C. Peyrat, Graphs and interconnection networks: diameter and vulnerability J. M. Hammersley, The friendship theorem and the love problem J. W. P. Hirschfeld, Maximum sets in finite projective spaces C. C. Lindner, Quasigroup identities and orthogonal arrays A. Schrijver, Bounds on permanents, and the number of 1-factors and 1-factorizations of bipartite graphs J. Sheehan, Redfield discovered again Ernest Shult, Characterizations of the Lie incidence geometries V. T. Ss, Irregularities of partitions: Ramsey theory, uniform distribution R. P. Stanley, GL(n,C) for combinatorialists Published in: Surveys in Combinatorics. Edited by E. Keith Lloyd. London Mathematical Society Lecture Note Series, 82. Cambridge University Press, Cambridge, 1983. xi+256 pp. ISBN 0-521-27552-0 List of contributed talks Contributed papers: Ars Combinatoria 16A 16B (1983) Back to list of conferences 10th British Combinatorial Conference University of Glasgow, 22-26 July, 1985 173 participants. Invited talks: George E. Andrews, Combinatorics and Ramanujan's "lost" notebook Jozsef Beck, Irregularities of distribution and combinatorics H. J. Beker, Adaptive algorithms for communications G. R. Grimmett, Random flows: network flows and electrical flows through random media A. J. Hoffman, On greedy algorithms that succeed C. St. J. A. Nash-Williams, Detachments of graphs and generalised Euler trails (The Richard Rado lecture) P. D. Seymour (speaker) and Neil Robertson, Graph minors---a survey J. Tits, On building buildings J. H. van Lint, {0,1,*} distance problems in combinatorics H. J. Beker was unable to attend. His talk was delivered by E. V. Stansfield. Published in: Surveys in Combinatorics, 1985. Edited by Ian Anderson. London Mathematical Society Lecture Note Series, 103. Cambridge University Press, Cambridge, 1985. vi+173 pp. ISBN 0-521-31524-7 The talk by J. Tits does not appear in this volume. List of contributed talks Contributed papers: Ars Combinatoria 20 (1985) Back to list of conferences 11th British Combinatorial Conference Goldsmiths College, London, 13-17 July, 1987 260 participants. Invited talks: A. Barlotti, Finite geometries and designs P. J. Cameron, Portrait of a typical sum-free set V. Chvtal, Perfect graphs Paul Erds, My joint work with Richard Rado (The Richard Rado lecture) Peter Frankl, The shifting technique in extremal set theory E. C. Milner (speaker) and K. Prikry, Almost disjoint sets V. Rdl (speaker) and R. L. Graham, Numbers in Ramsey theory Andrew Thomason, Random graphs, strongly regular graphs and pseudorandom graphs Peter Winkler, The metric structure of graphs: theory and applications Published in: Surveys in Combinatorics, 1987. Edited by C. Whitehead. London Mathematical Society Lecture Note Series, 123. Cambridge University Press, Cambridge, 1987. vii+226 pp. ISBN 0-521-34805-6 List of contributed talks Contributed papers: Ars Combinatoria 25 (1988) Back to list of conferences 12th British Combinatorial Conference University of East Anglia, Norwich, 3-7 July 1989 260 participants. Invited talks: E. F. Assmus, Jr., On the theory of designs R. A. Bailey, Designs: mappings between structured sets Walter A. Deuber, Developments based on Rado's dissertation "Studien zur Kombinatorik" (The Richard Rado lecture) Jean Doyen, Designs and automorphism groups A. M. Frieze, On matchings and Hamilton cycles in random graphs Roland Hggkvist, Decompositions of complete bipartite graphs Colin McDiarmid, On the method of bounded differences L. Teirlinck, On the use of regular arrays in the construction of t-designs Herbert S. Wilf, The "snake oil" method for proving combinatorial identities Published in: Surveys in Combinatorics, 1989. Edited by Johannes Siemons. London Mathematical Society Lecture Note Series, 141. Cambridge University Press, Cambridge, 1989. viii+217 pp. ISBN 0-521-37823-0 List of contributed talks Contributed papers: Ars Combinatoria 29 (1990) Back to list of conferences 13th British Combinatorial Conference University of Surrey, Guildford, 8-12 July 1991 201 participants. Invited talks: J. A. Bondy, A graph reconstructor's manual Zoltan Fredi, Turan type problems (The Richard Rado lecture) S. W. Golomb, Construction of signals with favourable correlation properties G. Korchmros, Old and new results on ovals in finite projective planes I. G. Macdonald, Schubert polynomials Rudolf Mathon, Computational methods in design theory Jaroslav Nesetril (speaker) and Martin Loebl, Fast and slow growing (a combinatorial study of unprovability) Oliver Pretzel, Orientations and edge functions on graphs P. Rowlinson, Graph perturbations Published in: Surveys in Combinatorics, 1991. Edited by A. D. Keedwell. London Mathematical Society Lecture Note Series, 166. Cambridge University Press, Cambridge, 1991. vi+300 pp. ISBN 0-521-40766-4 List of contributed talks Contributed papers: Discrete Mathematics 125 (1994) Edited by D. R. Woodall. Back to list of conferences 14th British Combinatorial Conference University of Keele, 5-9 July 1993 208 participants. Invited talks: Noga Alon, Restricted colorings of graphs (The Richard Rado lecture) Aart Blokhuis, Polynomials in finite geometries and combinatorics Graham Brightwell, Models of random partial orders Andrs Frank, Applications of submodular functions Anthony J. W. Hilton (speaker) and Jerzy Wojciechowski, Weighted quasigroups A. A. Ivanov, Graphs with projective subconstituents which contain short cycles Bill Jackson, On circuit covers, circuit decompositions and Euler tours of graphs Michael E. Saks, Slicing the hypercube D. R. Stinson, Combinatorial designs and cryptography Published in: Surveys in Combinatorics, 1993. Edited by Keith Walker. London Mathematical Society Lecture Note Series, 187. Cambridge University Press, Cambridge, 1993. vi+287 pp. ISBN 0-521-44857-3 List of contributed talks Contributed papers: Discrete Mathematics 138 (1995) Edited by D. R. Woodall, I. Anderson, J. W. P. Hirschfeld, J. Sheehan and A. G. Thomason. Back to list of conferences 15th British Combinatorial Conference University of Stirling, 3-7 July 1995 235 participants. Invited talks: C. D. Godsil, Euclidean geometry of distance regular graphs Ray Hill, Searching with lies Franois Jaeger, Spin models for link invariants Mark Jerrum, Computational Polya theory Lszl Lovsz (speaker) and Peter Winkler, Mixing of random walks and other diffusions on a graph (The Richard Rado lecture) Alexander Lubotzky, Cayley graphs: eigenvalues, expanders and random walks A. Rosa (speaker) and T. S. Griggs, Large sets of Steiner triple systems Edward Spence, Construction and classification of combinatorial designs Joel Spencer, Modern probabilistic methods in combinatorics Edward Spence was unable to attend. His talk was replaced by: Willem Haemers, Eigenvalues and regularity of graphs Published in: Surveys in Combinatorics, 1995. Edited by Peter Rowlinson. London Mathematical Society Lecture Note Series, 218. Cambridge University Press, Cambridge, 1995. viii+231 pp. ISBN 0-521-49797-3 The talk by Willem Haemers does not appear in this volume. List of contributed talks Contributed papers: Discrete Mathematics 167 168 (1997) Edited by D. R. Woodall, I. Anderson, J. W. P. Hirschfeld, J. Sheehan and C. A. Whitehead. Back to list of conferences 16th British Combinatorial Conference Queen Mary and Westfield College, London, 7-11 July, 1997 320 participants. Invited talks: J. H. Conway, M13 Keith Edwards, The harmonious chromatic number and the achromatic number Clement Lam, Computer construction of block designs Cheryl E. Praeger, Finite quasiprimitive graphs B. A. Reed, Tree width and tangles: a new connectivity measure and some applications Alexander Schrijver, Minor-monotone graph invariants T. Sznyi, Some applications of algebraic curves in finite geometry and combinatorics William T. Trotter, New perspectives on interval orders and interval graphs Dominic Welsh, Approximate counting (The Richard Rado lecture) Published in: Surveys in Combinatorics, 1997. Edited by R. A. Bailey. London Mathematical Society Lecture Note Series, 241. Cambridge University Press, Cambridge, 1997. xiv+338 pp. ISBN 0-521-59840-0 List of contributed talks Contributed papers: Discrete Mathematics 197 198 (1999) Edited by D. R. Woodall, I. Anderson, G. R. Brightwell, J. W. P. Hirschfeld, P. Rowlinson, J. Sheehan and D. H. Smith. Conference website Back to list of conferences 17th British Combinatorial Conference University of Kent at Canterbury, 12-16 July, 1999 260 participants. Invited talks: Simeon Ball, Polynomials in finite geometries Charles Colbourn (speaker), Jeff Dinitz and Doug Stinson, Applications of combinatorial designs to communications, cryptography and networking Martin Dyer (speaker) and Catherine Greenhill, Random walks on combinatorial objects Klaus Metsch, Bose-Burton type theorems for finite projective, affine and polar spaces Jnos Pach, Geometric graph theory Robin Thomas, Recent excluded minor theorems for graphs Carsten Thomassen, Parity, cycle space and K4-subdivisions in graphs W. T. Tutte, The Coming of the Matroids (The Richard Rado lecture) Nick Wormald, Models of random regular graphs Published in: Surveys in Combinatorics, 1999. Edited by J.D.Lamb and D.A.Preece. London Mathematical Society Lecture Note Series, 267. Cambridge University Press, Cambridge, 1999. x+298 pp. ISBN 0-521-65376-2 Special Lecture Brendan McKay, *nauty* Public Lecture Brendan McKay, The Bible codes: Fact or Fallacy List of contributed talks Contributed papers: Discrete Mathematics 231 (2001) Edited by D. R. Woodall, R. A. Bailey, K. J. Edwards, T. S. Griggs, E. K. Lloyd and C. J. H. McDiarmid. Back to list of conferences 18th British Combinatorial Conference University of Sussex, Brighton, 2-6 July, 2001 222 participants. Invited talks: M. Aigner, The Penrose polynomial of graphs and matroids (The Richard Rado Lecture) I. Anderson, Some cyclic and 1-rotational designs A. R. Calderbank (speaker) and A. F. Naguib, Orthogonal designs and third generation wireless communication L. A. Goldberg, Computation in permutation groups: counting and randomly sampling orbits B. Mohar, Graphs on surfaces and graph minors M. S. O. Molloy, Thresholds for colourability and satisfiability in random graphs and boolean formulae J. G. Oxley, The interplay between graphs and matroids J. A. Thas, Ovoids, spreads and m-systems of finite classical polar spaces D. R. Woodall, List colourings of graphs (The Nash-Williams Memorial Lecture) Published in: Surveys in Combinatorics, 2001. Edited by J.W.P.Hirschfeld. London Mathematical Society Lecture Note Series, 288. Cambridge University Press, Cambridge, 2001. x+301 pp. ISBN 0-521-00270-2 List of contributed talks Contributed papers: Discrete Mathematics 266 (2003) Edited by D. R. Woodall, D. Bedford, A. R. Camina, K. J. Edwards, T. S. Griggs, and A. G. Thomason. Conference website Back to list of conferences 19th British Combinatorial Conference University of Wales, Bangor, 30 June - 4 July, 2003 190 participants. Invited talks: Lars Andersen (speaker) and C. A. Rodger, Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgamations Simon Blackburn, Combinatorial schemes for protecting digital content Alexandre Borovik, Matroids and Coxeter groups Pavol Hell, Algorithmic aspects of graph homomorphisms Dieter Jungnickel (speaker) and Dina Ghinelli, Finite projective planes with a large abelian group Imre Leader, Partition Regular Equations (The Richard Rado Lecture) Arun Ram (speaker) and Kendra Nelsen Kostka-Foulkes poylnomials and Macdonald spherical functions (The Littlewood Anniversary Lecture) Anne Penfold Street (speaker), D. M. Donovan, E. S. Mahmoodian and C. Ramsay, Defining sets in combinatorics: a survey Gnter Ziegler (speaker) and Volker Kaibel, Counting lattice triangulations Published in: Surveys in Combinatorics, 2003. Edited by C.D.Wensley. London Mathematical Society Lecture Note Series, 307. Cambridge University Press, Cambridge, 2003. vii+370 pp. ISBN 0-521-54012-7 List of contributed talks Contributed papers: Discrete Mathematics 293 (2005) Edited by D. R. Woodall, F. K. Bell, K. J. Edwards, T. S. Griggs, and S. Perkins. Conference website Back to list of conferences 20th British Combinatorial Conference University of Durham, 11-15 July, 2005 Organised jointly with the Open University 240 participants. Invited talks: Ben Green, Finite field models in additive combinatorics Oliver King, The subgroup structure of finite classical groups in terms of geometric configurations Patric stergrd, Constructing combinatorial objects via cliques Tim Penttila Flocks of circle planes Alex Scott, Judicious partitions and related problems (The Richard Rado Lecture) Oriel Serra, An isoperimetric method for the small subset problem Paul Seymour (speaker) and Maria Chudnovsky, The structure of claw-free graphs Alan Sokal, The multivariate Tutte polynomial (alias Potts model) for graphs and matroids Angelika Steger (speaker) and Stefanie Gerke, The sparse regularity lemma and its applications Published in: Surveys in Combinatorics, 2005. Edited by B.S.Webb. London Mathematical Society Lecture Note Series, 327. Cambridge University Press, Cambridge, 2005. vii+258 pp. ISBN 0-521-61523-2 List of contributed talks Contributed papers: To be published in Discrete Mathematics Conference website Back to list of conferences 21st British Combinatorial Conference University of Reading, 9-13 July, 2007 Preliminary information about the 21st BCC can be obtained from the conference website . Back to list of conferences Note that the lists of contributed talks are only approximations to the truth; they were compiled from the books of abstracts and whatever other information was available. Please email me if you know of any errors in this list. I would like to thank all those who provided information for this list. Keith Edwards Updated 1 November 2005
Permutation Patterns
University of Otago, Dunedin, New Zealand; 10--14 February 2003.
Conference on Permutation Patterns: First Announcement Conference on Permutation Patterns 10 - 14 February, 2003 University of Otago Dunedin New Zealand SECOND ANNOUNCEMENT NOW AVAILABLE FIRST ANNOUNCEMENT The unifying theme of the conference is permutation patterns. The topics addressed will include enumeration questions, excluded pattern questions, study of the involvement order, algorithms for computing with permutation patterns, applications and generalisations of permutation patterns, and others. The keynote speaker will be Herbert Wilf . The registration fee will be $100 NZ for registration by 1 November 2002 , and $150 thereafter. Extended abstracts (at most 6 pages) of papers to be presented at the conference should be sent to the Program Chair by 31 December 2002. To mark the conference a special issue of the Electronic Journal of Combinatorics is planned on the theme of Permutation Patterns. Articles for this issue are sought from researchers whether or not they plan to attend the conference and can be submitted to the editors of the special issue at any time before 31 May 2003. All such submissions will be refereed carefully and only those meeting the high standard of E-JC will be published in the special issue. The conference will be hosted by the Otago Computer Science Theory Group within the Department of Computer Science at the University of Otago . The University, which is the oldest in New Zealand, is in the town of Dunedin which is situated on the coast of the South Island of New Zealand. The surrounding countryside is exceptionally beautiful and in February the weather is generally mild and sunny. Aside from the academic program we plan a full social program that will give participants an opportunity to enjoy the location. Participants will be accommodated in nearby motels and university residences, all within walking distance. Program Chair: Michael Albert Special issue E-JC Editors: Mike Atkinson , Derek Holton
Finite Geometries
Kloster Irsee, Germany; 16--21 February 2003.
Finite Geometries - First Irsee Conference Finite Geometries First Irsee Conference Sunday 16 to Friday 21 February 2003 Organisers: Aart Blokhuis, James Hirschfeld, Dieter Jungnickel, Jef Thas Conference web site http: www.math.uni-augsburg.de fingeom03 Dear Colleague, We invite you to participate in this research workshop and, if you wish, to give a talk of 20 minutes on some aspect of your research related to the main topics of this workshop, which extends the series that began with the meeting at the Isle of Thorns in July 2000 and continued with the Oberwolfach meeting in December 2001. As before, the conference topics are Combinatorial structures in finite projective spaces; Algebraic curves over finite fields; Geometric and algebraic coding theory; Finite groups and geometries; Algebraic design theory. Main speakers Arrigo Bonisoli Matthew Brown Hans Dobbertin Gary Ebert Ernest Shult Felipe Voloch Additional Information List of Participants updated: Jan.20, 2003 Timetable: Download as PS-file or Download as PDF-file new: Jan. 7, 2003 Travel information updated: Jan. 24, 2003 Abstracts: Download as PS-file or Download as PDF-file new: Jan. 24, 2003 Venue The conference will take place at Kloster Irsee , an early 18th century monastery which has been transformed into a high class conference centre, preserving many of the original late baroque features, including a beautiful church. It is set in the attractive little town of Irsee in the northern part of the Allgu, a few kilometres from Kaufbeuren. The facilities include a bar (in the historic cellars and serving the local Klosterbru beer), table tennis, pool table, etc. Travel Irsee is about 7 kilometres from Kaufbeuren, which has direct train connections to both Augsburg and Munich; from Kaufbeuren it is simplest to take a taxi. It would be advisable to fly into Munich airport ; we might also be able to arrange a direct bus transport from there at a reasonable price. By car, Irsee is easily accessible from the Stuttgart-Munich and the Lindau-Munich motorways. Accommodation Kloster Irsee has 62 single rooms and 19 double rooms; so we would be able to accommodate a few accompanying persons. The rooms have all modern amenities: all are en-suite, with phones, minibar and the possibility of internet connection, but excluding TV which is only available on special request. Duration Arrival time is from 3 p.m. on Sunday 16 February. The first session will begin on Monday morning and the last session will end before dinner Friday 21 February. Participants are expected to leave Saturday morning; we can also arrange for a limited number of rooms to be available till Sunday morning. Cost The conference fee is 150 Euro (reduced to 100 Euro for accompanying persons); this includes the proceedings volume, the formal conference dinner and a Bavarian evening in the cellars. Accommodation and all meals will come to 720 Euro in a single room, and to 630 Euro in a double room. However, it is hoped to subsidise this for some or all participants, depending on the outcome of grant applications. Abstracts Please submit by 10 November 2002 an abstract of between one half and a whole page, in LaTeX, modifying the attached sample file . Abstracts should be sent to James by e-mail as below. Response We would be grateful for a reply by 1 July 2002. If you wish to book a double room, please indicate with whom you want to share it. Payment for both the conference fee and accommodation should be made by credit card and will be processed via the Kloster Irsee administration. If you intend to come please fill in the attached registration form (including your credit card information); your card will only be charged shortly before the conference. If credit card information is sent by email, the message will be deleted immediately afterwards. We have to confirm the final number of rooms needed by Christmas 2002; till then, there is no penalty for cancellation. In case of cancellation between 1 January 2003 and 14 February 2003, Kloster Irsee will charge 50 % of the accommodation costs; in case of cancellation after 14 February, the entire cost will be charged. Hence we can only waive the registration fee in such cases. By sending in your registration, you agree to these conditions. Please send all correspondence other than the abstract, to Dieter, either by email as below, or to Prof. Dr. Dieter Jungnickel Lehrstuhl fr Diskrete Mathematik Universitt Augsburg D-86135 Augsburg Germany For any questions, consult any one of the organisers. Aart: aart@win.tue.nl James: jwph@susx.ac.uk Dieter: jungnickel@math.uni-augsburg.de Jef: jat@cage.rug.ac.be Hoping to see you at Irsee, Aart, James, Dieter, Jef Sponsors Deutsche Forschungsgemeinschaft , Bonn Gesellschaft der Freunde der Universitt Augsburg The Institute of Combinatorics and Its Applications, Winnipeg, Canada Petra Huhn, updated: January 24, 2003
One-Day Meeting in Combinatorics
University College London, UK; Wednesday 5 February 2003.
UCL The Department of Mathematics The Department The Department Events Where to find us History and background Links Home One-Day Meeting in Combinatorics Wednesday 2 February 2005 10.30 am Coffee 11.00 am Stphan Thomass (Lyon) Dense triangle-free graphs are four chromatic 11.55 am Jeffrey Steif (Chalmers) An application of analysis to theoretical computer science: Coin flipping protocols 12.50 pm Lunch 2.15 pm Gnter Ziegler (Berlin) Matrices, Gale diagrams, and polyhedral surfaces of high genus 3.10 pm Alexander Schrijver (Amsterdam) New code bounds from the Terwilliger algebra and semidefinite programming 4.05 pm Tea 4.30 pm Dominic Welsh (Oxford) Random graphs from planar and other addable families The meeting will take place in Room 505, Department of Mathematics, University College London. Anyone interested is welcome to attend. Some funds may be available to contribute to the expenses of research students who wish to attend the meeting. Further details can be obtained from Alex Scott, tel: 020-7679-2128, email: scott@math.ucl.ac.uk. Support for this event by the London Mathematical Society and the British Combinatorial Committee is gratefully acknowledged.
27ACCMCC
27th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing. The University of Newcastle, Australia; 9--13 December 2002.
27ACCMCC 27ACCMCC 27th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing The University of Newcastle 9-13 December, 2002 You can now view photos from the conference here . Participants are encouraged to submit papers based on their talks at 27ACCMCC to the Australasian Journal of Combinatorics (AJC). Papers should be submitted at or immediately after the conference, and will undergo a normal refereeing process. Papers will most likely appear in March 2004. Each conference participant will receive a copy of this volume of AJC for free. Topics Invited Talks Program Venue Location Accommodation Links Submitted Abstracts Prizes Journal Papers Organisation Enquiries Photos Copyright 2002 Site maintained by Richard Webber Last Updated: 18 Dec 2002 Comments
Discrete Mathematics and its Applications
Instructional Workshop and Symposium on the occasion of the centenary of the birth of Professor Raj Chandra Bose. Kolkata, India; 15--19 and 20--23 December 2002.
R. C. BOSE CENTENARY WORKSHOP AND SYMPOSIUM ON DISCRETE MATHEMATICS AND APPLICATIONS First Announcement The Indian Statistical Institute is organizing an Instructional Workshop and a Symposium on Discrete Mathematics and its Applications at Kolkata during December, 2002 on the occasion of the birth centenary of Professor Raj Chandra Bose who made epoch-making contributions to various branches of Mathematics and Statistics. Second Announcement
Design in Combinatorics and Statistics
An LMS EPSRC Short Course. Queen Mary College, University of London, UK; 9--13 September 2002.
Design in Combinatorics and Statistics Design in Combinatorics and Statistics LMS EPSRC Short Course Queen Mary, University of London, 9-13 September 2002 A Short Course entitled "Design in Combinatorics and Statistics" was held at Queen Mary, University of London , in the week 9-13 September 2002. The course was sponsored by the London Mathematical Society and the Engineering and Physical Sciences Research Council . The course was organised by R. A. Bailey, Peter J. Cameron and Sharon Woolf. You can read the course description or the list of participants here. Some pictures taken by Maylin Wartenburg are also available. Peter J. Cameron 25 September 2002. Design Theory Pages at Queen Mary: DesignTheory.org | Resources | Lecture Notes | Design Research Group | Maths Research Centre Semi-Latin squares | Neighbour-balanced designs | Partial Spreads | SOMAs | Permutation groups Encyclopaedia of Design Theory (under construction)
ECCO 2002
XV-th Conference of the European Chapter on Combinatorial Optimisation. Lugano, Switzerland; 30 May -- 1 June 2002.
ECCO XV, 2002 ECCO XV Organised by the European Chapter on Combinatorial Optimisation Theme Keynotes Organization Book of Abstracts List of participants Social events Special EJOR issue Venue Accommodation How to get to Lugano Deadlines Instruction to Authors Registration Home XV Conference of the European Chapter on Combinatorial Optimisation 30 May - 1 June 2002 Lugano, Switzerland Thank you! The program committee and the local organising committee would like to thank all the participants who have attended ECCO XV and who have made it possible thanks to their scientific contributions. We all hope to meet you again next year at ECCO XVI, which will be announced shortly (some off-the-record voices advise to prepare some warm clothes and head North...). ...and to remember your visit to Lugano, Ivo Bloechliger has put online some photos ... (thanks to Ivo for the excellent reportage) Organised by: the European Chapter on Combinatorial Optimisation Local organisers: IDSIA (Istituto Dalle Molle di studi sull'Intelligenza Artificiale) SUPSI (University of Applied Sciences of Southern Switzerland) USI (University of Lugano) In collaboration with: Swiss Operations Research Society AntOptima The city of Lugano This website is hosted by IDSIA - Last Update: 13 March 2002
Combinatorics, Graph Theory and Applications
Hong Kong University of Science and Technology; 15--17 August 2002.
Satellite Conference of ICM-2002 Combinatorics, Graph Theory and Applications Satellite Conference of ICM-2002 15-17 August 2002 Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong The conference is to provide an opportunity for people to discuss the most recent ideas and advances in combinatorics and graph theory. Topics range from traditional problems to new directions, applications, and interactions with other fields. Confirmed Speakers: Noga Alon Tel Aviv, Israel Bela Bollobas Cambridge, UK; Memphis, USA Christian Borgs Microsoft, USA Jennifer Chayes Microsoft, USA W.T. Gowers Cambridge, UK; Princeton, US Gyula Katona Renyi Institute, Budapest, Hungary Laszlo Lovasz Microsoft, USA Oliver Riordan Trinity College, UK Miklos Simonovits Renyi Institute, Budapest, Hungary Endre Szemeredi Rutgers, USA Andrew Thomason Cambridge, UK More speakers are awaited for confirmation. Organizers: Bela Bollobas Cambridge, UK; Memphis, USA Beifang Chen HKUST, Hong Kong Email: mabfchen@ust.hk Fax: (852) 2358-1643 The Programs DVI version PostScript version Other Information All presentations will take place in Lecture Theatre C, a few minutes walk from the accommodation. Sports facilities on campus include an outdoor swimming pool, Squash courts, table-tennis, etc., and are available to those staying on-campus. There is a small supermarket, an ATM that should allow you to get money from your credit card, and various restaurants on campus. More information on the conference site, including detailed information on how to get there, is available in our local guide . HKUST is a bit far from the trendy tourist areas of Hong Kong (at least 30 minutes by taxi, or 45-60 minutes by bus and underground), and so we would recommend staying on-campus. If you don't mind the commute, or if you wish to extend your stay, there is no shortage of hotels in Hong Kong, and current room rates are quite reasonable. The Hong Kong Tourist Association maintains a good list of hotels , and many hotels can even be booked on-line. Typical tourist areas are Tsim Sha Tsui or Tsim Sha Tsui East . If you wish to stay on Hong Kong Island or in the New Territories, consider that the morning traffic will mean that you'll have to get up early to make it to the first session. There are two hotels selected by Dr. BF Chen for your reference. You can contact them directly (quoting the conference name) by email or fax for reservation. You can obtain detail accommodation in HKUST Campus at our web site: http: www.ab.ust.hk cso home_vc_frame.htm The registration desk will be open on Thursday, 15 August 2002 9:00am-3:0pm in front of Lecture Theatre C , and on Friday, 16 August 2002 9:00am-12:00am at the same place.
COCOON 2002
The Eighth Annual International Computing and Combinatorics Conference. Singapore; 15--17 August 2002.
The Eighth Annual International Computing and Combinatorics Conference \HTML
2002 SIAM Conference on Discrete Mathematics
San Diego, CA, USA; 11--14 August 2002.
2002 SIAM Conference on Discrete Mathematics
SIGMAC '02
Second Workshop on Symmetries in Graphs, Maps and Complexes. Aveiro, Portugal; 15--19 July 2002.
SIGMAC '02 This page uses frames, but your browser doesn't support them.
Korea-Hungary Joint Workshop on Combinatorics
POSTECH, Pohang, Korea; 5--7 July 2002.
index Workshop Theme and Purpose Conference Program Revised Program (html) Invited Speaker Registered Speaker and Abstract Conference Proceedings Location and Travel Information Organizing Committee and Conference Director Registration Information On-line Registration Accomodations RevisedArrangement(html) Abstract Answers for frequently asked que stion s (Mirror) 2002 Korea-Hungary Joint Workshop, July 5-7, 2002 and You may also be interested in participating Com 2 MaC Conference on Graphs and Combinatorics, July 8-10, 2002 Suggested Arrival day (Evening of July 4) and Departure day(July 10 or 11), 2002 * Conference Poster * Current Wheather Map in Korea Copyright 2002, Made by sglee@math.skku.ac.kr , All rights reserved Photos of 2001 Hungary-Korean JointWorkshop on Combinatorics Special Session on Education for Gifted Students, July 7th Updated on June 20th Revised Program Update! ( html ) Revised Accomodation Plan (html)
Graphs and Combinatorics
POSTECH, Pohang, Korea; 8--10 July 2002.
Com2MaC Conference Com2MaC Conference on Graphs and Combinatorics July 8-10(Mon-Wed), 2002 POSTECH, Pohang, Korea Purpose The conference is aimed at bringing together researchers on all aspects of graphs including algebraic, combinatorial, probabilistic and topological approach to graph theory and their applications. It is intended to cover recent developments in these theories and related areas of mathematics as well as their applications. You may also be interested in participating 2002 Korea-Hungary joint workshop on Combinatorics July 5-7(Thur-Fri), 2002, POSTECH, Pohang, Korea organized by Jin Ho Kwak at POSTECH and Sang-Gu Lee at Sungkyunkwan University. The participants can join both confernces. Call for papers The conference will consists of an hour or 45 minutes-long plenary talks, and 25 minutes contributed talks. Abstracts, at most one page and typed in english, related to the topics of the conference are invited by May 31, 2002 (May 31, 2002 is also a Registration Due). The abstract should include: name(s) of author(s), affiliation(s), address of the contact person, phone and fax number, and e-mail address. Authors are kindly requested to submit their abstracts via e-mail in LaTeX (or AMS TeX) to one of the following conference organizer. Suh-Ryung Kim (Kyung Hee University srkim@khu.ac.kr ), Jaeun Lee (Yeungnam University julee@yu.ac.kr ), Han Hyuk Cho (Seoul National University hancho@snu.ac.kr ). Plenary speakers (will be added) Gyula Katona, Alfred Renyi Institute of Mathematics Hungarian Academy of Sciences, ohkatona@renyi.hu Ian Goulden, Department of Combinatorics and optimization, University of Waterloo, ipgoulde@math.uwaterloo.ca Dan Archdeacon, Department of Mathematics and Statistics, University of Vermont, archdeac@emba.uvm.edu Fred .R. McMorris, Department of Applied Mathematics, Illinois Institute of Technology, mcmorris@iit.edu Jeong Han Kim, Theory Group, Microsoft Research, jehkim@microsoft.com Henry Martyn Mulder, Econometrisch Instituut, Erasmus Universiteit, hmmulder@few.eur.nl Fred S. Roberts (tentative), Director of DIMACS, Department of Mathematics, Rutgers University, froberts@dimacs.rutgers.edu Vera T. Sos, Alfred R nyi Mathematical Institute, Hungarian Academy of Sciences, sos@renyi.hu Registered Participants (will be added) Prof. Sung-Jin Cho Division of Mathematical Sciences Pukyong National University Prof. Han-Doo Kim School of Computer Aided Science Inje University Prof. Un-Sook Choi Division of Mathematical Sciences Pukyong National University Title: Analysis of Trees of Complemented CA derived from a Linear TPMACA Prof. Iwao Sato Oyama National College of Technology Oyama, Tochigi 323-0806, Japan Tel+Fax: +81-285-22-3344 Title: "Zeta functions of oriented line graphs of graph coverings" Prof. Paul Bonnington Department of Mathematics Univ. of Auckland Private Bag 92019, Auckland, New Zealand Phone: +64-9-3737599 x6623 Prof. Katsuhiro Ota Department of Mathematics Keio University 3-14-1 Hiyoshi, Kohoku-Ku Yokohama 223-8522, Japan Tel+Fax: +81-45-566-1648 Prof. Nobuyuki Takahashi Department of Mathematics Keio University 3-14-1 Hiyoshi, Kohoku-Ku Yokohama 223-8522, Japan Prof. Seiya Negami Faculty of Education and Human Sciences Yokohama National University 79-2 Tokiwadai, Hodogaya-Ku, Yokohama 240-8501, Japan Tel+Fax: +81-45-339-3373 Prof. Atsuhiro Nakamoto Faculty of Education and Human Sciences Yokohama National University 79-2 Tokiwadai, Hodogaya-Ku, Yokohama 240-8501, Japan Tel+Fax: +81-45-339-3373 Prof. Kou Yamamoto Faculty of Education and Human Sciences Yokohama National University 79-2 Tokiwadai, Hodogaya-Ku, Yokohama 240-8501, Japan Tel+Fax: +81-45-339-3373 Mr.(Ms.) Akira Sasao Faculty of Education and Human Sciences Yokohama National University 79-2 Tokiwadai, Hodogaya-Ku, Yokohama 240-8501, Japan Tel+Fax: +81-45-339-3373 Mr.(Ms.) Ryuichi Mori Faculty of Education and Human Sciences Yokohama National University 79-2 Tokiwadai, Hodogaya-Ku, Yokohama 240-8501, Japan Tel+Fax: +81-45-339-3373 Mr.(Ms.) Yusuke Suzuki Department of Mathematics Keio University 3-14-1 Hiyoshi, Kohoku-Ku Yokohama 223-8522, Japan Tel+Fax: +81-45-566-1648 Mr.(Ms.) Kyoji Ohba Department of Mathematics Keio University 3-14-1 Hiyoshi, Kohoku-Ku Yokohama 223-8522, Japan Tel+Fax: +81-45-566-1648 Prof. Han Hyuk Cho, Department of Mathematics Education, Seoul National University, KOREA Mr. Seog-Jin Kim Department of Mathematics University of Illinois at Urbana-Champaign, USA Professor park Park San Ro, Department of Mathematics, POSTECH, KOREA Professor Sung Pyo Hong, Department of Mathematics POSTECH, KOREA MR ESSILFIE, JOSEPH KWAME SHABA19B, KNUST-KUMASI, GHANA MATHEMATIC DEPARTMENT ATTILA SALI, Alfred Renyi Institute of Mathematics, HUNGARY Zoltan Kiraly, Dept. of Comp. Sci., Eotvos University, Hungary Mr. Jeong-Mo Yang, Department of Mathematics POSTECH, KOREA Mr.(Ms.) Tosei Kasahara Mr.(Ms.) Kenji Koyama Mr.(Ms.) Tetsuji Katahira Professor Sungchul Lee Mr.(Ms.) Eun kyung Baik Professor Jack Koolen Revised Program Advisory Board Fred S. Roberts (Director of DIMACS, Rutgers University froberts@dimacs.rutgers.edu ), Gyula Katona (Director, Alfred Renyi Institute of Mathematics Hungarian Academy of Sciences ohkatona@renyi.hu ), Jonathan Gross (Department of Computer science, Columbia University gross@cs.columbia.edu Conference director Dr. Jin Ho Kwak Director of the Combinatorial and Computational Mathematics Center, POSTECH Organizing committee Suh-Ryung Kim (Kyung Hee University srkim@khu.ac.kr ), Jaeun Lee (Yeungnam University julee@yu.ac.kr ), Han Hyuk Cho (Seoul National University hancho@snu.ac.kr ). Official language All the lectures will be delivered in English. Conference Proceedings All the speakers are invited to submit a complete version of their work to the Conference Proceedings, a Special Issue of the devoted to the Com2MaC Conference. Participants presenting papers are invited to submit them for possible publication in a special issue of the international Journal : "Discrete Mathematics " Papers will be refereed in accordance with the normal high standards of Discrete Mathematics and will be thoroughly refereed at the same level as in any of the major publications in the area, and will consist of selections of the best contributions presented at the conference. The deadline for submission to the special issue is Nov. 31, 2002 . Location and Travel (cf. QA below) The conference will take place at POSTECH, Pohang, Korea. Pohang is located approximately 250 miles south of Seoul (about 40-minute flight from Kimpo Domestic Airport. There is a shuttle between Incheon international Airport and Kimpo Airport). For furtjer information click and read this file Further information (cf. QA below) All travel related information as well as other local information may be found via Internet and our conference website http: com2mac.postech.ac.kr . Questions regarding the technical program and or regarding travel and local arrangements should be directed to e-mail: com2mac@postech.ac.kr Answers for frequently asked question (Click) Conference registration All participant will be required to register for the conference via online. To obtained the form, click and read this file, and fax it to the given number. Accomodations All accommodations are located within twenty-minute drive from the Conference site. For further information, click and read this file. Revised Arrangement
FPSAC 2002
14th International Conference on Formal Power Series and Algebraic Combinatorics. University of Melbourne, Australia; 8--12 July 2002.
Formal Power Series Algebraic Combinatorics 2002 Home Registration Accom- modation Invited Speakers Program Committee Organising Committee Program Info for Participants Presenters Participant Support Conference Sponsors Previous Conferences Satellite Conferences Conference Tours Guide to Melbourne Conference Date The conference will take place from 8-12 July 2002 at The University of Melbourne, Australia. Announcements First announcement call for papers. Second announcement call for papers. Update on funding for graduate students and junior researchers (3 June, 2002.) Extended early bird registration : (15th April 2002). Information for participants and presenters : (3 June 2002). Topics Algebraic and bijective combinatorics and its relationship with other parts of mathematics, combinatorial and computer algebra, computer science and physics. Conference Program Invited lectures, contributed presentations, poster sessions, problem sessions and software demonstrations. Official Languages The official languages of the conference are English and French. Important deadlines Papers: Submission before December 15, 2001, Acceptance scheduled by February 15, 2002 Registration : by April 1, 2002 Software : Submission before February 15, 2002 Open problems : Submission before June 1, 2002 Conference Contacts For queries about themes, Content and Funding Tony Guttmann, Department of Mathematics The University of Melbourne Email: tonyg@ms.unimelb.edu.au For General Conference queries Bronwen Hewitt Conference Management The University of Melbourne Email: fpsac@ms.unimelb.edu.au For Paper submission queries Omar Foda Department of Mathematics The University of Melbourne Email: o.foda@ms.unimelb.edu.au Satellite Other Conferences Workshop on Combinatorics and Integrable Models: July 15-19 2002 ACISP'02 conference: July 3-5 2002 28th Conference on Stochastic Processes and their Applications July 1 - 5, 2002 The University of Melbourne Parkville, Australia Page Info. Created: 23 April, 2001. Last Updated: Monday, 03-Jun-2002 13:51:12 EST . Maintained by: R. Brak Disclaimer CopyrightNotice The University of Melbourne 1994-2001. Disclaimer and Copyright Information.
AWOCA 2002
The Australasian Workshop on Combinatorial Algorithms, hosted by the University of Queensland. Kingfisher Bay Resort, Fraser Island, Queensland, Australia; 7-10 July 2002.
Mathematics Disclaimer Mathematics All of UQ News and Events General Information Student Information Staff Information Visitor Information Research Information Club Infinity People Seminars Positions Vacant Sitemap Select a quick link: Other Mathematics Links MathSciNet School of Physical Sciences Faculty of EPSA About UQ my.UQ mySI-net Programs and Courses UQ News UQ Experts UQ Images Organisational Units Staff Web Page You have requested the document http: www.maths.uq.edu.au ~njc awoca awoca2002. This is a staff web area hosted on a University of Queensland web server. Please be advised that the web pages within this area are NOT officially endorsed by The University of Queensland. The University accepts no responsibility or liability for the contents of this area. This message has been displayed in accordance with the University's Internet Code of Practice , which forms a part of the Handbook of University Policies Procedures . Please note that you will need to enable cookies in your browser in order to proceed. to continue, or to the Mathematics home page. privacy | feedback 2004 The University of Queensland, Brisbane, Australia ABN 63 942 912 684 CRICOS Provider No: 00025B Authorised by: Head of School Maintained by: webmaster@sps.uq.edu.au Last Updated - Today 09:31pm
Seventh North Carolina Mini-Conference on Graph Theory, Combinatorics and Computing
Appalachian State University, Boone, NC, USA; 12 April 2002.
Seventh North Carolina Mini-Conference Friday, April 12, 2002 The Departments of Computer Science and Mathematical Sciences at Appalachian State University are pleased to announce the Seventh North Carolina Mini-Conference on Graph Theory, Combinatorics, and Computing. The conference will be held on Friday, April 12th, 2002. We have a preliminary schedule of talks. The conference will be held at the Plemmons Student Union Building (note: this is different from last year). Parking is available at First Baptist Church on King Street (hang tags are needed). We plan to have someone in the church lot to direct parking and give out hang tags. One of the goals of this conference is to provide a venue in which students can present their work, and so we especially encourage students (undergraduate and graduate) to consider giving talks. Each speaker will have 20 minutes for his her presentation with 5 additional minutes for questions. A conference luncheon will take place again this year. During the luncheon, participants will have the opportunity to interact with one another -- discussing areas of common interest and making valuable connections with others in our region. The luncheon will be free for everyone who has registered before April 8th. After lunch we will hear from our featured speaker, Peter Slater, professor of mathematics at the University of Alabama(Huntsville). Our aim is for this conference to be beneficial to both the students and the faculty of our region. We hope that you will be able to be with us on this day, and we hope that you will encourage others to attend. To register for the conference, please complete the online registration form . Directions to campus will be sent to you in early April. If you have comments or questions, direct them to Mark C. Ginn mcg@math.appstate.edu or Alice A. McRae aam@cs.appstate.edu Department of Mathematical Sciences Appalachian State University Boone, NC 28608 Phone: 828-262-3050 Fax: 828-265-8617 Last Modified: Tuesday, 31-Aug-99 - JMH
Graphs, Eigenvalues and Geometric Representations
5-day minicourse by Lszl Lovsz. Technische Universiteit Eindhoven, Belgium; 22--26 April 2002.
lovasz.html (MC-02-26 --- TU e vakcode 2E941 ) 5-day minicourse on Graphs, Eigenvalues, and Geometric Representations by Prof. Lszl Lovsz, Microsoft Research, Redmond, Washington, USA Lszl Lovsz was born in Budapest, Hungary in 1948. He obtained his doctoral degree in mathematics from the Etvs Lornd University, in Budapest, Hungary in 1971. He is a member of the Hungarian Academy of Sciences and three other Academies. He was Professor of the A. Jzsef University of Szeged, the L. Etvs University in Budapest, and Yale University. Currently he is Senior Researcher at Microsoft Research. His awards include the Brouwer Medal (1993) and the Wolf Prize (1999). His field of research is discrete mathematics, in particular its applications in the theory of algorithms and the theory of computing. Contents Connections between eigenvalues of adjacency matrices of graphs and graph-theoretic properties has been subject to intense research. Various geometric representations of graphs have also been studied and used in a variety of ways: for example, planar graphs can be represented by convex polyhedra. Other representations (like orthogonal representations) have applications to graph algorithms. In this course we show that there is a very tight connection between eigenvalues and geometric representations. Eigensubspaces of (weighted) adjacency matrices lead to embeddings of graphs in euclidean spaces, reflecting graph theoretic properties. For example, for 3-connected planar graphs, this method gives representations as 3-polytopes, and all polytopal representations can be obtained this way. The topic is closely tied with a spectral invariant introduced by Colin de Verdiere. Time and place Technische Universiteit Eindhoven, The Netherlands, April 22 - 26, 2002. Admission fee The admission fee for a minicourse is Euro 680 (NLG 1500). However, our courses are free of charge for EIDMA members and for university students. Reductions or exemptions do apply to members of other academic institutes. Registration You can register by sending an e-mail to mrs. Henny Houben at eidma@tue.nl before April 8, 2002. Back to the EIDMA homepage
ALCCAL 2000
Algebraic Combinatorics and Computer Algebra Summer School. Varna, Bulgaria; 3--14 September 2000.
ALCCAL.html Summer School ALCCAL' 2000 "ALGEBRAIC COMBINATORICS AND COMPUTER ALGEBRA" September 3 - 14, 2000, Varna, BULGARIA First Announcement Place of the ALCCAL'2000 Summer School Main idea Scientific Community Structure of the meeting Method of organization Description of the place and available facilities Payments and deadlines Registration form Abstracts Important dates Main idea We are organizing a summer school with the above title in Bulgaria on the coast of Black Sea from September 3 to September 14, 2000. The duration of the summer school will be 12 days, including 8 working days, 2 excursion days and days of arrival and departure. Sponsorship was not sought for the meeting and so we are unable to give any financial support to the participants. Everything is based on the enthusiasm of the organizers and our guests. In a sense the idea of this meeting is similar to the idea of the First International Conference on Algebraic Combinatorics in Vladimir, USSR, August 1991. We think that the present time in Bulgaria is most appropriate: this country is striving to become a major tourist and recreational attraction. Thus we have been able to find reasonable prices at a high level of service. Scientific community Algebraic combinatorics is a field of mathematics which was recognized "officially" 10-15 years ago. The name itself came from the Japanese mathematicians E. Bannai T. Ito who published a book with such title in 1984. Roughly speaking, algebraic combinatorics deals with highly symmetrical combinatorial objects (graphs, designs, codes etc.). What "high symmetry" means can be rigorously formulated in terms of the action of the automorphism group of the object. One of the most beneficial ways to consider this is that the requirement of transitivity (primitivity) of the action of a certain group is substituted by weaker assumption of combinatorial regularity. For example, parallel consideration and classification of rank 3 graphs and strongly regular graphs is one of the areas in algebraic combinatorics. The techniques used in algebraic combinatorics is in a sense an amalgamation of methods from group theory, linear algebra, graph theory, number theory and representation theory. Extensive use of computers and especially of computer algebra packages is an essential feature of this area. There are hundreds of mathematicians working in algebraic combinatorics as it is defined above. A lot of research deals with allied areas: design theory, topological graph theory, diagram geometries, finite fields and its applications, coding theory, applied statistics, etc. and these have a deep and long-standing dependency on algebraic combinatorics. The main target of our summer school will be all theoretical aspects of algebraic combinatorics. This will be supplemented by various links with coding theory. Other important components of interest will be computer algebra systems and in particular use of modern computer systems (for example GAP, GRAPE, DISCRETA, COCO and others) in algebraic combinatorics. Structure of the meeting The period of the school is September 3 - September 14, 2000. Sunday, September 3 will be the day of arrival, 8 working days will start from Monday, September 4 until Wednesday, September 13, with an interruption for two excursion days. Thursday, September 14 will be a day of departure and or optional excursions. The standard package for the participants will be 11 nights from Sunday, September 3 till Thursday, September 14. Shorter packages (of at least for 7 days) will also be available. During each of the 8 working days there will be two sessions, each of 3-4 working hours. The main body of the summer school will be covered by 8-12 short courses, each consisting of 2-4 hour lectures. These mini-courses will be given by prominent leading experts in algebraic combinatorics who have an approved reputation as excellent speakers. Each participant (including organizers) will be invited to submit a 30 minutes contributed talk. Such option will be open to everybody who register before the deadline. If necessary, parallel sessions will be organized. We will also organize a few poster sessions for ad hoc contributions. Other suitable ideas for social outings (besides excursion days) will also be considered which will involve accompanying persons (daily) and all participants (at evening time). The abstracts of all contributed talks will be available at the time of registration. At this moment we have the following preliminary arrangements of the short courses (those marked by the sign * are finally confirmed): Table algebras and their applications to finite groups (Zvi Arad*, Israel); Association Schemes in Statistics (Rosemary A. Bailey*, England); Graph Embeddings and Galois Groups (Gareth Jones*, England); Group theoretical methods for constructive enumeration in combinatorics (Reinhard Laue*, Germany); Constructive enumeration of graphs (Brendan McKay, Australia); Isomorphisms of Cayley graphs (Mikhail Muzychuk*, Israel); Cayley Graphs in Theoretical Computer Science (Gottfried Tinhofer*, Germany); Structural approach to association schemes (Paul-Hermann Zieschang*, Germany); Normally regular directed graphs (Leif Jorgensen*, Denmark); Selected topics of coding theory (Anton Betten*, Germany). The final list of short courses will be included in the second announcement which will be sent to everybody who will reply on this announcement. Method of organization Programme Committee (PC): Dr. Igor Faradjev Research and Design Manager Design Technology Group Synopsys 700 East Middlefield Road Mountain View, CA 94043 USA e-mail: iaf@synopsys.com Prof. Ted Hurley National University of Ireland Galway, Ireland e-mail: Ted.Hurley@nuigalway.ie Prof. Dr. A. Kerber Lehrstuhl II fur Mathematik Universitaet Bayreuth D-95440 Bayreuth Germany e-mail: kerber@btm2xh.mat.uni-bayreuth.de , kerber@uni-bayreuth.de Prof. Mikhail Klin Department of Mathematics Ben-Gurion University of the Negev P.O.Box 653, Beer-Sheva 84105, Israel e-mail: klin@cs.bgu.ac.il All inquiries regarding the scientific program should be addressed to M.Klin. Local Organization Committee (LC): Prof. Dr. Stefan Dodunekov Institute of Mathematics and Informatics, Bulgarian Academy of Sciences Acad. G. Bonchev Str., Bl. 8 1113 Sofia, Bulgaria e-mail: stedo@moi.math.bas.bg Associate Prof. Dr. Daniela Nikolova Institute of Mathematics and Informatics, Bulgarian Academy of Sciences Acad. G. Bonchev Str., Bl. 8 1113 Sofia, Bulgaria e-mail: dani@math.bas.bg Research Associate Margarita Spiridonova Institute of Mathematics and Informatics, Bulgarian Academy of Sciences Acad. G. Bonchev Str., Bl. 8 1113 Sofia, Bulgaria e-mail: mspirid@math.bas.bg Blajka Radeva Institute of Mathematics and Informatics, Bulgarian Academy of Sciences Acad. G. Bonchev Str., Bl. 8 1113 Sofia, Bulgaria e-mail: lpmivt@vt.bia-bg.com Note that most part of the work of Programme Committee and Local Committee will be done in the framework of their usual academic duties. Description of the place and available facilities The resort St Constantine is the oldest Bulgarian Black sea resort. It is located in a beautiful natural park with a wonderful combination of sea coast, woods and hot mineral springs. The resort is only 8 km. from the town of Varna, and is connected to it by a highway with regular bus transport throughout the year. Car service facilities, car wash and oil gas station are available at the resort. In the middle of the resort stands the International Home of Scientists "F. Joliot-Curie". For over thirty years it has been a gathering point for the scientists from countries all over the world offering ideal opportunities for summer vacation, congress tourism and balneologic therapy. The house meets all the requirements of a three star hotel. In the house are five multifunctional halls equipped with all modern facilities and meeting all international requirements. The tradition and experience in the organization of congresses, symposia and workshops have made the house renowned in the international scientific community. It has its own beach. The restaurant has a great veriety of specialties from the Bulgarian and international cuisine, as well as the best Bulgarian wines and spirits. The panorama- cafe has a wonderful view of the sea and the resort itself. The park features a cactus' garden unique in Bulgaria. The following facilities and services are available at the balneology therapy center: covered pool with mineral water (free of charge), fitness hall ( also free of charge), sauna, manual and water massage, water therapy procedures such as: mineral, herb, pearl and cosmetic bath tubs, and also group and individual medical exercises, electrical therapy, inhalations, acupuncture, manual therapy. Single and double rooms (with showers) as well as a few apartments will be available for the participants and their companions. Payments and deadlines Registration fee: $100 till June 30, $120 later. For students and young researchers: $70 till June 30, $120 later. The registration fee covers: admission to lectures, conference materials, cocktail, banquet, coffee breaks, excursions. Registration fee for spouses: $50. This covers the non-academic activities of the school. We suggest that all participants and accompanying persons take the whole package, including full board in the hotel, although short packages (for at least half of the period) are also possible. Prices of the accommodation and meals (for the whole period) are as follows: Single room in the hotel + meals: $430 A bed in double room + meals: $350 For families there is a just a few apartments with a shower, including two beds of price $20 each, and two pliable beds of half price, i.e. $10 each. For those who rent an apartment meals will be available for $12 per day (for one person). There is no hotel charge for children under 2 years of age. Balneological facilities will be available as well (the price list is available from LC). The fitness hall will be free of charge for the participants. Payment in advance is preferable. Due to the limited number of apartments they will be booked in order of the advanced payment. Acceptable methods of payment: Bank transfer to BULBANK (see details below); Institutional check sent to the address of the Local Committee; Payment (in cash) on arrival. Bank details: Bank name: BULBANK Ltd., Kaloyan Branch Bank address: 3 Kaloyan Str., Sofia 1000, Bulgaria SWIFT: BFTBBGSFKAL Bank Code: 62175395 Bank account: 3100043212 Beneficent: IMI - BAN (for ALCCAL'2000) Bank Phone: (359 2) 868 42 00, Fax: (359 2) 980 33 13 Registration form Please, click here for access to the registration form. LaTeX-version of the registration form is also available. Please, fill in the information and send the form to the e-mail address of the LC: ALCCAL@math.bas.bg or by fax: (359 2) 971 36 49, For ALCCAL'2000 or as a hard copy to the following address of the LC: ALCCAL'2000 Summer School Institute of Mathematics and Informatics, Bulgarian Academy of Sciences Acad. G. Bonchev Str., Bl. 8 1113 Sofia, Bulgaria Abstracts Each abstract of a contributed paper should not exceed two pages. It should be prepared in LaTeX form and sent to the Local Committee before July 15, 2000. An example of abstract in LaTex form can be used. Important dates Early registration for the School: June 30, 2000 Deadline for submission of the abstracts: July 15, 2000. Click here for the LaTeX - version of the First Announcement. Clich here for the Second Announcement Last updated on August 21, 2000. Go at the top!
Combinatorial Aspects of Mathematical Analysis
EuroSummer School: Instructional Conference. ICMS, Edinburgh, Scotland, UK; 25 March -- 5 April 2002.
Combinatorial Aspects of Mathematical Analysis Home Page EuroSummer School Instructional Conference on Combinatorial Aspects of Mathematical Analysis Edinburgh, 25 March to 5 April 2002 Scientific Programme | Conference Arrangements | Application Forms | Conference Home Page Instructional Conference participants on the steps outside the James Clerk Maxwell Building, Edinburgh University, towards the end of the meeting. Organising committee Tony Carbery (Edinburgh) Mike Christ (UC Berkeley) Tim Gowers (Cambridge) - Chair Vitali Milman (Tel Aviv) Terry Tao (UCLA) The aim of this 10-day course is to instruct young mathematicians in topics involving combinatorial ideas in mathematical analysis. The conference takes the form of a series of courses (each course being made up of between 2 and 4 one-hour lectures), the courses being structured so that the more basic material is presented during the first week, leading to more advanced lectures in the second week. The following themes will be addressed: Combinatorial Number Theory Combinatorial Methods in Convexity Combinatorial Methods in Harmonic Analysis Concentration of Measure Geometric Inequalities Ramsey Methods in Banach Spaces. Supporting institutions and organizations The meeting is supported by the European Commission, DG XII, Human Potential Programme, High Level Scientific Conferences HPCF-CT-1999-00213 and by the Engineering and Physical Sciences Research Council (EPSRC) of the UK. The Organisers hope to provide financial support for the majority of younger participants. This meeting's pages last updated 21 February 2002 Future Events | Travel Information | Call for Proposals | Publications Previous Events | Useful Links | About ICMS | Front Page
Combinatorics and Set Theory 2
(Set theory and its Neighbours 11). London, UK; 4 April 2002.
Set theory and its neighbours, Tenth Meeting Set theory and its neighbours , 11: Combinatorics and set theory, 2 The eleventh one-day conference in the in the series Set theory and its neighbours, took place on Wednesday, 3rd April 2002 at the London Mathematical Society building, De Morgan House, 57-58 Russell Square, London WC1. The speakers at the meeting were: Marcin Kysiak (Polish Academy of Sciences) Various classes of small sets: combinatorics vs. measure and category (ps) (pdf) [Both at Marcin's site in Warsaw] Abstract: I shall talk about relations between classes of small sets in the sense of measure and or category (like: strongly null, universally null, very meager, perfectly meager, etc.) and - that's combinatorial part - classes of small sets like s_0, l_0, m_0. In particular, I shall concentrate on some new (I hope so!) results that we have recently obtained together with Tomasz Weiss concerning Laver-null (l_0) and Miller-null (m_0) sets. Imre Leader (Cambridge) Forbidden distances in the rationals and the reals Abstract: We show that the reals may be partitioned into finitely many classes, each of which has `few' distances in a certain natural sense. Although the construction appears to use CH in an indispensible way, it turns out that the result remains true without CH. Olivier Lessman (Oxford) Dimension theory in homogeneous model theory Charles Morgan (UCL) Some step-ups and a few gentle stretching exercises Abstract: I discuss generic stepping up problems and techniques, with particular emphasis on the new notions of local connectedness functions and -M-proper forcing for arbitrary uncountable cardinals . I give some applications of these ideas to pcf theory, Lindelof spaces, and strong chains in P( ). Links to papers : Local distance and connectedness functions pcf structures II: the consistency of pcf structures on omega_2 tudes in -M-proper forcing Greg Piper (UEA) Square principles on P_\kappa(\lambda) Rene Schipperus (University of Vienna) Elementary submodels in the partition calculus Abstract: We prove some new and old results in the partition calculus which make use of the choice of elementary submodels of (a part of) the set theoretic universe. These ideas replace the older ramification arguments and are essential to further progress. We explain all of the set theoretic notions involved. We are very grateful to the LMS for allowing us to use De Morgan House as a venue and for their financial support for the meeting. Mirna Dzamonja and Charles Morgan Return to the Set theory and its neighbours homepage for information, including slides from the talks and related preprints, about the previous meetings. Last updated on 4th April 2002, Charles Morgan
Caribbean Workshop on Hypercube and its Relatives
San Juan, Puerto Rico; 21--23 March 2002.
Second Announcement HYPERCUBE 2002 Caribbean Workshop on Hypercube and its Relatives. San Juan, Puerto Rico, March 21-23, 2002 Description: Combinatorial and Geometric Problems on the Hypercube are the main topics of the workshop. The relatives include: Boolean Functions, Theshold Logic, Regular Graphs, Polytopes, Binary Codes, Perfect Dominating Sets, Graph Decompositions, etc. Invited Speakers: Victor Klee, Kevin T. Phelps, Josep Rif, Zoltn Fredi, Ghidewon Abay-Asmerom, Warren Adams, Martin Ziegler, etc. Abstracts: Send your abstract to the address below, or the Latex file via e-mail to: sanjuancube@yahoo.com. Registration: Ask for registration to the electronic address above or the post office address below. Organizing Committee: M. R. Emamy-K. (chair), I. J. Dejter (co-chair), P. Guan, F. Castro. Address: PO Box 23355 Department of Mathematics University of Puerto Rico San Juan, PR 00931-3355
Combinatorial Potlatch
University of Puget Sound, Tacoma, Washington, USA; 16 February 2002.
Combinatorial Potlatch - February 2002 Thompson Hall , Math CS Dept Combinatorial Potlatch University of Puget Sound Saturday, February 16, 2002 Wheelock Student Center , Meeting Site Definitions | Speakers | Schedule | Abstracts | Registration | Getting There | Lodging | Eating | Conference Party | History | Contacts The n-th Annual Combinatorial Potlatch will be held February 16, 2002 on the campus of the University of Puget Sound in Tacoma , Washington. Definitions Combinatorial Potlatches have been held for many years at various locations around Puget Sound and southern British Columbia, and are an opportunity for combinatorialists in the region to gather informally for a day of invited talks and conversation. While most who attend work in, or near, the Puget Sound basin, all are welcome. The American Heritage Dictionary defines "potlatch" as: A ceremonial feast among certain Native American peoples of the northwest Pacific coast, as in celebration of a marriage or an accession, at which the host distributes gifts according to each guest's rank or status. Between rival groups the potlatch could involve extravagant or competitive giving and destruction by the host of valued items as a display of superior wealth. [Chinook Jargon, from Nootka p'achitl, to make a potlatch gift.] Invited Speakers Brian Alspach , University of Regina and Simon Fraser University (Emeritus) Title: Group Actions and Hamilton Decompositions of Complete Graphs Brett Stevens , Carleton University (Ottawa) Title: On Universal Cycles of k-sets of an n-set Jonathan Jedwab, Simon Fraser University Title: Combinatorial Design Theory and the IEEE 802.12 Transmission Code Abstracts Group Actions and Hamilton Decompositions of Complete Graphs Brian Alspach, University of Regina and Simon Fraser University (Emeritus) Abstract: We shall take a look at the problem of determining for which values of n there exist Hamilton decompositions of the complete graph of order n which are invariant under the action of cyclic groups. We shall also consider some extensions of this problem. In summary, not a lot is known. On Universal Cycles of k-sets of an n-set Brett Stevens, Carleton University (Ottawa) Abstract: In 1992 Chung, Diaconis and Graham wrote the readable and thoroughly enjoyable "Universal Cycles for Combinatorial Structures". In it they generalize both the definition and construction of de Bruijn cycles to other families of combinatorial objects: permutations, partitions and subset systems. These generalizations resonate with generalizations of Gray Code, being gray codes that are compatible with queue data structures. Hurlbert and Jackson have continued this work solving, among other families, universal cycles for $k$-sets of $n$-sets for $k=2, 36$ and partially for other $k$. In their empirical work it was noted and conjectured that a universal cycle for the $n-2$-sets of an $n$-set never exists, even thought the standard necessary conditions are satisfied for all odd $n$. This was recently proved by Stevens, et al. This talk will review the past work, this recent result and the future look at Gray codes or de Bruijn generalizations compatible with different data structures. Title: Combinatorial Design Theory and the IEEE 802.12 Transmission Code Jonathan Jedwab, Simon Fraser University Abstract: TBA Schedule 10:00-10:30 Registration, Coffee and Doughnuts 10:30-11:30 Brian Alspach, Group Actions and Hamilton Decompositions of Complete Graphs 11:30-1:30 Lunch, Engine House 9, 611 N. Pine Street, 253-272-3435 1:30-2:30 Brett Stevens, On Universal Cycles of k-sets of an n-set 2:30-3:00 Break, Coffee and Cookies 3:00-4:00 Jonathan Jedwab, Combinatorial Design Theory and the IEEE 802.12 Transmission Code 5:00-7:00 Dinner, Harmon Brewery 7:00-???? Conference Party at Coles Tavern, A Blues Oasis Registration Please help us plan food for break services by carefully considering the following (punitive) registration options. Advance registration: Free. Contact Nancy Neudauer nancy@pacificu.edu with your probability of attending, hopefully at least a few days in advance. To receive more announcements, or for future Combinatorial Potlatches, send a request to Rob Beezer beezer@ups.edu to be added to the announcement list. On-site registration: $100 per person. Getting There (Location and Driving Directions) All talks and breaks will be conducted in the Murray Boardroom, which is located on the first floor of the Wheelock Student Center in the northeast corner. The Wheelock Student Center is building number 20 on the campus map . A larger map of the Tacoma area works well with written directions describing travel by car, plane, train or bus. Parking on the weekend should not present any special problems, and no parking passes are necessary. Approaching the Student Center from the south along Lawrence Street (off N 11th Street) will lead to a large parking lot adjacent to the building. Or find the parking lot just west of the intersection of N 14th and Alder. Local Lodging For those traveling from some distance the UPS web site has some suggestions for overnight accomodations, bed and breakfasts and hotels and motels . Keenan House is the closest bed and breakfast at just a few blocks from campus. If you are combining business with pleasure, The Villa is pretty deluxe, but has also been eager to accomodate visitors to the university at their lowest rates for some of the fancier rooms. For more traditional hotels and motels, we can recommend The Tacoma Sheraton , though it is likely the most expensive of the lot. Some of the hotels listed on the UPS site as being "off I-5" can be pretty ordinary. If you are coming down through the Olympic Peninsula, The Inn at Gig Harbor is a nice location 15 minutes short of campus, while the Maritime Inn is a small hotel right on the waterfront in Gig Harbor proper - very picturesque. Local Eateries Some suggestions for lunch or dinner that are nearby are provided by the UPS web site. Or consult this list , which seems to have it about right, or the Tacoma Weekly's more comprehensive list . The Engine House 9 might be a good location for a group lunch - close to campus, variants on pub food, and a wide selection of beer, some brewed next door. More scenic is Katie Downs with good pizza and good beer right on the waterfront along Ruston Way . Gateway to India is close by, and caters to vegetarians (more info on a couple of the lists referenced above). Conference Party A no-host conference party will be held after dinner at Coles Tavern, A Blues Oasis located at 5811 N 51st St, which is close to the entrance to Pt Defiance Park at the northern tip of North Tacoma (though this is really the very small town of Ruston). Phone number there is 253-879-1119. History A history of the Combinatorial Potlatch is available. Photos of the speakers in action are also available. Contacts Program Committee: Nancy Neudauer nancy@pacificu.edu Local Arrangements Committee: Rob Beezer beezer@ups.edu UPS Math CS Department Last Updated: February 18, 2002 http: www.math.ups.edu activities potlatch2002.html
ACCMCC-23
23rd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing. Brisbane, Australia; 6--10 July, 1998. Conference report.
Mathematics Disclaimer Mathematics All of UQ News and Events General Information Student Information Staff Information Visitor Information Research Information Club Infinity People Seminars Positions Vacant Sitemap Select a quick link: Other Mathematics Links MathSciNet School of Physical Sciences Faculty of EPSA About UQ my.UQ mySI-net Programs and Courses UQ News UQ Experts UQ Images Organisational Units Staff Web Page You have requested the document http: www.maths.uq.edu.au ~ejb conference.html. This is a staff web area hosted on a University of Queensland web server. Please be advised that the web pages within this area are NOT officially endorsed by The University of Queensland. The University accepts no responsibility or liability for the contents of this area. This message has been displayed in accordance with the University's Internet Code of Practice , which forms a part of the Handbook of University Policies Procedures . Please note that you will need to enable cookies in your browser in order to proceed. to continue, or to the Mathematics home page. privacy | feedback 2004 The University of Queensland, Brisbane, Australia ABN 63 942 912 684 CRICOS Provider No: 00025B Authorised by: Head of School Maintained by: webmaster@sps.uq.edu.au Last Updated - Today 09:31pm
History of Conferences Organised by the CMSA
Australian Conference on Combinatorial Mathematics; Australasian Conference on Combinatorial Mathematics and Computing; Australasian Conference on Combinatorial Mathematics and Combinatorial Computing.
Mathematics Disclaimer Mathematics All of UQ News and Events General Information Student Information Staff Information Visitor Information Research Information Club Infinity People Seminars Positions Vacant Sitemap Select a quick link: Other Mathematics Links MathSciNet School of Physical Sciences Faculty of EPSA About UQ my.UQ mySI-net Programs and Courses UQ News UQ Experts UQ Images Organisational Units Staff Web Page You have requested the document http: www.maths.uq.edu.au ~ejb history.html. This is a staff web area hosted on a University of Queensland web server. Please be advised that the web pages within this area are NOT officially endorsed by The University of Queensland. The University accepts no responsibility or liability for the contents of this area. This message has been displayed in accordance with the University's Internet Code of Practice , which forms a part of the Handbook of University Policies Procedures . Please note that you will need to enable cookies in your browser in order to proceed. to continue, or to the Mathematics home page. privacy | feedback 2004 The University of Queensland, Brisbane, Australia ABN 63 942 912 684 CRICOS Provider No: 00025B Authorised by: Head of School Maintained by: webmaster@sps.uq.edu.au Last Updated - Today 09:31pm
Combinatorial Optimization Day 1995
Applications of Semidefinite Programming in Combinatorial Optimization. Rutgers University, Busch Campus, Piscataway, NJ, USA; 22 April 1995.
RUTCOR: Rutgers Center for Operations Research Combinatorial Optimization Day Applications of Semidefinite Programming in Combinatorial Optimization 22 April, 1995 10:30am- 6:30pm RUTCOR Bldg, Rutgers University, Busch Campus, Piscataway, NJ Program: Morning Session Chair: Peter L. Hammer, RUTCOR [10:30-10:40] Opening Remarks, Joseph A. Potenza, Provost [10:40 -- 11:30] David Williamson (I.B.M T. J. Watson Lab): Approximation Algorithms for Maximum Cut and Satisfiability Problems [11:30 -- 11:40] Coffee Break [11:40 -- 12:30] Michel Goemans (MIT Math. Dept.): Semidefinite Programming Relaxations for the Vertex Cover Problem [12:30 -- 2:00] Lunch Break Afternoon Session Chair: Endre Boros, RUTCOR [2:00 -- 2:50] Laszlo Lovasz (Yale CS Dept.): Mixing Rank and Semidefiniteness: Colin de Verdiere's Invariant [2:50 -- 3:00] Coffee Break [3:00 -- 3:50] Madhu Sudan (I.B.M T. J. Watson Lab): Algorithms for Coloring and Clique Approximation Using Semidefinite Programming [3:50 -- 4:00] Coffee Break [4:00 -- 4:50] Mario Szegedy (ATT Bell Labs): Negative Results [4:50 -- 5:00] Coffee Break [5:00-5:30] Discussion session on research directions and open problems, chaired by Farid Alizadeh. [5:30 -- 6:30] Wine and Cheese Party PREREGISTRATION There are no fees, however because of space limitations PREREGISTRATION by e-mail or FAX is strongly recommended. REGISTRATION BY E-MAIL: send mail to cost@rutcor.rutgers.edu REGISTRATION BY FAX: send fax to 908-445-5472 Updates of this document and a map of Busch campus of Rutgers University can be obtained from www cite: http: new-rutcor.rutgers.edu. ------------------------------------------------------------------------ Theory-B email: theorynt@langevin.usc.edu OR theorynt@vm1.nodak.edu URL: http: langevin.usc.edu ~theorynt ------------------------------------------------------------------------
Combinatorial Optimization and Integer Programming
Columbia University; 28 November 2001.
1st Columbia Optimization Day 1st COLUMBIA OPTIMIZATION DAY Combinatorial Optimization and Integer Programming, The State of the Art Wednesday, November 28, 2001 Francisco Barahona Bob Bixby Sebastian Ceria Vasek Chvatal Bill Cook David Johnson George Nemhauser Bruce Shepherd Conference Program Registration (Includes lunch) Directions For further information, contact Daniel Bienstock
Colloquium on Combinatorics 2001
Technical University Braunschweig, Germany; 16--17 November 2001. On-line registration.
Colloquium on Combinatorics 2001 Diskrete Mathematik Technische Universitt Braunschweig Diskrete Mathematik Pockelsstrae 14 38106 Braunschweig Germany Tel: +49-531-391-7522 Fax: +49-531-391-8210 COLLOQUIUM ON COMBINATORICS 16th and 17th November 2001 Technical University Braunschweig Invitation (HTML) (Postscript) (LaTeX) Einladung (HTML) (Postscript) (LaTeX) Registration form (HTML) (Postscript) (LaTeX) Anmeldungsformular (HTML) (Postscript) (LaTeX) Layout of abstracts (Postscript) (LaTeX) Second announcement (HTML) (Postscript) Zweite Mitteilung (HTML) (Postscript) How to reach Anreise TU-Umgebungsplan (HTML) (Postscript) Participants Teilnehmer Schedule Vortragsplan (Postscript) (PDF) City map Stadtplan Parking lots Parkpltze The City Braunschweig Homepage der Abteilung Diskrete Mathematik Arnfried Kemnitz Thu Jun 28 19:13:11 CEST 2001
Euroconference on Combinatorics, Graph Theory and Applications (COMB01)
The Conference concentrates mainly on four areas: Algebraic, Algorithmic, geometric and probabilistic combinatorics, including their applications to other areas of mathematics, computer science and engineering. Barcelona, Spain; September 12-15, 2001.
Comb01
Probabilistic Methods in Discrete Mathematics
Fifth International Petrozavodsk Conference. Karelia, Russia; 1--6 June 2000.
IAMR KarRC RAS. Conference "Probabilistic Methods in Discrete Mathematics" Steklov Mathematical Institute of Russian Academy of Science Institute of Applied Mathematical Reasearch, Russian Academy of Science Petrozavodsk State University The Fifth International Petrozavodsk Conference "Probabilistic Methods in Discrete Mathematics" June 1-6, 2000. Petrozavodsk Simultaneously "The First Symposium on Applied and Industrial Mathematics" will take place (organized with help of "Probability Theory and its Applications" publishers) Conference Committee Conference Sections Conference Languages Conference Publications Contact Information Picture Gallery Conference Committee: V.Y.Kozlov, chairman, V.F.Kolchin, vice-chairman V.V.Mazalov,vice-chairman A.S.Fomin, G.I.Ivchenko, V.I.Khokhlov, V.G.Mikhailov, Y.L.Pavlov, Y.V.Prokhorov, B..Sevastianov, A.D.Sorokin, V..Vatutin, .B.Zhizhchenko, A.M.Zubkov Conference Sections: Probabilistic Problems In Combinatorial Analysis; Statistical Problems In Discrete Mathematics; Mathematical Methods of Information Security; Dynamic Games; Conference Languages : Official languages of the conference are Russian and English Conference Publications : All submitted abstracts will be published in"Surveys of Applied and Industrial Mathematics" before the beginning of the conference, and in "Proceedings of The Fifth International Petrozavodsk Conference". The conference and symposium will be held at "Beliye Kluchi" hotel near Petrozavodsk During the conference you will have an opportunity to enjoy beautiful Karelian scenery and to visit the famous Kizhi island. Contact Information: Moscow 117966, Moscow, ul. Gubkina, 8, Steklov Mathematical Institute, room 622, "Discrete Mathematics and Applications", ph. +7 (095) 9383700, fax +7 (095)1350555, kolchin@mi.ras.ru , Valentin Kolchin. Petrozavodsk 185610, Petrozavodsk, ul. Pushkinskaya, 11, Institute of Applied Mathematical Research (IAMR), fax (8142) 776313, pavlov@post.krc.karelia.ru , Yuri L. Pavlov. Phone: (8142)771108 director of IAMR, Vladimir V. Mazalov (8142)773470 vice-director of IAMR, Anatoly D. Sorokin (8142)771218 head of the Laboratory of Probability Theory, Yuri L. Pavlov (8142)776313 secretary Back IAMR conferences Last modified on June 13, 2002
Symposium on String Processing and Information Retrieval
Laguna de San Rafael, Chile; November 13-15, 2001.
:: SPIRE 2001 :: 8th International Symposium on String Processing and Information Retrieval | HOME | Main page Photographs from the conference Accepted papers Accepted papers Accepted posters Topics Invited speakers Important dates Program committee Accommodations Local organization sponsors Download the SPIRE 2001 program: Poscript - PDF Subject to changes What is SPIRE? SPIRE'2001 is a Symposium on String Processing and Information Retrieval which is in its eighth edition. The first four editions focused primarily on string processing and originated in South America, and were called WSP (South American Workshop on String Processing). They were held in Belo Horizonte, Brazil (1993), Valparaso, Chile (1995 and 1997), and Recife, Brazil (1996). Starting in 1998, at Santa Cruz, Bolivia, the focus of the workshop was broadened to include the area of information retrieval due to its increasing relevance and its inter-relationship with the area of string processing. SPIRE'99, at Cancn, Mexico, and SPIRE'2000, at A Corua, Spain, have continued this trend including also the area of DNA computing, with several papers and invited talks on this topic. For SPIRE'2001 we expect to have contributions from several related communities. The SPIRE'2001 symposium aims at facilitating the potential benefits of cross- fertilization between different fields. As such, it offers a singular opportunity for researchers interested in working with problems related to these areas. As in the past, the proceedings of SPIRE'2001 will be published by IEEE CS Press. Top of page Departament of Computer Sciences University of Chile Blanco Encalada 2120 Santiago, Chile Questions Comments: spire2001@dcc.uchile.cl Last updated : Webmaster: Cuauhtmoc Rivera Loaiza
CoSSaC 2001 - Combinatorics of Searching, Sorting and Coding
Ischia Island, Italy; 7-9 September 2001.
CoSSaC 2001: Combinatorics of Searching Sorting and Coding How to Reach COSSAC Registration Hotel-Reservation PRELIMINARY PROGRAM 7-9 September 2001, Ischia Island , Italy Inquiries on general information related to COSSAC should be addressed to: cossac@dia.unisa.it Last modified 25 04 01
Symmetric Functions 2001
Surveys of Developments and Perspectives. Cambridge, UK; 25 June -- 6 July 2001.
Symmetric Functions 2001 Isaac Newton Institute for Mathematical Sciences NATO Advanced Study Institute with support from the EC Symmetric Functions 2001: Surveys of Developments and Perspectives Cambridge, U.K., June 25 - July 6, 2001 Topics: Macdonald polynomials. Combinatorial and asymptotic problems in representation theory, algebraic geometry, and mathematical physics. International Organizing Committee: Sergey Fomin , University of Michigan, U.S.A. (Director from a NATO country) Grigori Olshanski, Dobrushin Lab, IPPI, Russia (Director from a Partner country) Phil Hanlon, University of Michigan, U.S.A. Ian G. Macdonald, QMW, University of London, U.K. Andrei Okounkov, University of California at Berkeley, U.S.A. Lecturers: Persi Diaconis , Stanford University, U.S.A. William Fulton, University of Michigan, U.S.A. Mark Haiman , University of California at San Diego, U.S.A. Phil Hanlon, University of Michigan, U.S.A. Alexander Klyachko , Bilkent University, Turkey Bernard Leclerc , Universit de Caen, France Ian G. Macdonald, QMW, University of London, U.K. Masatoshi Noumi , Kobe University, Japan Andrei Okounkov , University at California at Berkeley, U.S.A. Grigori Olshanski, Dobrushin Lab, IPPI, Russia Eric Opdam , Korteweg-de Vries Institute, The Netherlands Anatoly Vershik , Steklov Institute, St.Petersburg Branch, Russia Andrei Zelevinsky , Northeastern University, U.S.A. Schedule Participants Style files and templates SF-2001 web page at the Newton Institute This ASI is planned as the concluding event of the Scientific Programme on Symmetric Functions and Macdonald Polynomials . This page is maintained by Sergey Fomin . Revised March 20, 2001
First International Conference DM-CCG
Discrete Models: Combinatorics, Computation and Geometry. Paris, France; 2--5 July 2001.
First International Conference DM-CCG Discrete Models Combinatorics, Computation and Geometry Paris, July 2-5 2001 For a few years, an increasing number of researchers has been interested in discrete models from several points of view: computer science, mathematics, physics, biology, ... Many different problems were unified thanks to these studies, and a new field of research appeared. The aim of this conference is to put together researchers working on various aspects of the discrete models studies and to give the opportunity of fruitful exchanges. The conference will consist in invited talks, contributed presentations selected after a refeering procedure, and poster sessions. The proceedings will be published as a special issue of DMTCS (Discrete Mathematics and Theoretical Computer Science) . DM-CCG will take place in Paris (France) on July 2-5 2001 at the Institut Henri Poincare ( map ). Program Researchers interested in the following subjects (non exhaustive list) are encouraged to submit and or to participate: (Abelian) Sand Pile Model Chip Firing Games Convergent Games Integer Partitions Cellular Automata Tilings Polytopes Quasi-crystals Integrable Models Hotels list and useful sites Important dates: Deadline for submission: February, 4 2001. Notification of acceptance rejection: April, 4 2001. Definitive version due: April, 20 2001. Reduced registration fees until: May, 25 2001. Registration Submission of papers Invited speakers : Jean-Paul Allouche ( LRI , Orsay, France) Anders Bjorner ( KTH , Stockholm, Sweden) Mireille Bousquet-Melou ( LABRI , Bordeaux, France) Nicolas Destainville ( LPQ-IRSAMC , Toulouse, France) Deepak Dhar ( TIFR , Bombay, India) Michel Duneau ( CPHT , Palaiseau, France) Eric Goles ( DIM , Santiago, Chile) Denis Gratias ( LEM , Chatillon, France) Richard Kenyon ( TDS , Orsay, France) Cris Moore ( SFI , Santa Fe, USA) James Propp ( Univ. Wisconsin , Madison, USA) Guenter Ziegler ( TU , Berlin, Germany) Steering Committee : Robert Cori ( LABRI , Univ. Bordeaux I and LIX , Ecole Polytechnique ) Jacques Mazoyer ( LIP , ENS Lyon ) Michel Morvan ( LIAFA , Univ. Paris VII , and IUF ) Remy Mosseri ( GPS , Univ. Paris VI ) Organizing Committee Sebastien Desreux ( DDM , LIAFA , Univ. Paris VII ) Matthieu Latapy ( DDM , LIAFA , Univ. Paris VII ) Clemence Magnien ( DDM , LIAFA , Univ. Paris VII ) Maurice Nivat ( LIAFA , Univ. Paris VII ) Jean-Christophe Novelli ( DDM , LIFL , Univ. Lille I ) Ha Duong Phan ( DDM , LIAFA , Univ. Paris VII ) Eric Remila ( LIP , ENS Lyon ) Dominique Rossin ( LIX , Ecole Polytechnique ) Laurent Vuillon ( DDM , LIAFA , Univ. Paris VII ) The conference is organized by the Maison de l'Informatique et des Mathematiques Discretes (MIMD) . Comments are welcome.
BCC18
18th British Combinatorial Conference. University of Sussex in Brighton, Falmer, Brighton, UK; July 1-6, 2001.
The 18th British Combinatorial Conference Homepage Invited lectures Contributed talks Registration Programme Accommodation Social events Problem list Financial support Facilities on Campus Campus map Travel details Local attractions Supported by: 18th British Combinatorial Conference will be held at The University of Sussex Falmer, Brighton, UK. Sunday 1 - Friday 6 July 2001 Conference Updates Who is talking when ! Alphabetical list of speakers with the times of their talks as a PS file, a PDF file or a DVI file (files dated 19 June 2001). Contributed talks A list of contributed talks accepted for this conference is available as a PDF file, a PS file, or a DVI file (files dated 20 June 2001). Arrival Arrangements If arriving on Sunday 1 July, please go to the Conference Reception Desk at York House. If arriving on later days, Conference Reception Desk will be outside the Chichester Lecture Theatre. Details of arrival arrangements Music at the Conference Concert Can you sing? Can you dance? We want to hear from you En-suite accommodation Please note that all single en-suite accommodation (a room for one person with private bathroom) is now fully booked. 19th British Combinatorial Conference in 2003 The next BCC will be held at the University of Wales in Bangor, organiser, Chris Wensley. Click here for preliminary details. CONTACT INFORMATION Organisers: James Hirschfeld and Richard Lewis Conference e-mail: BCC2001@sussex.ac.uk 18th British Combinatorial Conference School of Mathematical Sciences University of Sussex Brighton BN1 9QH UK. Tel: + 44 - (0) - 1273 - 678080 Fax: + 44 - (0) - 1273 - 678097 Conference Theme The main themes of the conference are the topics within 05 Combinatorics of the Mathematics Classification Scheme 2000 as well as the linked topics in 06, 11, 20, 22, 33, 51, 62, 68, 90, 94. Links: British Combinatorial Committee 17th British Combinatorial Conference 16th British Combinatorial Conference University of Sussex School of Mathematical Sciences R.J.Chambers 19.06.01
Big Sky Conference on Discrete Mathematics
University of Montana, Missoula, MT, September 7-9, 2000.
Big Sky Discrete Mathematics Home Page 2003 Big Sky Conference on Discrete Mathematics 2003 Announcement and Registration Information Conference Announcement: in postscript or pdf format The ninth Big Sky Conference on Discrete Mathematics will be held at the University of Montana-Missoula, 11-13 September 2003. The invited speakers are Prof. William Cook (Georgia Institute of Technology) and Prof. Bojan Mohar (University of Ljubljana). More information about the speakers can be found at : W.C. and B.M. The registration and abstract deadlines are August 26, 2003. The student support deadline is August 11, 2003. (Please note this earlier deadline.) This page will be updated periodically. The conference schedule will be posted here approximately 10 days before the conference begins. Registration Form Student Support Form *** New Postings *** Conference Schedule (in pdf format) Mathematics Colloquium by Dr. William Cook, Sept. 11 at 4:10 pm Public Lecture (for a general audience) by Dr. William Cook, Sept. 11 at 8:00 pm Conference Colloquium by Dr. Bojan Mohar, Sept. 12 at 4:10 pm Activities for Students Montana TSP Challenge We'd like to thank our SPONSORS: , , , and The Institute of Combinatorics and its Applications General Local Information Rafting Information Local Information : hotel, transportation, registration, banquet info. Map of Missoula , Campus Map Local Weather Local Newspaper: Missoulian National Parks: Glacier Park , Yellowstone Road Conditions and Information Past Events 2002 Conference Events Conference Photos , Rafting Pictures Conference Schedule (in pdf format) Mathematics Colloquium by Dr. Jeff Weeks , Sept. 5 at 4:10 pm. Public Lecture (for a general audience) by Dr. Jeff Weeks , Sept. 5 at 8:00 pm. Conference Colloquium by Dr. Penny Haxell , Sept. 6 at 4:10 pm. Activities for Students 2001 Conference Events Conference Photos , Rafting Pictures Conference Schedule (in pdf format) Mathematics Colloquium by Dr. Herbert Wilf , Sept. 6 at 4:10 pm. Public Lecture (for a general audience) by Dr. Herbert Wilf , Sept. 6 at 8:00 pm. Conference Colloquium by Dr. Matthew DeVos , Sept. 7 at 4:10 pm. Activities for Students 2000 Conference Events Conference Photos , Rafting Pictures Faculty Seminar, The Mysterious Arithmetic of Integral Lexicographic Codes by Dr. John H. Conway Keynote Address Conference Colloquium Lecture, The Interplay between Graphs and Matroids by Dr. James Oxley 1999 Conference Events Conference Photos!! Faculty Seminar, The Impact of User Interfaces in Educational Software by Dr. Maria Klawe Keynote Address, Mathematics, Computer Games and Gender by Dr. Maria Klawe Conference Colloquium Lecture, An Algorithmic Approach to Multicolouring by Dr. Jeannette Janssen Activities for Undergraduates - pdf format 1997 and 1998 Events A summary of Dr. Ron Graham's fantastic lectures (from 1998). - pdf format 1997 Conference Summary (See page 3.) - in pdf format 1997 Conference Photos: Group Picture , Rafting A summary of Dr. Doris Schattschneider's incredible General Audience Talk (from 1997). - in pdf format mail comments to bigsky@mso.umt.edu updated 2 July 2003
Paul Erds and his Mathematics
Budapest, Hungary; 4--11 July 1999.
Paul Erdos and His Mathematics Paul Erds and his Mathematics Budapest, July 4-11, 1999 The Hungarian Academy of Sciences , The Jnos Bolyai Mathematical Society , TheEtvs Lornd University of Budapest and The Mathematical Institute of The Hungarian Academy of Sciences , organized a conference dedicated to the memory of Paul Erds that was held July 4 - 11, 1999, in Budapest , Hungary . The topics of the conference included all basic fields that Paul Erds contributed to: Analysis (including Ergodic Theory), Combinatorics (including Combinatorial Algebra, Combinatorial Geometry and Theoretical Computer Science), Number Theory, Probability Theory, and SetTheory among others. The main goal of the conference was to explore Paul Erds' wide ranging contributions to mathematics, to bring us closer to an understanding of his rich oeuvre, and to attempt to survey the trends of development originating in his work. This symposium was a satellite conference to the UNESCO-ICSU World Conference on Science held 26 June - 1 July 1999, in Budapest, Hungary. List of participants text xls pdf If your e-mail or other data has changed please let us know so we could update the list! The Proceedings of the Conference have now been published by the Bolyai Society and Springer. Detailed information (list of contents, how to order from Springer, price etc.) can be found at Springer's webpage . The table of contents can also be found here: Volume 1 Volume 2 The Conference Site Detailed program Dvi PostScript Full booklet of the Program Dvi PostScript (including alphabetical list of speakers) A musical tribute to Paul Erds written by Peter Winkler
Classical Combinatorics
In honor of Dominique Foata's 65th birthday. Temple University, Philadelphia, PA, USA; 7--9 July 2000.
FOATAFEST Classical Combinatorics In honor of Dominique Foata's 65th birthday Temple University 1616 Walnut Street, Philadelphia, PA July 7-9, 2000 Participants | Poster | Schedule of Speakers Expense Report Info | At the Banquet | Dominique's Doctorate Directions Proceedings Information: All participants (both speakers and non-speakers) are cordially invited to contribute to the refereed proceedings for "Classical Combinatorics" which will be published as a special issue of Advances in Applied Mathematics. Please send your contribution to Joseph Kung at kung@unt.edu. The deadline for submissions has been extended to January 1, 2001. The term Classical Combinatorics , coined by Dominique Foata, is roughly the combinatorial analog of Classical Analysis. Today it is better know as Enumerative and Algebraic Combinatorics. One of the fastest growing areas of modern mathematics, it touches upon many areas of mathematics and science. This conference will emphasize the more classical aspects of enumerative combinatorics, like permutation statistics, tableaux, q-series, words, combinatorial special function theory, commutation monoids, and related subjects, as well as their relation to computer science, physics, and statistics. Organized by: George Andrews, Richard A. Askey, Aaron Robertson (co-chair), Herbert S. Wilf, and Doron Zeilberger (co-chair). Supported by: National Science Foundation and Temple University
Algebraic Combinatorics and Applications
Gweinstein, Germany; 12--19 September 1999.
Euroconference: ALGEBRAIC COMBINATORICS AND APPLICATIONS Euroconference: ALGEBRAIC COMBINATORICS AND APPLICATIONS Gweinstein (Germany) September 12-19, 1999 The aim of the conference is to bring together leading researchers from mathematical theory (including related computer science) and its applications in chemistry and physics in order to stimulate fruitful interdisciplinary discussions and to generate an impact regarding future research in this area. Topics to be presented: Finite group actions Other combinatorial tools like generating functions, species and computer algebra Applications of combinatorics in chemistry Connection of mathematics with physics A special emphasis will be on the presentation of related software packages Please note: On sunday evening (Sept. 12) the organizers can be reached at Scheffelgasthof Balthasar Neumann Str 6 91327 Goessweinstein Tel (+49) (0)9242 201 FAX (+49) (0)9242 7318 Scientific program Participation fees registered participants: accommodation Important dates Registration timetable for talks how to get there arrival and lecture room Conference poster Conference Impressions (Oct 28, 1999) Proceedings For more information please contact Prof. Dr. A. Kerber, Prof. Dr. R. Laue, Lehrstuhl II f. Mathematik Universitt Bayreuth D-95440 Bayreuth Germany Conference email-address: alcoma99@btm2x2.mat.uni-bayreuth.de Back to the homepage "Lehrstuhl II" last change: July 28, 1999.
Discrete Mathematics and Industrial Applications
Capri, Italy; 7--10 June 2001.
DISCRETE MATHEMATICS AND ITS INDUSTRIAL APPLICATIONS DISCRETE MATHEMATICS AND ITS INDUSTRIAL APPLICATIONS SCIENTIFIC COMMITTEE: D. Jungnickel - G. Lunardon - F. Mazzocca - N. Melone - D. Olanda The Conference DISCRETE MATHEMATICS AND ITS INDUSTRIAL APPLICATIONS will be held in Capri (Italy), in the Hotel La Residenza from Thursday June, 7 to Sunday June, 10 2001. Any communication about the conference can be sent to polverin@matna2.dma.unina.it There will be a registration fee of 150.000 Italian Lire (77.47 Euro). FIRST ANNOUNCEMENT TO BOOK REGISTRATION FORM LIST OF PARTICIPANTS LIST OF TALKS HOW TO GET TO CAPRI PROGRAM
Horizons in Combinatorics
Graph Theory, Combinatorics and Computing in conjunction with the 16th Annual Shanks Lectures. Vanderbilt University, Nashville, Tennessee; May 21-24, 2001.
Computational Harmonic Analysis In a few seconds you should be automatically redirected to http: www.math.vanderbilt.edu ~aldroubi CHA073003.htm If not, please click on the link above.
BCC16
Sixteenth British Combinatorial Conference. Queen Mary and Westfield College, University of London, UK; 7--11 July 1997. Abstracts, problem lists.
BCC16 Sixteenth British Combinatorial Conference The Sixteenth British Combinatorial Conference was held at Queen Mary and Westfield College, University of London, on 7-11 July 1997. The local organisers were R. A. Bailey, P. J. Cameron, L. H. Soicher and S. Wilkinson. As usual, the invited speakers' contributions were published in advance of the conference, edited by R. A. Bailey. You can see details of this volume, including abstracts of the papers, here . You should order the book from your bookseller or from Cambridge University Press . This website will remain for the time being. You can take a copy of the Problems presented at the conference (plain TeX file), or the Delegate List (LaTeX209 file). The Problems are also available as a PostScript file ; and the Problems from BCC15 are still available. Brinkmann's counterexamples to Alabdullatif's conjecture in Problem BCC16.2 are available as PostScript files: there is a trivalent and a tetravalent example. DON'T FORGET that the Seventeenth British Combinatorial Conference will be held at the University of Kent at Canterbury, 12-16 July 1999. The local organisers are John Lamb and Donald Preece. The preceding week (4-11 July 1999) there is a conference in memory of Paul Erds, organised by the Hungarian Academy of Sciences and other bodies. Why not take in both conferences? You can find details on their Web page . Peter Cameron (for the organisers) Visit my homepage
FPSAC'01
13th International Conference on Formal Power Series and Algebraic Combinatorics. Arizona State University, Tempe, AZ, USA; 20--26 May 2001.
FPSAC'01 - Arizona State University Here are the non-frame based version of the document: English French Spanish
14th Cumberland Conference
Combinatorics, Graph Theory and Computing. Dedicated to Richard H. Schelp on his 65th birthday. University of Memphis, TN, USA; 17--19 May 2001.
14th Cumberland Conference 14th Cumberland Conference University of Memphis, TN May 17-19, 2001 Dedicated to Richard H. Schelp on his 65th birthday Announcement Background Registration Schedule Abstracts Travel Maps Accommodation Local Attractions Participants Announcing the 14th Cumberland Conference The 14th Cumberland Conference was held on the campus of the University of Memphis from 1:30pm Thursday, May 17 to 1pm Saturday, May 19. The organizers wish to thank everyone who attended for making the conference such a success. The 15th Cumberland Conference will be held at the University of Mississippi, May 16-18, 2002. Principal Speakers Gyula Katona Alexandr Kostochka Dana Randall Bjarne Toft Conference funded by the US Army Research Office To contact the organizers, email balistep@msci.memphis.edu Link to Department of Math Sciences Last revised January 3, 2002.
Design Theory: Resolvability and Parallelisms
PIMS at Simon Fraser University, BC; May 16-18, 2001.
Design Theory Workshop The Pacific Institute for the Mathematical Sciences launched a new web site on March 31, 2005. If there is any discrepancy between the information on this page and the new site, the information on the new site should be used. Design Theory: Resolvability and Parallelisms May 16-18, 2001 PIMS at Simon Fraser University East Academic Annex - Seminar Room 1100 Parallel classes and resolvability are two powerful substructures in Combinatorial Design theory. Full and partial Parallel classes are necessary for Wilson's Fundamental construction. Recent generalizations of traditional resolvability are an exciting new area of study and application. There have been two recent generalizations of resolvability to Pairwise Balanced Designs, RRPs where every resolution class is made of of blocks of a fixed size and CURDs where every resolution class is isomorphic as a spanning subgraph of the complete graph. Resolvable packings and partial resolutions have been shown to be powerfully applicable to synchronous uni-polar multi-user communication systems. These exciting recent developments prompt this mini workshop on the subject. The conference is going to be informal, with about three invited talks per day and plenty of time for informal discussion or impromptu presentation. We also hope to give promising graduate students a chance to talk in a comfortable atmosphere. If you have a student who you think would be appropriate then please send us their name so that we may extend an invitation to them. There will also be a conference dinner on Thursday at the Liliget Feast House (Salish Food) it will cost approximately $40 per person but it promises to be a wonderful experience! If you have any questions, please do not hesitate to contact one of the organisers: Brett Stevens ( brett@math.sfu.ca ) or Luis Goddyn ( goddyn@math.sfu.ca ) 2005 Pacific Institute for the Mathematical Sciences Last Modified: Monday, 27-Aug-2001 17:04:43 PDT
Finite and Infinite Combinatorics
Topics include graph theory, extremal and random graphs, combinatorial optimization and number theory, discrepancy theory, infinite combinatorics, and set theory. Budapest, Hungary, January 5-10, 2001.
Finite and Infinite Combinatorics Finite and Infinite Combinatorics Budapest , Hungary, January 5 (Friday) - 10 (Wednesday), 2001 Dear Colleagues, The Jnos Bolyai Mathematical Society and the Mathematical Institute of the Hungarian Academy of Sciences are organized a Colloquium on Finite and Infinite Combinatorics. The conference was supported by DIMATIA-ITI Charles University, Prague. The special occasion for this meeting is to honour the 70th birthdays of Professors Vera T. Ss and Andrs Hajnal. Andrs Hajnal. Vera T. Ss Download the list of the presented talks in DVI format or in PostScript format. Download the list of participants in DVI format or in PostScript format . We would highly appreciate if you filled out and submitted the participant questionnaire of CORDIS here . Thank you. We thank all participants for coming to Budapest The Organizing Commitee L. Lovsz (Co-chair) G. O. H. Katona (Co-chair) G. Y. Katona (Secretary) . Kisvlcsey (Secretary) Mail address: Jnos Bolyai Mathematical Society Budapest, F utca 68, 1027 HUNGARY Phone:(36 1) 201 7656 Phone Fax: (36 1) 201 6974 Email: finf@renyi.hu
Asymptotic Combinatorics with Applications to Mathematical Physics
Summer school surveying recent progress in the asymptotic theory of Young tableaux and random matrices from the point of view of combinatorics, representation theory, and the theory of integrable systems. Saint Petersburg, Russia; July 9-22, 2001.
EMSchool'2001 NATO Advanced Study Institute Asymptotic combinatorics with applications to mathematical physics (European Summer School-2001 in Russia) July 9-22, 2001 Saint-Petersburg, Russia Organizers: St.Petersburg Department of Steklov Mathematical Institute of Russian Academy of Science (POMI RAN) International Euler Mathematical Institute (EIMI) European Mathematical Society (EMS) Short description: The summer school aims to observe the recent progress in the asymptotic theory of Young tableaux and random matrices from the point of view of combinatorics, representation theory and theory of integrable systems. The systematic courses on the subjects and current investigations will be presented. Scientific Committee: O.Bohigas (Paris, Univ. Paris-Sud) E.Brezin (Paris, ENS) P.Deift (US, Philadelphia) L.Faddeev (St.Petersburg) K.Johansson (Stockholm KTH) M.Kontsevich (IHES, Bures-sur-Yvette) V.Malyshev (INRIA, France) R.Stanley (USA), A.Vershik (St.Petersburg, Chairman) Organizing Committee: V.Kazakov (Paris, ENS) A.Lodkin (St.Petersburg) Yu.Neretin (Moscow, Independent Univ.) A.Okounkov (US, Berkeley) L.Pastur (Paris, Univ. Paris-7) Secretaries: K.Kokhas' (St.Petersburg) E.Novikova (St.Petersburg) N.Tsilevich (St.Petersburg) The main goals: To make known the recent progress in asymptotic representation theory and related asymptotic combinatorics and its applications to mathematical and statistical physics. To make appropriate courses on these topics for graduate students and mathematicians who have no knowledge on the problems. To organize simultaneous seminars and the conference on the topic. To publish the proceedings of the Summer School. To intensify contacts between specialists and first of all between young mathematicians from Russia and from the West. Scientific program Main lectures: Brezin E. (ENS, France) An introduction to matrix models Deift P. (Upenn, USA) Riemann-Hilbert Problems Kenyon R. (University Paris-11, France) Random maps from Z^2 to Z Bozejko M. (University of Wroclaw) Positive definite functions on Coxeter groups and second quantization of Young-Baxter type Kazakov V. (ENS, France) Matrix quantum mechanics and statistical physics on planar graphs Nazarov M. (University of York, UK) On the Frobenius rank of a skew Young diagram Okounkov A. (UCB, USA) Combinatorics and moduli spaces of curves Vershik A. (POMI, Russia) Asymptotic combinatorics as a theory of representation Borodin A. (Upenn, USA) Application of the Riemann-Hilbert problem in asymptotic representation theory Malyshev V. (INRIA, France) Asymptotic number of maps on surfaces: combinatorial approach Ol'shanski G. (IPPI, Russia) Introduction to asymptotic representation theory Neretin Yu. (Independent University, Russia) Poisson processes and polymorphisms Lascoux A. (University Marne-la-Valiee, France) The combinatorics of dimension of representations of the symmetric and linear group Speicher R. (University of Heidelberg, Germany) Free probability and non-crossing partitions Lectures or seminars: Biane Ph., Hora A., Jacobsen J.L., Korepin V., Pastur L., Zinn-Justin P. Round Table: Problems of the theory of random matrices Problem sessions: Asymptotics of Young tableaux and random configurations; Theory of integrable operators and determinant processes Poster session for students Participants Approximately 80 students from Belarus, France, Poland, Russia, Ukraine, UK, USA. Visas and invitations Contact email: emschool@pdmi.ras.ru First Announcement (TeX-file) Second Announcement (ps-file) Final List of Participants Final Timetable Photo Album Back to the EIMI home-page Back to the Steklov Institute of Mathematics at St.Petersburg
11th Postgraduate Combinatorics Conference
Intended to bring together current postgraduate students in combinatorics and related areas. Includes both contributed talks and talks by pre-eminent combinatorialists. Held together with the 2nd Postgraduate Group Theory Conference. QMW College, London, April 25-27, 2000.
Postgraduate Combinatorial Conference 2000 12th Postgraduate Combinatorial Conference 3rd Postgraduate Group Theory Conference 11TH POSTGRADUATE COMBINATORIAL CONFERENCE 25th - 27th April 2000, QMUL College, London supported by grants from the London Mathematical Society and the British Combinatorial Committee . Postmortem Guest speakers Arriving at the conference Registration and accomodation General information Conference organisers Some previous postgraduate conferences.
Combinatorics and Related Conferences in 2000
Maintained by the British Combinatorial Committee.
Conferences in 2000 Combinatorics and related conferences in 2000 There is a similar list for conferences in 2001. See also: CDAM conference list (discrete and applicable mathematics) Group Pub Forum (group theory and related areas) DMV-Fachgruppe Diskrete Mathematik December 2000 25ACCMCC (Australasian conference on combinatorial mathematics and combinatorial computing), Christchurch, New Zealand, 4-8 December 2000: Web page ATMGT2000 (Algebraic and Topological Methods in Graph Theory), Auckland, New Zealand, 11-15 December 2000: Web page and email address Peter Cameron 1 September 2000 BCC homepage
Interactive Activities: Combinatorial Games
Java implementations of several impartial, partizan, and one-player games garnered from the books Winning Ways and On Numbers and Games.
Interactive Mathematics Activities Username: Password: Sites for teachers Sites for parents Terms of use Awards Interactive Activities CTK Exchange Games Puzzles Arithmetic Algebra Geometry Probability Eye Opener Analog Gadgets Inventor's Paradox Did you know?... Proofs Math as Language Things Impossible My Logo Math Poll Cut The Knot! MSET99 Talk Other Math sites Front Page Movie shortcuts Personal info Reciprocal links Privacy Policy Guest book News sites Recommend this site Sites for teachers Sites for parents Wholesale Shopping Health Information Online Student Loan Help Networking Software Management Training Courses Interactive Mathematics Activities Memory and Matching Match answers Memory - Easy Memory - Medium Memory - Hard Arithmetic 2 Pails Puzzle 3 Jugs Puzzle 3 Jugs Puzzle in Barycentric Coordinates Abacus in Various Number Systems Aliquot Game Arithmetic Operations in Various Bases Broken Calculator Coin Game Collatz Conjecture Counting and Grouping Distributive Law Equivalent Fractions Even, Odd and Total Number of Digits Euclid's Game Farey Fractions Flipping Items Simultaneously Kaprekar's Iterations and Numbers Less, Equal, More Napier Bones Plain Multiplication table up to 2020 Sieve of Eratosthenes Sieve of Squares Soroban in Various Number Systems Suan Pan in Various Number Systems Sums and Products Sums of Powers of Digits Two Simple Equations Algebra Binary Color Device Breaking Chocolate Bars Candy Game: Integer Iterations on a Circle Chebyshev polynomials Counting Triangles Counting Triangles II Divisibility Problem Dots and Fractions Four Pegs That Form a Square Frieze Patterns Averages, Arithmetic and Harmonic Means Heads and Tails (counting, invariance) Identities in the Multiplication Table Integer Iterations on a Circle II (superposition principle) Integers and Rectangles Integers and Rectangles: a Proof by Induction Integers and Rectangles: Two Simple Proofs Interest Calculations Josephus Flavius Game Letter Count in a Sentence Logistic Model Loop or Halt Mean Values Merlin's Magic Squares (modular arithmetic, boolean and linear algebra) Minimax Principle Minimax Theorem Modular Arithmetic Parrondo Paradox Via Simpson Paradox Plus or Minus (parity, invariance) PolygonalNumbers Proizvolov's Identity Pythagorean Triples Rectangle on a Chessboard Self-documenting Sentences Sierpinski's Gasket and Dihedral Symmetry Signs in a Matrix Simple Cellular Automaton Simpson Paradox Solitaire in Two Colors Squares and Circles (parity, invariance) Squares, Circles, and Triangles (modular arithmetic, invariance) Sum of Consecutive Integers is Triangular Sum of Consecutive Odd Numbers is Square Sum of Consecutive Triangular Numbers is Square Toads And Frogs Puzzle (counting, logic, problem solving) Two Colors in Two Rows Two Colors in Two Rows II What's next? Word Problems Logic Lewis Carroll's Bilateral Diagrams Lewis Carroll's Trilateral Diagrams Lewis Carroll's Logic Game Venn Diagrams I Venn Diagrams II Fractals All Peano Curves Apollonian Gasket Color Cycling on the Mandelbrot Set Cantor sets Dot Patterns, Pascal Triangle and Lucas Theorem Emergence of Chaos Fractal Curves and Dimension Iterated Function Systems Iterations in the Mandelbrot Set Mandelbrot Set and Indexing of Julia Sets Plane Filling Curves: Hilbert's and Moore's Plane Filling Curves: Peano's and Wunderlich's Sierpinski Gasket By Common Trema Removal Sierpinski Gasket Via Chaos Game Sierpinski Gasket by Trema Removal The Chaos Game: Address Space vs IFS Probability Bertrand's Paradox Birds On a Wire Buffon's Noodle Family Statistics Lewis Carroll's pillow problem Monty Hall Dilemma Parrondo Paradox Random Clock Hands Stick Broken Into Three Pieces (Cartesian Coordinates) Stick Broken Into Three Pieces (Trilinear Coordinates) Three pancakes Who Needs Monty? Visual Illusions Assimilation Illusion Balls and Shadows Illusion Bulging lines illusion Circular Poggendorff Illusion Continuous Line Illusion Cube Counting Ambiguity Day's Sine Illusion Delboeuf Illusion Distorted Lines Illusion Gerbino's Illusion Heaver: A Visual Illusion Height Width Interplay Illusion Hering Illusion Hermann Grid Illusion Judd Illusion Kanizsa Triangle Mller-Lyer Illusion Necker Cube Orbison Illusion Parallelogram Illusion Perspective Illusion Poggendorff Illusion Poggendorff Illusion II Ponzo Illusion Ponzo Illusion II Revolving Circles Illusion Scintillating Grid Illusion Shepard's Parallelogram Illusion Shifting Cube Illusion Shimmer Illusion Simultaneous Contrast Illusion Simultaneous Contrast Illusion II Staircase Illusion Twisted Cord Illusion Wundt Illusion Wundt Block Illusion Zllner's Illusion Calculus Addition and Subtraction of Functions Derivative of Sine and Cosine Equations of the Straight Line Function, Derivative and Integral Graph of a Polynomial Inflection Points of Fourth Degree Polynomials Lagrange Interpolation Maximum Volume of a Cut Off Box Naturally Discontinuous Functions Riemann Sums - Function Integration Rolle's and Mean Value Theorems Taylor Series Approximation to Cosine Math Magic Arithmetic magic matrix Bachet's Magic Trick Calendar Magic Gergonne's Magic Trick Hummer's Mind Reader Magic in Square Number Guessing Game Two Numbers Guessing Game Combinatorics 3-Colors Tower of Hanoi Affirmative Action Problem Bicolor Tower of Hanoi Blithe 12 Cheapest Link Kruskal's Algorithms - skill practice Chvatal's Art Gallery Theorem Coin change Critical Path in a Weighted Digraph de Bruijn Cycle Euler Hamilton Paths - skill practice Five Lattice Points Flipping Items Simultaneously II Flipping pancakes Gray Codes Group multiplication of permutations Hanoing Happy 8 Hex Can't End in a Draw How to define a permutation Infinite Latin Square Latin Squares Leibniz and Pascal Triangles Life-like Automaton With Definable Rules Light Bulbs in a Circle Listing all permutations Lucky 7 Make Your Move, Kid! Marriage Problem, simulation Mazes Monotone Number Sequences Number sequences and Pigeonhole Project Scheduling Property of the Powers of 2 Sam Loyd's Fifteen Scrub Tile Puzzle Shuttle Puzzle Simple Graphs Sliders (slider games on torus, Moebius strip, projective plane, permutations, cycles) The Game of Life Tool for Constructing Orthogonal Latin Squares Tower of Hanoi Two Men of Tibet Y Can't End in a Draw Combinatorial Games Date Game (impartial game) Fraction Game (partisan game) Grundy's Game (impartial game) Kayles (impartial game) Nim (impartial game) Nimble (impartial game) Northcott's game (impartial game) One Pile (impartial game) Plainim (impartial game) Plainim Misre (impartial game) Scoring (impartial game) Scoring Misre (impartial game) Silver Dollar Game (impartial game) Silver Dollar Game With No Silver Dollar (impartial game) Sticks , Jess realization of Scoring Misre Sticky Problem Subtraction Game (impartial game) Take-Away Games (impartial game) Turning Turtles (impartial game) Wythoff's Nim (impartial game) Wythoff's Nim II (impartial game) Puzzles Games 444 Tic Tac Toe (spacial visualization) Changing Colors (combinatorics, invariance) Computer Mastermind (logic and problem solving) Farmer and Wife To Catch Rooster and Hen (invariance, city block distance) Fif (multiple representations) Fill a Hexagonal Grid (space visualization) Fish Soup Game (multiple representations) Four Knights (multiple representations) Goat, Cabbage and Wolf to move across a river (multiple representations) Jam (multiple representations) Looping Chips (multiple representations) Mastermind (logic and problem solving) Mastermind Variants (logic and problem solving) Peg Solitaire (logic, problem solving, subproblems) Pick A Label (logic, problem solving) Reverse Solitaire (logic, problem solving, subproblems) Sending scouts into the desert (algebra, geometric series, problem solving) Seven Coins Puzzle (multiple representations) Solitaire on a Circle (iterations, invariance) Tiling a Triangulated Hexagon (a proof without words) Toads And Frogs in 2 dimensions (repeated application of same idea) Tromino Puzzle Geometric Fallacies A Circle With Two Centers Curry's Paradox Delian Problem Solved A Faulty Dissection Langman's Paradox Sam Loyd's Son's Dissection Rouse Ball's Fallacy Two Perpendiculars From a Point to a Line Elementary Geometry A Property of Equiangular Polygons Angle Bisector Area of Median Triangle Arithmetic in Disguise Building a Bridge Carpet With a Hole Diagonal Count Divide a Circle into N Parts of Equal Area Equidecomposition of a Rectangle and a Square Equidecomposition of Two Rectangles Equidecomposition of a Triangle and a Rectangle Equidecomposition of Two Parallelograms Fibonacci Bamboozlement A Famous Theorem Geoboard Inscribed and Central Angles in a Circle Inscribed Angles Maimed Cake Mathematics in Pizzeria Polygon Metamorphosis Property of Angle Bisectors Pythagorean Theorem By Dissection Pythagorean Theorem By Dissection II Secant Angles Simple Quadrilaterals Tessellate the Plane Translation Transform Viviani's Theorem Viviani's Theorem II Geometry 2N-Wing Butterfly Theorem 3 Isosceles Trapezoids 5-Star and A Circle 9-point Circle as a Locus of Concurrency Adams' Circle Addition of Radius-Vectors An Isoperimetric Theorem Angle Bisectors and Perpendiculars in a Quadrilateral Angle Bisectors in a Quadrilateral Angle Preservation Property Angle Trisection by Archimedes Angle Trisection by Hippocrates Angle Trisectors on Circumcircle Another Pair of Twins in an Arbelos Anticomplementary Triangle Surprise Apollonian Circles Theorem Apollonius Problem Application of Ceva's Theorem Archimedes' Quadruplets Archimedes Triangle and Squaring of Parabola Archimedes' Twin Circles and a Brother Area of an Arbelos Area of Parallelogram Areas in Triangle Areas in Triangle II Asymmetric Propeller I Asymmetric Propeller II Asymmetric Propeller III Barycentric Coordinates: a Tool Bisectal Circle Book of Lemmas: Proposition 1 Book of Lemmas: Proposition 2 Book of Lemmas: Proposition 3 Book of Lemmas: Proposition 5 Book of Lemmas: Proposition 6 Book of Lemmas: Proposition 10 Book of Lemmas: Proposition 12 Book of Lemmas: Proposition 13 Bttcher's Proof of the Pythagorean Theorem Bttcher's Proof Variant Bottema's Theorem Brahmagupta's Theorem Brianchon's Theorem Bride's Chair Butterfly Problem Cantor's Theorem Cardioid As Envelope of Circles Cardioid As Epicycloid Carnot's Theorem Carpets Theorem Carpets Theorem With Parallelograms Center Circles and Their Chains Centroids in a Polygon Ceva and Menelaus Theorems for Angle Bisectors Ceva's Theorem Ceva's Theorem (PWW) Cevian Nest Cevian Triangle Chain of Inscribed Circles Chords in Cardioid Circle and Hyperbola as Lighthouse Curves Circle Chains and Inscribed Angles Circle Crosses Triangle Circle Inscribed in a Circular Segment Circle of Similitude Circles and Reflections in a Triangle Circles in Morley's Triangles Circles On Cevians Circumcevian Triangle Clifford Chain Clifford's Lemma Coaxal Circles Theorem Complete Quadrilateral Concurrency in Analytic Geometry Concurrency in Arbelos Concurrency in the Intouch Triangle Concyclic Circumcenters: A Dynamic View Conway's Circle Copernicus' Theorem Cycloids Cyclic Incenters Directly Similar Figures Desargues' Theorem Dividing a Segment into N parts: Besteman's Construction Dividing a Segment into N parts: Besteman's Construction II Dividing a Segment into N parts: GLaD Construction Dividing a Segment into N parts: SaRD Construction Double Generation Theorem Douglas' Theorem (complex variables, linear algebra) Droz-Farny Circles Droz-Farny Line Theorem Dual to Pappus' Theorem Dynamic Construction of Ellipse and Other Curves Easy Construction of Bicentric Quadrilateral Easy Construction of Bicentric Quadrilateral II Eight Point Circle Ellipse, how to draw Equal Incircles Theorem Equichordal Curves Equilateral Triangles On Sides of a Parallelogram Equilateral Triangles on Sides of a Quadrilateral Euler Line Cuts Off Equilateral Triangle Euclid I.43 Eyeball Theorem External Angle Bisector Fagnano's problem Fagnano's problem II Fagnano's Problem, Third Solution Fagnano's Problem in Reverse Fermat's Point Feuerbach's theorem Feuerbach's Theorem: A Proof Five Incircles Theorem First Vecten Point Five Cardioids Fixed Point of Circles Orthogonal to the Given One Fixed point on a rod rotating around a triangle Focal Properties of Parabola Four 9-Point Circles in a Quadrilateral Four Circles In a Triangle Four Concurrent Lines in a Cyclic Quadrilateral Four Incident Circles Four Touching Circles Four Triangles, One Circle Friendly Kiepert's Perspectors Fundamental Theorem of 3-Bar Motion Glide Reflection Golomb's inductive proof of a tromino theorem Gothic Arc Grebe's Theorem Harmonic Ratio Hart Circle Hart's Inversor Haruki's Lemma Heron's Problem Hexagon Parallel to Medial Triangle Hexagon Parallel to Orthic Triangle Hinged Squares Hofstadter Triangles and Points Homothety Hypocycloid Families Incenters in Cyclic Quadrilateral Incidence in Feuerbach's Theorem Incident Center Circles and Cardioid Incircles, Circumcircles and Inscribed Angles Inscriptible and Exscriptible Quadrilaterals Internal Tangents to Three Circles Inversion: Reflection in a Circle Inversion in the Incircle Inversion Tool Inversion with Negative Power Isogonal and Isotomic Conjugalities Isogonal Concurrency Isogonal image of the circumcircle Iterations in Geometry, an example Iterations in Geometry, Generalization Iterations on Euler Lines Kiepert's Theorem Law of Cosines La Hire's Theorem La Hire's Theorem, a Variant Lighthouse Curves Locus of Points in a Given Ratio to Two Points Malfatti's Problem Malfatti's Problem, Hart's Solution Maxwell's Theorem Medians in a Quadrilateral Menelaus and Ceva Theorems Menelaus From Ceva Minkowski's addition of convex shapes Miquel's Point Miquel's Point of a 4-line Via Spiral Similarity Mirror property of the altitudes Monge via Desargues Monge via Desargues II Morley Constellation Morley's Theorem Morley's Theorem Nagel Line Nagel point Nagel Point of Medial Triangle Napoleon Theorem by Plane Tesselation Newton's Construction of Conics Newton's Theorem Nine Point Circle Nobbs' Points, Gergonne Line Non-classic Way To Draw Cardioid On Bottema's Shoulders On Bottema's Shoulders II One Sided Surface in 4D Optimization Problem in Acute Angle Orthopole Pairs of Incircles in a Quadrilateral Pappus' Theorem Parabola As Envelope of Straight Lines Parabola As Envelope II Parabolic Mirror Paragon Parahexagon Parallel Lines and Similar Triangles Pascal Lines: Steiner and Kirkman Theorems Pascal Lines: Steiner and Kirkman Theorems II Peaucellier Linkage Pascal's Theorem Pedal Polygons Perigal's Proof of the Pythagorean Proposition Perpendicular Bisectors in an Inscriptible Quadrilateral Perpendicular Bisectors in an Inscriptible Quadrilateral II Pivot Theorem Point common to two similar rectangles Polar Circle Pole and Polar with respect to a Triangle Poles and Polars Poles, Polars and Quadrilaterals Polygon from midpoints of its sides Polygons Formed by Perpendicular Bisectors Poncelet's Porism Poncelet's Theorem Problem in an Equilateral Triangle Problem in an Equilateral Triangle II Problem in Three Squares Problem of Equal Steps Problem of Equal Steps II Problem of polygon construction Problem with Equilateral Triangles Product of Rotations Projective Collinearity in a Quadrilateral Proof Without Words for the Pythagorean Theorem Properties of the Circle of Similitude Property of Angle Bisectors II Property of Circumscribed Quadrilaterals Property of Points Where In- and Excircles Touch a Triangle Pythagorean Theorem By Euclid Pythagorean Theorem By Plane Tessellation Pythagorean Theorem By Hexagonal Tessellation Pythagorean Theorem By Rearrangement Pythagorean Theorem By Shearing and Rotations I Pythagorean Theorem By Shearing and Rotations II Quadrilaterals Formed by Perpendicular Bisectors Quest for Paragon Radical Axis and Center, an Application Radical Axis of Circles Inscribed in a Circular Segment Radical Center Rectangle in Arbelos Reflection In Line Reflections of a Line Through the Orthocenter Reflections of a Point on the Circumcircle Reflections of the Orthocenter Remarkable Line in Cyclic Quadrilateral Rotation Transform Rusty Compass Construction of Equilateral Triangle Salinon: from Archimedes Book of Lemmas See-Saw Lemma Segment Trisection Shape of Constant Width Siamese Triangles Siamese Triangles II Similar Triangles on Sides of a Quadrilateral Simson Line Simson Line From Isogonal Perspective Simson Lines Of Diametrically Opposite Points Simsons and 9-Point Circles in Cyclic Quadrilateral sin(N) Six Circles Theorem (Elkies) Six Circles Theorem (Evelyn) Six Incircles in an Equilateral Triangle Soddy Circles and David Eppstein's Centers Sperner's Lemma Spira Mirabilis - Wonderful Spiral Square Inscribed in a Triangle Square Inscribed in a Triangle II Squares Inscribed In a Triangle III Squares on Sides of a Quadrilateral Squinting Eyes Theorem Star Construction of Shapes of Constant Width Steiner's Chain Steiner's porism Straight Edge Construction of Polar Symmedian and Antiparallel Symmedian and 2 Antiparallels Symmedian and the Tangents Tangency Point of Two Circles Tangent and Secant Tangent in Concurrency Tangents and Diagonals in Cyclic Quadrilateral Tesseract Thbault's Problem I Thbault's Problem II Thbault's Problem III Theorem of Complete Quadrilateral Three Incircles in a Triangle Three Isosceles Triangles Three Parabola Tangents Three Roads, Three Travelers Three Similar Polygons Three Similar Triangles Three Similar Triangles (but differently oriented) Three Similar Triangles (but differently oriented) II Three Tangent Circles Three Tangents Theorem Three Tangents Theorem II Three Tangents, Three Secants Touching Circles Triangle and Segment Count in a Polygon Tucker Circles Two Butterflies Theorem Two Butterflies Theorem II Two Butterflies Theorem III Two Circles in a Parallelogram Two Circles in a Square Two Proofs of MenelausTheorem Two Quadrilaterals Two Squares and Another Square Two Triples of Similar Triangles Two Tangents to Parabola Triangle Geometry Triangular Billiard Trigonometric Form of Ceva's Theorem (a tool for discovery of trigonometric identities and other problems) Tucker Circles Through Homothety Two Tangents to Parabola Varignon Parallelogram Vecten's Collinearity Vecten's Theorem Versatile Theorem What does one see inside a spherical mirror? When a Triangle is Equilateral Wittenbauer's Parallelogram Zaslavsky's theorem Social Science Adams' Apportionment Method Fair Division: Method of Lone Divider Fair Division: Method of Markers Fair Division: Method of Sealed Bids Fast Power Indices Hamilton's Apportionment Method Huntington-Hill Apportionment Method Jefferson's Apportionment Method Social Choice Webster's Apportionment Method Weighted Voting and Power Indices Miscellaneous Demonstrations Convex Polygon Is the Intersection of Half Planes Disappearing Lines Disappearing Rectangles Distance Between Strings Experimentation with Dynamic Geometry Software: An Example Genetic Algorithm Solves the Toads and Frogs Puzzle Impossible Fork Morphing Popping A Square Projectile Trajectory Random Dot Stereograms Ratchet Effect Rotating Gears Sorting Algorithms Structural Constellation Copyright 1996-2005 Alexander Bogomolny 15490841 Search: All Products Apparel Baby Beauty Books DVD Electronics Home Garden Gourmet Food Personal Care Jewelry Watches Housewares Magazines Musical Instruments Music Computers Camera Photo Software Sports Outdoors Tools Hardware Toys Games VHS Computer Games Cell Phones Keywords: Google Web CTK Latest on CTK Exchange probability Posted by tennyson 6 messages 03:13PM, Aug-29-05 The number 0.142857..... Posted by Zakatos 2 messages 10:54AM, Nov-05-05 SSA Postulate Posted by Allison 1 messages 02:23PM, Nov-16-05 Gift Exchange probability Posted by Owen 10 messages 11:27PM, Nov-16-05 A self-referencing sentence in us ... Posted by Paul R. 1 messages 09:42PM, Nov-16-05 Complex number solutions Posted by Owen 2 messages 10:16AM, Nov-14-05
GAMESMAN
Game-independent Automatic Move position-tree Exhaustive-Search, Manipulation And Navigation. Tool for analyzing and playing small two-player games, built independent of the actual game being played.
Dan Garcia : Software : GAMESMAN This is a deprecated page. Please see my Undergraduate Game Theory Research Group GamesCrafters for the current state of the project. "There once was a prof known as Danny... who couldn't play games worth a penny. He wrote a small program... that played them all fo' him. Now he indeed seems quite canny!" -- Daniel Horn, UC Berkeley EECS alumnus GAMESMAN A Finite, Two-Person, Perfect-Information Game Generator Overview GAMESMAN (Game-independent Automatic Move position-tree Exhaustive-Search, Manipulation And Navigation) is my Master's thesis (2Mb pdf) and accompanying awesome software which I finished in the Spring of 1995. [I've written up a brief, 5-page introduction to the system. ] Abstract "Why write a program when you can write a program to write a program?" -- Author unknown This Master's report introduces GAMESMAN, a system for generating graphical parametrizable game applications. Programmers write game 'modules' for a specific game, which when combined with our libraries, compile together to become stand-alone X-window applications as shown in the Figure below. The modules only need contain information about the rules of the game and how the game ends. If the game is small-enough, it may be solved, and the computer can play the role of an oracle, or 'perfect' opponent. This oracle can advise a novice player how to play, and teach the strategy of the game even though none was programmed into the system! If a game is too large to be solved exhaustively, the game programmer can add heuristics to provide an imperfect computer opponent. Finally, the application can provide a useful utility to two human players who are playing each other, since it can be a 'referee' who constrains the users' moves to be only valid moves, can update the board to respond to the move, and can signal when one of the players has won. WWW Maven: Dan Garcia ( ddgarcia@cs.berkeley.edu ) Send me feedback
'3in1' Graphs
14th Workshop. Dobczce, Poland; 10--12 November 2005.
Workshop '3in1' Graphs 14th Workshop '3in1' Graphs 2005 Dobczyce, Poland November 10-12, 2005 What | When | Where | Who | Why | How | What about Dear Colleague, Faculty of Applied Mathematics AGH in Cracow cordially invites you to attend The 14th Workshop '3in1' Graphs 2005 to be held in Dobczyce (Poland, ca 20 km from Cracow), November 10-12, 2005 (from Thursday noon till Saturday noon). The workshop will focus on solving some open problems in graph theory. Approximate cost (bed and board + banquet + fee) ca 110 EUR. Additional accommodation (before or after the meeting) can be requested at the price 20 EUR (with breakfast). Single and double rooms only, with bathrooms, . Proceedings of the Workshop will be published as a special volume of "Discussiones Mathematicae - Graph Theory". Weather conditions are unpredictable, from sun or rain to snow and frost, but the weather forecast for Dobczyce is available at this Web sites: Dreakmore Gazeta.pl . e-mail: 3in1@agh.edu.pl www: http: galaxy.agh.edu.pl ~3in1 phone: +48 12 617 3592 fax: +48 12 617 3165 mailing address: al. Mickiewicza 30, 30-059 Krakw, Poland
Analysis on Graphs and its Applications
Research programme at the Isaac Newton Institute, Cambridge, UK; 8 January - 29 June 2007.
INI Programme AGA - Institute Home Page Programmes Web-Seminars Programme Home Seminars Workshops Additional Links Contacts Mailing List Isaac Newton Institute for Mathematical Sciences Analysis on Graphs and its Applications 8 January - 29 June 2007 Organisers: Professor BM Brown (Cardiff), Professor P Exner (Czech Academy of Sciences), Professor P Kuchment (Texas) and Professor T Sunada (Meiji) Scientific Advisors: : Professor WD Evans (Cardiff), Professor JP Keating (Bristol), Professor B Pavlov (Auckland), Professor A Teplyaev (Connecticut) and Professor C de Verdire (Institut Fourier) Programme Theme Analysis on graphs and other discrete structures has been developing for quite some time, in particular due to applications to number theory, algebra, probability theory, spectral geometry, as well as to its usefulness in many practical problems. This area, however, has experienced recently a significant boost in terms of new important applications arising, new methods being developed, and new models introduced not studied before. This has happened due to numerous new applications arising in different areas of mathematics, sciences, and engineering. They swipe throughout a wide scientific landscape, which besides the fields already mentioned includes nanotechnology, microelectronics, quantum chemistry, superconductivity, optics, etc. New objects, so called quantum graphs have also emerged. These are graphs considered as one-dimensional CW-complexes and equipped with differential or pseudo-differential, rather than customary difference operators. Such graphs, besides being in many cases useful low-dimensional models of complex systems, are also used as toy models for studying difficult issues such as Anderson localisation, scattering, and quantum chaos. This has lead to interest in this research by scientists coming from different fields (physics, partial differential equations, algebra, combinatorics, number theory). The methods already used or expected to be useful in analysis on graphs come from a very wide range of topics: algebra, combinatorics, PDEs, spectral theory, micro-local and complex analysis, to name a few. The program will assemble, essentially for the first time, a diverse group of prominent mathematicians and physicists, as well as young researchers working in or interested in entering this fast developing and fascinating area. The hope is to facilitate the process of communication and cooperation, thereby promoting accelerated progress in this burgeoning new area. Among the particular topics that will be addressed during the program are: Spectral analysis on combinatorial graphs and its applications to number theory, discrete groups, random walks, and other areas; Quantum graph models for wave propagation in thin structures and for quantum and optical switching and computing; Spectral analysis and quantum chaos on quantum graphs; Analysis on fractals.
Aveiro Workshop on Graph Spectra
Aveiro, Portugal; 10--12 April 2006.
AVEIRO WORKSHOP ON GRAPH SPECTRA Home Fees and Deadlines Registration Special Issue Committees Conference Program Social Events List of participants General Information Support Contacts My Account Home About the workshop The theory of graph spectra is now a well established field of research in mathematics and in several applied sciences (e.g. chemistry), and many results have been published over the last few decades. In recognition of the strong developments in the subject, this workshop has been organized as a forum for the many researchers around the world. The main goals of the workshop are to bring together the leading researchers on graph spectra and related topics, to establish the state of the art, and to discuss recent achievements and challenges. The topics include applications of graph spectra to chemistry and other branches of science. The members of the Scientific Committee are among the renowned specialists on spectral graph theory who will deliver 10 plenary presentations. Additionally, we have planned a problem session and a few parallel contributions where international experts will be able to present their most recent results. Contributors should submit the pdf file of their abstract (no more than two A4 pages), attached to their registration form or to a message sent to awgs@mat.ua.pt , by January 15, 2006. Notification of acceptance will be sent by February 15, 2006. After that contributors should also send the LaTex file ( Here you can find the Template LaTex file). There will be no financial support to contributors. However, we hope to be able to provide a limited number of free accommodations for up to four nights (between April 9 and April 13) for students and junior scientist participants. Requests should be sent by March 1, after registration and fee payment by bank transfer (see details in Fees and Deadlines ), by email to awgs@mat.ua.pt . Hotels should be contacted directly. Please see addresses of some hotels and other information about the town in General Information . Here you can download the poster about the workshop. Sponsors Home | Fees and Deadlines | Registration | Special Issue | Committees | Conference Program | Social Events | List of participants | General Information | Support | Contacts Developed by Mentes Virtuais
Graph Theory White Pages
Directory of graph theorists maintained by Daniel P. Sanders.
You are using a 0 browser. MICE can only be used with IE 5.0, IE 6.0, Netscape 7, Opera or Mozilla, not IE 4.0, Netscape 4.x or earlier browsers. CS@CU Not Found Education Admissions Undergraduate Graduate Courses Research Areas Publications People Faculty Directory Alumni Resources A to Z Computing Jobs Directions Newsletters Page Not Found The page you are trying to reach does not exist. We have recently redesigned our website, so the page you are trying to reach may have been moved. You can search for the page: Contact the with questions or comments about this site. Credits Columbia University Department of Computer Science Fu Foundation School of Engineering Applied Science 450 Computer Science Building 1214 Amsterdam Avenue, Mailcode: 0401 New York, New York 10027-7003 Tel: 1.212.939.7000 Fax: 1.212.666.0140
Gordon Royle
Algebraic graph theory.
Gordon Royle Research Publications Combinatorial data Mathematical Links Talks and Writings Teaching Java Programming CS124 Combinatorial Enumeration CS489 Administration Associate Head of Department International Education Co-ordinator Contact Addresses gordon@csse.uwa.edu.au
Erich Prisner
Graph theory, algorithms, computational geometry and cellular automata.
Dr. E. Prisner Erich Prisner Universitt Hamburg Fachbereich Mathematik Bundesstr. 55 D-20146 Hamburg Raum: 334 Telefon: +49 40 42838-5194 Email: prisner@math.uni-hamburg.de List of papers Research Interests: Graph Transformations Intersection Graphs Distance in Graphs Interconnection Networks Graph Algorithms Computational Geometry Cellular Automata Welt ... Europa ... Deutschland ... Hamburg Universitt Hamburg ... Fachbereich Mathematik ... Schwerpunkt Geometrie Diskrete Mathematik (C)Schwerpunkt Geometrie und Diskrete Mathematik. Last modified Okt. 1997
David Penman
Random graphs, computational combinatorics.
Dr David B. Penman Dr David B. Penman Lecturer in Probability Room: 6.307 Telephone: +44 1206 872839 Email: dbpenman at essex.ac.uk Contact Information Research Interests A new class of random graphs. Instead of the classical assumption that all edges arise independently of each other, with the same probability, one assumes that each vertex independently receives one of k colours and then the probability that an edge between two vertices arises depends on the colours of the two vertices. Since the colours of the vertices are assumed hidden, whether or not edges are present are no longer independent of each other: for example, with two equiprobable colours, if edges arise between vertices of the same colour with probability p and between vertices of different colours with probability q, the probability of the triangle 1-2-3-1 arising is ((p+q) 2)^3+((p-q) 2)^3 rather than ((p+q) 2)^3 as classically. The thrust of the research is to consider the probability of the random graphs in these more general models having various properties, and compare and contrast this with the corresponding probability in that classical model where the overall probability of each edge arising is the same, so that the differences between the two reflect the dependence structure in the new model. Member of the Computational Combinatorics Group Copyright 2004 University of Essex. Last updated on 13 August 2004.
Rich Lundgren
Applied graph theory and combinatorial matrix theory.
Rich Lundgren's Homepage Welcome to Rich Lundgren's Home Page! Professor of Mathematics How to find me Vita Professional Informaton Teaching Research Discrete Math Seminar Personal Information Last Upated: 8 20 04 by Rich Lundgren
Hubert de Fraysseix
Topological graph theory and combinatorics.
Hubert de Fraysseix - Home
Dan Archdeacon
Topological graph theory, combinatorics, theoretical computer science.
Dan Archdeacon's Home Page Dan Archdeacon's Home Page last modified June 6, 2005 I am a Professor in the Department of Mathematics and Statistics at the University of Vermont . For more information click one of the following: Teaching Research Personal How to Contact Me Most frequent links (for my convenience) EM webmail server Search with Google Teaching In the Fall '05 semester I'm teaching: Math 21 - Calculus I Math 373 - Topics in Combinatorics Here is the UVM Registar's home page. Here is the CAES (Conference and Events Services) home page to reserve rooms. Classes at UVM frequently have Mathematica Labs . Mathematica is a product of Wolfram Research . Return to the top of the page Research My research interests are in Graph Theory, Combinatorics, and Theoretical Computer Science. I am particularly interested in Topological Graph Theory. I maintain several other web pages. Problems in Topological Graph Theory , an ongoing online list of open problems. A gallary of graphs , with many obstruction sets. Copies of some recent papers (and some not so recent papers). I direct the Editorial Offices of The Journal of Graph Theory (also see Wiley's JGT home page). We run an Applied Combinatorics Seminar . This is a collaborative effort between UVM's Department of Mathematics and Statistics and St. Michael's University Department of Mathematics , with occasional tie-ins to UVM's Department of Computer Science , and to IBM. Here are some other helpful links: Graph Theory White Pages Graph Theory Journals Graph Theory Conferences MathSciNet Search Voyager (UVM Libraries) The Electronic Journal of Combinatorics I have an especially rich academic heritage (pdf format). Return to the top of the page Personal I am a Professor in the Department of Mathematics and Statistics at the University of Vermont . The Department is a part of both the College of Engineering and Mathematical Sciences and the College of Arts and Sciences . The university is located in City of Burlington , Vermont. The Arts and Entertainment Channel (AE Top 10) ranks Burlington as one of the 10 most desired cities to live in America (in fact, we're 1!). Find out more about the State of Vermont , and life in Vermont . I am married to Mara Saule. We have two children, Talis (age 23) Nick (age 18). In the summer we kayak and sail on Lake Iroquois. In the winter we ski at Mad River Glen . Return to the top of the page How to contact me: E-Mail: dan.archdeacon@uvm.edu Work Address: Dan Archdeacon Dept. of Mathematics Statistics University of Vermont Burlington VT 05405-0156 USA Home Address: Dan Archdeacon 4797 Oak Hill Road Williston, VT USA 05495 Phone Numbers: Office: (802) 656-0850 Department: (802) 656-2940 Fax: (802) 656-2552 Home: (802) 872-0023 Return to the top of the page
Keith Edwards
Harmonious colourings and achromatic number.
Keith Edwards' Home Page Keith Edwards Address: Division of Applied Computing University of Dundee Dundee DD1 4HN E-mail: kjedwards@dundee.ac.uk Phone: 01382 384463 Research Interests: Graph Theory Harmonious Colourings and Achromatic Number Includes a detailed bibliography . Graph Colourings Enumeration Problems Algorithms Algorithms for Graphs Problems NP-Completeness Links of interest University of Dundee Home Page Applied Computing Dept. Maths Dept. Edinburgh Mathematical Society London Mathematical Society American Mathematical Society European Mathematical Society UK Maths Departments British Combinatorial Committee Past British Combinatorial Conferences - lists of speakers etc. Graph Theory White Pages The Electronic Journal of Combinatorics and World Combinatorics Exchange ECCC - The Electronic Colloquium on Computational Complexity A compendium of NP optimization problems Open Problems in Combinatorial Optimization Updates for Toft and Jensen's book "Graph colourings" Joe Culberson's Graph Coloring Page Combinatorial Object Server Combinatorial Catalogues Regular Graphs University of Tennessee Archive Hamiltonian Cycle Page Mathematics Software, Tools and Projects Integer Sequence Search Inverse Symbolic Calculator Plouffe's Inverter Tex archive This page is the personal responsibility of Keith Edwards. The views expressed here do not necessarily represent the official views of the University.
Gary Chartrand
Graph structures, distance in graphs and domination.
Gary Chartrand Gary Chartrand 4424 Everett Tower (616) 387-4533 chartrand@wmich.edu Gary received his Ph.D. in 1964 under the direction of Edward A. Nordhaus at Michigan State University. He has been at WMU since then, spending a year at the University of Michigan as a Research Associate with Frank Harary and taking sabbaticals at the University of California, Santa Barbara and San Jose State University. He has written Introductory Graph Theory , and co-authored Applied and Algorithmic Graph Theory with Ortrud R. Oellermann and the third edition of Graphs Digraphs with Linda Lesniak. He is currently writing the text Mathematical Proofs . His research area is graph theory, and his current research interests include graph structures, distance in graphs, and domination. More details are given in an abbreviated vita. His nonacademic interests include Broadway musicals, show music, movies, writing, and sports. http: www.wmich.edu math-stat faculty chartrand Last modified: June 10, 1996
Ashay Dharwadker
Algebra, topology, graph theory and theoretical computer science.
Ashay Dharwadker's Profile Ashay Dharwadker Born January 1, 1967, New Delhi, India Address: H-501 Palam Vihar, District Gurgaon, Haryana 122017, India. Website: :: http: www.geocities.com dharwadker Email: :: dharwadker@yahoo.com Research: Algebra, combinatorics, topology and their applications. Theoretical computer science and information technology. :: Google Directory - Graph Theorists Common Systems of Coset Representatives, :: http: www.geocities.com dharwadker coset.html , 2005. Using the axiom of choice, we prove that given any group G and a finite subgroup H, there always exists a common system of representatives for the left and right cosets of H in G. A New Algorithm for finding Hamiltonian Circuits, :: http: www.geocities.com dharwadker hamilton , 2004. We present a new polynomial-time algorithm for finding Hamiltonian circuits in certain graphs. It is shown that the algorithm always finds a Hamiltonian circuit in graphs that have at least three vertices and minimum degree at least half the total number of vertices. In the process, we also obtain a constructive proof of Diracs famous theorem of 1952, for the first time. There are no known examples of Hamiltonian graphs for which this algorithm cannot find a Hamiltonian circuit. In view of the importance of the P versus NP question, we ask: does there exist a Hamiltonian graph for which this algorithm cannot find a Hamiltonian circuit? The algorithm is implemented in C++ and the program is demonstrated with several examples. :: The Math Forum Review Heptahedron and Roman Surface, :: http: www.eg-models.de , Electronic Geometry Models, Model 2003.05.001, 2004. Using Hilbert's definition of a heptahedron we show how to construct Steiner's Roman surface as a model of the projective plane. :: Eric Weisstein's World of Mathematics - Roman Surface :: Eric Weisstein's World of Mathematics - Heptahedron My Students Database, :: http: members.lycos.co.uk dharwadker , 2003. A prototype online relational database management system in Boyce-Codd normal form using MySQL, PHP and Apache web server. Riemann Surfaces, :: http: www.eg-models.de , Electronic Geometry Models, Model 2002.05.001, 2003. Riemann surfaces were first studied by Bernhard Riemann in his Inauguraldissertation at Gttingen in 1851. This paper shows the construction of the surfaces w=zn. Calculus 1.0, :: http: www.geocities.com dharwadker calculus.html , 2003 and 2005. Software for Windows: Compute and graph functions, derivatives, integrals, tangents, arc lengths, areas, roots, maxima minima, points of inflection, Taylor series and Fourier series, areas and volumes of surfaces of revolution, estimate limits of functions, sequences and series. :: The Math Forum - Single Variable Calculus :: The Math Works - Calculus The Witt Design, :: http: www.geocities.com dharwadker witt.html , 2002. The Steiner system S(5,8,24) with a C++ program to generate the Witt design, Golay code and projective plane PG(2,4). :: Design Resources at Queen Mary, University of London :: The Math Forum Review :: Rose-Hulman Math Journal - Tight Subdesigns of The Higman-Sims Design A New Proof of The Four Colour Theorem, :: http: www.geocities.com dharwadker , 2000. A new proof of the famous Four Colour Theorem using Steiner systems, Eilenberg modules, Hall matchings and Riemann surfaces. :: Canadian Mathematical Society Award :: The Math Forum Review :: Tlvunot Frttahorn Article :: History of the Four-Color Conjecture :: Google Directory - Graph Theory :: Dr. Matrix Award for Science Excellence - Mathematics :: Dr. Matrix Award for Science Excellence - Creative Minds :: Yahoo! - Famous Mathematics Problems Split Extensions and Representations of Moufang Loops, Communications in Algebra 23(11), 4245-4255, 1995. A representation theory of Moufang loops generalizing the traditional representation theory of groups. :: European Mathematical Society Review Reviewer: United States - Israel Binational Science Foundation :: Mathematics and Computer Science Research Grants 2004-2005 Editor: Open Directory Project :: Graph Theory Teaching: :: Today's Lecture Copyright 2005 by Ashay Dharwadker . All rights reserved. geovisit();
David Eppstein
Graph algorithms and computational geometry.
David Eppstein David Eppstein About Contact Research Students Classes Software Math Fun I am a professor in the Computer Science Department , Donald Bren School of Information and Computer Sciences , University of California, Irvine. Recent topics in my research: Computational geometry and geometric optimization Triangulation and mesh generation Graph drawing and information visualization Data depth and robust statistics Analysis of exponential-time algorithms I am also an avid photographer and have many photos in my web photo gallery . This site is quite static; if you want more frequent updates (or to find out what's changed here) go to my livejournal . My name is not uncommon (although the spelling is atypical); see my page of Eppsteins on the net if you think you've reached the wrong me.
Tom Whaley
Formal development of programs, Steinhaus graphs, parallel computing.
Tom Whaley Tom Whaley Office: Science Center P406 Office phone: 540-463-8813 Office Hours: MTuF 2-3 and by appointment E-mail: whaley@wlu.edu Computer Science Department Home Page Classes CS111 Fundamentals of Computer Science I Research Interests Formal development of programs, correctness of programs, Steinhaus graphs , parallel computing Publications
Bela Bollobas
Functional analysis, combinatorics and graph theory.
Dr. Bela Bollobas Dr. Bela Bollobas Professor Hardin Chair of Excellence in Combinatorics D. Sc., Cambridge University, 1985 Ph.D., Cambridge University, 1972 Dr. Rer. Nat., Budapest, 1967 Department of Mathematical Sciences The University of Memphis Memphis, TN 38152-3240 Office: 243 Winfield Dunn Phone: (901) 678-5610 Fax: (901) 678-2480 email: bollobas@msci.memphis.edu Research interests: functional analysis and combinatorics. Mathematical Sciences Faculty Department of Mathematical Sciences
Stephen C. Locke
Graph theory and algorithms.
Stephen C. Locke S.C. Locke You can contact me at LockeS@fau.edu . Problem of the Week BA BS Checkout Sheet , BA Flow Chart , BS Flow Chart . The Combinatorics Conference . My course syllabi . Search Engines . FAU text only page . The national test (Grade 8) . Background Information Professor, Department of Mathematical Sciences , and Professor, Department of Biomedical Science , Florida Atlantic University . Ph.D. in Combinatorics and Optimization , University of Waterloo , 1982. Ph.D. Supervisor: Professor J.A. Bondy . Thesis title: Extremal Properties of Paths, Cycles and k-Colourable Subgraphs of Graphs M.Math. ( Combinatorics and Optimization ) University of Waterloo , 1976. B.Math. ( Combinatorics and Optimization and Pure Mathematics ) University of Waterloo , 1975. Putnam competitor for all four years. Our team won in 1974. Married since 1974 to Joanne Thomson Locke . Sons Daniel and Geoffrey ( Jeff ). Research Titles and Abstracts Graph Theory and Graph Theory Algorithms, particularly Dirac-type conditions and long cycles, independence ratio in triangle-free graphs. Courses Taught 1995 recipient of a Teaching Incentive Award. Thank you to all the students who wrote letters on my behalf. 1998-1999 recipient of an Award for Excellence in Undergraduate Advising. Service Duties Hobbies Godan: Judo May 24, 1995. Godan: Ju-Jitsu May 24, 1995. Tomodachi Judo Club Information on the Tomodachi Judo Club (Boca Raton, Boynton Beach). Telephone: 561-496-7000 Duplicate Bridge: American Contract Bridge League , Life Master (2004). Jobs in the SUS University of Waterloo (CORR) Research Reports Looking for a sixth? http: problems.math.umr.edu Canadian Universities Canadian Universities: Mathematics Departments Canadian Mathematics Positions University Positions (mainly non-academic) Canadian Directory Assistance Sun-Sentinel's College Page with links to Florida Universities and Junior Colleges Palm Beach County School District Math Servers Penn State's List of Math Servers American Mathematical Society Free Trial of MathSciNet (until December 15, 1995) World Wide Web Worm HTML Symbols Frank Garvan's list of Math Symbol gifs Queen's University e-mail Address Finder Hockey News Where The Rules Come From Old English Pages Anglo-Saxon, Norse, Celtic at Cambridge Celts and Saxons Translations Boca Raton High School Minority Students Health Careers Motivation Program , University of Miami School of Medicine, P.O. Box 016960 (R 128), Miami, FL 33101. 305-243-5998. vcrawfor@mednet.med.miami.edu . http: www.math.fau.edu locke Premed PAprograms.htm : Some PA schools Captain Myranda L. Vereen ,U.S. Army Health Care Recruiter, 1999. AAMCAS Application Other contact points Department of Mathematical Sciences Florida Atlantic University 777 Glades Road Boca Raton , Florida 33431-0991 USA Office: Room 286, Science Engineering Phone: (561) 297-3350 Fax: (561) 297-2436 Email: LockeS@fau.edu URL: http: www.math.fau.edu locke Last modified October 6, 1999, by S.C. Locke. Please send your comments to LockeS@fau.edu
Some Open Problems in Graph Theory
Open Problems involving Steiner distance.
Open Problems in Graph Theory involving Steiner Distance Some Open Problems in Graph Theory It has been shown by Chartrand, Oellermann, Tian, and Zou that, for a tree T: diamn T = [n (n-1)] radn T for all n =2. This inequality does not hold for graphs in general as was shown by Henning, Oellermann, and Swart . It was shown in the same paper that for a graph G and n=3 and 4: diamn G = [2(n-1) (2n-1)] rad n G. It was conjectured in the same paper that this inequality holds for all n = 3. However, it remains an open problem for n =5. It was shown by Oellermann and Tian that for a tree T: Cn-1(T) is contained in Cn (T) for all n =3. It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-center of a graph is contained in its Steiner n-center. It was shown by Beineke, Oellermann and Pippert that if T is a tree, then Mn-1(T) is contained in Mn (T) for all n = 3. It remains an open problem to determine whether this containment holds for general graphs. In other words, it is not known if the Steiner (n-1)-median of a graph is contained in its Steiner n-median. It is known that for a given n = 2 every graph is the Steiner n-center of some graph. (Also, the Steiner n-centers of trees were characterized by Oellermann and Tian ). It is known that every graph is the 2-median of some graph (see Holbert ,and Hendry ). Steiner n-medians of trees have been completely characterized by Beineke, Oellermann, and Pippert. However, it remains an open problem to determine which graphs are Steiner n-medians of graphs for n = 3. It was shown by Oellermann that Steiner n-centers and Steiner n-medians of trees can be specified according to their characterizations and that they can be arbitrarily far apart. Holbert... showed that the 2-center and 2-median of a graph can be specified and that these can be arbitrarily far apart in some graph. However, for n 2, this problem is still open. Of course, solving this problem can only be attempted once problem 4 has been solved. Copyright 1998. Ortrud Oellermann URL: http: www.uwinnipeg.ca ~ooellerm open_problems index.html
Some Open Problems
Kzdy's open problems.
Kzdy -- Some Open Problems Sums Modulo n, Cyclic Neofields, and Tree Embeddings These problems arise from some of my work with Hunter Snevily (University of Idaho at Moscow, ID). Kzdy and Snevily (in our paper entitled ``Distinct sums modulo n and tree embeddings``, submitted) have conjectured the following four conjectures. Let [k] = {1,...,k}. A function f: [k] x [k] Zn is alternating if f(i,j) = - f(j,i) (mod n), for all i,j. Permutations are viewed as sequences, so the permutation in Sn is viewed as the sequence (1), (2), ..., (n). For i,j, define the distance in from i to j, denoted d(i,j), as the quantity -1(j) - -1(i). Clearly d(i,j) = -d(j,i) (i.e. d is an alternating function). Conjecture A: For any positive integers k and n satisfying k n, and any alternating function f: [k] x [k] Zn, there exists a permutation in Sk, such that d(i,j) f(i,j) (mod n), for all distinct i,j in [k] We have proven Conjecture A when n is prime. For a = (a1,a2,...,ak) in Znk, let (n,a) denote the number of permutations in Sk such that are all distinct modulo n. Define N(n,k) = min { (n,a) : a in Znk}. Snevily has conjectured that N(n,k) 0 for all positive integers n and k satisfying k n (see conjecture 4 in ``The Cayley addition table of Zn``, by H. Snevily, Amer. Math. Monthly, 106 No. 6, June-July (1999), 584-585). Conjecture B: N(n,k) is monotone in n and k. Specifically, N(n,k) N(n,k+1) for all n and k satisying 0 k n - 1, and N(n,k) N(n+1,k), for all n and k satisfying 0 k n. Conjecture C: For n sufficiently large with respect to k, N(n,2k) = (k!)2 and N(n,2k+1) = (k+1)(k!)2 . Note that, if true, Conjecture C would be sharp because a=(0,...0,n-1...n-1) achieves the bound (where the number of 0's is floor(k 2) and the number of n-1's is ceiling(k 2)). In light of the apparent monotonicity of N(n,k), a particularly interesting value of this function occurs when k = n-1. We conjecture the following... Conjecture D: For n 3, N(n,n-1) is equal to the number of cyclic neofields of order n+1. Partitioning Permutations The problems in this section arise from some of my work with Hunter Snevily (University of Idaho at Moscow, Idaho) and Chi Wang (University of Louisville, Louisville, KY). Determine all forbidden permutations that characterize (2,1)-permutations. That is, find all permutations that can not be partitioned into 2 increasing and 1 decreasing subsequences, and are minimal with this property. For example, 210543, or 216480375. We believe there are 102 such permutations. Our paper shows that there are at most a finite number of these (the bound is sure to be no where near the right answer). For a list of known 102 forbidden (1,2)-permutations, please e-mail me at: kezdy@louisville.edu Determine the forbidden induced subgraph characterization of (2,2)-comparability graphs. That is, find all comparability graphs whose vertex set cannot be partitioned into two independent sets and two cliques, and are minimal with this property.
Gordon Royle's Open Questions
Colouring, algebraic graph theory, geometries.
Gordon Royle's Open Questions Open questions This page lists a variety of questions in combinatorics that I believe are open questions and to which I would be interested in knowing the answer. For the moment there is no particular order to the questions, nor any segregation between questions of great difficulty and importance and incremental advances in pushing back the borders of knowledge. Of course this information will change over time - please let me know if you can update any of the information here. Also I am far from being an expert in many of these areas so if you see any blunders or can inform me of any further information please mail gordon@cs.uwa.edu.au This is all very much under construction - besides being lazy, I have a million other things to do. Graph Theory Graph colouring The ultimate reference for open questions on graph colouring is the recent book Graph Coloring Problems by Tommy Jensen and Bjarne Toft. I will just be mentioning some of the ones that I find most appealing (i.e. nothing to do with embeddings or asymptotics), and some that do not appear in GCP. Prove or disprove Hedetniemi's conjecture that the product of two graphs of chromatic number n must also have chromatic number n. See GCP, Problem 11.1. Miscellaneous Prove or disprove: every (finite) graph with minimum degree at least 3 contains some cycle with length a power of two. (This is a pretty weird conjecture, looks like it ought to be false, but there are no obvious immediate counterexamples.) I have obtained some negative computer results. Question due to Erdos and Gyarfas. Algebraic Graph Theory Eigenvalues of graphs What is the maximum spectral radius attained by a planar graph on n vertices. I strongly conjecture that the graph obtained by completely joining the path on 2 vertices to the path on n-2 vertices achieves the maximum. There is some evidence to support this conjecture. Strongly regular graphs Find or prove non-existent strongly regular graph with the following parameter sets: (3250,57,0,1) - Moore graph. (65,32,15,16) - smallest parameter set whose status is unresolved. (162,21,0,3) - smallest triangle-free graph not yet known. Geometry Projective planes Find or prove non-existent a projective plane of order 12, the smallest order for which this is not known. Determine whether there are any projective planes of non prime-power order Generalized quadrangles Generalized polygons Designs
Perfect Problems
Unsolved problems on perfect graphs.
Open problems on perfect graphs PERFECT PROBLEMS Created on 22 August, 2000 Last updated on 28 November, 2004 In May 2002, the Strong Perfect Graph Conjecture became the Strong Perfect Graph Theorem Details are here. As a part of the 1992 -- 1993 Special Year on Combinatorial Optimization at DIMACS , Lszl Lovsz, Bruce Reed, and I organized a workshop on perfect graphs. The workshop took place at Princeton University on June 10--14, 1993. In February of that year, Bruce and I prepared a list of open problems, which was then sent to all the invited participants. The next version of the list, updated just before the workshop, and still available at ftp: dimacs.rutgers.edu pub perfect problems.tex included additions by Claude Berge, Leizhen Cai, Guoli Ding, Vladimir Gurvich, Andrs Gyrfs, Alain Hertz, Stefan Hougardy, Frdric Maire, Frdric Maffray, K.R.Parthasarathy, Myriam Preissmann, G.Ravindra, Irena Rusu, Andrs Seb, R.Sritharan, and Zsolt Tuza. Most of the problems presented here come from that list. If you have information on progress towards solving these problems or complaints in case I did not give credit where credit was due or suggestions for problems to add, please, send them to me . Va154ek Chv225tal br p hr p Related pages: ul li a href="http: www.aimath.org WWN perfectgraph " Problems from the AIM Workshop on Perfect Graphs a br (compiled by Maria Chudnovsky) li A HREF="papers.html" A bibliography on perfect graphs A li A HREF="people.html" Home pages of people interested in perfect graphs A li A HREF=".. " Va154ek Chv225tal's home page A ul p hr p This collection is written for people with at least a basic knowledge of perfect graphs. Uninformed neophytes may look up the missing definitions on the web in !-- blockquote (not now: see a href="http: www.oreilly.com news treasure_1100.html " Treasure Trove Looted a and a href="http: mathworld.wolfram.com docs updates.html " Updates about the CRC Lawsuit a ) blockquote -- A href="http: www.cwi.nl ~lex files dict97_114.ps" Alexander Schrijver's lecture notes A or in a href="http: www.vuse.vanderbilt.edu ~spin research.html" Jerry Spinrad's draft of a book a on efficient graph representations etc. or in a href="http: mathworld.wolfram.com " Eric Weisstein's World of Mathematics a . Books on perfect graphs include ul li M. C. Golumbic, a href="http: www.amazon.com exec obidos ASIN 0122892607 qid=1000604246 sr=1-2 ref=sc_b_2 104-5829045-8687937" EM Algorithmic graph theory and perfect graphs. EM a With a foreword by Claude Berge. Computer Science and Applied Mathematics, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London-Toronto, Ont., 1980. xx+284 pp. ISBN: 0-12-289260-7 A HREF="http: www.ams.org mathscinet-getitem?mr=81e%3A68081" STRONG MR 81e:68081 STRONG A P li C. Berge and V. Chvaacute;tal, eds. a href="http: www.amazon.com exec obidos ASIN 044486587X qid=1000604515 sr=1-3 ref=sc_b_3 104-5829045-8687937" EM Topics on perfect graphs. EM a North-Holland Mathematics Studies, 88. Annals of Discrete Mathematics, 21. North-Holland Publishing Co., Amsterdam-New York, 1984. xiv+369 pp. ISBN: 0-444-86587-X A HREF="http: www.ams.org mathscinet-getitem?mr=85k%3A05006" STRONG MR 85k:05006 STRONG A P li T. R. Jensen and B. Toft, a href="http: www.wiley.com Corporate Website Objects Products 0,9049,39701,00.html" EM Graph coloring problems EM a , Wiley-Interscience Series in Discrete Mathematics and Optimization, A Wiley-Interscience Publication, John Wiley amp; Sons, Inc., New York, 1995. xxii+295 pp. ISBN: 0-471-02865-7 P li A. Brandstauml;dt, V. B. Lecirc;, and J. Spinrad, a href="http: www.siam.org catalog mcc05 dt03.htm" EM Graph Classes: A Survey EM a , SIAM, Philadelphia, 1999. xii + 304 pp. ISBN: 0-89871-432-X P li J.L. Ramiacute;rez-Alfonsiacute;n and B.A. Reed (editors), a href="http: www.wiley.com Corporate Website Objects Products 0,9049,1800308,00.html" em Perfect Graphs em a , Wiley, 2001. 392 pp. ISBN: 0-471-48970-0 p ul hr HR size=6 noshade hr p a name="tc" Contents of this page: blockquote a href="recognition" 1. Recognition of perfect graphs a br a href="optimization" 2. Optimization in perfect graphs a br a href="partitionable" 3. Structure of partitionable graphs a br a href="P4" 4. The var P sub 4 sub var -structure and its relatives a br a href="parity" 5. Parity pairs and perfectly contractile graphs a br a href="holes" 6. Graphs without odd holes (and graphs without even holes) a br a href="intersection" 7. Intersection graphs a br a href="qperfect" 8. var q var -perfect graphs a br blockquote a name="recognition" p hr HR size=6 noshade hr h3 1. RECOGNITION OF PERFECT GRAPHS h3 hr In mid-November 2002, Maria Chudnovsky and Paul Seymour designed a polynomial-time algorithm for recognizing perfect graphs, blockquote a href="http: www.math.princeton.edu ~mchudnov paper2_submitted.ps" Recognizing Berge Graphs a , blockquote and Geacute;rard Cornueacute;jols, Xinming Liu, and Kristina Vu154;kovix0107; designed another, blockquote A HREF = "http: integer.gsia.cmu.edu webpub perfectrecogn1.pdf" A Polynomial Algorithm for Recognizing Perfect Graphs A . blockquote The two algorithms share their first phase, which is presented in the joint paper blockquote a href="http: www.math.princeton.edu ~mchudnov paper3_submitted.ps" Cleaning for Bergeness a blockquote by the five authors. !-- In November 2002, Maria Chudnovsky and Paul Seymour designed a polynomial-time algorithm for recognizing perfect graphs. This makes most problems from this section solved or not very interesting. The a href="spgt.htmltheorem" decomposition theorem for perfect graphs a does not -- or at least does not yet -- provide a polynomial-time algorithm for recognizing perfect graphs. (De Figueiredo, Klein, Kohayakawa, and Reed ( EM Finding skew partitions efficiently EM , J. Algorithms STRONG 37 STRONG (2000), 505--521. A HREF="http: www.ams.org mathscinet-getitem?m\ r=2001j%3A05114" STRONG MR 2001j:05114 STRONG A ) designed a polynomial-time algorithm to recognize graphs that admit a skew partition and to find a skew partition in such graphs. However, it is not clear what to do with a graph in which a skew partition has been found: the policy of decomposing it into the four subgraphs that arise by deletion of one of the four parts of the skew partition may eventually lead to an overwhelming number of subgraphs to be tested for perfection.) br p Meanwhile, warm-up exercises consist of trying to recognize, in polynomial time, restricted classes of perfect graphs. Five of these infinitely many warm-up problems are singled out here. br p hr A graph is called em var F var -free em if it contains no induced subgraph isomorphic to var F var nbsp;; the em square em is the hole with four vertices. blockquote b Problem 1.1 b . Design a polynomial-time algorithm to recognize square-free perfect graphs (or prove that the recognition problem is var NP var -complete). blockquote A decomposition theorem for square-free perfect graphs that might help in solving Problem 1.1 has been found by Conforti, Cornueacute;jols, and Vu154;kovix0107;: see A HREF = "http: integer.gsia.cmu.edu webpub squarefree.pdf" Square-Free Perfect Graphs A . p hr blockquote b Problem 1.2 b . Design a polynomial-time algorithm to recognize var K sub 4 sub var -free perfect graphs (or prove that the recognition problem is var NP var -complete). br blockquote p var K sub 4 sub var -free perfect graphs have been studied by Tucker ( EM Critical perfect graphs and perfect 3-chromatic graphs EM , J. Combinatorial Theory Ser. B STRONG 23 STRONG (1977), 143--149. A HREF="http: www.ams.org mathscinet-getitem?mr=58%20%2316369" STRONG MR 58 16369 STRONG A ; EM The validity of the perfect graph conjecture for K sub 4 sub -free graphs EM , Topics on perfect graphs, North-Holland Math. Stud., 88, North- Holland, Amsterdam-New York, 1984, pp. 149--157. A HREF="http: www.ams.org mathscinet-getitem?mr=86j%3A05067" STRONG MR 86j:05067 STRONG A ). Some researchers believe that solving Problem 1.2 would require developing techniques powerful enough to yield a polynomial-time algorithm to recognize perfect graphs. p hr A graph is called em short-chorded em or em Raspail em if each of its cycles whose length is odd and at least five has a ``short chord'', meaning a chord that along with two edges of the cycle forms a triangle. br p Trivially, no odd hole is short-chorded; seeing that no odd antihole is short-chorded is not difficult, either. (For illustration, consider the hole of length seven with vertices kbd 1,2,3,4,5,6,7 kbd and edges kbd 12,23,34,45,56,67,71 kbd : in its complement, the cycle with edges kbd 14,47,73,36,62,25,51 kbd has no short chord.) By the Strong Perfect Graph Theorem, it follows that short-chorded graphs are perfect. blockquote b Problem 1.3 b . Design a polynomial-time algorithm to recognize short-chorded graphs (or prove that the recognition problem is var NP var -complete). blockquote Short-chorded graphs have been studied by Lubiw ( EM Short-chorded and perfect graphs EM , J. Combin. Theory Ser. B STRONG 51 STRONG (1991), 24--33. A HREF="http: www.ams.org mathscinet-getitem?mr=92a%3A05095" STRONG MR 92a:05095 STRONG A ) and by Sun ( EM Two classes of perfect graphs EM , J. Combin. Theory Ser. B STRONG 53 STRONG (1991), 273--292. A HREF="http: www.ams.org mathscinet-getitem?mr=92j%3A05075" STRONG MR 92j:05075 STRONG A ). p hr A em neighborhood subgraph em is the subgraph induced by some vertex and all its neighbors; the em neighborhood number em is the smallest number of neighborhood subgraphs whose union covers all the edges of the graph; the em neighborhood independence number em is the largest number of edges, no two of which belong to the same neighborhood subgraph; a graph is called em neighborhood-perfect em if, for each of its induced subgraphs var F var , the neighborhood number of var F var is equal to the neighborhood independence number of var F var . It follows easily from the Strong Perfect Graph Theorem that neighborhood-perfect graphs are perfect. blockquote b Problem 1.4 b . Design a polynomial-time algorithm to recognize neighborhood-perfect graphs (or prove that the recognition problem is var NP var -complete). blockquote Neighborhood-perfect graphs were introduced by Lehel and Tuza ( EM Neighborhood perfect graphs EM , Discrete Math. STRONG 61 STRONG (1986), 93--101. A HREF="http: www.ams.org mathscinet-getitem?mr=87j%3A05128" STRONG MR 87j:05128 STRONG A ); they were studied further by Chang, Farber, and Tuza ( EM Algorithmic aspects of neighborhood numbers EM , SIAM J. Discrete Math. STRONG 6 STRONG (1993), 24--29. A HREF="http: www.ams.org mathscinet-getitem?mr=94b%3A05144" STRONG MR 94b:05144 STRONG A ) and by Gyaacute;rfaacute;s, Kratsch, Lehel, and Maffray ( EM Minimal non-neighborhood-perfect graphs EM , J. Graph Theory STRONG 21 STRONG (1996), 55--66 . A HREF="http: www.ams.org mathscinet-getitem?mr=96m%3A05081" STRONG MR 96m :05081 STRONG A ). p hr When var q var is a positive integer, var alpha sub q sub (G) var denotes the largest number of vertices of var G var that can by colored with only var q var colors; the em q-norm em of a family of sets var C sub 1 sub ,C sub 2 sub , ... ,C sub k sub var is the sum of the var k var numbers min{ var |C sub sub j|,q var }, and var theta sub q sub (G) var is the smallest var q var -norm of a family var C sub 1 sub ,C sub 2 sub , ... ,C sub k sub var of cliques in var G var whose union covers all the vertices; a graph is called var q var em -perfect em if, and only if, var alpha sub q sub (F)=theta sub q sub (F) var for all its induced subgraphs var F var . This concept was introduced by Lov225;sz ( EM Perfect graphs EM , Selected topics in graph theory (L.nbsp;M.nbsp;Beineke and R.nbsp;L.nbsp;Wilson, eds.), 2, Academic Press, London-New York, 1983, pp. 55--87. A HREF="http: www.ams.org mathscinet-getitem?mr=86h%3A05053" STRONG MR 86h:05053 STRONG A ). blockquote b Problem 1.5 b (Claude Berge). Characterize var 2 var -perfect graphs. blockquote It is known that var 2 var -perfect graphs are perfect and that the converse is false; it is known that parity graphs, balanced graphs, comparability graphs and cocomparability graphs are var 2 var -perfect; see C. Berge, EM The q-perfect graphs. I. The case q=2. EM Sets, graphs and numbers (Budapest, 1991; L.nbsp;Lovaacute;sz, D.nbsp;Miklos, and T.nbsp;Szouml;nyi, eds.), Colloq. Math. Soc. Jaacute;nos Bolyai, 60, North-Holland, Amsterdam, 1992, pp.67--75. A HREF="http: www.ams.org mathscinet-getitem?mr=94d%3A05110" STRONG MR 94d:05110 STRONG A and C. Berge, EM The q-perfect graphs. EM II.Combinatorics 92 (Catania, 1992), Matematiche (Catania) STRONG 47 STRONG (1992), 205--211 (1993). A HREF="http: www.ams.org mathscinet-getitem?mr=95h%3A05126" STRONG MR 95h:05126 STRONG A and C. Berge, EM The q-perfect graphs. EM Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Intersci. Publ., Wiley, New York, 1995, pp.47--62. A HREF="http: www.ams.org mathscinet-getitem?mr=97c%3A05060" STRONG MR 97c:05060 STRONG A . br p hr One neat paradigm for decomposing perfect graphs is this: blockquote If the vertices of a graph var G var can be colored red and white in such a way that certain conditions are satisfied, then ar G var is perfect if and only if each of its two subgraphs induced by all the vertices of the same color is perfect. blockquote Chvaacute;tal, Lenhart, and Sbihi ( EM Two-colourings that decompose perfect graphs EM , J. Combin. Theory Ser. B STRONG 49 STRONG (1990), 1--9. A HREF="http: www.ams.org mathscinet-getitem?mr=91f%3A05051" STRONG MR 91f:05051 STRONG A ) investigated this paradigm with the "certain conditions" specialized to forbidding certain types of induced var P sub 4 sub var s: a var P sub 4 sub var with vertices var a,b,c,d var and edges var ab,bc,cd var is of type RRWR if var a,b,d var are red and var c var is white (other types are defined similarly). They found six cases where the paradigm holds (and showed that, in a sense, this list of six is complete): ol type=i li Forbid types WRRR,RWRR,RWWW,WRWW. li Forbid types RRRR,RWWR,WRRW,WWWW. li Forbid types WRRR,RWRR,RWWR,WRRW,WWWW. li Forbid types WRRR,RWRR,RWWR,WRRW,WWWW. li Forbid types WRRR,RWRW,RWWR,WRRW,RWWW. li Forbid types WRRR,WRRW,WRWW. ol Case i is an earlier theorem of Chvaacute;tal and Hoagrave;ng ( EM On the P sub 4 sub -structure of perfect graphs. I. Even decompositions EM , J. Combin. Theory Ser. B STRONG 39 STRONG (1985), 209--219. A HREF="http: www.ams.org mathscinet-getitem?mr=87c%3A05056a" STRONG MR 87c:05056a STRONG A ); Case ii was rediscovered independently by Gurvich ( EM Bilinear forms of enumerated graphs.(Russian) EM Dokl. Akad. Nauk STRONG 325 STRONG (1992), 221--226; EM translation in EM Russian Acad. Sci. Dokl. Math. STRONG 46 STRONG (1993), 36--42 A HREF="http: www.ams.org mathscinet-getitem?mr=94d%3A05115" STRONG MR 94d:05115 STRONG A ). All six of these cases follow easily from the Strong Perfect Graph Theorem. blockquote b Problem 1.6 b . In each of the five cases ii, iii, iv, v, vi, given a graph var G var , can you find in polynomial time a coloring satisfying the condition of this case (with at least one vertex red and at least one vertex white) or prove that such a coloring does not exist? blockquote There is a polynomial-time algorithm that, given a graph var G var , finds a coloring satisfying the condition of Case i (with at least one vertex red and at least one vertex white) or proves that such a coloring does not exist: the task reduces to the problem of deciding whether a system of linear congruences mod 2 has a non-constant solution. br p Even if the problem of recognizing graphs that can be colored to satisfy the condition of, say, Case vi turned out to be var NP em var -complete, there would still be hope for progress: it is conceivable that the condition of Case vi can be relaxed to yield a stronger theorem, and that the relaxed condition can be tested in polynomial time. br p Case ii is a little special: here, neither of two subgraphs induced by all the vertices of the same color contains an induced var P sub 4 sub var , and so, by a theorem of Seinsche ( EM On a property of the class of n-colorable graphs EM , J. Combinatorial Theory Ser. B STRONG 16 STRONG (1974), 191--193. A HREF="http: www.ams.org mathscinet-getitem?mr=49%20%232448" STRONG MR 49 2448 STRONG A ), each of these two subgraphs is perfect. Hence a stronger statement holds true: blockquote If the vertices of a graph var G var can be colored red and white in such a way that there is no induced var P sub 4 sub var of type RRRR, RWWR, WRRW, or WWWW, then var G var is perfect. blockquote Gurvich ( EM Completely separated and biseparated graphs.(Russian) EM Dokl. Akad. Nauk STRONG 328 STRONG (1993), 427--430. A HREF="http: www.ams.org mathscinet-getitem?mr=94d%3A05055" STRONG MR 94d:05055 STRONG A ) strengthened this statement further as follows: blockquote If the vertices of a graph var G var can be colored red and white in such a way that there is no induced var P sub 4 sub var of type RRRR or WWWW and each var P sub 4 sub var of type RWWR or WRRW is ``innocuous'' then var G var is perfect. blockquote Here, a var P sub 4 sub var of type RWWR (resp. WRRW) with vertices var a,b,c,d var and edges var ab,bc,cd var is said to be innocuous if var a var and var d var belong to different components of the graph induced by all the red (resp. white) vertices and if var b var and var c var belong to different components of the complement of the graph induced by all the white (resp. red) vertices. -- p hr p a href="tc" To the table of contents a br a name="optimization" p hr HR size=6 noshade hr h3 2. OPTIMIZATION IN PERFECT GRAPHS h3 hr Grouml;tschel, Lovaacute;sz, and Schrijver ( EM Polynomial algorithms for perfect graphs EM , Topics on perfect graphs, North-Holland Math. Stud., 88, North-Holland, Amsterdam-New York, 1984, pp. 325--356; A HREF="http: www.ams.org mathscinet-getitem?mr=86g%3A05073" STRONG MR 86g:05073 STRONG A ) showed that the weighted versions of ul li the stable set problem, li the clique problem, li the coloring problem, and li the clique covering problem ul are solvable in polynomial time for perfect graphs. Their algorithms are based on the ellipsoid method and a polynomial time separation algorithm for a certain class of positive semidefinite matrices related to Lovaacute;sz' upper bound ( EM On the Shannon capacity of a graph EM , IEEE Trans. Inform. Theory STRONG 25 STRONG (1979), 1--7; A HREF="http: www.ams.org mathscinet-getitem?mr=81g%3A05095" STRONG MR 81g:05095 STRONG A ) on the Shannon capacity of a graph. br p Can these four optimization problems be solved for perfect graphs by polynomial-time algorithms of purely combinatorial nature avoiding the numerical instability of the ellipsoid method? The a href="spgt.htmltheorem" decomposition theorem for perfect graphs a does not -- or at least does not yet -- provide such algorithms; warm-up exercises consist of trying to design such algorithms for restricted classes of perfect graphs. One of these infinitely many warm-up problems is singled out here. br p hr A graph is called em perfectly ordered em if its vertex-set is endowed with a linear order code lt; code in such a way that no induced P sub 4 sub with vertices code a,b,c,d code and edges code ab,bc,cd code has code alt;b code and code dlt;c code . Chvaacute;tal ( EM Perfectly ordered graphs. EM Topics on perfect graphs, North-Holland Math. Stud., 88, North-Holland, Amsterdam-New York, 1984, pp. 63--65. A HREF="http: www.ams.org mathscinet-getitem?mr=86j%3A05059" STRONG MR 86j:05059 STRONG A ) has shown that, given a perfectly ordered graph code G code and its coloring -- by some number code k code of colors -- constructed by the familiar greedy algorithm, one can find a clique of code k code vertices in code G code in polynomial time; it follows that perfectly ordered graphs are perfect. P blockquote b Problem 2.1 b . Design a polynomial-time algorithm of purely combinatorial nature that, given a perfectly ordered graph code G code , constructs a largest stable set in code G code . blockquote p hr p a href="tc" To the table of contents a br a name="partitionable" p hr HR size=6 noshade hr h3 3. STRUCTURE OF PARTITIONABLE GRAPHS h3 hr Following Bland, Huang, and Trotter ( EM Graphical properties related to minimal imperfection EM , Discrete Math. STRONG 27 STRONG (1979), 11--22. A HREF="http: www.ams.org mathscinet-getitem?mr=80g%3A05034" STRONG MR 80g:05034 STRONG A ; EM Graphical properties related to minimal imperfection. EM Topics on perfect graphs, North-Holland Math. Stud., 88, North-Holland, Amsterdam-New York, 1984, pp. 181--192. A HREF="http: www.ams.org mathscinet-getitem?mr=86e%3A05075" STRONG MR 86e:05075 STRONG A ), a graph is called em partitionable em if, for some var r var and var s var , it has var rs+ var 1 vertices and, no matter which vertex is removed, the set of the remaining var rs var vertices can be partitioned into var r var pairwise disjoint cliques of size var s var and also into var s var pairwise disjoint stable sets of size var r var . Odd holes and odd antiholes are partitionable; many additional partitionable graphs have been constructed by V. Chvaacute;tal, R. L. Graham, A. F. Perold, and S. H. Whitesides ( EM Combinatorial designs related to the strong perfect graph conjecture EM , Discrete Math. STRONG 26 STRONG (1979), 83--92 A HREF="http: www.ams.org mathscinet-getitem?mr=81b%3A05044" STRONG MR 81b:05044 STRONG A )). br p hr A em small transversal em in a graph var G var is a set of var alpha(G)+omega(G) var code - code 1 vertices which meets all cliques of size var omega(G) var and all stable sets of size var alpha(G) var . The following problem is an easier variation on a conjecture contributed to the 1993 workshop by Gurvich and Temkin and on two conjectures proposed by Bacsoacute, Boros, Gurvich, Maffray, and Preissmann ( EM On minimal imperfect graphs with circular symmetry EM , J. Graph Theory STRONG 29 STRONG (1998), 209--225. A HREF="http: www.ams.org mathscinet-getitem?mr=2000h%3A05116" STRONG MR 2000h:05116 STRONG A ). p blockquote b Conjecture 3.1 b . Every partitionable graph var G var with var alpha(G)gt;2 var and var omega(G)gt;2 var br has a small transversal or else contains a hole of length five. blockquote One of the milestones in the development of our understanding of perfect graphs was the theorem of Lov225;sz ( EM A characterization of perfect graphs EM , J. Combinatorial Theory Ser. B STRONG 13 STRONG (1972), 95--98. A HREF="http: www.ams.org mathscinet-getitem?mr=46%20%238885" STRONG MR 46 8885 STRONG A ) asserting that every minimal imperfect graph var G var has precisely center var alpha(G)omega(G) var +1 center vertices. This theorem implies that every minimal imperfect graph is partitionable and that -- as pointed out by Chv225;tal ( EM Notes on perfect graphs EM , Progress in combinatorial optimization (Waterloo, Ont., 1982), Academic Press, Toronto, Ont., 1984, pp. 107--115. A HREF="http: www.ams.org mathscinet-getitem?mr=86h%3A05091" STRONG MR 86h:05091 STRONG A ) -- no minimal imperfect graph contains a small transversal. It follows that a proof of Conjecture 3.1 would provide another proof of the Strong Perfect Graph Theorem. br p A partitionable graph without a small transversal has been constructed by by Chvaacute;tal, Graham, Perold, and Whitesides (op.cit.). Its vertices are code 0,1,...,16 code ; vertices code i code and code j code are adjacent if and only if code |i-j| code b mod b 17 is one of center code 1,3,4,5,12,13,14,16 code . center Ara Markosian claims ( a href="http: www.aimath.org WWN perfectgraph articles html 46a " here a ) that this is the only known partitionable graph without a small transversal. One of the many holes of length five in this graph is center code 1 - 4 - 8 - 12 - 15 - 1 code center p Helpful hints in the direction of Conjecture 3.1 are the results of Bacsoacute, Boros, Gurvich, Maffray, and Preissmann (op.cit.); these involve the construction of partitionable graphs with rotational symmetries designed by Chv225;tal, Graham, Perold, and Whitesides (op.cit.), which goes as follows. br p Take any factorization center var n-1=m sub 1 sub m sub 2 sub ... m sub 2k sub var center into integer factors var m sub j sub var all greater than one; define sets var M sub 1 sub ,M sub 2 sub ,... ,M sub 2k sub var by center var M sub i sub = var { var tm sub 1 sub m sub 2 sub ... m sub i-1 sub : t=0,1,... ,m sub i sub -1 var } center and write center var A=M sub 1 sub +M sub 3 sub +...M sub 2k-1 sub , nbsp; B=M sub 2 sub +M sub 4 sub +...M sub 2k sub var center The partitionable graph, with vertices var v sub 0 sub , v sub 1 sub ,..., v sub n-1 sub var , has center var alpha=m sub 1 sub m sub 3 sub ...m sub 2k-1 sub var and var omega=m sub 2 sub m sub 4 sub ...m sub 2k sub var nbsp;; center with subscript arithmetic modulo var n var , its stable sets of size var alpha var are the var n var sets center { var v sub j+a sub :a in A var } with var j=1,2, ... ,n var center and its cliques of size var omega var are the var n var sets center { var v sub j-b sub :b in B var } with var j=1,2, ... ,n var . center This may not specify the graph completely: for instance, if var n=10 var and var m sub 1 sub =m sub 2 sub =3 var , then var A= var { var 0,1,2 var }, var B= var { var 0,3,6 var }, and so each var v sub i sub var may or may not be adjacent to var v sub i+5 sub var . More generally, following Fr233;d233;ric Maffray and Myriam Preissmann, a pair of vertices is called em indifferent em if it is contained in no clique of size var omega var and in no stable set of size var alpha var ; indifferent pairs may or may not be adjacent in the CGPW graph. br p Bacsoacute, Boros, Gurvich, Maffray, and Preissmann (op. cit.) say that a CGPW graph is of em Type 2 em if it has both of the properties center var m sub 1 sub =m sub 3 sub =...=m sub 2k-1 sub =2 var center and center var m sub 2 sub =m sub 4 sub =...=m sub 2k sub =2; var center they say that the graph is of em Type 1 em if it has precisely one of these properties; they say that the graph is of em Type 0 em if it has neither of them. They prove that ul li every CGPW graph var G var of Type 0 or 1 with var alpha(G)gt;2 var and var omega(G)gt;2 var br has a small transversal and li every CGPW graph var G var of Type 2 br contains an induced var C sub 5 sub var (without indifferent pairs of vertices). ul p A helpful result on small transversals (called the "Parent Lemma" in the paper of Bacsoacute, Boros, Gurvich, Maffray, and Preissmann) goes as follows. In a partitionable graph var G var , a clique var C var of size var omega(G) var is a em mother em of a vertex var v var if no clique of size var omega(G) var meets var C var in the single vertex var v var ; a stable set var S var of size var alpha(G) var is a em father em of a vertex var v var if no stable set of size var alpha(G) var meets var S var in the single vertex var v var . Gurvich and Temkin ( EM Berge's conjecture holds for rotational graphs.(Russian) EM Dokl. Akad. Nauk STRONG 332 STRONG (1993), 144--148. A HREF="http: www.ams.org mathscinet-getitem?mr=94m%3A05156" STRONG MR 94m:05156 STRONG A ) and, independently, Bacsoacute proved that blockquote em if some vertex in a partitionable graph has both parents, br then the graph has a small transversal. em blockquote hr p The following problem, related to Conjecture 3.1, has been contributed to the 1993 workshop by Andr225;s Sebouml;. blockquote b Problem 3.2 b . True or false? If a partitionable graph var G var contains two cliques of size var omega(G) var with var omega(G)-1 var vertices in common and two stable sets of size var alpha(G) var with var alpha(G)-1 var vertices in common, then var G var has a small transversal. blockquote An affirmative solution of Problem 3.2 would sharpen the main result of Markosyan, Gasparyan, and Markosyan ( EM On a conjecture of Berge EM , J. Combin. Theory Ser. B STRONG 56 STRONG (1992), 97--107. A HREF="http: www.ams.org mathscinet-getitem?mr=93h%3A05078" STRONG MR 93h:05078 STRONG A ) and also that of Sebouml; ( a href="http: cosmos.imag.fr DMD OPTICOMB Membres sebo ipcofor.ps" EM Forcing colorations, and the perfect graph conjecture EM A , Integer Programming and Combinatorial Optimization STRONG 2 STRONG (E.nbsp;Balas, G.nbsp;Cornueacute;jols, and R.nbsp;Kannan, eds.), Mathematical Programming Society and Carnegie Mellon University, 1992). br hr blockquote b Problem 3.3 b . Prove that, in every partitionable graph other than var C sub 5 sub var , br every var P sub 4 sub var extends into a var P sub 5 sub var or the complement of a var P sub 5 sub var . blockquote From results of ul li V. Chvaacute;tal, EM Star-cutsets and perfect graphs EM , J. Combin. Theory Ser. B STRONG 39 STRONG (1985), 189--199. A HREF="http: www.ams.org mathscinet-getitem?mr=87a%3A05066" STRONG MR 87a:05066 STRONG A ul and ul li V. Chvaacute;tal, EM On the P sub 4 sub -structure of perfect graphs. III. Partner decompositions EM , J. Combin. Theory Ser. B STRONG 43 STRONG (1987), 349--353. A HREF="http: www.ams.org mathscinet-getitem?mr=89a%3A05062" STRONG MR 89a:05062 STRONG A , ul it follows that blockquote in every partitionable graph, br every var P sub 4 sub var extends into a var P sub 5 sub var or the complement of a var P sub 5 sub var or a var C sub 5 sub var . blockquote p hr p a href="tc" To the table of contents a br a name="P4" p hr HR size=6 noshade hr h3 4. THE var P sub 4 sub var -STRUCTURE AND ITS RELATIVES h3 The Perfect Graph Theorem of Lovaacute;sz ( EM Normal hypergraphs and the perfect graph conjecture EM , Discrete Math. STRONG 2 STRONG (1972), 253--267. A HREF="http: www.ams.org mathscinet-getitem?mr=46%20%231624" STRONG MR 46 1624 STRONG A ) asserts that a graph is perfect if and only if its complement is perfect. Musings on the relationship of this theorem to possible certificates of perfection led Chvaacute;tal in the late 1970's and the early 1980's to look for graph invariants code I(G) code such that ol type=i li if code G' code is the complement of code G code , then code I(G) code = code I(G') code , li if code I(G) code = code I(G') code , then code G code and code G' code are either both perfect or both imperfect ol in the hope that an elegant and easily verifiable certificate of perfection of code G code could be expressed exclusively in terms of some such natural invariant. br p The finest invariant with properties (i) and (ii) assigns to each graph code G code the unordered pair consisting of code G code and its complement; the coarsest invariant with properties (i) and (ii) sets center code I(G)=1 code if code G code is perfect and code I(G)=0 code if code G code is imperfect. center One natural invariant that interpolates between these two extremes is the em code P sub 4 sub code -structure em of code G code ; this invariant is defined as the hypergraph whose vertex-set code V code is vertex-set of code G code and whose edges are the subsets of code V code that induce code P sub 4 sub code 's in code G code . For example, here are two graphs with the same code P sub 4 sub code -structure, pre {a,b,c,d}, {b,c,d,e}, {c,d,e,f}, {d,e,f,a}, {e,f,a,b}, {f,a,b,c}: a b o--------o a b c \ o---------o---------o \ | | | \ | | | f o o c | | | \ | | | \ | | | \ o---------o---------o o--------o d e f e d pre Since code P sub 4 sub code is a self-complementary graph, the code P sub 4 sub code -structure of code G code has property (i); Chvaacute;tal ( EM A semistrong perfect graph conjecture. EM Topics on perfect graphs, North-Holland Math. Stud., 88, North-Holland, Amsterdam-New York, 1984, pp. 279--280. A HREF="http: www.ams.org mathscinet-getitem?mr=86j%3A05119" STRONG MR 86j:05119 STRONG A ) conjectured and Reed ( EM A semistrong perfect graph theorem EM , J. Combin. Theory Ser. B STRONG 43 STRONG (1987), 223--240. A HREF="http: www.ams.org mathscinet-getitem?mr=88g%3A05059" STRONG MR 88g:05059 STRONG A ) proved that it has property (ii) as well. br p Additional graph invariants with properties (i) and (ii), found by Chiacute;nh Hoagrave;ng, are ul li the em co-paw-structure em of code G code , defined as the hypergraph whose vertex-set code V code is vertex-set of code G code and whose edges are the subsets of code V code that induce code C sub 5 sub code or the paw (the graph with vertices code a,b,c,d code and edges code ab,ac,bc,cd code ) or the complement of the paw in code G code nbsp;nbsp;(C. T. Hoagrave;ng, EM On the disc-structure of perfect graphs. I. The co-paw-structure EM , Proceedings of the Third International Conference on Graphs and Optimization, GO-III (Leukerbad, 1998), Discrete Appl. Math. STRONG 94 STRONG (1999), 247--262. A HREF="http: www.ams.org mathscinet-getitem?mr=1+682+174" STRONG MR 2001a:05065 STRONG A ); ul ul li the em co-C sub 4 sub -structure em of code G code , defined as the hypergraph whose vertex-set code V code is vertex-set of code G code and whose edges are the subsets of code V code that induce code C sub 5 sub code or code C sub 4 sub code or the complement of code C sub 4 sub code in code G code nbsp;nbsp; (C. T. Hoagrave;ng, em On the disc-structure of perfect graphs. II. The co-C sub 4 sub -structure em , Discrete Math. strong 252 strong (2002), 141--159); li the em co-P sub 3 sub -structure em of code G code , defined as the hypergraph whose vertex-set code V code is vertex-set of code G code and whose edges are the subsets of code V code that induce code P sub 3 sub code or the complement of code P sub 3 sub code in code G code nbsp;nbsp; (C. T. Hoagrave;ng, a href="http: sauron.wlu.ca physcomp choang CO-P3.ps" em On the co-P sub 3 sub -structure of perfect graphs em a , to appear in SIAM J. Discrete Math.); li the em co-K sub 3 sub -structure em of code G code , defined as the hypergraph whose vertex-set code V code is vertex-set of code G code and whose edges are the subsets of code V code that induce code K sub 3 sub code or the complement of code K sub 3 sub code in code G code nbsp;nbsp; (since code K sub 3 sub ,P sub 3 sub ,co-P sub 3 sub code , and code co-K sub 3 sub code are the only graphs with three vertices, two graphs have the same em co-P sub 3 sub -structure em if and only if they have the same co-K sub 3 sub -structure). ul Our subsequent discussion of code P sub 4 sub code -structure applies -- with suitable modifications -- to Hoagrave;ng's invariants as well. p hr p p Let us define an em odd ring em as the 4-uniform hypergraph with vertices center code u sub 0 sub , u sub 1 sub , ..., u sub k-1 sub code center where code k code is odd and at least five and with the code k code edges center code {u sub i+1 sub , u sub i+2 sub , u sub i+3 sub , u sub i+4 sub } code center where the subscripts are taken modulo code k code . It is easy, if a little tedious, to show that a graph is a Berge graph if and only if its code P sub 4 sub code -structure contains no induced odd ring; this fact led in the past to speculations about possible certificates, elegant, easily verifiable, and expressed exclusively in terms of 4-uniform hypergraphs, that a prescribed code P sub 4 sub code -structure contains no induced odd ring. br p Finding such a certificate is at least as difficult as the -- as yet unsolved -- problem of showing that the class of Berge graphs belongs to b NP b . A less ambitious program would be an attempt to reformulate the a href="http: www.math.gatech.edu ~thomas spgc.html" decomposition theorem for perfect graphs a by Chudnovsky, Robertson, Seymour, and Thomas exclusively in terms of code P sub 4 sub code -structure. p hr p The decomposition theorem asserts that blockquote every Berge graph either belongs to one of five classes of basic Berge graphs, namely, ul li bipartite graphs, li complements of bipartite graphs, li line-graphs of bipartite graphs, li complements of line-graphs of bipartite graphs, li "double split graphs", ul or else it has one of four structural faults, namely, ul li 2-join, li 2-join in the complement, li M-join, li a balanced skew partition ul blockquote (for definitions, see the a href="http: www.math.gatech.edu ~thomas spgc.html" paper a by Chudnovsky, Robertson, Seymour, and Thomas); in her thesis, Chudnovsky showed that the stronger assertion with M-joins dropped remains valid. Do the remaining three structural faults admit natural counterparts formulated exclusively in terms of code P sub 4 sub code -structure? p The following two problems represent one attempt to state this question in precise terms. blockquote b Problem 4.1 b . Find a class strong C strong sub 1 sub of 4-uniform hypergraphs such that ul li the code P sub 4 sub code -structure of a graph belongs to strong C strong sub 1 sub if and only if it is the code P sub 4 sub code -structure of a (possibly different) graph such that this graph or its complement admits a 2-join li membership in strong C strong sub 1 sub can be tested in polynomial time. ul blockquote blockquote b Problem 4.2 b . Find a class strong C strong sub 2 sub of 4-uniform hypergraphs such that ul li the code P sub 4 sub code -structure of a graph belongs to strong C strong sub 2 sub if and only if it is the code P sub 4 sub code -structure of a (possibly different) graph that admits a balanced skew partition, li membership in strong C strong sub 2 sub can be tested in polynomial time. ul blockquote It is conceivable that these problems can be solved by building up on the following three results: ul li Hayward, Hougardy, and Reed ( A HREF = "http: www.informatik.hu-berlin.de ~hougardy paper recp4.html" Polynomial Time Recognition of P sub 4 sub -structure A ) designed a polynomial-time algorithm to recognize code P sub 4 sub code -structures of graphs, p li Cornueacute;jols and Cunningham ( EM Compositions for perfect graphs EM , Discrete Math. STRONG 55 STRONG (1985), 245--254. A HREF="http: www.ams.org mathscinet-getitem?mr=86j%3A05120" STRONG MR 86j:05120 STRONG A ) designed a polynomial-time algorithm to recognize graphs that admit a 2-join, p li De Figueiredo, Klein, Kohayakawa, and Reed ( EM Finding skew partitions efficiently EM , J. Algorithms STRONG 37 STRONG (2000), 505--521. A HREF="http: www.ams.org mathscinet-getitem?m\ r=2001j%3A05114" STRONG MR 2001j:05114 STRONG A ) designed a polynomial-time algorithm to recognize graphs that admit a skew partition. ul However, defining strong C strong sub 1 sub or strong C strong sub 2 sub through properties of graphs with a prescribed code P sub 4 sub code -structure does not fit the intuitive meaning of the expression "exclusively in terms of code P sub 4 sub code -structure". br p br p a name="basic" As for the five classes of basic Berge graphs, we are about to define a class strong C strong of 4-uniform hypergraphs such that blockquote ul li the code P sub 4 sub code -structure of every basic Berge graph belongs to strong C strong , li no 4-uniform hypergraph in strong C strong contains an induced odd ring, li membership in strong C strong can be tested in polynomial time. ul blockquote This class is defined in terms of a certain directed graph, code D sub 6 sub (H) code , associated with every 4-uniform hypergraph code H code : strong C strong consists of all 4-uniform hypergraphs code H code such that blockquote ul li code H code contains no induced ring with five vertices and li all strongly connected components of code D sub 6 sub (H) code are bipartite. ul blockquote The vertices of code D sub 6 sub (H) code are all the ordered 6-tuples center code (u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub ) code center of distinct vertices of code H code such that the sub-hypergraph of code H code induced by the set center code {u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub } code center consists of hyperedges center code {u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub }, {u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub }, {u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub }; code center there is a directed edge from vertex center code (u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub ) code center of code D sub 6 sub (H) code to vertex center code (v sub 1 sub ,v sub 2 sub ,v sub 3 sub ,v sub 4 sub ,v sub 5 sub ,v sub 6 sub ) code center of code D sub 6 sub (H) code if and only if center code v sub 1 sub =u sub 2 sub , v sub 2 sub =u sub 3 sub , v sub 3 sub =u sub 4 sub , v sub 4 sub =u sub 5 sub , v sub 5 sub =u sub 6 sub . code center p hr p Trivially, membership in strong C strong can be tested in polynomial time; trivially, no 4-uniform hypergraph in strong C strong contains an induced odd ring; a proof that the code P sub 4 sub code -structure of every basic Berge graph belongs to strong C strong is based on the following observation (verified by exhaustive search and used also in the proof that a graph is a Berge graph if and only if its code P sub 4 sub code -structure contains no induced odd ring): blockquote The code P sub 4 sub code -structure of a graph code F code with vertices center code u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub code center consists of hyperedges center code {u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub }, {u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub }, {u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub } code center p only if code F code is isomorphic (as an unlabeled graph) with one of the following six graphs: ol li code F sub 1 sub code is the path code P sub 6 sub code ; p li code F sub 2 sub code is the complement of code F sub 1 sub code ; p li code F sub 3 sub code consists of vertices code a,b,c,d,e,f code and edges code ab,bc,cd,eb,fb,fc,fe code ; p li code F sub 4 sub code is the complement of code F sub 3 sub code ; p li code F sub 5 sub code consists of vertices code a,b,c,d,e,f code and edges code ab,bc,cd,de,fb,fc code ; p li code F sub 6 sub code is the complement of code F sub 5 sub code . ol blockquote Now consider an arbitrary graph code G code and let code H code denote its code P sub 4 sub code -structure; we shall say that a vertex center code (u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub ) code center of code D sub 6 sub (H) code is of em type em code i code if the subgraph of code G code induced by center code {u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub } code center is isomorphic with code F sub i sub code . The next observation (also verified by exhaustive search and also used in the proof that a graph is a Berge graph if and only if its code P sub 4 sub code -structure contains no induced odd ring) is this: blockquote Each vertex of code D sub 6 sub (H) code with nonzero in-degree and nonzero out-degree has one of the following four properties: ul li it is of type code 1 code and all its neighbors are of type code 1,5, code or code 6 code ; li it is of type code 2 code and all its neighbors are of type code 2,5, code or code 6 code ; li it is of type code 3 code and all its neighbors are of type code 4 code ; li it is of type code 4 code and all its neighbors are of type code 3 code . ul blockquote It follows that blockquote each strongly connected component of code D sub 6 sub (H) code with at least two vertices has one of the following three properties: ul li all of its vertices are of type code 1 code ; li all of its vertices are of type code 2 code ; li it is bipartite, all its vertices in one part of the bipartition are of type code 3 code , and all its vertices in the other part of the bipartition are of type code 4 code . ul blockquote p Finally, assuming that code G code is a basic Berge graph, we shall verify that all strongly connected components of code D sub 6 sub (H) code are bipartite. Since code P sub 4 sub code -structure of code G code is invariant under complementation of code G code , we may distinguish between three cases. br p b Case 1: b code G code is bipartite. br p Since code F sub 2 sub code is not bipartite, we only need to two-color each strongly connected component of code D sub 6 sub (H) code whose vertices are of type code 1 code . This can be done by giving each of these vertices, center code (u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub ), code center the color of code u sub 1 sub code in code G code . br p b Case 2: b code G code is the line-graph of a bipartite graph. br p The two-coloring of the vertices of the bipartite graph induces a two-coloring of the edges of code G code such that the two edges of any induced code P sub 3 sub code in code G code have distinct colors. Since code F sub 2 sub code is not a line-graph of a bipartite graph, we only need to two-color each strongly connected component of code D sub 6 sub (H) code whose vertices are of type code 1 code . This can be done by giving each of these vertices, center code (u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub ), code center the color of the edge code u sub 1 sub u sub 2 sub code in code G code . br p b Case 3: b code G code is a double split graph. br p By definition, code G code has code 2m+2n code nbsp; ( code m,ngt;1 code )nbsp; distinct vertices, center code a sub 1 sub ,...,a sub m sub , b sub 1 sub ,...,b sub m sub , c sub 1 sub ,...,c sub n sub , d sub 1 sub ,...,d sub n sub , code center and ul li an code a sub i sub code is adjacent to a code b sub j sub code if and only if code i=j code , li a code c sub i sub code is nonadjacent to a code d sub j sub code if and only if code i=j code , li each set code {a sub i sub ,b sub i sub ,c sub j sub ,d sub j sub } code induces a code P sub 4 sub code . ul An exhaustive search shows that each vertex center code (u sub 1 sub ,u sub 2 sub ,u sub 3 sub ,u sub 4 sub ,u sub 5 sub ,u sub 6 sub ) code center of code D sub 6 sub (H) code that is of type code 1 code must have center code u sub 1 sub ,u sub 3 sub ,u sub 4 sub ,u sub 6 sub code nbsp; in nbsp; code {a sub 1 sub ,...,a sub m sub ,b sub 1 sub ,...,b sub m sub } code center and center code u sub 2 sub ,u sub 5 sub code nbsp; in nbsp; code {c sub 1 sub ,...,c sub n sub ,d sub 1 sub ,...,d sub n sub }; code center it follows that no two vertices of type code 1 code are adjacent. Since the complement of a double split graph is a double split graph, no two vertices of type code 2 code are adjacent, either. br p hr p Here are a few results on recognizing P sub 4 sub -structures of graphs: ul li Ding ( EM Recognizing the P sub 4 sub -structure of a tree EM , Graphs Combin. STRONG 10 STRONG (1994), 323--328. A HREF="http: www.ams.org mathscinet-getitem?mr=95k%3A05048" STRONG MR 95k:05048 STRONG A ) designed a polynomial-time algorithm to recognize code P sub 4 sub code -structures of trees, li Sorg ( a href="http: www.zpr.uni-koeln.de GroupBachem lehrveranstaltungen \ dipl.html" em Die P sub 4 sub -Struktur von Kantengraphen bipartiter Graphen em a , Diploma Thesis, Mathematisches Institut der Universitauml;t zu Kouml;ln, February 1997) designed a polynomial-time algorithm to recognize code P sub 4 sub code -structures of line-graphs of bipartite graphs, li Babel, Brandstauml;dt, and Lecirc; ( EM Recognizing the P sub 4 sub -structure of bipartite graphs EM , Discrete Appl. Math. STRONG 93 STRONG (1999), 157--168) designed a polynomial-time algorithm to recognize code P sub 4 sub code -structures of bipartite graphs. li Brandstauml;dt and Lecirc; ( EM Recognizing the P sub 4 sub -structure of block graphs EM , Discrete Appl. Math. STRONG 99 STRONG (2000), 349--366) designed a polynomial-time algorithm to recognize code P sub 4 sub code -structures of connected graphs whose 2-connected components are cliques. li L. Babel, A. Brandstauml;dt, and V. B. Lecirc; ( EM Recognizing the P sub 4 sub -structure of claw-free graphs and a larger graph class EM , Discrete Math. Theor. Comput. Sci. b 5 b (2002), 127--146 ( a href="http: dmtcs.loria.fr volumes abstracts dm050109.abs.html" electronic a )) designed a polynomial-time algorithm to recognize P sub 4 sub -structures of a class of graphs that includes all claw-free graphs. li R. Hayward, S. Hougardy, and B. Reed ( A HREF = "http: www.informatik.hu-berlin.de ~hougardy paper recp4.html" Polynomial Time Recognition of P sub 4 sub -structure A ) designed a polynomial-time algorithm to recognize code P sub 4 sub code -structures of graphs. ul Other papers on the P sub 4 sub -structure include: ul li L. Babel and S. Olariu, EM A new characterization of P sub 4 sub -connected graphs EM , Graph-theoretic concepts in computer science (Cadenabbia, 1996), Lecture Notes in Comput. Sci. 1197, Springer, Berlin, 1997, pp. 17--30. A HREF="http: www.ams.org mathscinet-getitem?mr=98f%3A05102" STRONG MR 98f:05102 STRONG A P li L. Babel and S. Olariu, EM On the var p- var connectedness of graphs---a survey EM , Discrete Appl. Math. STRONG 95 STRONG (1999), no. 1-3, 11--33. A HREF="http: www.ams.org mathscinet-getitem?mr=2000g%3A05093" STRONG MR 2000g:05093 STRONG A P li A. Brandstauml;dt, V. B. Lecirc;, and S. Olariu, A HREF="ftp: rutcor.rutgers.edu pub rrr reports96 19.ps" EM Linear-Time Recognition of the P sub 4 sub -structure of Trees EM A , Rutcor Research Report RRR 19-96, Rutgers University, 1996. P li V. Chvaacute;tal, EM On the P sub 4 sub -structure of perfect graphs. III. Partner decompositions EM , J. Combin. Theory Ser. B STRONG 43 STRONG (1987), 349--353. A HREF="http: www.ams.org mathscinet-getitem?mr=89a%3A05062" STRONG MR 89a:05062 STRONG A P li Chvaacute;tal and Hoagrave;ng ( EM On the P sub 4 sub -structure of perfect graphs. I. Even decompositions EM , J. Combin. Theory Ser. B STRONG 39 STRONG (1985), 209--219. A HREF="http: www.ams.org mathscinet-getitem?mr=87c%3A05056a" STRONG MR 87c:05056a STRONG A ), li R. B. Hayward, EM Recognizing P sub 3 sub -structure: a switching approach EM , J. Combin. Theory Ser. B STRONG 66 STRONG (1996), 247--262. A HREF="http: www.ams.org mathscinet-getitem?mr=96m%3A05168" STRONG MR 96m:05168 STRONG A P li R. B. Hayward and W. J. Lenhart, EM On the P sub 4 sub -structure of perfect graphs. IV. Partner graphs EM , J. Combin. Theory Ser. B STRONG 48 STRONG (1990), 135--139. A HREF="http: www.ams.org mathscinet-getitem?mr=91i%3A05056" STRONG MR 91i:05056 STRONG A P li C. T. Hoagrave;ng, EM On the P sub 4 sub -structure of perfect graphs. II. Odd decompositions EM , J. Combin. Theory Ser. B STRONG 39 STRONG (1985), 220--232. A HREF="http: www.ams.org mathscinet-getitem?mr=87c%3A05056b" STRONG MR 87c:05056b STRONG A P li C. T. Hoagrave;ng, EM On the sibling-structure of perfect graphs EM , J. Combin. Theory Ser. B STRONG 49 STRONG (1990), 282--286. A HREF="http: www.ams.org mathscinet-getitem?mr=91h%3A05054" STRONG MR 91h:05054 STRONG A P li C. T. Hoagrave;ng, S. Hougardy, and F. Maffray, EM On the P sub 4 sub -structure of perfect graphs. V. Overlap graphs EM , J. Combin. Theory Ser. B STRONG 67 STRONG (1996), 212--237. A HREF="http: www.ams.org mathscinet-getitem?mr=97f%3A05068" STRONG MR 97f:05068 STRONG A P li C. T. Hoagrave;ng and V. B. Lecirc;, EM On P sub 4 sub -transversals of perfect graphs EM , Discrete Math. STRONG 216 STRONG (2000), 195--210. A HREF="http: www.ams.org mathscinet-getitem?mr=1+750+861" STRONG CMP 1 750 861 STRONG A P li S. Hougardy, A HREF="http: www.informatik.hu-berlin.de ~hougardy paper diss.html" EM On the P sub 4 sub -Structure of Perfect Graphs EM a (electronic introduction), Dissertation, Shaker Verlag, Aachen, 1996, ISBN 3-8265-1140-9 P li S. Hougardy, EM Perfect graphs with unique P sub 4 sub -structure EM , Graphs and combinatorics (Marseille, 1995), Discrete Math. STRONG 165 166 STRONG (1997), 421--430. A HREF="http: www.ams.org mathscinet-getitem?mr=97m%3A05098" STRONG MR 97m:05098 STRONG A P li F. Roussel, I. Rusu, and H. Thuillier, EM On graphs with limited number of P sub 4 sub -partners EM , Internat. J. Found. Comput. Sci. STRONG 10 STRONG (1999), 103--121. A HREF="http: www.ams.org mathscinet-getitem?mr=1+739+197" STRONG CMP 1 739 197 STRONG A P li I. Rusu, EM P sub 4 sub -domination in minimal imperfect graphs EM , Proceedings of the Third International Conference on Graphs and Optimization, GO-III (Leukerbad, 1998), Discrete Appl. Math. STRONG 94 STRONG (1999), 329--336. A HREF="http: www.ams.org mathscinet-getitem?mr=2000d%3A05089" STRONG MR 2000d:05089 STRONG A P ul p hr p a href="tc" To the table of contents a br a name="parity" p hr HR size=6 noshade hr h3 5. PARITY PAIRS AND PERFECTLY CONTRACTILE GRAPHS h3 hr p An em even pair em is a pair of vertices such that every chordless path between them has an even number of edges. J.nbsp;Fonlupt and J.-P. Uhry ( EM Transformations which preserve perfectness and H-perfectness of graphs EM , Bonn Workshop on Combinatorial Optimization (Bonn, 1980), Ann. Discrete Math., 16, North-Holland, Amsterdam-New York, 1982, pp. 83--95. A HREF="http: www.ams.org mathscinet-getitem?mr=84f%3A05076" STRONG MR 84f:05076 STRONG A ) and H. Meyniel ( EM A new property of critical imperfect graphs and some consequences EM , European J. Combin. STRONG 8 STRONG (1987), 313--316. A HREF="http: www.ams.org mathscinet-getitem?mr=88k%3A05082" STRONG MR 88k:05082 STRONG A ) proved that em contracting em an even pair in a graph code G code (which means deleting both vertices of the even pair, introducing a brand new vertex, and making the neighborhood of this new vertex equal to the union of the neighborhoods of the two deleted vertices) changes neither the clique number of code G code nor the chromatic number of code G code . br p M.E. Bertschi ( EM Perfectly contractile graphs EM , J. Combin. Theory Ser. B STRONG 50 STRONG (1990), 222--230. A HREF="http: www.ams.org mathscinet-getitem?mr=91j%3A05042" STRONG MR 91j:05042 STRONG A ) defined an em even-contractile graph em as any graph code G code for which there is a sequence center code G sub 0 sub , G sub 1 sub , ..., G sub k sub code center such that ul li code G sub 0 sub =G code , li each code G sub t+1 sub code arises by contracting an even pair in code G sub t sub code , li code G sub k sub code is a clique ul and he defined a em perfectly contractile graph em as any graph code G code such that all induced subgraphs of code G code are even-contractile. (The results of Meyniel guarantee that every perfectly contractile graph is perfect.) br p Hazel Everett and Bruce Reed contributed to the 1993 workshop a number of conjectures on even pairs and perfectly contractile graphs; two of them are singled out here. The em odd stretcher em in the first of them is any graph that consists of three vertex-disjoint triangles and three vertex-disjoint paths, each path having an odd number of edges and one endpoint in each of the two triangles. (In particular, the smallest odd stretcher is the antihole with six vertices.) blockquote b Conjecture 5.1 b . A graph is perfectly contractile if and only if it contains no odd hole, no antihole, and no odd stretcher. blockquote blockquote b Conjecture 5.2 b . Every perfectly contractile graph other than a clique contains an even pair whose contraction leaves the graph perfectly contractile. blockquote hr p Bienstock ( EM On the complexity of testing for odd holes and induced odd paths EM , Discrete Math. STRONG 90 STRONG (1991), 85--92. A HREF="http: www.ams.org mathscinet-getitem?mr=92m%3A68040a" STRONG MR 92m:68040a STRONG A Corrigendum: EM Discrete Math. STRONG 102 STRONG (1992), 109. A HREF="http: www.ams.org mathscinet-getitem?mr=92m%3A68040b" STRONG MR 92m:68040b STRONG A ) has proved that it is coNP-complete to determine if a graph contains an even pair. By analogy with the notion of en even pair, an em odd pair em is a pair of nonadjacent vertices such that every chordless path between them has an odd number of edges. The following two algorithmic problems are obvious. blockquote b Problem 5.3 b . Design a polynomial-time algorithm to determine br if a perfect graph contains an even pair. blockquote blockquote b Problem 5.4 b . Design a polynomial-time algorithm to determine br if a perfect graph contains an odd pair. blockquote hr p Other problems on path parity and perfection, including additional conjectures contributed to the 1993 workshop by Everett and Reed, can be found in ul li H. Everett, C.M.H. de Figueiredo, C. LinharesSales, F. Maffray, O. Porto, and B. A. Reed, EM Path parity and perfection EM , Graphs and combinatorics (Marseille, 1995), Discrete Math. STRONG 165 166 STRONG (1997), 233--252. A HREF="http: www.ams.org mathscinet-getitem?mr=98a%3A05069" STRONG MR 98a:05069 STRONG A ul and in ul li H. Everett, C.M.H. de Figueiredo, C. LinharesSales, F. Maffray, O. Porto, and B. A. Reed, EM Even pairs EM , in: a href="http: www.wiley.com Corporate Website Objects Products 0,9049,1800308,00.html" em Perfect Graphs em a (J.L. Ramiacute;rez-Alfonsiacute;n and B.A. Reed, eds.), Wiley, 2001, pp. 1--12. A HREF="http: www.ams.org msnmain?fmt=docfn=105id=2002i_05050l=20pg3=IIDr=1s3=173284v3=Everett%2C%20Hazel " STRONG MR 2002i:05050 STRONG A ul p hr p a href="tc" To the table of contents a br a name="holes" p hr HR size=6 noshade hr h3 6. GRAPHS WITHOUT ODD HOLES br (AND GRAPHS WITHOUT EVEN HOLES) h3 hr p Problems 6.1--6.3 come from Andraacute;s Gy225;rf225;s ( EM Problems from the world surrounding perfect graphs EM , Proceedings of the International Conference on Combinatorial Analysis and its Applications (Pokrzywna, 1985), Zastos. Mat. STRONG 19 STRONG (1987), 413--441. A HREF="http: www.ams.org mathscinet-getitem?mr=89e%3A05089" STRONG MR 89e:05089 STRONG A ). blockquote b Problem 6.1 b . Prove the existence of a function var g var such that br every graph var G var with no odd hole has chromatic number at most var g(omega(G)) var . blockquote Guoli Ding asked whether var g(3)=4 var . His question has been answered in the affirmative by Robertson, Seymour, and Thomas, who provided a structural characterization of graphs without odd holes and without K sub 4 sub . blockquote b Problem 6.2 b . For all positive integers var k var , prove the existence of a function var g sub k sub var such that every graph var G var with no odd hole longer than var k var has chromatic number at most var g sub k sub (omega(G)) var . blockquote blockquote b Problem 6.3 b . For all positive integers var k var , prove the existence of a function var h sub k sub var such that every graph var G var with no hole longer than var k var has chromatic number at most var h sub k sub (omega(G)) var . blockquote hr p Chiacute;nh Hoagrave;ng and Colin McDiarmid ( em On the divisibility of graphs em , Discrete Math. STRONG 242 STRONG (2002), 145--156. A HREF="http: www.ams.org mathscinet-getitem?mr=1+874+761" STRONG MR 1 874 761 STRONG A ) say that a graph is em 2-divisible em if, for each of its induced subgraphs code F code , the vertex-set of code F code can be partitioned into subsets code S sub 1 sub code and code S sub 2 sub code in such a way that every largest clique in code F code meets both code S sub 1 sub code and code S sub 2 sub code . Trivially, no odd hole is 2-divisible, and so every 2-divisible graph is odd-hole-free; Hoagrave;ng and McDiarmid conjectured the converse: blockquote b Conjecture 6.4 b . Every odd-hole-free graph is 2-divisible. blockquote Hoagrave;ng and McDiarmid proved Conjecture 6.4. for claw-free graphs and noted that it also holds for graphs without K sub 4 sub (since var g(3)=4 var in Problem 6.1). br p Can something similar be said about graphs without even holes? The notion of 2-divisibility generalizes: Hoagrave;ng and McDiarmid say that a graph is em k-divisible em if, for each of its induced subgraphs code F code , the vertex-set of code F code can be partitioned into subsets code S sub 1 sub code , code S sub 2 sub code , ..., code S sub k sub code in such a way that no code S sub i sub code contains a largest clique in code F code . blockquote b Conjecture 6.5 b . (Hoagrave;ng) nbsp; Every even-hole-free graph is 3-divisible. blockquote blockquote b Conjecture 6.6 b . (Hoagrave;ng) nbsp; Every even-hole-free graph code G code is colorable by center code 2middot;omega(G)-1 code center colors. blockquote Conjecture 6.6 implies Conjecture 6.5: more generally, if code G code is a graph and code k code is an integer such that center code kmiddot;(omega(G)-1) = chi(G), code center then code G code is code k code -divisible. br p The following conjecture comes from Hayward and Reed ( em Forbidding holes and antiholes em , in: a href="http: www.wiley.com Corporate Website Objects Products 0,9049,1800308,00.html" em Perfect Graphs em a (J.L. Ramiacute;rez-Alfonsiacute;n and B.A . Reed, eds.), Wiley, 2001, pp. 113--137. A HREF="http: www.ams.org mathscinet-getitem?mr=1+861+360" STRONG MR 1 861 360 STRONG A ): blockquote b Conjecture 6.7 b . Every even-hole-free graph includes a vertex whose neighborhood can be partitioned into two cliques. blockquote Conjecture 6.7 implies Conjecture 6.6: more generally, if every induced subgraph of a graph code G code includes a vertex of degree at most code t code , then code G code is code t+1 code -colorable. br p hr p Conforti, Cornueacute;jols, Kapoor, and Vu154;kovix0107; (Even-hole-free graphs. II. Recognition algorithm. em J. Graph Theory em b 40 b (2002), 238--266) designed a polynomial algorithm to recognize even-hole-free graphs. blockquote b Problem 6.8 b . Design a polynomial algorithm to recognize odd-hole-free graphs. blockquote p hr p a href="tc" To the table of contents a br a name="intersection" p hr HR size=6 noshade hr h3 7. INTERSECTION GRAPHS h3 hr p Problems 7.1--7.6 were contributed by Zsolt Tuza before the 1993 workshop (see also Tuza, EM Perfect triangle families EM , Bull. London Math. Soc. STRONG 26 STRONG (1994), 321--324. A HREF="http: www.ams.org mathscinet-getitem?mr=96b%3A05083" STRONG MR 96b:05083 STRONG A ). blockquote b Problem 7.1 b . For every (undirected) graph var G var , let var H sub 1 sub (G) var denote the graph whose vertices are the triangles in var G var , two vertices of var H sub 1 sub (G) var being adjacent if and only if the corresponding triangles in var G var share an edge. br For which graphs var G var is var H sub 1 sub (G) var perfect? blockquote In a slightly related paper, Akiyama and Chvaacute;tal ( EM Packing paths perfectly EM , Discrete Math. STRONG 85 STRONG (1990), 247--255. A HREF="http: www.ams.org mathscinet-getitem?mr=92a%3A68114" STRONG MR 92a:68114 STRONG A ) studied graphs var H'(G) var whose vertices are (not necessarily induced) paths var P sub 3 sub var in var G var , two vertices of var H'(G) var being adjacent if and only if the corresponding var P sub 3 sub var 's in var G var share at least one vertex; they characterized (undirected) graphs var G var for which var H'(G) var is perfect. Another related paper is Lecirc;, EM Perfect k-line graphs and k-total graphs EM , J. Graph Theory STRONG 17 STRONG (1993), 65--73. A HREF="http: www.ams.org mathscinet-getitem?mr=94b%3A05083" STRONG MR 94b:05083 STRONG A . blockquote b Problem 7.2 b . For every directed graph var G var , let var H sub 2 sub (G) var denote the graph whose vertices are the transitive triangles in var G var , two vertices of var H sub 2 sub (G) var being adjacent if and only if the corresponding triangles in var G var share an arc. br For which graphs var G var is var H sub 2 sub (G) var perfect? blockquote blockquote b Problem 7.3 b . For every directed graph var G var , let var H sub 3 sub (G) var denote the graph whose vertices are the cyclic triangles in var G var , two vertices of var H sub 3 sub (G) var being adjacent if and only if the corresponding triangles in var G var share an arc. br For which graphs var G var is var H sub 3 sub (G) var perfect? blockquote blockquote b Problem 7.4 b . Charaterize graphs var H var such that br var H=H sub 1 sub (G) var for some graph var G var . blockquote blockquote b Problem 7.5 b . Charaterize graphs var H var such that br var H=H sub 2 sub (G) var for some directed graph var G var . blockquote blockquote b Problem 7.6 b . Charaterize graphs var H var such that br var H=H sub 3 sub (G) var for some directed graph var G var . blockquote If var G var is a planar oriented graph, then var H sub 3 sub (G) var is known to be ( var K sub 4 sub -e var )-free Berge graph, and hence perfect. br p Comment by Leizhen Cai: for each pair of graphs var X var and var Y var , Cai, Corneil and Proskurowski ( EM A generalization of line graphs: var (X,Y) var -intersection graphs EM , J. Graph Theory STRONG 21 STRONG (1996), no. 3, 267--287. A HREF="http: www.ams.org mathscinet-getitem?mr=96m%3A05164" STRONG MR 96m:05164 STRONG A ) defined the em var (X,Y) var -intersection graph em of a graph var G var as the graph whose vertices correspond to distinct induced subgraphs of var G var that are isomorphic to var Y var , and where two vertices are adjacent iff the intersection of the corresponding subgraphs contains an induced subgraph isomorphic to var X var . In this terminology, var H sub 1 sub (G) var is the var (K sub 2 sub ,K sub 3 sub ) var -intersection graphs of var G var . Cai, Corneil and Proskurowski have shown that the family of var (X,Y) var -intersection graphs is a subfamily of line-graphs of var k var -uniform hypergraphs, where var k var is the number of distinct induced copies of var X var in var Y var . p hr p a href="tc" To the table of contents a br a name="qperfect" p hr HR size=6 noshade hr h3 8. var q var -PERFECT GRAPHS h3 hr When var q var is a positive integer, var alpha sub q sub (G) var denotes the largest number of vertices of var G var that can by colored with only var q var colors; the em q-norm em of a family of sets var C sub 1 sub ,C sub 2 sub , ... ,C sub k sub var is the sum of the var k var numbers min{ var |C sub sub j|,q var }, and var theta sub q sub (G) var is the smallest var q var -norm of a family var C sub 1 sub ,C sub 2 sub , ... ,C sub k sub var of cliques in var G var whose union covers all the vertices; a graph is called var q var em -perfect em if, and only if, var alpha sub q sub (F)=theta sub q sub (F) var for all its induced subgraphs var F var . This concept was introduced by Lov225;sz ( EM Perfect graphs EM , Selected topics in graph theory (L.nbsp;M.nbsp;Beineke and R.nbsp;L.nbsp;Wilson, eds.), 2, Academic Press, London-New York, 1983, pp. 55--87. A HREF="http: www.ams.org mathscinet-getitem?mr=86h%3A05053" STRONG MR 86h:05053 STRONG A ). br p The following problems were contributed to the 1993 workshop by Claude Berge. blockquote b Problem 8.1 b Characterize var 2 var -perfect graphs. blockquote blockquote b Problem 8.2 b . Is it true that every minimal not- var 3 var -colorable var 3 var -perfect graph is perfect? blockquote It is known that var 2 var -perfect graphs are perfect and that the converse is false; it is known that parity graphs, balanced graphs, comparability graphs and cocomparability graphs are var 2 var -perfect; see C. Berge, EM The q-perfect graphs. I. The case q=2. EM Sets, graphs and numbers (Budapest, 1991; L.nbsp;Lovaacute;sz, D.nbsp;Miklos, and T.nbsp;Szouml;nyi, eds.), Colloq. Math. Soc. Jaacute;nos Bolyai, 60, North-Holland, Amsterdam, 1992, pp.67--75. A HREF="http: www.ams.org mathscinet-getitem?mr=94d%3A05110" STRONG MR 94d:05110 STRONG A and C. Berge, EM The q-perfect graphs. EM II.Combinatorics 92 (Catania, 1992), Matematiche (Catania) STRONG 47 STRONG (1992), 205--211 (1993). A HREF="http: www.ams.org mathscinet-getitem?mr=95h%3A05126" STRONG MR 95h:05126 STRONG A and C. Berge, EM The q-perfect graphs. EM Graph theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Intersci. Publ., Wiley, New York, 1995, pp.47--62. A HREF="http: www.ams.org mathscinet-getitem?mr=97c%3A05060" STRONG MR 97c:05060 STRONG A . br p hr p a href="tc" To the table of contents a br p HR body html
Problem of the Month
Research problems collected by Bojan Mohar.
Problems Problems Problem of the month Genus spectrum of regular maps (Late Summer 2005) Genus of Paley graphs (Early Summer 2005) Removable paths conjectures (Spring 2005) - communicated by Matthias Kriesell Graph Theory @ Oberwolfach 2005, Part 2 (Late Winter 2005) Graph Theory @ Oberwolfach 2005, Part 1 (Early Winter 2005) (3l + 1)-Conjecture (Fall 2004) - submitted by D. Kral, T. Madaras and R. krekovski Largest planar graph with positive combinatorial curvature (Summer 2004) [Added in January 2005: a solution found by Tamas Reti, a relaxed problem has been proposed.] Snarks on the projective plane (Late Spring 2004) Graphs of 4-polytopes (Early Spring 2004) Long paths in vertex-transitive graphs (Winter 2003 04) Go to the Problem of the month archives . Problems from the book Graphs on Surfaces Some Web pages with mathematical problems Problems I like - by Matt DeVos [temporarily unavailable] Problems in Topological Graph Theory maintained by Dan Archdeacon Open problems in Graph Theory by Stephen C. Locke Open problems (SIAM) by Doug West Open problems - Graph theory and combinatorics (collected by Doug West) Open problems in Graph Theory - DIMACS MathSoft unsolved problems Problem of the month (archives) Crossing number of the complete graph (April 2001) Crossing number of the complete bipartite graph (April 2001) Crossing number of the hypercube (April 2001) Barnette's Conjecture (May 2001) Grunbaum's Edge-Coloring Conjecture (June 2001) Matchings in vertex transitive graphs (July 2001) -edge-critical graphs and list colorings (August 2001) The chromatic number of the Unit Distance Graph (September 2001) Berge-Fulkerson Conjecture (October 2001) Hamiltonicity of graphs of convex polytopes (November 2001) Contractible edges in 5-connected graphs (December 2001) Choosability for the circular chromatic number (January 2002) [partially solved by X. Zhu] Are 3-connected planar graphs determined by their spectral properties? (February 2002) One Factorization and Hamiltonian Factorization Conjecture (March 2002) Fowler's Conjecture on eigenvalues of (3,6)-polyhedra (April 2002) Local colorings of triangulations (May 2002) Light infinite paths in infinite planar graphs (June 2002) Acyclic partitions of planar digraphs (July 2002) Induced forests in planar graphs (August 2002) Steiner triple systems and flexibility of embeddings of Kn (September - December 2002) [Comments by Mark Ellingham added in Dec.04] Can flow polynomials have large (real) roots? (January 2003) 5-Choosability of graphs on a fixed surface (February 2003) [Conjecture 2 solved by M. DeVos, K.-I. Kawarabayashi and B. Mohar in June 2005] The Strong Circular 5-Flow Conjecture (March and April 2003) [solved by E. Ma ajova and A. Raspaud] Eigenvalue-nonhamiltonian graphs (May 2003) [solved by Chris Godsil and Gordon Royle ] (r,s)-edge-choosability of cubic graphs (June 2003) Edge-coloring dual complete maps (Summer 2003) A relaxation of the Hadwiger Conjecture (Fall 2003) Revised: July 27, 2005.
Perfect Graphs
Conjectures and open problems, maintained at the AIM.
Perfect Graphs This web page highlights some of the conjectures and open problems concerning Perfect Graphs. If you would like to print a hard copy of the whole outline, you can download a dvi , postscript or pdf version. Recognition of Perfect Graphs Polynomial Recognition Algorithm Found Interaction Between Skew-Partitions and 2-joins The Perfect-Graph Robust Algorithm Problem NP Characterization of Perfect Graphs Recognition Algorithm Given the List of Maximal Cliques Berge Graphs with Poly-bounded Number of Max Cliques TDI Matrices Fixed Parameter Algorithms Clique Joins Polynomial Size Decomposition Tree Structural Characterization of Perfect Graphs Coloring Perfect Graphs Uniquely colorable perfect graphs Optimization on Perfect Graphs New Optimization Problems on Perfect Graphs A Possible New Problem Skew-Partitions Extending a Skew -Partition Graphs Without Skew-Partitions Graphs Without Star Cutsets Finding Skew-Partitions in Berge Graphs Interaction Between Different Skew-Partitions in a Graph Skew -Partitions of Balanced Size Recognizing Balanced Skew-Partitions Even-Pair Skew-Partition Even Pairs in Berge Graphs Coloring Berge Graphs Using Even Pairs Recognizing Even Pairs Quasi-Parity and Strict Quasi-Parity Graphs Forbidden Subgraphs for The Class of Strict Quasi-Parity Graphs Recognition of Quasi-Parity and Strict Quasi-Parity Graphs Perfectly Contractile Graphs Perfectly Contractile Graphs and the Decomposition Method Possible Structure Theorem for Berge Graphs Odd holes and odd walks Forbidding Holes and Antiholes 2-divisible Graphs Clique Coloring of Perfect Graphs Recognition of Odd-Hole-Free Graphs Even-Hole-Free Graphs Even-hole-free circulants, beta-perfect graphs Partitionable Graphs Perfect, Partitionable, and Kernel-Solvable Graphs Partitionable graphs and odd holes A Property of Partitionable Graphs Small Transversals in Partitionable Graphs The Imperfection Ratio Integer Programming Partitionable Graphs as Cutting Planes for Packing Problems? Feasibility Membership Problem For the Theta Body Balanced Graphs Balanced circulants P4-structure and Its Relatives The individual contributions may have problems because converting complicated TeX into a web page is not an exact science. The dvi, ps, or pdf versions are your best bet.
Graph Coloring Problems
Archives for the book "Graph Coloring Problems" by Tommy R. Jensen and Bjarne Toft (Wiley Interscience 1995)
Graph Coloring Problems -- The archive. IMADA Research activities Graph Coloring Problems Here are the archives for the book "Graph Coloring Problems" by Tommy R. Jensen and Bjarne Toft (Wiley Interscience 1995), dedicated to Paul Erds . The book has ISBN number 0-471-02865-7. It is published as part of the Wiley-Interscience Series in Discrete Mathematics and Optimization. The list price is US$ 44.95, but most booksellers seem to charge only US$ 39.95. It may be ordered by electronic mail from several booksellers, e.g. from Powell's Technical Books, Oregon, USA . Overview New problems Reviews Kenneth I. Appel, Bull. Amer. Math. Soc. 33 (1996), pp.287-288. Ron Read, SIAG-DM Newsletter Fall 1995, pp. 4-6. Alexander Soifer, Geombinatorics V(2) Oct.1995, pp.81-83. Contributions to be considered for inclusion into the archives should be sent by e-mail to graphcol@imada.sdu.dk . An interesting graph coloring link is Joseph Culberson's Graph Coloring Page . It contains links to numerous other sites with material of interest for graph coloring. For general information related to combinatorial mathematics, consult the World Combinatorics Exchange . Graph Theory by Reinhard Diestel (Springer 1997) gives an introduction to general graph theory including chapters on coloring and integer flows. Digraphs: Theory, Algorithms and Applications by Jrgen Bang-Jensen and Gregory Gutin (Springer 2001) is a comprehensive text on directed graphs, containing material on the relations of graph orientations with coloring and integer flows, and with discussion of directed graph homomorphisms, among other topics. Tommy R. Jensen and Bjarne Toft Last modified: January 28, 1999
Problems in Topological Graph Theory
Web text by Dan Archdeacon with a list of open questions in topological graph theory.
Problems in Topological Graph Theory Problems in Topological Graph Theory Go to the Table of Contents Compiled by Dan Archdeacon List Started: August 5, 1995 Converted to the web: September 1, 1998 Last modified: November 15, 1998 E-Mail: dan.archdeacon@uvm.edu Postal Mail: Dan Archdeacon Dept. of Math. and Stat. University of Vermon t Burlington VT 05401-1455 USA Abstract Do you think you've got problems? I know I do. This paper contains an ongoing list of open questions in topological graph theory. If you are interested in adding a problem to this list please contact me at the addresses above. The spirit is inclusive---don't submit a problem you're saving for your graduate student. If it appears here, it's fair game. If you solve one of the problems, know some additional history, or recognize it as misphrased or just a stupid question, please let me know so that I can keep the list up-to-date. I've taken quite a bit of liberty editing the submissions. I apologize for any errors introduced. Enjoy my problems---I do! Table of Contents Classical questions on genus Coloring graphs and maps Drawings and crossings Paths, cycles, and matchings Symmetries Locally planar embeddings Computational complexity Book embeddings Representing graphs and embeddings Random topological graph theory Miscellaneous problems Solved problems from previous editions Return to the Main Table of Contents The Problems Classical questions on genus The effect of edge deletion on the nonorientable genus Minor-minimal non-toroidal graphs Nearly triangular imbeddings of complete graphs Quadrilateral embeddings of composition graphs Edge coloring the n-cube The genus sequence of a signed graph Trading handles for crossings Return to the Main Table of Contents Coloring graphs and maps The earth-moon coloring problem Ringel's one-chromatic number of surfaces Tutte's nowhere-zero 4- and 5-flow conjectures Three edge-coloring orientable triangulations Four-coloring all but three vertices of a toroidal graph The d-diagonal chromatic number Generalizations of Tait coloring cubic graphs Vertices of odd degree in a triangulation Determining triangulations by their four-colorings When are there local colorings? Return to the Main Table of Contents Drawings and crossings The crossing number of the complete graph A combinatorial generalization of drawing the complete graph Four questions about drawing the complete graph Turan's brickyard problem: the crossing number of K(n,m) The crossing number of the cube The crossing number of a product of cycles The rectilinear crossing number The thrackle conjecture Is the maximum crossing number hereditary? A crossing number hereditary under minors Drawing rotations in the plane Drawing chords in a disk Two problems about drawing graphs in the plane Straight-ahead cycles in drawings of Eulerian graphs Return to the Main Table of Contents Paths, cycles, and matchings Longest paths in polyhedral graphs The cycle double cover conjecture Double covering edges by perfect matchings 2-Connected spanning subgraphs of bounded degree Return to the Main Table of Contents Symmetries Regular maps on nonorientable surfaces Automorphism groups of Cayley maps Regular Cayley maps that are neither balanced nor antibalanced Automorphisms adjacent to the identity Planar coverings: the 1-2-infinity conjecture Return to the Main Table of Contents Locally planar embeddings Planar graphs in nonplanar surfaces Orientable genus of graphs of bounded nonorientable genus Finding separating cycles in embedded graphs Interpolation conjectures on separating cycles in embedded graphs Spanning trees with small degree Finding embeddings of large face width LEW embeddings of weighted graphs Return to the Main Table of Contents Computational complexity Complexity questions for cubic graphs The approximability of graph minimum genus embeddings Return to the Main Table of Contents Book embeddings The pagenumber of complete bipartite graphs The average pagenumber of a permutation An unusual way to draw graphs in books Return to the Main Table of Contents Representating graphs and embeddings Planar graphs with integer length straight edges Representing graphs by intersecting line segments Representing graphs by spheres in 3-space Recognizing and coloring rectangle visibility graphs Toroidal triangulations with flat faces Return to the Main Table of Contents Random topological graph theory The expected number of regions in a random embedding of the complete graph Partitioning into complete graphs Return to the Main Table of Contents Miscellaneous problems Outerplanar partitions of planar graphs Faces covering the edges of a graph Boundary-preserving maps between disks Two-dimensional Catalan numbers Return to the Main Table of Contents Solved problems from previous editions Return to the Main Table of Contents The End
Problems in Graph Theory
Maintained by Peter Cameron.
Problems ex Cameron's homepage Problems These are problems which have been on my homepage and are now put out to grass. See also permutation group problems . 1. In 1956, Rudin defined a permutation of the integers which maps 3x to 2x, 3x+1 to 4x+1, and 3x-1 to 4x-1 for all x. Problem: Determine the cycle structure of this permutation. I have just learned (December 1998) that this problem is older: it is the "original Collatz problem" from the 1930s (before the famous 3x+1 problem). A paper by Jeff Lagarias gives details. 2. Let f(k,n) be the number of rooted trees with n leaves, all at level k (that is, distance k from the root), up to isomorphism of rooted trees. Prove that f(k+1,n) f(k,n) tends to infinity with n, for fixed k. Is it even true that f(k+1,n) f(k,n) is at least 1 + (n-1) k? Solution by Peter Johnson. Let r be the maximum number of edges from a vertex on one level to the next level, in a tree with n vertices at level k. Then rk is at least n, so r is at least n1 k. From any tree of height k+1, we obtain at most k different trees of height k by suppressing one level (replacing the paths of length 2 crossing this level by single edges). But there is some tree of height k from which at least p(n1 k) trees of height k+1 can be recovered by introducing a new level. (Choose a level where some vertex has at least n1 k upward edges; if the number of such edges is r, then we can split the r edges in p(r) ways giving non-isomorphic trees. (Treat all the other vertices on this level alike.) So f(k+1,n) f(k,n) is at least p(n1 k) k. For motivation, see On the probability of connectedness in Discrete Mathematics 167 168 (1997), 173-185. 3. Let C be a class of graphs closed under forming disjoint unions and connected components. Let cn be the number of connected n-vertex graphs in C, and an the total number of n-vertex graphs in C (up to isomorphism). Suppose that c(x) is the generating function of the sequence (cn); assume that c(x) has non-zero radius of convergence r less than 1. Is it true that, if the ratio cn an tends to a positive limit as n tends to infinity, then c(r) converges? Information I have about this is in the paper On the probability of connectedness in Discrete Mathematics 167 168 (1997), 173-185. 4. The number of strings of n red and blue beads is equal to the number of collections of necklaces of red and blue beads, where rotation of each necklace is permitted and only necklaces with no rotational symmetry are allowed. (The number is 2n in each case.) For example, when n=2, the collections of necklaces are (R)(R), (R)(B), (B)(B), and (RB); (RR) and (BB) are not allowed. The strings are RR, RB, BR, BB. Problem: find a bijective proof of this fact. Solutions were given by Dima Fon-Der-Flass, Rosemary Bailey, and Robin Chapman. Then Roger Bryant drew my attention to C. Reutenauer, Free Lie Algebras, London Math. Soc. Monographs (New Series) 7, Oxford University Press, 1993, which contains this and more. An account of my secret agenda in asking this question is in the paper The algebra of an age, in Model Theory of Groups and Automorphism Groups (ed. David M. Evans), London Math. Soc. Lecture Notes 244, Cambridge University Press, 1997, pp. 126-133. 5. Let G be a finite graph, and X(G) the class of graphs containing no induced subgraph isomorphic to G. For which G is it true that the probability that a (labelled or unlabelled) graph in X(G) with n vertices is connected tends to a limit strictly between zero and one as n tends to infinity? For example, if G is the path of length 3, then the probability of connectedness in n-vertex graphs in X(G) is 1 2 for all n 1. 6. Let s(n) be the number of sequences of elements from the set {1,...,n} for which each term is at least twice the preceding one, and u(n) the number of such sequences in which each term is greater than the sum of its predecessors. It is known that u(n) - u(n-1) = s(n) 2. Problem: Find a bijective proof. Solution by Jeannette Janssen: Use the terms S-sequence and U-sequence for the sequences counted by s(n) and u(n). The left-hand side of the equality counts U-sequences ending in n; removing the last term gives a U-sequence with sum less than n. Given an S-sequence, we can add or remove 1 without changing the S-sequence property. So the right-hand side counts S-sequences containing 1. Now take one of these U-sequences, say u1, u2, ...; the corresponding S-sequence is 1, 1+u1, 1+u1+u2, ... Note: this problem is from my combinatorics textbook, for which a Web page now exists. 7. A triangular prism made of uniform material has cross-section with sides a, b and c (not necessarily equal). It is rolled along a smooth plane so that it rotates about its axis. It gradually loses energy (because of air resistance). What are the probabilities that it lands on each of the three faces (in terms of a, b and c)? There are obviously some points of detail in the physics to discuss. Dima Fon-Der-Flaass has an argument to show that, if the loss of energy is infinitesimally slow, and the triangle has unequal sides, then the probabilities are either 1 2, 1 4, 1 4 or 1 2, 1 2, 0. This assumption is not physically realistic. Paul Glendinning found the even more surprising result that there is a collection of non-trivial intervals, arbitrarily close to 0, such that if the dissipation rate d lies in one of these intervals, then the probabilities are 1, 0, 0 for almost all initial conditions; that is, there is one face on which the prism is almost certain to land. See P. Glendinning, Inaccessible attractors of weakly dissipative systems, Nonlinearity 10 (1997), 507-522. Franco Vivaldi pointed out that, if instead the prism is turned to a random orientation and dropped onto a plane covered with glue, then the probabilities are proportional to the angles subtended by the sides at the centroid of the triangle. 8. It can be shown that, if Fi is the number of orbits of a finite permutation group G on i-tuples of distinct elements, then the proportion of elements of G which are derangements (have no fixed points) is the alternating sum of the quantities Fi i!. (See N. Boston, W. Dabrowski, T. Foguel, P. J. Gies, J. Leavitt, D. T. Ose and D. A. Jackson, The proportion of fixed-point-free elements of a transitive permutation group, Communications in Algebra 21 (1993), 3259-3275.) For an infinite oligomorphic group (one with Fi finite for all i), the alternating sum may make sense (i.e. it may converge, or some other summation method may apply), even though the proportion of derangements does not. Problem: What does this mean? For example, in the infinite symmetric group, Fi=1 for all i, and the sum is 1 e, which is just the limiting proportion of derangements in finite symmetric groups. A more mysterious example is the group of order preserving permutations of the rational numbers. Here, fi=i! for all i, and the sum is 1-1+1-1...=1 2 (according to Euler). In what sense are half of the order-preserving permutations derangements? 9. (A. D. Keedwell). Suppose that x1, ..., xm, y1, ..., yn are positive integers such that there exists a bipartite graph with vertex degrees x1, ..., xm in one bipartite block and y1, ..., yn in the other. (This is equivalent to asserting that the conditions of the Gale-Ryser theorem are satisfied.) Suppose further that all the xi and yj are greater than 1. Show that there is a bipartite graph having these vertex degrees, which has two proper edge-colourings such that for any vertex, the sets of colours appearing on edges at that vertex are the same in both colourings; no edge receives the same colour in both colourings. Note: it is not true that any graph with these vertex-degrees has such a pair of colourings. A counterexample is given by the two degree sequences (3,2,2,2) and (3,2,2,2), when the graph consisting of two 4-cycles joined by an edge does not have such a pair of colourings (though the graph consisting of two vertices joined by three disjoint paths of length 3 has such the same degree sequences and does have such colourings. The conjecture is true if the degrees are all equal, or if every degree is either 2 or 3. This problem is also Problem 16.15 in the list of BCC16 problems (PostScript file). See also Discrete Math. 197 198 (1999), 799-812. Recently, it has been shown by M. Mahdian, E. S. Mahmoodian, A. Saberi, M. R. Salavatipour and R. Tusserkani that this conjecture is a consequence of the celebrated "oriented cycle double cover conjecture" for bridgeless graphs. They have shown its truth in many cases. 10. Let S be the symmetric group on the infinite set X. Consider the product action of S2 on X2, and let an be the number of orbits on subsets of size n. Problem: Find a formula for, or an efficient means of calculating, an. The number an has other combinatorial interpretations: It is the number of zero-one matrices with n ones, with no zero rows or columns, up to row and column permutation. It is the number of bipartite graphs with n edges, no isolated vertices, and a distinguished bipartite block, up to isomorphism. 11. (a) Do there exist eight subsets of the set 1..10 with the properties any two points lie in at most two sets, any two sets meet in at least two points? Solution: yes; I found one by hand: 1, 2, 5, 8, 9 1, 2, 6, 7, 9 3, 4, 5, 7, 9 3, 4, 6, 8, 9 1, 3, 5, 6, 10 2, 4, 5, 6, 10 1, 4, 7, 8, 10 2, 3, 7, 8, 10 (b) Do there exist twelve subsets of the set 1..15 with the above properties? Solution: no (by a combination of case analysis and computer search). Remark. The next interesting open case is eighteen subsets of 1..21. This has been settled in the negative by Pablo Spiga (personal communication). 12. Let An denote the nth element on the axis of symmetry of Pascal's triangle (the middle binomial coefficient 2n choose n). A simple argument with generating functions shows that A0An + A1An-1 + ... + AnA0 = 4n. (The generating function Sum Antn is equal to (1-4t)-1 2, by the binomial theorem.) Problem. Find a "counting proof" of this identity. This problem is due to Alastair King and Andrew Swann. I heard it from Geoff Smith . A solution was found by Omer Egecioglu . Subsequently, Robin Chapman told me that the result is due to Daniel J. Kleitman, A note on some subset identites, Studies in Applied Mathematics LIV 289-293 (1975). Then an even earlier `proof' was unearthed in W. Feller's classic An Introduction to Probability Theory and its Applications, by Alastair King . Here are his comments (with an addition by Robin Chapman): Solution: As observed by Kleitman, the "central binomial convolution identity" amounts to the fact that the number of balanced +1 -1 sequences (random walks) is equal to the number of never balanced ones of the same length. A simple combinatorial proof of this fact can be extracted from the probability literature: W. Feller, An Introduction to Probability Theory and its Applications, Wiley, New York, 1950. The result plays a fundamental role in the analysis of random walks (Main Lemma III.3.1). The proof given in the text is not strictly combinatorial, but Problem III.10.7 asks for a purely combinatorial proof and sketches the construction of a bijection which is attributed to E. Nelson. Confusingly, the sketch appears to construct a bijection with another set of random walks of the same size, namely those which are non-negative. However, a small modification yields the following: Identify the "initial" segment of a walk as being: for a balanced walk, up to the first time it reaches either its minimum value for walks that start -1 or its maximum value for walks that start +1, for a never balanced walk, up to the last time it reaches half its final value with a +1 for walks that start with +1 or with a -1 for walks that start with -1. The bijection reverses the signs and order of the initial segment. Note: the first and last steps in an initial segment have the same sign. Thus balanced walks that start -1 correspond to never balanced ones that start +1 (and vice versa). 13. This problem is due to Sylvie Corteel, Carla D. Savage, Herbert S. Wilf and Doron Zeilberger, and appeared in the Journal of Combinatorial Theory, Series A, 82 (1998), 186-192. Among the ordered pairs of monic polynomials of degree n over GF(2), exactly half consist of relatively prime polynomials. Find a nice bijection between the relatively prime pairs and the non-relatively-prime pairs. I have no further information. 14. Two problems on designs and partitions. 1. Is it possible to partition the 4-subsets of a 16-set into 13 sets of 140 subsets, each set isomorphic to the set of planes in the affine space AG(4,2)? Solution: Rudi Mathon informs me that Luc Teirlinck has shown the non-existence of such a partition. I will add the reference when I find it. Of course, one can now ask for a partition of the 4-subsets of a 32-set into 29 copies of AG(5,2). 2. Is there a Steiner system S(3,5,26) (a set of 5-subsets of a 26-set with the property that any 3 points lie in just one of them) having the property that there are no three of the blocks which have pairwise intersections of size 2 but the intersection of all three is empty? Such a design would give rise to a strongly regular graph on 352 vertices and hence to a biplane with 352 points and the same number of blocks. 15. Two problems on random Latin squares 1. Call a row of a Latin square even or odd according as it is an even or an odd permutation of the set {1,2,...,n}. Prove that the number of even rows of a random Latin square of order n is approximately binomial B(n,1 2). (The best result in this direction is due to R. Hggkvist and J. Janssen, Discrete Mathematics 157 (1996), 199-206: the probability that all rows are even is exponentially small.) 2. Define a probability measure on permutations of {1,2,...,n} as follows: the probability of a permutation is the proportion of Latin squares with first row (1,2,...,n) in which it occurs as the second row. What can be said about this distribution? (For example, a permutation has non-zero probability if and only if it is a derangement.) In particular, prove that the probability that a permutation lies in no transitive proper subgroup of the symmetric group except possibly the alternating group tends to 1 as n approaches infinity. (The analogous result for the uniform distribution was proved by T. Luczak and L. Pyber, Combinatorics, Probability and Computing 2 (1993), 505-512. Their result gives a simple deduction that the group generated by the rows of a random Latin square is almost surely the symmetric group. A solution to this problem would give the same conclusion for a random "normalised" Latin square.) Note added 28 July 2005: I now believe that the distribution defined here "approaches" the uniform distribution on derangements as n grows. For example, when n=7, the numbers of ways of extending a two-rowed Latin rectangle corresponding to each type of derangement (with cycle lengths 7, 2+5, 2+2+3, and 3+4 respectively) are 6566400, 6604800, 6635520, and 6543360 respectively. 16. Find all positive ingers greater than two which can be written as the sum of two powers of the same prime in three different ways. (I know of only six such integers, none of which has more than three different representations of this form.) 17. It is known that the average number of ways in which a positive integer in the range [1,...,n] can be written as a sum of consecutive primes tends to the limit loge2 as n tends to infinity. Is it true that the limiting distribution of the number of representations of this form is Poisson with parameter loge2? This would imply that the density of the set of numbers with no such representation is 1 2. It would also imply that there exist integers with arbitrarily many such representations. Either of these assertions would be a nice result! 18. A problem on Fibonacci numbers. (I learned this problem from John Conway; see also C. Kimberling, Numeration systems and fractal sequences, Acta Arith. 73 (1995), 103-117.) Any positive integer can be written uniquely as the sum of non-consecutive Fibonacci numbers. Hence we can define the Fibonacci successor function on the natural numbers by taking this expression and "moving each Fibonacci number along one". So, for example, 40 = 34 + 5 + 1; its Fibonacci successor is 55 + 8 + 2 = 65. Now produce a table in which each row begins with the smallest number which doesn't occur in any earlier row, and all further entries are obtained by applying the Fibonacci successor function. (So the top row consists of the Fibonacci numbers 1, 2, 3, 5, 8, ...; the next begins 4, 7, 11, ...) It turns out that if we extrapolate each row back two steps using the recurrence relation for the Fibonacci numbers, we obtain the natural numbers 0, 1, 2, 3, ...; this gives a convenient numbering of the rows. Every positive integer occurs exactly once in this table, and every sequence of positive integers satisfying the Fibonacci recurrence relation agrees from some point on with a row of the table. Now let xn denote the fractional part of n times the golden ratio. Let an and bn be the number of earlier terms of this sequence to the left and the right respectively of xn (including 0 and 1). The sequence of pairs (an, bn) begins (1,1), (1,2), (3,1), (2,3), (1,5), (5,2), ... If we look at the pairs occurring in the Fibonacci-numbered positions, we see (1,1), (1,2), (3,1), (1,5), ... In other words, one number in the pair is 1, and it bounces from side to side as we progress along the sequence. This follows from well-known properties of the continued fraction expansion of the golden ratio. Problems. If we consider the pairs in the positions numbered by any fixed row in the table, show that there is a "bouncing number" which alternates sides in the pairs. Which numbers occur as "bouncing numbers"? For example: row number 1 of the table is 4, 7, 11, 18, 29, ...; the pairs in these positions are (2,3), (3,5), (9,3), (3,16), (27,3), ...; so the "bouncing number" is 3. The "bouncing numbers" for rows 0, 1, 2, 3, 4, ... appear to be 1, 3, 2, 5, 8, 5, 9, ... Further information here, in DVI or PostScript . 19. Let p1 be a prime number. For every n, let pn+1 be the smallest prime divisor of p1...pn+1. Is it true that, for every n, there is a prime p1 for which none of the first n terms of the sequence is equal to 3? Is there a prime p1 for which no term of the sequence is equal to 3? (This problem is due to Steve Donkin .) 20. Is the following true? If P is a 2-group which is not elementary abelian, then some non-identity element of the centre of P is a square. Solution: The answer to this question is negative. The smallest counterexamples have order 128, and there are two of them. This was found by Alexander Hulpke and Andreas Caranti. Alexander provided the following example in GAP: gap g:=SmallGroup(128,36); gap z:=Centre(g); Group([ f6, f7 ]) gap r:=List(ConjugacyClasses(g),Representative);; gap s:=Filtered(r,i- Order(i) 2);; gap List(s,Order); [ 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 ] gap Set(List(s,i- i^2)); [ f4, f5, f4*f7, f5*f6, f3*f4*f5, f3*f4*f5*f6, f3*f4*f5*f7, f3*f4*f5*f6*f7 ] gap List(last,i- i in z); [ false, false, false, false, false, false, false, false ] If not, is the following weaker statement true? If P is a 2-group which is not elementary abelian, and Q is a core-free subgroup of P, then there is an element lying in no conjugate of Q which is a square. Avinoam Mann also suggested the above group as a possible counterexample to the second question. However, Steve Linton and John Murray both checked that there is no core-free subgroup Q for which it is a counterexample. So the question is still open. Solution (13 September 2004): The answer to the second question is also negative. Pablo Spiga found that the group of order 128 with generators (1,2,7,3)(4,8)(5,11)(6,9)(10,14)(12,16,13,15), (1,4,7,5)(2,8)(3,11)(6,13,14,12)(9,15)(10,16), and (1,6)(2,9,3,10)(4,12,5,13)(7,14)(8,15)(11,16) is a counterexample. Indeed, in this group the set of elements with fixed points coincides with the set of squares. This group is SmallGroup(128,836) in the GAP library. The motivating question, whether a vertex-transitive trivalent graph necessarily has a semiregular automorphism of order greater than 2, is currently still open. 21. A symmetric graph design, or SGD, with parameters (n, X, lambda, F), (where n and lambda are positive integers and X and F are graphs on n vertices), is a set {X1, ..., Xn} of subgraphs of the complete graph on {1, ..., n} having the following properties: Xi is isomorphic to X for all i; Xi intersection Xj is isomorphic to F for all distinct i,j; any edge of the complete graph lies in exactly lambda of the graphs X1, ..., Xn. To avoid degenerate cases, we assume that X is neither the complete nor the null graph on n vertices. Symmetric graph designs generalise symmetric BIBDs (symmetric 2-designs, the case where X=Kk and F=Klambda). In this case, condition 2 follows from conditions 1 and 3. Problem: Does condition 2 follow from 1 and 3 in general? Does 3 follow from 1 and 2? Does 1 follow from 2 and 3? (Assume that lambda is greater than 1.) Dima Fon-Der-Flaass has shown that condition 1 does not follow from 2 and 3. An example for lambda=2: it is easy to find n subgraphs of Kn, each having n-1 edges, in such a way that every edge belongs to exactly two of them, and every two subgraphs have a single edge in common. The subgraphs can be arbitrary. Santi Spadaro points out that 3 does not follow from 1 and 2, essentially because we can take a symmetric graph design and choose an arbitrary subset of the graphs Xi. Moreover, 2 does not follow from 1 and 3: take all graphs on n vertices isomorphic to a fixed graph X; then 1 and 3 hold but 2 usually fails. This problem is now completely settled in the negative. (11 June 2002) 22. It is known that, if G is a permutation group in which every non-identity element fixes exactly k points, then either G has a fixed set of size k, or G is one of a finite list of groups (for given k). The problem is to find a good upper bound (in terms of k) for the orders of the groups in this finite list. For example, when k=2, the groups are the tetrahedral, octahedral and icosahedral groups, acting on the vertices, edges and faces of the corresponding polyhedra. (Every rotation has an axis, so has just two fixed points in this action.) So the correct bound is 60. (This is a theorem of Iwahori, J. Fac. Sci., Univ. Tokyo 11 (1964), 47-64.) C. Franchi, in European J. Combinatorics 22 (2001), 821-837, solved this by giving the bound max{60,a!a(a!a-1)}. I don't know whether this can be improved. 23. Let G be a finite group, a an automorphism of G, and X the semidirect product of G by the group generated by a. Suppose that every element of X not in G has prime order p. It follows that the centraliser of a in G is a p-group. Let its order be pm. A theorem of Kegel (Math. Z. 75 (1961), 373-376) shows that G is nilpotent. Then a theorem of Khukhro (Mat. Zametki 38 (1985), 652-657) shows that G has a normal subgroup whose nilpotency class and index are bounded by functions of p and m. Is it true that the nilpotency class of G is bounded by a function of p and m? Solution: This question has been settled in the affirmative by Andrei Jaikin , using a theorem of E. Khukhro, On locally nilpotent groups admitting a splitting automorphism of prime order, Mat. sb. 130 (1986), 120-127. 24. A separation relation on a set is the quaternary relation induced by a circular order on the set by the rule that S(a,b,c,d) holds if a and b separate c and d. (This holds for exactly one of the three partitions of the four points a,b,c,d into two pairs.) It is known that a quaternary relation is a separation relation if and only if its restriction to every 5-element set is a separation relation. Let P be an inversive plane, C a circle of P. Define a relation S on C by the rule that S(a,b,c,d) holds if every circle through a and b meets every circle through c and d. Problem: What does it mean for P if, for every circle C of P, the above relation S is a separation relation? 25. Let Sn and Pn be the respectively the symmetric group (the set of all permutations) and the set of all partitions on the set [1..n]. There is a function F from Sn to Pn which replaces every permutation by the partition corresponding to its cycle decomposition. (a) Is there an efficient method to decide whether a set of partitions is the image under F of a subgroup of Sn? (b) If G and H are subgroups of Sn such that F(G)=F(H), then G and H have the same order. Are they necessarily isomorphic? Note added 19 May 2000: The answer to (b) is negative. Eamonn O'Brien has shown that there are two pairs of groups of order 64 (numbers 19 and 111, and 94 and 249, in the lists in MAGMA and GAP), which act transivitely on 16 points, such that the two groups in each pair give rise to the same sets of cycle partitions. You can find a GAP program to verify this. A preprint ( DVI or PostScript ) gives further details. 26. It is known that the only finite or countably infinite graphs G with the property that, for any partition of the vertex set into two parts, at least one of the parts induces a subgraph isomorphic to G, are a single vertex, the countable complete and null graphs, and the countable random graphs. Which graphs have the property that, for any partition of the vertex set into three parts, the induced subgraph on the union of some two of the parts is isomorphic to the original graph? Note 26 6 2000: This problem has been solved by A. Bonato, D. Delic and S. Thomass: details later. 27. Let G be a subgroup of the symmetric group Sn. For i = 0, ..., n, let pi be the probability that a random element of G has exactly i fixed points, and let Fi be the number of orbits of G on i-tuples of distinct points. These two sequences determine each other. In fact, N. Boston, W. Dabrowski, T. Foguel, P. J. Gies, J. Leavitt, D. T. Ose and D. A. Jackson, Communications in Algebra 21 (1993), 3259-3275, showed that, if P(x) = Sum pi xi and F(x) = Sum Fi xi i! , then F(x) = P(x+1). Now consider the linear analogue. Let G be a subgroup of the general linear group GL(n,q). For i = 0, ..., n, let pi be the probability that the fixed points of a random element form precisely an i-dimensional subspace, and let Fi be the number of orbits of G on linearly independent i-tuples. Again the two sequences determine each other. Problem: Express the relation between these two sequences in terms of generating functions. Note: This problem is now solved (2 August 2000). It is just a case of finding the right definitions of the q-analogues! Here is an account of this ( DVI or PostScript ) 28. (An old problem revisited) Let G be a permutation group on the infinite set X. Assume that G is oligomorphic, that is, G has only finitely many (say fn) orbits on the set of n-element subsets of X. Dugald Macpherson, Proc. London Math. Soc. (3) 46 (1983), 471-486, showed that, if G is primitive on X (preserves no non-trivial equivalence relation) but not highly set-transitive ((that is, fn 1 for some n), then the sequence (fn) grows exponentially, that is, limsup (fn)1 n 1. These two assumptions apply throughout this problem, though analogous problems can be posed with primitivity relaxed. Is it true that lim (fn)1 n exists for any group G? What is the smallest possible value of the limsup? (Macpherson's lower bound of 21 5 has been improved by F. Merola to about 1.324. The smallest known value is 2.) What is the smallest limit point of the set of values of the limsup? Further information on such sequences is available in my survey article . 29. Let n be a positive integer and a a positive real number. It is easy to show that there is a positive real number b (depending on n and a) with the property that, for any positive integers x1, ..., xn, if (1 x1) + ... + (1 xn) a, then (1 x1) + ... + (1 xn) = a-b. Problem: If a is an integer, find an explicit lower bound for b in terms of n and a. 30. Let k be a positive integer. Which finite groups G have the property that, given any k elements of G, there is an automorphism of G which simultaneously inverts them all? Which finite groups G have the weaker property that, given any k elements of G, there is an automorphism of G and a permutation of the elements whose combination maps each element to its inverse? All abelian groups have the first property. Perhaps, for moderately large k, there are not too many more. Added 12 March 2001: The problem of bounding k has been solved by my colleague R.A.Bailey. For a non-abelian group G, the value of k is at most 2 for the first question, 5 for the second. These bounds are best possible. The problem of classifying all groups attaining the bounds (or, indeed, having one of these properties for a positive k) remains open. 31. (This is a variant of Problem 30.) Which finite groups have the property that the automorphism group acts transitively on the set of ordered pairs of non-commuting elements? Added 22 March 2004: Pablo Spiga has pointed out that such a group must be a p-group of Frattini class 2. 32. A graph is N-free if it does not contain the path of length 3 as an induced subgraph. Let c(n) be the number of connected N-free graphs on n vertices. Then the following identity holds. Productn 0(1-qn)-c(n) =1 - q + 2 Sumn 0c(n)qn. This somewhat resembles in form the denominator identity of a Kac-Moody Lie algebra. Problem: Is there a nice connection? 33. Let A0, ..., As be nn matrices of zeros and ones. Consider the following conditions: (1) A0 + ... + As = J, the all-1 matrix. (2) A0 = I, the identity matrix. (3) For all i, there exists j such that AiT=Aj. (3+) For all i, AiT=Ai. (4) There are numbers pijk such that AiAj=SumpijkAk. (4-) There are numbers qijk such that AiAj+AjAi=SumqijkAk. If (1), (2), (3+) and (4) hold, we have an association scheme. Conditions (1), (2), (3) and (4) define a homogeneous coherent configuration. Conditions (1), (2), (3+) and (4-) define a Jordan scheme (so-called because the span of the matrices is a Jordan algebra). The operation of symmetrizing involves, for each non-symmetric matrix Ai, replacing it and its transpose by their sum (a symmetric zero-one matrix). It is easy to see that symmetrizing a homogeneous coherent configuration gives a Jordan scheme. Problem: Is there a Jordan scheme which is not obtained by symmetrizing a homogeneous coherent configuration? 34. A base for a permutation group is a sequence of points whose stabiliser is the identity; it is irredundant if no point is fixed by the stabiliser of its predecessors. Cameron and Fon-Der-Flaass, Europ. J. Combinatorics 16 (1995), 537-544, called a permutation group an IBIS group if all irredundant bases have the same number of elements; they showed that the irredundant bases of an IBIS group are the bases of a matroid. Problem: What is the relation between the Tutte polynomial of the matroid and the cycle index of the permutation group? It is known that sometimes the first determines the second and sometimes vice versa. Perhaps there is a gadget which generalises both! See a paper in the Electronic Journal of Combinatorics for further details. 35. R. D. Carmichael defined a primitive lambda-root or PLR of n to be an element of U(n) (the group of units modulo n) whose order is equal to the exponent of U(n). It is possible to count the number of PLRs of n, for any n. Donald Preece asked: is it possible to count the number of PLRs x having the property that x-1 is a unit? In particular, for which n do all (resp. some, none) of the PLRs have this property? Combinatorics Study Group notes on primitive lambda-roots are available. For reasons explained therein, the number can be counted in principle by inclusion-exclusion, but there is unlikely to be a neat formula ... 36. How large is the largest antichain of subgroups of the symmetric group Sn? More precisely, estimate an sn, where an is the size of the largest antichain and sn the total number of subgroups. 37. Let L(G) be the subgroup lattice of the finite group G. Is the following true or false? Suppose that the Boolean lattice B(n) of subsets of an n-element set is embeddable as a meet-semilattice of L(G), and suppose that n is maximal with this property. Then there is an embedding of B(n) as meet-semilattice, such that the least element of B(n) is a normal subgroup of G. Note: The quaternion group Q8 shows that we cannot make the least element of B(n) correspond to the identity in general. 38. This problem is due to R. A. Bailey. Let A be an affine plane of order q. Is it possible to find, for each point x of A, a permutation px of the set of parallel classes of A with the properties for all x, px is a derangement; for all distinct x, y, if the line xy lies in parallel class C, then Cpx is different from Cpy? There is no solution for q=2, since there are only two derangements and four points. For q=3, there is a solution. It is conjectured that a solution exists for all larger q. 39. This problem is due to Harut Aydinian, and was communicated to me by Oriol Serra. What is the size of the largest sum-free set (one not containing two points and their vector sum) in the square {1,...,n}{1,...,n}? In particular, show that the number is cn2+O(n), and find the constant c. Upper and lower bounds for c are e-1 2=0.6065... and 3 5=0.6 respectively. The lower bound for the number is the integer part of 3n(n+1) 5. Proofs can be found here . 40. Let Z(G) denote the cycle index of the permutation group G, and let F*n(G) be the number of orbits of G on the set of all n-tuples of its permutation domain. Let G and H be permutation groups acting on sets X and Y respectively. We consider GH as a permutation group on XY. We have Z(GH) = Z(G)oZ(H), where siosj = (slcm(i,j))gcd(i,j), and the operation is extended multiplicatively and additively; F*n(GH) = F*n(G)F*n(H). The second assertion is trivially proved directly. The challenge is to deduce it from the first; this will probably require methods of dealing with these very strange operations on polynomials. Solution: Solved by Daniele Gewurz. See a paper by the Daniele Gewurz, Francesca Merola and me. 41. Given n and k, what is the largest number m with the property that, if S is any set of m permutations on the set {1,...,n}, there exists a permutation which agrees with each element of S in at most k places? For k=0, the value of m is the integer part of n 2. For k=1 and even n, it does not exceed n-1, but I do not know whether this is the exact value. (Note: Kzdy and Snevily conjectured that n-1 is the correct value in this case, and that the value is at least n for odd n. This conjecture implies two celebrated conjectures by Ryser and Brualdi on Latin squares: Ryser conjectured that any Latin square of odd order has a transversal, and Brualdi that any Latin square has a partial transversal of size n-1.) A related question: Is it true that, if S is the set of rows of a Latin square of order n, there is a permutation agreeing with each element of S in at most two places? Note: This problem was solved by Ian Wanless; the answer is "yes". A preprint by Ian Wanless and me gives further details. 42. This problem was suggested by Donald Preece. Following Carmichael, a primitive lambda-root of n is a unit in the integers modulo n which has the largest possible order. Let F(n) be the number of primitive lambda-roots of n. If primitive roots of n exist (that is, if n is an odd prime power, or twice an odd prime power, or 4), then F(n)=phi(phi(n)), where phi is Euler's totient function. However, this equation holds for other numbers too; indeed, it is true for more than half of the integers up to a million. In general, the left-hand side is at least as large as the right-hand side. Problem: Is it true that the proportion of natural numbers for which the equation F(n)=phi(phi(n)) holds tends to a non-zero limit? If so, what is the limit? See our notes on primitive lambda-roots for more details. Solution: This problem has been solved by T.W.Mller and J.-C.Puchta: the limiting proportion is zero (though it tends to zero rather slowly). I will give the reference when the paper appears. 43. What is the cardinality of the largest subset of the group PSL(2,q) with the property that any two of its elements agree in at least two points? The two-point stabiliser, with size (q-1) 2 for odd q, has this property, but at least for small q there are larger sets. Pablo Spiga points out that, if q is congruent to 1 mod 4, then the stabiliser of an unordered pair of points has the above property, and has size q-1. 44. Consider the following decision problem. Let p1, ..., pm be partial permutations of a finite set A (that is, bijections between subsets). Suppose that p1 is the identity map on A, and for any i,j, there is at most one k such that pk extends piopj. Does there exist a finite set B containing A, and permutations fi of B extending pi for i=1,...,m, such that, if pk extends piopj, then fiofj=fk? What is the computational complexity of this problem? How is this affected if we insist that B=A? Some notes about this question are here . 45. This problem is due to Patrick Moss, in his Ph.D. thesis (University of East Anglia 2003). A sequence (u(n)) of non-negative integers is said to be realizable if there is a set X and a permutation T of X such that u(n) is the number of fixed points of Tn in X. Moss shows indirectly that, if (u(n)) is realizable, then so are the sequences (u(n)n) and (u(nk)), where k is a fixed positive integer. Problem: Find a pair (X',T') realizing each of these sequences, in terms of the pair (X,T) realizing the original sequence. The first sequence is not likely to be easy. For example, let p be a prime. The constant sequence with value p is realized by the identity permutation of a set of size p. An obvious realization of the sequence (pn) is (X,T), where X is the algebraic closure of the field with p elements and T is the Frobenius map T(x)=xp. The second, however, is reasonably straightforward. Indeed, let f be a function on the natural numbers such that n divides f(n), and suppose that there is a function g such that g(m) divides n if and only if m divides f(n). Then a realization of (u(f(n))) can be constructed directly from a realization of (u(n)). The function f(n)=nk has these properties. The proof is here . 46. This problem is based on joint work with Jarik Nesetril. A graph G is said to be homomorphism-homogeneous, or HH, if any homomorphism from a finite subgraph of G into G can be extended to an endomorphism of G. All finite HH graphs are known. The countable examples we know are disjoint unions of complete graphs of the same size, and graphs which contain the random graph R as an induced subgraph. Problem: Are there any others? 47. The Stirling transform of a sequence a is the sequence b given by b(n)=SumS(n,k)a(k), where S(n,k) are the Stirling numbers of the second kind. What can be said about the asymptotics of a sequence a for which b(n)~ca(n) for some constant c 1? Many interesting sequences (e.g. chains in the partition lattice, zero-one matrices with n ones and no non-zero rows or columns) have this property. 48. Let G be a Frobenius group with Frobenius kernel N and Frobenius complement H having orders n and h respectively. Number the elements of N as x1,...,xn. Now let Xij be the nn matrix with (k,l) entry equal to the cardinality of the intersection of xi-1Hxk and xj-1Hxl. Note that Xii=hI while, for i and j distinct, Xij is a zero-one matrix. Is it true that SumkXikXkj=nXij+h(h-1)J, where J is the all-one matrix? Solution: This problem is now solved in the affirmative! 49. Let s and t be the numbers of positive and negative eigenvalues of the adjacency matrix of a graph. A.Torgasev proved that s is bounded by a function of t. Problem: Find the best bound. In particular, there a polynomial (or even a quadratic) bound? 50. Since Problem 20 above has a negative solution, the following problem (due to John Sheehan and me, BCC problem 17.12) is open again. Is it true that a vertex-transitive trivalent graph has a semiregular automorphism (one with all cycles of the same size) of order greater than 2? Note: This has just been settled affirmatively by Pablo Spiga. 51. There is a well-known connection between the three polyhedral groups Alt(4), Sym(4) and Alt(5), on the one hand, and the exceptional root lattices E6, E7 and E8 on the other. (See the McKay correspondence and various results in singularity theory). For a finite group G, let n(G) denote |G| mu(1,G), where mu is the Mbius function of the subgroup lattice of G. Is it just coincidence that, ignoring signs, the values of n(G) for the three polyhedral groups are equal to the connection numbers of the corresponding root lattices (the index in the dual lattice)? The numbers are 3, 2, 1 respectively. The coincidence becomes sharper if we include the correspondence between cyclic and dihedral groups and the root lattices An and Dn, for which the numbers also agree up to sign if n+1 is squarefree. (This requires some charity about the interpretation of the McKay correspondence.) A subsidiary question: If there is a natural explanation, what is the interpretation for root lattices of the sign of the Mbius function? 51. Let G be a permutation group of degree n. The base size of G is the smallest number b(G) of points whose stabiliser is the identity; the separation number of G is the smallest size of a set S of points such that, for any two distinct points x,y, there exists s in S such that x and y lie in distinct orbits of the stabiliser of s. Clearly b(G) =s(G). Is it true that, if G is primitive but not 2-transitive, then s(G) =b(G)logn? See Combinatorics Study Group notes on this problem ( PDF file ). 52. This problem is due to Robin Chapman. Let p be a prime congruent to 3 mod 4, and let r=(p+1) 2. Let (x p) denote the Legendre symbol (taking the values +1, -1, or 0 according as x is congruent to a nonzero square, a non-square, or zero modp. Show that the rr matrix with (i,j) entry ((j-i) p) has determinant1. This is true for primes less than 1000. 53. John Dixon has shown that the number of pairs of permutations on {1,...,n} which generate a transitive subgroup of Sn is equal to (n-1)! times the number of indecomposable permutations of {1,...,n+1}. (Here a permutation is indecomposable if there is no positive k less than n+1 such that it maps the set {1,...,k} to itself.) Problem: Find a bijective proof! 54. A tournament is a directed graph in which every pair of vertices is joined by an arc in one direction. Its score sequence is the list of the out-degrees of the vertices in decreasing order. A permutation (represented by a nn permutation matrix P) is said to be binary if no two 1s in P are on the same northeast-southwest diagonal. The shadow of a binary permutation is the (2n-1)-tuple (indexed from 2 to 2n) with 1 in position i+j if Pij=1, and other entries 0. C. Bebeacua, T. Mansour, A. Postnikov, and S. Severini conjecture that the number of score sequences of n-vertex tournaments is equal to the number of shadows of binary permutations on n elements. Problems: Prove (or refute) this conjecture! If it is true, find a bijective proof. 55. Consider the following operation of "critical set reduction" of a family of sets: Find a minimal proper subfamily which is critical (that is, equality holds in Hall's condition), if one exists; remove elements of its union from all the other sets in the family; now apply this method recursively to the sets not in the critical subfamily. Clearly the new family has the same systems of distinct representatives as the old one. Now suppose that a Su Doku puzzle is given. (By definition, a Su Doku must have a unique solution.) Consider the following algorithm: First, for each blank cell, calculate the "free set" consisting of numbers not appearing in the row, column, or subsquare containing that cell. Now repeat the following until no further progress occurs: if one of the free sets has cardinality 1, write its entry in the puzzle and blank it out; for each row, column, and subsquare, apply critical set reduction to its free sets. A GAP program implementing this algorithm is here (but be warned that the program is not correct). Problem: Find a Su Doku puzzle which is not solved by this algorithm. Remark: Daniele Gewurz and Francesca Merola have pointed out that solutions to this problem can be found on Gordon Royle's Sudoku page . My homepage Peter J. Cameron p.j.cameron(AT)qmul.ac.uk 4 October 2005
Problems in Signed, Gain, and Biased Graphs
Compiled by Thomas Zaslavsky.
Problems in Signed, Gain, and Biased Graphs Problems in Signed, Gain, and Biased Graphs Compiled by Thomas Zaslavsky This is a fairly miscellaneous and incomplete selection of problems that I happen to have taken an interest in -- not necessarily an active interest. Some are open and some are solved or partially solved -- as for example a problem may have been shown to be NP-complete but special cases could still be solved exactly or algorithmically. This list is intended to supplement the many problems in the Bibliography . There is just a small amount of duplication. For the present, the problems here all concern signed graphs. However, many of them have obvious generalizations. References are as cited in the Bibliography . All the terms employed should be defined in the Glossary . If you find any missing, or if you have suggestions for this page, please notify me! NOTE: A PostScript version is available. It is slightly more up-to-date and it is the only one that will be maintained and expanded. I. Direct Measures of Imbalance (June 8-10 1998) Imbalance of a signed graph can be measured in numerous ways. Here are problems concerning some measures that have appeared in the literature. The greatest interest has been in the edge version of frustration. (The problems in part II can be regarded as measuring imbalance in a different way.) Frustration index. Symbol: l( ). This is the least number of edges whose deletion results in a balanced subgraph. Its complement is the largest size of a balanced subgraph. It has turned out to be the measure that is most interesting and arises most often. Calculating l(Sigma). Taking the all-negative signing, l(-G) = the smallest size of the complement of a cut (bipartite subgraph). Thus the problem of calculating l(Sigma) -- more precisely, the question "l(Sigma) = k?" -- is at least as hard as that of finding a maximum-sized cut, which is a standard NP-complete problem. Barahona (1981a, 1982a) proved that the question is solvable in polynomial time if |Sigma| can be embedded in the torus. Is the question polynomial-time solvable if |Sigma| ranges over graphs embeddable in a fixed genus? Is it polynomial-time solvable if, while Sigma ranges over all signed graphs, we are given an oracle that tells us: the genus of |Sigma|? an embedding of G in its minimal orientable surface? Most frustrated signatures. Let l(G) = max l(G, sigma) over all signings of a graph G. Maximizing signatures. Petersdorf's (1966a) Theorem says that -Kn is the unique maximally frustrated signing of Kn. Which other graphs attain maximum frustration index when signed all negative? Among these, for which is the all-negative signing uniquely most frustrated (up to switching, of course)? In particular, is it true that chordal graphs are among the answers to the first two questions? This is plausible since they have lots of triangles. Is it possible for a graph with even girth to attain maximum frustration when all negative? (Maybe the real question is whether girth has anything at all to do with whether the all-negative signature maximizes frustration.) What other kinds of graphs have nice answers to the question of which signings maximize the frustration index? Estimates and values. Akiyama, Avis, et al. (1981a) and Sol and Zaslavsky (1994a) found bounds on l(G) for various kinds of graphs. Brown and Spencer (1971a), followed by Gordon and Witsenhausen (1972a), found asymptotic estimates for complete bipartitie graphs. Brown and Spencer (1971a) found some exact values; also see Sole and Zaslavsky (1994a). Improve the known bounds, both in general and for special types of graphs. Improve the asymptotic estimates for complete bipartite graphs. Find asymptotic estimates for other graphs. Evaluate l(Kr,s) for r = 6, 7, ..., extending the work of Brown and Spencer (r 5) and Sol and Zaslavsky (r = 5). (Possibly a linear programming approach would be feasible for small r.) Restricted frustration index. Here we restrict the deleted edges to lie within a prescribed subset A. Let lA(Sigma) be the smallest size of a subset D of A for which l(Sigma-D) = l(Sigma-A) (the smallest frustration index one can hope to achieve). If A = E this is l(Sigma). If A = E-, the negative edge set, it is the "negative-edge frustration index" (proposed recently by Harary ; the restricted frustration index is a generalization); here l(Sigma-A) = 0. Note that, unlike the frustration index, these numbers are not switching invariant. They are also NP-complete, at least when A = E- (from Sigma form Sigma' by the negative-subdivision trick; then l(Sigma') = lE-(Sigma)). For which subsets A does lA(Sigma) = l(Sigma)? (Obviously it is never l(Sigma).) In particular, find the signed graphs such that lE-(Sigma) = l(Sigma). Find a use for lA(Sigma). (It looks as though it ought to be good for something!) Vertex frustration number (vertex elimination number). Symbol: l0( ). This is the smallest number of vertices whose deletion results in a balanced subgraph. Its complement is the largest order of a balanced subgraph. Taking the all-negative case, it becomes the problem of the largest order of a bipartite induced subgraph (whose NP-completeness I don't happen to know). Can either of l0( ) and l( ) be expressed in terms of the other? Find any theorems about l0( ). Find any theorems about l0(G) = max l0(G, sigma) over all signatures sigma. Cycle indices of imbalance. In the early days of signed graph theory there was interest in the proportions of unbalanced polygons, balanced triangles, and balanced polygons weighted according to length (the weights decreasing with length). These were very hard to work with and not particularly natural as measures of imbalance. All I know of is some work of Norman and Roberts (1972a, b) on weighted measures. Find mathematical properties of the proportion of unbalanced polygons, unbalanced triangles, or unbalanced polygons weighted by length. Examine the proportion of unbalanced triangles for chordal graphs. Is it maximized by the all-negative signature (as is the case with complete graphs)? Are the maximizing signatures unique (up to switching)? Balancing degree. This is Deltab = minimum of Delta(S) over all balancing edge sets S (that is, Sigma - S is balanced). Hoffman's Theorem: There is a function f such that Deltab(Sigma) = f(least eigenvalue of A(Sigma)) when Sigma is a signed complete graph. Does this generalize to other (simple) graphs than complete graphs? To all simple graphs? Find out something about Deltab besides Hoffman's Theorem. II. Packing and Covering (June 8-10 1998) Polygons. Vertex disjoint. Find the largest number of vertex-disjoint unbalanced polygons. There is a deep theorem in here somewhere. This includes as the contrabalanced case Lovasz's theorem on the largest number of vertex-disjoint polygons in a graph. Characterize the signed graphs for which this number is at most k. (The case k = 2 has been solved by Lovsz (unpublished).) Edge disjoint. Find the largest number of edge-disjoint unbalanced polygons. There is also a deep theorem in here somewhere. Characterize the signed graphs for which this number is at most k. Obviously this number is not greater than l(Sigma). When is it equal? (This would be a deep theorem and very interesting.) Balanced Decomposition. A balanced decomposition is a decomposition of Sigma into balanced subgraphs. It is minimal if it decomposes Sigma into the fewest possible subgraphs. (Decomposition means that the edges are partitioned amongst the subgraphs. Every subgraph has all the vertices.) This generalizes bipartite decomposition of unsigned graphs (take all signs negative) and forest decomposition (take all polygons unbalanced). See Zaslavsky (1987b). Balanced decomposition number. The balanced decomposition number is the smallest number of subgraphs in a balanced decompostion. There is a simple formula for signed graphs (Zaslavsky) and a famous formula for contrabalanced biased graphs (Nash-Williams). Find something for all biased graphs. Connected balanced decomposition number. The connected balanced decomposition number (c.b.d.n.) is similar but requires connected subgraphs. Find out something about the c.b.d.n. of a general signed graph. Find the c.b.d.n.'s of signings of particular graphs. Study the maximum c.b.d.n. of all signings of a graph. Study the c.b.d.n. of a biased graph. Balanced decomposition degree. For a balanced decomposition rho of Sigma into subgraphs Si, let Deltadmax(rho) be the maximum Delta(Si) (where Delta denotes maximum degree of a graph) and let Deltadmin(rho) be the minimum. Over all minimal balanced decompositions rho of Sigma, let Deltadmax(Sigma) = the maximum of Deltadmax(rho). These are measures of the degree to which minimal balanced decompositions divide the edges up equitably among the subgraphs. What can one say about Deltadmax(Sigma)? What about the minimum of Deltadmax(rho) over all minimal balanced decompositions of Sigma? What about the maximum and minimum of Deltadmax(Sigma) over all signings of a particular graph? It must be obvious that I'm not sure which are the best numbers to look at in order to get a good picture of how equitable a balanced decomposition can be. Figure out which one(s) make the most sense. Covering by balancing edge sets Consider the intersection of all maximal balanced subsets. Equivalently (by complementation) this is the union of all balancing edge sets. When is it empty? (When does the union of all balancing edge sets cover Sigma?) In general what is it? That is, which edges belong to every maximal balanced subgraph? What is the smallest number of balancing edge sets required to cover the union of all balancing edge sets? Especially, when these sets cover Sigma. Best Viewed With Any Browser Last modified 2002 Dec 9 Created 1998 June 8. Home page of signed graphs . E-mail: zaslav@math.binghamton.edu
Some Open Problems
Open problems and conjectures concerning the determination of properties of families of graphs.
Some Open Problems Some Open Problems and Conjectures These problems and conjectures concern the determination of properties of families of graphs. For example, one property of a graph is its domination number. For a graph G, a set S of vertices is a dominating set if every vertex of G is in S or adjacent to a member of S. The domination number of G is the minimum size of a dominating set of G. Determining the domination number of a graph is an NP-complete problem, but can often be done for many graphs encountered in practice. One topic of some interest has been to determine the dominating numbers of grid graphs (meshes), which are just graphs of the form P(n) x P(m), where P(n) is the path of n vertices. Marilynn Livingston and I showed that for any graph G, the domination number of the family G x P(n) has a closed formula (as a function of n), which can be found computationally. This appears in M.L. Livingston and Q.F. Stout, ``Constant time computation of minimum dominating sets'', Congresses Numerantium 105 (1994), pp. 116-128. Abstract Paper.ps (Postscript) Paper.pdf (PDF) This proof used a combination of dynamic programming and properties of minimal weight paths in graphs (the relevant graphs being state graphs that arise in the dynamic programming). Further, it extends to a great many other properties beyond simple domination, including problems involving covers, independence, packing, mispacking, coding, tilings, etc. It can also be extended to counting problems such as dimer problems, where one is counting the number of maximal packings. For some problems, such as determining if perfect dominating sets exist, the computations are somewhat easier because the relevant state space is smaller and the question is merely whether a path of specified length exists. However, there are several conjectures, open questions, and generalizations not yet finished. A few of these are Conjecture: For every graph G and dimension d, the dominating numbers of the d-dimensional family G x P(n1) x P(n2) ... x P(nd) have a closed form. Even the special case where G is a single point and d=2, is unknown, as our approach only works for d=1 (though G can be arbitrary). I further believe that this is true for a very wide range of properties, not just domination. Question: Is there an interesting formal language L, so that if a property A (such as domination number) can be expressed in L, then there is a closed form for A(G x P(n))? Question: For every m, is there a closed form for the fractional dominating number of P(m) x P(n)? (In fractional domination, one can put arbitrary nonnegative real values at each vertex, with the constraint that for every vertex v, the sum of the values of v and all of its neighbors must be at least 1. The fractional dominating number is the minimum possible sum, over all vertices, of these values.) Our approach cannot be proven to work here, because there is no constraint on the values that may be used. If one could restrict them to a finite set, then the approach would apply. We know of a few other forms of domination which have similar difficulties, though it seems that most of the forms of domination which occur in practice are amenable to our approach. Question: For what other parameterized families F(n) can one prove that the dominating number of G x F(n) has a closed form? For example, our results can be extended from paths to cycles and complete t-ary trees. Recently we realized that one can prove that there is a closed form for some simple doubly-indexed families, such as rooted trees with m subtrees, each of which is P(n), and this approach can be extended to various other construction techniques. Here is some more information about some of my work in dynamic programming , applied to a variety of problems. Copyright 2004 Quentin F. Stout
Three for the Money: The Degree Diameter Problem
Students can understand and work on an unsolved problem in mathematics.
Games on Graphs Three for the Money: The Degree Diameter Problem Description Students can understand and work on an unsolved problem in mathematics. There is a good chance that this problem can be solved by someone who spends enough time experimenting with it. The only skills required to work on it are the ability to draw dots and connect them with lines, and the understanding of four ideas related to graphs: degree , diameter , planarity , and size . (These concepts can be explored in the story Superperson Saves the Monster ). Materials Instructions Ideas for discussion Materials One large copy of the puzzle graph that all students can see, such as one that is drawn on the floor with masking tape, or a copy for each student or group of students. Paper and pencil should be handy so students can experiment and draw their own solutions to the problem. Instructions Explain to students that you are going to tell them about a problem in mathematics that is easy to understand that no one has solved yet. There is no reason why one of them could not be the person to solve it. A famous mathematician, Paul Erdos, has offered a large cash prize for the person who succeeds in drawing the graph that solves this problem. They could win it. Have the students look at the puzzle graph carefully. If they have played the games with Gertrude, Superperson and the Monster, they have already learned a lot about the structure of this graph. Explain that it has four properties or characteristics that mathematicians have found interesting: Its size is 12, because it has 12 vertices . It is planar because it's edges can be drawn in a flat plane without crossing each other. That is why Gertrude, Superperson and the Monster can fly around their Land without needing traffic lights or underpasses. The diameter is 3. If Superperson can't get to where Gertrude is trying to drown the Monster , it is because she overshoots the pond by flying too far. She would never have to fly more than three ponds to get to them. It is 3-regular . When Superperson and the Monster were trying to get Gertrudy to fly to all of the other ponds one by one, they flew into her pond along two of the flyways. This left Gertrude exactly one choice for flying out. This can be done from any pond because every pond has exactly three flyways touching it. Tell the students that no one has ever figured out a way to draw a graph whose size is greater than 12 (a graph with more than 12 vertices) that has all of the other properties. Nor has anyone been able to figure out a good reason why it can't be done. Invite them to make mathematical history--and win a cash prize--by being the one who does it. Have students experiment with this problem and try to draw the graph. If someone succeeds, send mail to MegaMath immediately! When they begin working on the problem, students usually produce graphs that have most of the properties, but not quite all of them. Help students to work together and carefully check each others' graphs. Have students draw large copies of graphs that almost meet the criteria and display them. This is a problem to let rest for a while and return to, off and on, for perhaps weeks. Give students plenty of time to experiment and mull it over. Eventually after much trial and error someone may come up with a graph that meets the criteria. Or perhaps after enough experimentation with various possibilities, someone will be able to explain why it is that size 12 is the largest that such a graph can be. If time and perseverance are what is needed to solve this problem, there is no reason why the person to solve it cannot be a child. Ideas for Discussion What strategies did you use to try and construct the graph? Where did you get stuck? What do you plan to try next? Look carefully at some of the graphs mathematicians have drawn while trying to understand and solve the degree-diameter problem. These are the largest known graphs with the minimum degree and maximum diameter as indicated. It has been proved that the graph above with the maximum degree of 4 is the largest one that can be drawn with diameter 4, but it is not known if it is possible to draw a larger graph than the one shown that has maximum degree 3 and diameter 4. In general it is not known what the largest possible graphs that have relatively small degree and relatively large diameter are. Experiment with some graphs of your own and send in the graphs that you draw and what you have learned about them. Because this mathematical territory has not been studied very much, you may be the one to make a discovery that could find its way into a mathematical journal. If you become convinced that it is impossible to draw a larger graph that is 3-regular, planar and has diameter 3, explain to them that "I tried for hours to do this and couldn't," is not a statement that proves that whatever they were trying to do is impossible. You can show that it is impossible to make a 3-regular, planar, graph of diameter 3 that has 13 vertices. You can demonstrate that there is no sense in trying to do this because it can't be done. Here's how: (It is a Proof by Contradiction . Draw the 13 vertices. Make each vertex degree 3 by drawing the all three edges that will touch each vertex. Now you have 13 vertices, each with half an edge touching it. In order to make the graph that we are trying to make, you will have to connect pairs of half-edges to make single whole edges. But count the number of half-edges--there are 13 x 3 = 39 of them! Every time you connect two vertices together you will use up two of the half-edges. There is no way to connect the vertices together without having one half-edge left over. Therefore, you can be sure that you are wasting your time trying to make a 3-regular graph of size 13, much less one that is planar and has diameter 3. What other sizes of graph are certain not to work? What next
Open Problems in Graph Algorithms
Compiled by Jerry Spinrad.
Some Open Problems Please mail me with any corrections, or any other comments. The list is very rough at the moment. Bipartite Classes 1) Chordal Bipartite Graphs The fastest known algorithms for recognizing chordal bipartite graphs involve lexically ordering a matrix, and checking for a forbidden configuration. The checking is linear, and the ordering takes O(mlogn) or O(n^2) time. The ordering algorithm is designed for any matrix, whether or not it has the forbidden configuration. Can you use the fact that the matrices are special to design a linear time algorithm? 2) Find a Geometric Model for Chordal Bipartite Graphs (Spinrad) 3) Bipartite graphs with no induced cycle of length 6 (Spinrad) Count, recognize, find a good representation of them. 4) Perfect Elimination Bipartite Recognition Perfect elimination bipartite graphs are discussed in Golumbic's book, and correctly model perfect Gaussian elimination in arbitrary matrices. However, the best recognition algorithm for these graphs takes O(n^3) time, and actually performing Gaussian elimination can be done in O(n^3) time. These graphs would seem much more useful if they could be recognized in much less time than performing the elimination. 5) Chordal Bipartite Plus weight condition (Shamir) Must find gamma-free ordering in which for all row column pairs topleft + bottomright = bottomleft + topright. O(mnlogn) Alon, ?, Hochbaum, Ditrich. Chordal Graphs and Variants 1) Finding Simplicial Vertices (Spinrad) Can you find a simplicial vertex in an arbitrary graph in time less than matrix multiplication? 2) Finding holes in graphs How efficiently can you determine whether a graph has no hole of length k? The best I can do is O(n^(k-.634)). Can you determine whether a graph has a chordless cycle containing a particular vertex v in linear time? This would allow an O(m^2) algorithm for k = 5. Can you recognize graphs which are "generalized simplicially reducible" efficiently; i.e., graphs which can be reduced to the empty graph by successively removing vertices which are not in the center of a $P sub k$? Is it NP-complete to determine the smallest value $k$ such that $G$ is "$k$-simplicially reducible"? Can you determine whether a pair of vertices is in a common hole of length 4 in polynomial time? 3) Chi-boundedness of hole-free graphs (Sritharan) Hole free (not antihole-free) graphs, can the chromatic number be hugely different from the size of the maximum clique? ) 4) Extending cycles in chordal graphs (Hendry, XingXing) For a chordal graph G, and a cycle (not induced) of length k max cycle in G, can you always add a vertex and rearrange to get a cycle of length k+1? Circle Graphs and Variants 1) Polygon in circle graphs (Lubiw) A circle graph is the intersection graph of chords in the circle. What do you get for the intersections of k-gons in the circle? The two most natural subproblems to me here are recognition of triangle in circle, and general kgon- I very much doubt that this gives all graphs, but I have no proof at the moment. Circular-Arc Graphs 1) Certificate that G is not circular-arc (Eschen, Raghavan) Although we have an efficient recognition algorithm, can you give an easy proof to someone that G is not circular-arc? Bouchet has done this for circle graphs, for example. 2) Dimension of "circular-arc interesection orders" (Trotter) Consider a circular-arc graph which is a comparability graph. Qin and Trotter show the dimension is at most 4; can it be as high as 4 or not (it can be 3). Comparability Graphs 1) Transitive graph recognition (Spinrad) Can you recognize transitive graphs in less time than it takes to perform the transitive closure of the graph, or are these problems provably of the same complexity? A fast transitive graph recognition algorithm would improve the time complexity of the best known algorithm for comparability graph recognition. The same problem is interesting for the transitive reduction. 2) Verification of transitivity You can verify the result of a matrix multiplication in O(n^2) time probabilistically. For checking if a graph is transitive, can you make this deterministic? Note: you cannot use the result above to get O(n^2) probabilistic transitive graph recognition; the result does not apply (at least immediately) to Boolean matrix multiplication. 3) Chordal comparability graphs (Ma, Spinrad) Is there a good intersection model for this class? Can we tell in O(n) time whether the transitive closure of a graph is chordal, if we are given the diagram? 4) Intersections, Strings on 1 wall (Sritharan) The intersection graphs of strings on 2 walls is the cocomparability graphs; what do we get if we restrict to one wall? 5) New approaches to Transitive Graph Recognition (Mada, Sri) 5a) Given a transitive graph G, can we compute the transitive reduction of G in O(n^2) time? 5b) Given 2 graphs G1 and G2, can we verify in O(n^2) time that G1 is the transitive reduction of the transitive graph G2? 5c) Can you reduce verification of boolean matrix multiplication to recognition of transitive graphs? Note: transitive verification can be reduced to both transitive reduction verification and matrix verification in O(n^2) time; what of the other possible reductions? 5d) Can you come up with an O(kn^2 + m) transitive closure reduction algorithm, where k is the number of missing extra edges in the transitive closure reduction? 6) Problems when given subset of transitive closure (Spinrad, Mohring) Suppose that you are given a subset of the transitive closure of a partial order (in my algorithms, I have always assumed that you have the transitive closure). Is it possible to perform substitution decomposition without performing a general transitive closure algorithm? This is possible for series-parallel partial orders, for example. There are two separate subproblems of this; in one, you may assume that you have the diagram of the partial order, while in the more general case you have anything which contains the transitive reduction and is contained in the transitive closure. Can you determine whether a partial order is N-free in linear time, if no assumption is made about the "completeness" of the input? Decompositions 1) Clique separator decomposition (Whitesides, Tarjan) Can you improve the time complexity, 1st for primetesting and then for the whole decomposition? I would suggest seeing what is implied by a and b on the same side; perhaps partitioning and pseudoparallelism will work. 2) Generalized join decomposition (Hsu, JCT B 1987) Hsu describes a decomposition, which has an alternative chartacterization as follows: can G be partitioned into X, Y such that the edges between X and Y do not contain an induced 2K2 (edges within X,Y ignored). Can we determine whether G has such a decomposition in polynomial time? Which graphs are "completely decomposable" with respect to the join decomposition, and can they be recognized efficiently; or alternatively, does this notion actually make sense at all (it could depend on the decomposition sequence)? I note that all permutation graphs are completely decomposable with respect to generalized join. 3) Decomposition with forbidden subgraphs (Spinrad) This problem is a generalization of the problem above. Given a fixed bipartite subgraph H, can G be partitioned into X, Y so that the bipartite subgraph of edges between X and Y does not contain H (we might also assume that X and Y are at least as large as the smaller side of the bipartition of H)? Can you characterize the class of graphs H for which this is polynomial (or, is it always polynomial?) 4) Split decomposition We can find the split decomposition of an undirected graph in O(n^2) time. Can you do the same for a directed graph? Should be doable using the same ideas. 5) Ordered Neighborhood Decomposition (Ma) A (separable) chordal graph a separator which is a clique. Having a clique separator allows you to decompose G so that holes and antiholes are preserved. The same could be said if you allow the separator to be a set of vertices whose neighborhood are ordered by set inclusion. Can you find such a separator in polynomial time? What kind of graphs are "completely separable" in this sense? 6) Hole preserving decomposition Can you find algorithms for the following types of decompositions? Partition V into V1, V2 such that every long hole is contained in one of the 2 sets. Partition E into E1, E2 with the same property. Partition V into V1, V2 such that at least one edge is within each side, and any hole of length k has at least k-1 vertices on a single side. Dimension See also the excellent list of problems prepared by Trotter, and my paper on dimension and algorithms from ORDAL. 1) Do Problems become easy if given a Realizer? Can you find a problem which is easy on 3-dimensional partial orders if you are given the three lists which represent the graph? Sometimes, this might be the way the information is given to you. (Obviously, the dimension problem is not an interesting example). I might suggest domination problems. How about transitive closure or reduction? How quickly can you do these in 3d posets with and without the realizer (see ORDAL paper). Same for clique, independent set, independent set clique of size n^.5, ... 2) Dimension Calculation for Special Classes Find interesting classes of posets for which the dimension is calculable in polynomial time. Some open classes are interval orders, cycle-free orders (note: these have dimension at most 4), W-free, bounded width. For height 1 partial orders, are the 3 dimensional orders recognizable in polynomial time? 3) Dimension of Chordal bipartite graphs (Spinrad) How fast can dimension grow with n? It must grow as fast as clogn; O(logn) would give a good representation for graphs in the class 4) Dimension Completion (Spinrad) This problem came up when I thought about writing a program to try to test the conjecture that a class of partial orders was always 3 dimensional. How would you test 3-dimensionality? The obvious approach is to generate all extensions, and see whether each can be part of a realizer of size 3. The question is, once the first list is fixed, can you determine in polynomial time whether 2 more lists suffice? 5) Constructing a realizer Greedily (Spinrad) If you are trying to construct a realizer, a natural approach is to try to "satisfy" as many pairs as possible with a linear extension; a pair of unrelated elements x,y is satisfied if each comes before the other in some linear extension. Given a set of linear extensions, can you find an extension which satisfies the maximum number of pairs? Given a poset, can you find 2DPO which satisfies maximum number of pairs? 6) Dimension reducing extension (Rival) Is there a way to add one relation at a time so that the dimension never increases on the way to finding a linear extension? 7) Construct poset from realizer (Spinrad) Perhaps the simplest open problem to state here is constructing the poset in linear time from a set of 3 linear extensions; for others see ORDAL paper. 8) Crossing Number (Urrutia) The crossing number is an alternative parameter for measuring partial orders. A partial order on n vertices is represented as a set of n functions, with a b iff the function corresponding to a is always above the function corresponding to b. For any such representation R, we can count C(R) = the maximum number of times that two functions corresponding to unrelated pairs of vertices cross. The crossing number is the minimum value of C(R) over all representations of R. Can the crossing number be computed in polynomial time (conjectured NP-complete for all k 1). What is the expected value of the crossing number for an n element poset? 9) Problems on 2 dimensional partial orders Open problems include several variants of scheduling problems (e.g. weighted completion time), optimal linear arrangement, jump number, and counting the number of linear extensions. Many of these are also open for other classes (interval orders, N-free, cycle-free, ...). 10) Dimension Approximation Is there a constant c such that for any partial order of dimension k, you can construct a realizer of size at most ck in polynomial time? This is a famous open problem, but even the following is unknown and must be "easy"; given a 3 dimensional poset, produce a set of O(n^(1-epsilon)) linear extensions which realize the poset. Alternatively, show that dimension approximation requires OMEGA(n^epsilon) times the optimal for some epsilon. Interval and Interval Variants 1) Astroidal Triple-free Graph recognition (Corneil, Stewart, Olariu) Can you recognize them in o(n^3) time? 2) Tolerance Graphs (Golumbic, Monma) In a tolerance graph, each vertex is associated with both an interval and a positive value t called a "tolerance". Two vertices are adjacent if their overlap is greater than the minimum tolerance of the two vertices; this generalizes both the interval graphs (tolerance = 0) and the permutation graphs (tolerance = length of interval). Can you recognize tolerance graphs in polynomial time? 3) Intershold Graphs In this variant of threshhold graphs, you assign weights to vertices so that 2 vertices are adjacent if and only if their sum is within a certain interval (rather than being over some threshhold). Can they be recognized in polynomial time? 4) Variants on boxicity 2 (Sri) What happens when you change the definition of boxicity? Some variants include eliminating the isoorientation, equal sized boxes, squares, "nestable" boxes, no proper containment of boxes, small integer coordinates. Can you prove that you change the set? Can you recognize and find algorithms for any of these variants? 5) Optimization in Boxicity 2 Graphs How fast is clique for boxicity 2 graphs (in P because the number of maximal cliques is O(n^2)), both with and without the representation? Independent set, boxicity 2, also looks like it should be easy at least if given the representation, but I can't see it off the top of my head. 6) Weakly triangulated astroidal triple-free graphs This generalizes interval graphs; open problems include recognition, optimization, counting the number, and finding a representation. Perfect Graphs and Variants I won't even include the famous ones; perfect graph conjecture, recognize perfect graphs, recognize Berge graphs, recognize odd hole free graphs 1) Optimizing perfectly orderable graphs (Chvatal) Is there a "combinatorial" polynomial-time algorithm to find a maximum independent set in a graph G, when you are also given a perfect order on G. By combinatorial, I mean that you do not use ellipsoid techniques; since all perfectly orderable graphs are perfect, the algorithm of Gr$roman o dotdot$tschel Lovasz and Schrijver finds a maximum independent set in polynomial time using the ellipsoid method. What if no order is given? Of course, this is open for general perfect graphs as well. Permutation Graphs 1) Covering Graph Equivalent of Permutation Graph (Spinrad) Given an undirected graph, can the edges be directed to be the covering graph of a 2 dimensional partial order? See if you can determine this in polynomial time. The problem is also relevent for covering graph of other classes, such as N-free or interval orders. 2) Find a "large" independent set or clique It is well known that you can find an independent set or clique of size at least n^.5. Cab you find some such in O(n) time? Similar question for perfect graphs; can you find such a set quickly? The set does not need to be maximum, of course, and for comparability graphs (must beat matching). 3) Number of Prime Permutation Graphs(Stewart) What percentage permutation graphs are prime, i.e., have a unique representation? As opposed to arbitrary graphs, the percentage of nonprime graphs does not go to 0 for large values of n, but does the percentage of prime permutation graphs go to 0? 4) Circular Permutation Graphs (Sritharan) Optimization problems, generalizations to k concentric circles 5) Astroidal triple-free co-AT-free graphs Generalizes the comparability cocomparability characterization. Open problems include recognition, optimization, counting, representation. Representations 1) Distance Hereditary Graphs Find an intersection representation 2) Hereditary and 2^O(nlogn) = ? Implicit Representation(Kannan,Naor,Rudich) Open classes include containment or intersection graphs of circles, intersection graphs of lines or squares with general orientation in the plane, and many others. More generally, can you store any hereditary class with 2^f(n) members using O(log(f(n)) n bits per vertex, so that adjacency can be tested using only the information stored at the vertices in question? 3) Optimization Requiring Representation Find any example of a problem which is NP-complete on a class of graphs if the input is in adjacency list form, and polynomial if the class is given with its natural representation. Visibility Graphs 1) Maximum clique in visibility graph, given G only (Lubiw) It is O(n**3) if you are given the polygon 2) Recognition Famous open problem, not known to be in NP, still open if you are given the ordering of points on the boundary of the polygon. 3) Induced Visibility Graphs For various reasons, I feel that these are a less studied but more interesting, and possibly more tractable, class of graphs. All problems above are still open, as are some others. For starters, are the permutation interval chordal bipartite graphs in this class (I doubt it)? 4) Number of Induced Visibility Graphs (Spinrad) The key question here is, if G is a graph on n vertices, and G is an induced subgraph of a visibility graph H, how big can the minimum size H be? I can show it is O(nlogn$alpha$(n)), but it could be linear. It depends in part on the following question: how many visibility lines can touch the outer boundary of the polygon? There is a published paper claiming O(n), but we have found a serious error, and I think that the answer is probably O(nlogn). Can you find an efficient representation? 5) 3-clique ordering (Lubiw) Lubiw showed that every visibility graph has a "3-clique" ordering, i.e. you can start with a triangle and always continue with a vertex which is adjacent to all vertices from some previous triangle. How fast can you find such an ordering, either in a general graph or visibility graph? The obvious algorithm is something like O(n^7). Weakly Triangulated Graphs 1) Verifying weakly triangulated graphs (Spinrad) Can I verify a certificate that a graph is weakly triangulated using o(n^4 log^.5n) time? This seems like it could be easier than the larger problem of recognizing in o(n^4) time. 2) Weakly Triangulated Comparability Graphs (Sri) Recognize, count the number, find an efficient representation. Contains chordal bipartite graphs. 3) Every weakly triangulated graph without P5 is perfectly orderable (Chvatal) Resolve this conjecture. 4) G s.t. all induced subgraphs have a simplicial or cosimplicial vertex (Sri) Recognition, optimization, etc. Other Classes 1) Claw-free recognition As far as I know, you need to beat beat n * MM; do not expect to beat O(MM), where MM is the time to perform matrix multiplication 2) Circle intersection graphs (Golumbic) Apparently, almost nothing is known about the intersection graphs of circles in the plane, so recognition, structural characterization, and representation problems are all open. 3) $B sub 1$-orientation (Urrutia) An undirected graph is $B sub 1$ orientable if the edges can be directed so that (u,v), (w,v) implies that u and w are adjacent in G. These graphs include among other classes the chordal graphs and circular-arc graphs. Can you recognize these in o(nm) time? For the nonalgorithmically inclined, Urrutia has this conjecture: if G is $B sub 1$ orientable, then G is the intersection graph of subtrees of a planar graph. 4) P5 and P5 Complement free Generalizes cographs in much the same way that weakly triangulated graphs generalize chordal graphs. 5) Forbidden Submatrices Consider matrices which can be permuted to avoid a specific submatrix. Can you count the number of matrices, and give a nice representation? I am especially interested in forbidding the 2 by 2 identity matrix; recognizing these faster than O(c^2r^2) is of interest as well. 6) Brittle Graphs (Eschen) G is brittle if for all induced subgraphs, there is either some vertex which is not the endpoint of any $P sub 4$ or there is some vertex which is not the midpoint of any $P sub 4$. Recognize in o(m^2). 7) Independent sets in well Covered Graphs (Spinrad) A well covered graph is a graph in which every maximal independent set is maximum. If you know G is well covered, it is trivial to find a maximum independent set in G, but recognizing well-covered graphs is co-NP-complete. Find a polynomial algorithm which either finds a maximum independent set in G, or answers that G is not well-covered. 8) Containment Graphs, Paths in a Tree Recognize efficiently. 9) Recognize intersection G of subgraphs of 2-trees Send comments or new problems to include to spin@vuse.vanderbilt.edu
Unsolved Problems
Including the list of 50 problems of Bondy and Murty with current status. Compiled by Stephen C. Locke.
Unsolved Problems Unsolved Problems You can contact Stephen C. Locke at LockeS@fau.edu . Several people have asked me about unsolved problems. I will take the easy way out: see the list of 50 problems in Bondy and Murty . You can now see the list as it originally appeard in the the text, Graph Theory with Applications . (May, 2004: The authors are writing the next edition of the book.) Some of these problems have been solved (and thus the title is slightly incorrect) and I won't claim to be familiar with all current results. If you find that one of them has been solved (or even that some reasonable progress has been made), please e-mail me . Also, I'm not giving you all of the references in Bondy and Murty . You should get yourself a copy of that book (or look at the online version). 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Problems 26-56 . Problems 57-61 . Problems number above 50 on my list are from sources other than the Bondy and Murtry text. Bojan Mohar lists some additional graph theoretic problems. 1. The reconstruction conjecture . (S.M. Ulam, 1960) 2. A graph G is embeddable in a graph H if G is isomorphic to a subgraph of H. Characterise the graphs embeddable in the k-cube. (V.V. Firsov, 1965) 3. Prove: Every 4-regular simple graph contains a 3-regular subgraph. (N. Sauer, 1973) Conjecture 3 was proved in 1985 by L. Zhang: Every 4-regular simple graph contains a 3-regular subgraph, J. of Changsha Railway Institute 1 (1985), 130-154. Communicated to me (November 1996) by: Rob Pratt, Department of Mathematics, The University of North Carolina at Chapel Hill, CB 3250, 331 Phillips Hall, Chapel Hill, NC 27599-3250 (rpratt@math.unc.edu) Julio Subocz notes that this is also called Berge's conjecure or the Berge-Sauer conjecture and, in a conference in Lisboa (November 1995), Y. H. Hamidoune cited a proof (approximately 65 pages) by Taskinov of the conjecture. Yair Caro : Solved by Taskinov in 1982 and the proof is not 65 pages. V.A.Taskinov, Three regular parts of four regular graphs. Math. Notes 36(1984), 612-623 . Alon + Kallai + Friedland have several extensions. Taskinov also wrote an earlier paper: V.A.Taskinov, Regular subgraphs of regular graphs. Sov.Math.Dokl.26(1982), 37-38 . In this paper he proved the following : Let 0 k r be positive odd integers. Then every r-regular graph contains a k-regular subgraph (Here, the graph need not be simple). 1. Zhang, Li Min, 4-regular graphs without 3-regular subgraphs. Graph theory and its applications: East and West( Jinan, 1986), 691--699, Ann. New York Acad. Sci, Volume 576. New York Acad. Sci., New York, 1989. 2. Tashkinov, V. A.3-regular subgraphs of 4-regular graphs. (Russian) Mat. Zametki 36(1984), no. 2, 239--259. 4. Prove: If k 2, there exists no graph with the property that every pair of vertices is connected by a unique path of length k. (A. Kotzig, 1974) Kotzig verified his conjecture for k 9. Communicated by Yair Caro : Yuansheng Yang, Jianhua Lin, Chunli Wang,and Kaifeng Li. On Kotzig's conjecture concerning graphs with a unique regular path-connectivity. Discrete Mathematics 211(2000), 287-298. Abstract: Kotzig (see Bondy and Murty, Graph Theory with Applications, North-Holland, Amsterdam, 1976) conjectured that there exists no graph with the property that every pair of vertices is connected by a unique path of length k,k 2. Kotzig (Graph Theory and Related Topics, Academic Press, New York, 1979, pp. 358-367) has proved this conjecture for 2 k 9. Xing and Hu (Discrete Mathematics 135(1994), 387-393) have proved it for k 11. Here we prove this conjecture for the remaining cases k=9,10,11. Roland Hggkvist raises a question about one of the steps in the Xing and Hu article. ( click here if you want to read the details) Perhaps the problem is still open. 5. Prove: Every connected graph G on n vertices is the union of at most [(n+1) 2] edge-disjoint paths. (T. Gallai, 1962) See Lovsz (1968). Yair Caro : L.Pyber, JCTB 66(1996), proved that the edges of every connected graph on n vertices can be covered by at most n 2 + O(n3 4) paths. Communicated by Yair Caro : Nathaniel Dean and Mekkia Kouider. Gallai's conjecture for disconnected graphs. Discrete Mathematics 213(2000), 43-54. Abstract: The path number p(G) of a graph G is the minimum number of paths needed to partition the edge set of G. Gallai conjectured that p(G) =(n+1) 2 for every connected graph G of order n. Because of the graph consisting of disjoint triangles, the best one could hope for in the disconnected case is p(G) =2n 3. We prove the sharper result that p(G) =u 2+2g 3 where u is the number of odd vertices and g is the number of nonisolated even vertices. Communicated by Yair Caro : Fan Genghua. Subgraph coverings and edge switchings. JCTB 84(2002), 54-83. Abstract: By using the so-defined circuit path transformations together with an edge-switching method, the following conjectures were proved in this paper. (i) The edges of a connected graph on n vertices can be covered by at most ceiling(n 2) paths, which was conjectured by Chung. (ii) The edges of a 2-connected graph on n vertices can be covered by at most ceiling((2n-1) 3) circuits, which was conjectured by Bondy. An immediate consequence of (ii) is a theorem of Pyber that the edges of a graph on n vertices can be covered in at most n-1 edges and circuits, which was conjectured by Erds, Goodman and Psa. 6. Prove: Every 2-edge-connected simple graph G on n vertices is the union of n-1 cycles. (P. Erds, A.W. Goodman, L. Psa, 1966) See the comment for Question 5, above. 7. Prove: If G is a simple block on n vertices with at least n 2+k vertices of degree at least k, then G has a cycle of length at least 2k. (D.R. Woodall, 1975) Hao Li has essentially solved this one. He gets a cycle of length at least 2k-13 if G is not hamiltonian. Abstract . (Communicated to me by Galen E. Turner III.) 8. Let f(m,n) be the maximum possible number of edges in a simple graph on n vertices which contains no m-cycle. If it known that f(m,n) = [n2 4] if m is odd and 2m n+4; and f(m,n) = (n-m+2)(n-m+1) 2 + (m-1)(m-2) 2 if 2m n+2. Determine f(m,n) in the remaining cases. Yair Caro : f(4,n) essentially solved recently by Furedi. Zoltan Furedi, On the number of edges of quadrilateral-free graphs. JCT-B 68(1996), 1-6. 9. Let f(n) be the maximum possible number of edges in a simple graph on n vertices which contains no 3-regular subgraph. Determine f(n) (P. Erds and N. Sauer, 1974). Since there is a constant c such that every simple graph with at least cn8 5 edges contains the 3-cube (P. Erds and M. Simonovits, 1970), clearly f(n) cn8 5. Yair Caro : The best known lower bounds are given in the following paper: L.Pyber , V.Rodel , E.Szemeredi, Dense graphs without 3-regular subgraphs, JCTB 63(1995), 41-54 . There, reference to an earlier work of Pyber is also given. Julio Subocz : We relax the condition 3-regular subgraph, in the form: Let us call a graph 3-sum-0 if the degrees are multiples of 3. I think that this idea is due to Alon-Kallai-Friedland, Every four-regular graph plus an edge contains a three regular subgraph, J.Comb.Th.(B) 37(1984), 92-93. Let g(n) be the maximum possible number of edges in a simple graph of n vertices which contains no 3-sum-0-subgraph. Then g(4) = 5, g(5) = 8, g(6) = 10, g(7) = 13, but g(n) = 2n, for all n = 8. This was obtained with the aid of a computer program. Julio C. Subocz G., Some Values of Olson's Constant. Proceedings of the VIII Jornadas de Teora de Grafos. Cuman, Venezuela. (1998) To appear. 10. Determine which simple graphs G on n vertices have exactly one cycle of each possible length k, 3 (R. Entringer, 1973). Yair Caro : There are only seven known UPC-graphs (unipancyclic graphs) having respectively 3, 5, 8, 8, 14, 14, 14 vertices (Entringer). It is proved that there are only four outerplanar UPC-graphs having 3, 5, 8, 8 vertices respectively. It is conjectured that the above 7 graphs are the only UPC-graphs. Essentially there was no progress since 1986 !! The only available papers on the subject so far are : Shi, Y.B., Yap, H.P,. and Teo, S.K., On uniquely r-pancyclic graphs, Graph Theory and Its Applications: East and West, (Jinan, 1986), 487-499, Ann. New York Acad. Sci., 576, New York Acad. Sci. New York, 1989. MR 93d:05088 Shi, Y.B., Some theorems of uniquely pancyclic graphs, Discrete Math. 59(1986), 167-180. MR 87j:05103 from Klas Markstrom : A note on uniquely pancyclic graphs, technical report No 8 2000, Department of Mathematics, Ume University, submitted to Discrete Mathematics. I have shown that there are no such graphs on less than 56 vertices other than the seven previously found. The proof is basically a computer search. I also give some bounds for the number of edges in a uniquely pancyclic graph. 11. Let f(n) be the maximum possible number of edges in a graph on n vertices in which no two cycles have the same length. Determine f(n) (P. Erds, 1975) Using Math reviews, I found: 94i:05048 05C35 Lai, Chun Hui. On the size of graphs with all cycle having distinct length. (English. English summary) Discrete Math. 122(1993), no. 1-3, pages 363-364. Summary: "Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. In 1975, Erdos raised the question of determining $f(n)$ [see J. A. Bondy and U. S. R. Murty, Graph theory with applications, Elsevier, New York, 1976; MR 54 117]. We prove that for $n\geq 365t\sp 2-45t+1$ one has $f(n)\geq n+9t-1$. We conjecture that $\liminf (f(n)-n) \sqrt n\leq\sqrt 3$." 96h:05121 05C38 (05C35) Lai, Chun Hui(PRC-ZZTC), The number of edges of graphs in which all cycles have different lengths.(Chinese. Chinese summary) Zhangzhou Shiyuan Xuebao (Ziran Kexue Ban) 8(1994), no. 4, pages 30-34. In 1975, P. Erdos proposed the problem of determining the maximum number $f(n)$ of edges in a simple graph of $n$ vertices in which any two cycles are of different lengths. The present paper proves that $ f(n) \ge n+19t-1$ for $t=360q+7 (q \ge 1)$ and $n\ge \tfrac{1381}{9}t\sp 2+\tfrac {26}{45}t+\tfrac{98}{45}$. Consequently, $$\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \ge \sqrt {2 + {487 \over 1381}} \approx 1.53, $$ which is better than the previous bounds $\sqrt 2 \approx 1.41$ [Y. B. Shi, Discrete Math. 71 (1988), no. 1, 57--71; MR 89i:05169] and $\sqrt{2+{16 \over 73}} \approx 1.49$ [C. H. Lai, Discrete Math. 122 (1993), no. 1-3, 363--364; MR 94i:05048]. From Yair Caro : E. Boros, Y. Caro, Z.Furedi and R.Yuster: Covering non-uniform hypergraphs (submitted, 2000). The authors prove f(n) (this is a part of a much more general Turan-type problem considered). A lower bound due to Lai and other shows f(n) = n + sqrt(2n). See also: Chunhui Lai, Graphs without repeated cycle lengths. Australasian Journal of Combinatorics 27(2003), 101 - 105. In this paper, it is proved that $$f(n)\geq n+36t$$ for $t=1260r+169 \,\ (r\geq 1)$ and $n \geq 540t^{2}+\frac{175811}{2}t+\frac{7989}{2}$. Consequently, $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + {2 \over 5}}.$ We make the following conjecture: \par \bigskip \noindent{\bf Conjecture.} $$\lim_{n \rightarrow \infty} {f(n)-n\over \sqrt n}=\sqrt {2.4}.$$ 12. Prove: If G is a simple graph on n vertices and the number of edges of G is greater than n(k-1) 2, then G contains every tree with k edges (P. Erds and V. Ss, 1963). Erds and Gallai proved that every such graph contains a path of length k. Yair Caro: There are many partial results obtained in the last 10 years or so. The most notable are : The conjectured bound holds true if G is C4-free. J.F.Scale and M.Wozniak JCT_B 70(1997), 367-372 (extending an earlier result of Barndt and Dobson). The conjecture is true for every tree on k vertices having a vertex adjacent to at least (k-2) 2 leaves. Sidorenko, Combinatorica 9(1989), 207-215. 13. (Solved) Find a (6,5)-cage. An (m,n)-cage is an m-regular graph w