Benchmarking and performance analysis of the CM-2

A suite of benchmarking routines testing communication, basic arithmetic operations, and selected kernel algorithms written in LISP and PARIS was developed for the CM-2. Experiment runs are automated via a software framework that sequences individual tests, allowing for unattended overnight operation. Multiple measurements are made and treated statistically to generate well-characterized results from the noisy values given by cm:time. The results obtained provide a comparison with similar, but less extensive, testing done on a CM-1. Tests were chosen to aid the algorithmist in constructing fast, efficient, and correct code on the CM-2, as well as gain insight into what performance criteria are needed when evaluating parallel processing machines

Administrative Law - Judicial Review - Pennsylvania Local Agency Law - Exclusive Remedies

The Pennsylvania Supreme Court has held that a party aggrieved by the adjudication of a local agency who fails to take the statutory appeal provided by the Local Agency Law is precluded from contesting the merits of the agency\u27s order at a subsequent enforcement proceeding. Erie Human Relations Commission ex rel. Dunson v. Erie Insurance Exchange, 348 A.2d 742 (Pa. 1975)

Strong Ramsey Games in Unbounded Time

For two graphs $B$ and $H$ the strong Ramsey game $\mathcal{R}(B,H)$ on the board $B$ and with target $H$ is played as follows. Two players alternately claim edges of $B$. The first player to build a copy of $H$ wins. If none of the players win, the game is declared a draw. A notorious open question of Beck asks whether the first player has a winning strategy in $\mathcal{R}(K_n,K_k)$ in bounded time as $n\rightarrow\infty$. Surprisingly, in a recent paper Hefetz et al. constructed a $5$-uniform hypergraph $\mathcal{H}$ for which they proved that the first player does not have a winning strategy in $\mathcal{R}(K_n^{(5)},\mathcal{H})$ in bounded time. They naturally ask whether the same result holds for graphs. In this paper we make further progress in decreasing the rank. In our first result, we construct a graph $G$ (in fact $G=K_6\setminus K_4$) and prove that the first player does not have a winning strategy in $\mathcal{R}(K_n \sqcup K_n,G)$ in bounded time. As an application of this result we deduce our second result in which we construct a $4$-uniform hypergraph $G'$ and prove that the first player does not have a winning strategy in $\mathcal{R}(K_n^{(4)},G')$ in bounded time. This improves the result in the paper above. An equivalent formulation of our first result is that the game $\mathcal{R}(K_\omega\sqcup K_\omega,G)$ is a draw. Another reason for interest on the board $K_\omega\sqcup K_\omega$ is a folklore result that the disjoint union of two finite positional games both of which are first player wins is also a first player win. An amusing corollary of our first result is that at least one of the following two natural statements is false: (1) for every graph $H$, $\mathcal{R}(K_\omega,H)$ is a first player win; (2) for every graph $H$ if $\mathcal{R}(K_\omega,H)$ is a first player win, then $\mathcal{R}(K_\omega\sqcup K_\omega,H)$ is also a first player win.Comment: 18 pages, 46 figures; changes: fully reworked presentatio

Closed String Tachyons on C/Z_N

We analyse the condensation of closed string tachyons on the $C/Z_N$ orbifold. We construct the potential for the tachyons upto the quartic interaction term in the large $N$ limit. In this limit there are near marginal tachyons. The quartic coupling for these tachyons is calculated by subtracting from the string theory amplitude for the tachyons, the contributions from the massless exchanges, computed from the effective field theory. We argue that higher point interaction terms are are also of the same order in 1/N as the quartic term and are necessary for existence of the minimum of the tachyon potential that is consistent with earlier analysis.Comment: 19 pages, 1 figure; comments added about $N$ dependence of contact ter

The azimuth structure of nuclear collisions -- I

We describe azimuth structure commonly associated with elliptic and directed flow in the context of 2D angular autocorrelations for the purpose of precise separation of so-called nonflow (mainly minijets) from flow. We extend the Fourier-transform description of azimuth structure to include power spectra and autocorrelations related by the Wiener-Khintchine theorem. We analyze several examples of conventional flow analysis in that context and question the relevance of reaction plane estimation to flow analysis. We introduce the 2D angular autocorrelation with examples from data analysis and describe a simulation exercise which demonstrates precise separation of flow and nonflow using the 2D autocorrelation method. We show that an alternative correlation measure based on Pearson's normalized covariance provides a more intuitive measure of azimuth structure.Comment: 27 pages, 12 figure

Global/Local Iteration for Blended Composite Laminate Panel Structure Optimization Subproblems

Composite panel structure optimization is commonly decomposed into panel optimization subproblems. Previous work applied a guide based design approach to the problem for a structure where the local loads were assumed to be fixed for each panel throughout the design process. This paper examines the application of guide based design to a more realistic representation of the structure where the local loads for each panel are determined through a global level analysis that is coupled with the stacking sequence for every design panel. A small problem is selected for which an exhaustive search of the subproblem design space verifies the optimality of the solution found through the global/local iteration process introduced in this work. The efficient discovery of solutions to these guide based design subproblems creates an opportunity to incorporate the solutions into a global level optimization process. A parallel genetic algorithm is proposed to control global optimization in which evaluating the fitness of each member of the population requires the solution of a guide based design subproblem where parallelism is solely within fitness evaluations. Results are presented for a wingbox design problem and compared with known solutions for the same problem to demonstrate weight reductions in a problem thought to already be near optimally solved