The insurance industry is the major intermediator of long term credit in the U.S., and insurance ratings agencies have become powerful de facto regulators of insurance company investment policy and hence of capital allocation for the economy as a whole. If the rating process can be shown to be dishonest, arbitrary, or even simply lacking in rigor, the implications for the proper role of insurance ratings in capital markets are highly significant. The article examines the relationship between the A.M. Best Company's assigned Life/Health insurer ratings, 1994 edition, and the hundreds of quantitative and qualitative factors that A.M. Best discusses in its explanation of its rating system. The results indicate that company ratings are largely determined by company size and cash flow. Using tree modeling with only a few quantitative factors, with no additional qualitative input, it was possible to predict 49% of insurer's A.M. Best ratings exactly, and 99% if a miss by one rating in either direction is allowed. A simpler linear model was able to predict ratings with corresponding accuracies of 98% and 82%.

The CMAX translator converts applications written in scalable Fortran 77 to parallel Connection Machine Fortran. The most obvious part of the translation problem, and one addressed by a number of previous translators as well as CMAX, is loop vectorization: the substitution of array syntax and intrinsics for Fortran 77 DO loops. A less obvious (but equally important) part of the translation problem is the conversion of constructs arising from Fortran 77's linear memory model into code which does not rely on storage or sequence association. Most such constructs can only be detected and repaired through interprocedural analysis and transformation; CMAX is the first translator to perform such repairs. This paper describes the CMAX translator and some of the more important transforms that we have distilled from our users' porting experiences.

This work presents the first MPP execution of the a Cray Y-MP.Finally, we achieved at least 2 times the price/performance of a Cray Y-MP.

Article Compiler parallelization of an elliptic grid generator for 1990 Gordon Bell prize Share on Authors: Gary Sabot Thinking Machines Corporation, 245 First Street, Cambridge, MA Thinking Machines Corporation, 245 First Street, Cambridge, MAView Profile , Lisa Tennies Thinking Machines Corporation, 245 First Street, Cambridge, MA Thinking Machines Corporation, 245 First Street, Cambridge, MAView Profile , Alex Vasilevsky Thinking Machines Corporation, 245 First Street, Cambridge, MA Thinking Machines Corporation, 245 First Street, Cambridge, MAView Profile , Richard Shapiro United Technologies Corporation, East Hartford, CT United Technologies Corporation, East Hartford, CTView Profile Authors Info & Claims Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on SupercomputingAugust 1991 Pages 338–346https://doi.org/10.1145/125826.126020Online:01 August 1991Publication History 0citation161DownloadsMetricsTotal Citations0Total Downloads161Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Dictionary lookup is a computational activity that can be greatly accelerated when performed on large amounts of text by a parallel computer such as the Connection MachineTM Computer (CM). Several alogrithms for parallel dictionary lookup are discussed, including one that allows the CM to lookup words at a rate 450 times that of lookup on a Symbolics 3600 Lisp Machine.