Simplicial vs. Continuum String Theory and Loop Equations

We derive loop equations in a scalar matrix field theory. We discuss their solutions in terms of simplicial string theory -- the theory describing embeddings of two--dimensional simplicial complexes into the space--time of the matrix field theory. This relation between the loop equations and the simplicial string theory gives further arguments that favor one of the statements of the paper hep-th/0407018. The statement is that there is an equivalence between the partition function of the simplicial string theory and the functional integral in a continuum string theory -- the theory describing embeddings of smooth two--dimensional world--sheets into the space--time of the matrix field theory in question.Comment: 6 page

Cavity flow past a slender pointed hydrofoil

A slender-body theory for the flow past a slender, pointed hydrofoil held at a small angle of Attack to the flow, with a cavity on the upper surface, has been worked out. The approximate solution valid near the body is seen to be the sum of two components. The first consists of a distribution of two-dimensional sources located along the centroid line of the cavity to represent the variation of the cross-sectional area of the cavity. The second component represents the crossflow perpendicular to the centroid line. It is found that over the cavity boundary which envelops a constant pressure region, the magnitude of the cross-flow velocity is not constant, but varies to a moderate extent. With this variation neglected only in the neighbourhood of the hydrofoil, the cross-flow is solved by adopting the Riabouchinsky model for the two-dimensional flow. The lift is then calculated by integrating the pressure along the chord; the dependence of the lift on cavitation number and angle of attack is shown for a specific case of the triangular plan form

An unconventional magnetically-coupled multivibrator

Multivibrator circuit provides a low-frequency sine wave output without using a low-frequency power transformer or filter components. This circuit, utilizing two transistors and a magnetic core, represents a reduction in complexity, size, and weight over similar units

Event-by-event analysis of ultra-relativistic heavy-ion collisions in smoothed particle hydrodynamics

The method of smoothed particle hydrodynamics (SPH) is applied for ultra-relativistic heavy-ion collisions. The SPH method has several advantages in studying event-by-event fluctuations, which attract much attention in looking for quark gluon plasma (QGP) formation, because it gives a rather simple scheme for solving hydrodynamical equations. Using initial conditions for Au+Au collisions at RHIC energy produced by NeXus event generator, we solve the hydrodynamical equation in event-by-event basis and study the fluctuations of hadronic observables such as dN/dy due to the initial conditions. In particular, fluctuations of elliptic flow coefficient v2 is investigated for both the cases, with and without QGP formation. This can be used as an additional test of QGP formation.Comment: LaTeX, 16 figures, 3 tables, 23 pages. Talk presented at 6th International Workshop on Relativistic Aspects of Nuclear Physics(RANP2000), Caraguatatuba, Tabatinga Beach, Sao Paulo, Brazil, October 17-20, 2000. To be published in the proceedings (World Scientific, Singapore

Event-by-event fluctuations in hydrodynamical description of heavy-ion collisions

Effects caused by the event-by-event fluctuation of the initial conditions in hydrodynamical description of high-energy heavy-ion collisions are investigated. Non-negligible effects appear for several observable quantities, even for a fixed impact parameter $\vec b$. They are sensitive to the equation of state, being the dispersions of the observable quantities in general smaller when the QGP phase appears at the beginning of hydrodynamic evolution than when the fluid remains hadron gas during whole the evolution.Comment: 4 pages, 4 figures, talk presented to Quark Matter 2001 Conferenc

Tunable subpicosecond electron bunch train generation using a transverse-to-longitudinal phase space exchange technique

We report on the experimental generation of a train of subpicosecond electron bunches. The bunch train generation is accomplished using a beamline capable of exchanging the coordinates between the horizontal and longitudinal degrees of freedom. An initial beam consisting of a set of horizontally-separated beamlets is converted into a train of bunches temporally separated with tunable bunch duration and separation. The experiment reported in this Letter unambiguously demonstrates the conversion process and its versatility.Comment: 4 pages, 5 figures, 1 table; accepted for publication in PR

Bending and springback prediction method based on multi-scale finite element analyses for high bendability and low springback sheet generation

In this study, a sheet bendability and springback property evaluation technology through bending test simulations is newly developed using our multi-scale finite element analysis code, which is based on the crystallographic homogenization method

Parallel Exhaustive Search without Coordination

We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of "boxes", with a "treasure" hidden in one of them, where the boxes' order reflects the importance of finding the treasure in a given box. At each time step, a search protocol executed by a searcher has the ability to peek into one box, and see whether the treasure is present or not. By equally dividing the workload between them, $k$ searchers can find the treasure $k$ times faster than one searcher. However, this straightforward strategy is very sensitive to failures (e.g., crashes of processors), and overcoming this issue seems to require a large amount of communication. We therefore address the question of designing parallel search algorithms maximizing their speed-up and maintaining high levels of robustness, while minimizing the amount of resources for coordination. Based on the observation that algorithms that avoid communication are inherently robust, we analyze the best running time performance of non-coordinating algorithms. Specifically, we devise non-coordinating algorithms that achieve a speed-up of $9/8$ for two searchers, a speed-up of $4/3$ for three searchers, and in general, a speed-up of $\frac{k}{4}(1+1/k)^2$ for any $k\geq 1$ searchers. Thus, asymptotically, the speed-up is only four times worse compared to the case of full-coordination, and our algorithms are surprisingly simple and hence applicable. Moreover, these bounds are tight in a strong sense as no non-coordinating search algorithm can achieve better speed-ups. Overall, we highlight that, in faulty contexts in which coordination between the searchers is technically difficult to implement, intrusive with respect to privacy, and/or costly in term of resources, it might well be worth giving up on coordination, and simply run our non-coordinating exhaustive search algorithms