Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 30 of 42

Full-Text Articles in Physical Sciences and Mathematics

On The Strain-Rate Sensitivity Of Columnar Ice, M. E. Manley, E. M. Schulson Dec 1997

On The Strain-Rate Sensitivity Of Columnar Ice, M. E. Manley, E. M. Schulson

Dartmouth Scholarship

A power law relation between stress and strain rate of the form σ ∝ ε̇1/n was used to describe the response to strain rate of S1 ice loaded across the columns at -10°C. The rate exponent, n, decreased with increasing strain from about 4.6 at an observed peak on the load displacement curve to approximately 2.6 at a shortening of 2%. Analysis of these results and of the results of other authors on different forms of ice deformed at the same temperature suggests that the power law exponent, n, is proportional to Fc/Fg. The parameter Fc/Fg is the far-field basal …


A Detailed Comparison Of Hubble Space Telescopefaint Object Spectrograph Andiueultraviolet Spectra Of Selected Seyfert Nuclei, Anuradha Koratkar, Ian Evans, Sharon Pesto, Cynthia Taylor Dec 1997

A Detailed Comparison Of Hubble Space Telescopefaint Object Spectrograph Andiueultraviolet Spectra Of Selected Seyfert Nuclei, Anuradha Koratkar, Ian Evans, Sharon Pesto, Cynthia Taylor

Dartmouth Scholarship

Despite the contributions of the Hubble Space Telescope Faint Object Spectrograph (FOS) to the archive of UV observations of active galactic nuclei, the vast majority of UV reference data were obtained using the International Ultraviolet Explorer (IUE) satellite. These data remain important since they provide historical information about the intensities of the UV continua and emission lines that is needed to constrain models of the active nucleus. A detailed comparison of the FOS and IUE data is critical to understanding how the measurable quantities depend on the individual instrumental calibrations, and how any conclusions derived from modeling the …


A New Approach To Probing Large-Scale Power With Peculiar Velocities, Hume A. Feldman, Richard Watkins Dec 1997

A New Approach To Probing Large-Scale Power With Peculiar Velocities, Hume A. Feldman, Richard Watkins

Dartmouth Scholarship

We propose a new strategy for probing the power spectrum on large scales using galaxy peculiar velocities. We explore the properties of surveys that cover only two small fields in opposing directions on the sky. Surveys of this type have several advantages over those that attempt to cover the entire sky; in particular, by concentrating on galaxies in narrow cones, these surveys are able to achieve the density needed to measure several moments of the velocity field with only a modest number of objects, even for surveys designed to probe scales >∼100h−1Mpc. We construct mock surveys with this …


The Century Survey: A Deeper Slice Of The Universe, Margaret J. Geller, Michael J. Kurtz, Gary Wegner, John R. Thorstensen Dec 1997

The Century Survey: A Deeper Slice Of The Universe, Margaret J. Geller, Michael J. Kurtz, Gary Wegner, John R. Thorstensen

Dartmouth Scholarship

The "Century Survey" (CS hereafter) is a complete redshift survey of a 1° wide strip. It covers 0.03 steradians to a limiting mR = 16.13. The survey is 98.4% complete and contains 1762 galaxies. Large-scale features in the survey are qualitatively similar to those in other surveys: there are large voids surrounded or nearly surrounded by thin dense regions which are sections of structures like (and including) the Great Wall. The survey crosses the classical Corona Borealis supercluster. The galaxy density enhancement associated with this system extends for <˜100h-1 Mpc-1 (the Hubble constant is H0 = 100h …


Market-Based Resource Control For Mobile Agents, Jonathan Bredin, David Kotz, Daniela Rus Nov 1997

Market-Based Resource Control For Mobile Agents, Jonathan Bredin, David Kotz, Daniela Rus

Computer Science Technical Reports

Mobile agents are programs that can migrate from machine to machine in a heterogeneous, partially disconnected network. As mobile agents move across a network, they consume resources. We discuss a system for controlling the activities of mobile agents that uses electronic cash, a banking system, and a set of resource managers. We describe protocols for transactions between agents. We present fixed-pricing and dynamic-pricing policies for resources. We focus on and analyze the sealed-bid second-price auction as a mechanism for dynamic pricing.


Vic*: A Compiler For Virtual-Memory C*, Alex Colvin, Thomas H. Cormen Nov 1997

Vic*: A Compiler For Virtual-Memory C*, Alex Colvin, Thomas H. Cormen

Computer Science Technical Reports

This paper describes the functionality of ViC*, a compiler for a variant of the data-parallel language C* with support for out-of-core data. The compiler translates C* programs with shapes declared outofcore, which describe parallel data stored on disk. The compiler output is a SPMD-style program in standard C with I/O and library calls added to efficiently access out-of-core parallel data. The ViC* compiler also applies several program transformations to improve out-of-core data layout and access.


Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein Nov 1997

Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein

Dartmouth Scholarship

Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.

Our main contribution is to give approximation algorithms …


The I Band Tully-Fisher Relation For Cluster Galaxies: Data Presentation., Riccardo Giovanelli, Martha P. Haynes, Terry Herter, Nicole P. Vogt, Gary Wegner, John J. Salzer, Luiz N. Da Costa, Wolfram Freudling Oct 1997

The I Band Tully-Fisher Relation For Cluster Galaxies: Data Presentation., Riccardo Giovanelli, Martha P. Haynes, Terry Herter, Nicole P. Vogt, Gary Wegner, John J. Salzer, Luiz N. Da Costa, Wolfram Freudling

Dartmouth Scholarship

Observational parameters which can be used for redshift-independent distance determination using the Tully-Fisher (TF) technique are given for 782 spiral galaxies in the fields of 24 clusters or groups. I band photometry for the full sample was either obtained by us or compiled from published literature. Rotational velocities are derived either from 21 cm spectra or optical emission line long--slit spectra, and converted to a homogeneous scale. In addition to presenting the data, a discussion of the various sources of error on TF parameters is introduced, and the criteria for the assignment of membership to each cluster are given.


Computing Dense Clusters On-Line For Information Organization, Javed Aslam, Katya Pelekhov, Daniela Rus Oct 1997

Computing Dense Clusters On-Line For Information Organization, Javed Aslam, Katya Pelekhov, Daniela Rus

Computer Science Technical Reports

We present and analyze the off-line star algorithm for clustering static information systems and the on-line star algorithm for clustering dynamic information systems. These algorithms partition a document collection into a number of clusters that is naturally induced by the collection. We show a lower bound on the accuracy of the clusters produced by these algorithms. We use the random graph model to show that both star algorithms produce correct clusters in time Theta(V + E). Finally, we provide data from extensive experiments.


Approximating Disjoint-Path Problems Using Greedy Algorithms And Packing Integer Programs, Stavros G. Kolliopoulos, Clifford Stein Oct 1997

Approximating Disjoint-Path Problems Using Greedy Algorithms And Packing Integer Programs, Stavros G. Kolliopoulos, Clifford Stein

Computer Science Technical Reports

In the edge(vertex)-disjoint path problem we are given a graph $G$ and a set ${\cal T}$ of connection requests. Every connection request in ${\cal T}$ is a vertex pair $(s_i,t_i),$ $1 \leq i \leq K.$ The objective is to connect a maximum number of the pairs via edge(vertex)-disjoint paths. The edge-disjoint path problem can be generalized to the multiple-source unsplittable flow problem where connection request $i$ has a demand $\rho_i$ and every edge $e$ a capacity $u_e.$ All these problems are NP-hard and have a multitude of applications in areas such as routing, scheduling and bin packing. Given the hardness …


Faint Sources In The Euve Survey: Identification Of White Dwarfs, Active Late‐Type Stars, And Galactic Nuclei, Elisha Polomski, Stephane Vennes, John R. Thorstensen, Mihalis Mathioudakis, Emilio E. Falco Sep 1997

Faint Sources In The Euve Survey: Identification Of White Dwarfs, Active Late‐Type Stars, And Galactic Nuclei, Elisha Polomski, Stephane Vennes, John R. Thorstensen, Mihalis Mathioudakis, Emilio E. Falco

Dartmouth Scholarship

We report the classification of 21 new extreme-ultraviolet sources from the recent catalog of Lampton et al. The optical spectra presented identify the objects as 14 active late-type stars (including two double active stars and a possible T Tauri star), three white dwarfs, and six active galactic nuclei (a Seyfert galaxy, the BL Lac object 1ES 1028+511 [=EUVE J1031+508], and four quasi-stellar objects). We have detected Ca II absorption lines in the BL Lac object and measured its redshift. Two of the white dwarfs are unusually massive (M > 1.1 M). Our sample of late-type stars includes five …


Optically Identified Supernova Remnants In The Nearby Spiral Galaxies Ngc 5204, Ngc 5585, Ngc 6946, M81, And M101, David M. Matonick, Robert A. Fesen Sep 1997

Optically Identified Supernova Remnants In The Nearby Spiral Galaxies Ngc 5204, Ngc 5585, Ngc 6946, M81, And M101, David M. Matonick, Robert A. Fesen

Dartmouth Scholarship

We present the results of an optical search for supernova remnants (SNRs) in the spiral galaxies NGC 5204, NGC 5585, NGC 6946, M81, and M101. Using the criterion that emission nebulae with [S II]/Hα ≥ 0.45 are identified as SNRs, we found three SNRs in NGC 5204, five in NGC 5585, 27 in NGC 6946, 41 in M81, and 93 in M101. Including the 35 SNRs recently detected in NGC 2403 by Matonick et al., we have doubled the current number of galaxies that have been well searched for SNRs and increased the number of known extragalactic SNRs by about …


Performing Out-Of-Core Ffts On Parallel Disk Systems, Thomas H. Cormen, David M. Nicol Aug 1997

Performing Out-Of-Core Ffts On Parallel Disk Systems, Thomas H. Cormen, David M. Nicol

Computer Science Technical Reports

The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems can be solved entirely in main memory, some important classes of applications require out-of-core techniques. For these, use of parallel I/O systems can improve performance considerably. This paper shows how to perform one-dimensional FFTs using a parallel disk system with independent disk accesses. We present both analytical and experimental results for performing out-of-core FFTs in two ways: using traditional virtual memory with demand paging, and using a provably asymptotically optimal algorithm for the Parallel Disk Model (PDM) of …


Generating, Visualizing And Evaluating High Quality Clusters For Information Organization, Javed Aslam, Katya Pelekhov, Daniela Rus Aug 1997

Generating, Visualizing And Evaluating High Quality Clusters For Information Organization, Javed Aslam, Katya Pelekhov, Daniela Rus

Computer Science Technical Reports

We present and analyze the star clustering algorithm. We discuss an implementation of this algorithm that supports browsing and document retrieval through information organization. We define three parameters for evaluating a clustering algorithm to measure the topic separation and topic aggregation achieved by the algorithm. In the absence of benchmarks, we present a method for randomly generating clustering data. Data from our user study shows evidence that the star algorithm is effective for organizing information.


Fast Discrete Polynomial Transforms With Applications To Data Analysis For Distance Transitive Graphs, J. R. Driscoll, D. M. Healy, D. N. Rockmore Aug 1997

Fast Discrete Polynomial Transforms With Applications To Data Analysis For Distance Transitive Graphs, J. R. Driscoll, D. M. Healy, D. N. Rockmore

Dartmouth Scholarship

Let $\poly = \{P_0,\dots,P_{n-1}\}$ denote a set of polynomials with complex coefficients. Let $\pts = \{z_0,\dots,z_{n-1}\}\subset \cplx$ denote any set of {\it sample points}. For any $f = (f_0,\dots,f_{n-1}) \in \cplx^n$, the {\it discrete polynomial transform} of f (with respect to $\poly$ and $\pts$) is defined as the collection of sums, $\{\fhat(P_0),\dots,\fhat(P_{n-1})\}$, where $\fhat(P_j) = \langle f,P_j \rangle = \sum_{i=0}^{n-1} f_iP_j(z_i)w(i)$ for some associated weight function w. These sorts of transforms find important applications in areas such as medical imaging and signal processing.

In this paper, we present fast algorithms for computing discrete orthogonal polynomial transforms. For a system …


The Self-Organizing Desk, Daniela Rus, Peter De Santis Aug 1997

The Self-Organizing Desk, Daniela Rus, Peter De Santis

Dartmouth Scholarship

The self-organizing desk is a system that enhances a physical desk-top with electronic information. It can remember, organize, update, and manipulate the information contained in the documents on a desk. The system consists of a simple robot eye that can survey the desk, a module for smart extraction of information from the images taken by the robot, a module for representing this information in multiple views, and a module that allows a user to interact with this information.


Multimedia Data Analysis Using Imagetcl (Extended Version), Charles B. Owen, Fillia Makedon Jul 1997

Multimedia Data Analysis Using Imagetcl (Extended Version), Charles B. Owen, Fillia Makedon

Computer Science Technical Reports

ImageTcl is an new system which provides powerful Tcl/Tk based media scripting capabilities similar to those of the ViewSystem and Rivl in a unique environment that allows rapid prototyping and development of new components in the C++ language. Powerful user tools automate the creation of new components as well as the addition of new data types and file formats. Applications using ImageTcl at the Dartmouth Experimental Visualization Laboratory (DEVLAB) include multiple stream media data analysis, automatic image annotation, and image sequence motion analysis. ImageTcl combines the high speed of compiled languages with the testing and parameterization advantages of scripting languages.


Multiple Media Stream Data Analysis: Theory And Applications (Extended Version), Charles B. Owen, Fillia Makedon Jul 1997

Multiple Media Stream Data Analysis: Theory And Applications (Extended Version), Charles B. Owen, Fillia Makedon

Computer Science Technical Reports

This paper presents a new model for multiple media stream data analysis as well as descriptions of some applications of this model in development at Dartmouth College. This model formalizes the exploitation of correlations between multiple, potentially heterogeneous, media streams in support of numerous application areas. The goal of the technique is to determine temporal and spatial alignments which optimize a correlation function and indicate commonality and synchronization between media streams. It also provides a framework for comparison of media in unrelated domains. Applications such as text-to-speech alignment, functional magnetic resonance imaging, speaker localization, and degraded media realignment are described.


On-Line File Caching, Neal E. Young Jul 1997

On-Line File Caching, Neal E. Young

Computer Science Technical Reports

Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of total size at most some specified k so as to minimize the total retrieval cost. Specifically, when a requested file is not in the cache, bring it into the cache, pay the retrieval cost, and choose files to remove from the cache so that the total size of files in the cache is at most k. This problem generalizes previous paging and caching problems by allowing objects of arbitrary …


Interpretation Of Ultraviolet Absorption Lines In Sn 1006, A. J. S. Hamilton, R. A. Fesen, C.-C. Wu, D. M. Crenshaw Jun 1997

Interpretation Of Ultraviolet Absorption Lines In Sn 1006, A. J. S. Hamilton, R. A. Fesen, C.-C. Wu, D. M. Crenshaw

Dartmouth Scholarship

We present a theoretical interpretation of the broad silicon and iron ultraviolet absorption features observed with the Hubble Space Telescope (HST) in the spectrum of the Schweizer-Middleditch star behind the remnant of SN 1006. These features are caused by supernova ejecta in SN 1006.

We propose that the redshifted Si II 1260 Å feature consists of both unshocked and shocked Si II. The sharp red edge of the line at 7070 km s-1 indicates the position of the reverse shock, while its Gaussian blue edge reveals shocked Si with a mean velocity of 5050 km s-1 …


Performing Bmmc Permutations Efficiently On Distributed-Memory Multiprocessors With Mpi, Thomas H. Cormen May 1997

Performing Bmmc Permutations Efficiently On Distributed-Memory Multiprocessors With Mpi, Thomas H. Cormen

Computer Science Technical Reports

This paper presents an architecture-independent method for performing BMMC permutations on multiprocessors with distributed memory. All interprocessor communication uses the MPI function MPI_Sendrecv_replace(). The number of elements and number of processors must be powers of 2, with at least one element per processor, and there is no inherent upper bound on the ratio of elements per processor. Our method transmits only data without transmitting any source or target indices, which conserves network bandwidth. When data is transmitted, the source and target processors implicitly agree on each other's identity and the indices of the elements being transmitted. A C-callable implementation of …


Using Fundamental Plane Distances To Estimate The Total Binding Mass In Abell 2626, Joseph J. Mohr, Gary Wegner Apr 1997

Using Fundamental Plane Distances To Estimate The Total Binding Mass In Abell 2626, Joseph J. Mohr, Gary Wegner

Dartmouth Scholarship

We use fundamental plane (FP) distance estimates to the components of the double cluster A2626 (cz ~ 17,500 km/s) to constrain cluster kinematics and estimate total binding mass. We employ deep R band CCD photometry, multi-object spectroscopy, and software designed to account for seeing effects to measure the FP parameters R_e, sigma , and for 24 known early type and S0 cluster members. The FP coefficients from this sample (alpha =1.30+/-0.36 and beta =0.31+/-0.06) are consistent with others reported in the literature. We examine the Mg_b equivalent width distributions within both subclusters and find them to be indistinguishable. Lacking evidence …


Peculiar Velocities Of Clusters In Cold Dark Matter Models, Stefano Borgani, Luiz N. Da Costa, Wolfram Freudling, Riccardo Giovanelli, Martha P. Haynes, John Salzer, Gary Wegner Mar 1997

Peculiar Velocities Of Clusters In Cold Dark Matter Models, Stefano Borgani, Luiz N. Da Costa, Wolfram Freudling, Riccardo Giovanelli, Martha P. Haynes, John Salzer, Gary Wegner

Dartmouth Scholarship

Recently, peculiar velocity measurements became available for a new sample of galaxy clusters, hereafter the SCI sample. From an accurately calibrated Tully-Fisher relation for spiral galaxies, we compute the rms peculiar velocity, Vrms, and compare it with the linear theory predictions of COBE-normalized low-density and open cold dark matter models (ΛCDM and OCDM, respectively). Confidence levels for model rejection are estimated using a Monte Carlo procedure in order to generate a large ensemble of artificial data sets for each model. Following Zaroubi et al., we express our results in terms of constraints on the (Ω0, …


A Split-Phase Interface For Parallel File Systems, Sanjay Khanna, David Kotz Mar 1997

A Split-Phase Interface For Parallel File Systems, Sanjay Khanna, David Kotz

Computer Science Technical Reports

We describe the effects of a new user-level library for the Galley Parallel File System. This library allows some pre-existing sequential programs to make use of the Galley Parallel File System with minimal modification. It permits programs to efficiently use the parallel file system because the user-level library groups accesses together. We examine the performance of our library, and we show how code needs to be modified to use the library.


Far-Ultraviolet Absorption Lines In The Remnant Of Sn 1006, Chi-Chao Wu, D. Michael Crenshaw, Andrew J. S. Hamilton, Robert A. Fesen Mar 1997

Far-Ultraviolet Absorption Lines In The Remnant Of Sn 1006, Chi-Chao Wu, D. Michael Crenshaw, Andrew J. S. Hamilton, Robert A. Fesen

Dartmouth Scholarship

We have obtained a far-ultraviolet spectrum (1150-1600 Å) of a hot subdwarf star behind the remnant of supernova 1006 with the Faint Object Spectrograph (FOS) on the Hubble Space Telescope. The high-quality spectrum is used to test previous identifications of the strong absorption features discovered with the International Ultraviolet Explorer. These features have FWHM = 4000 (±300) km s-1 and are not at the rest wavelengths of known interstellar lines, as opposed to the broader (~8000 km s-1 FWHM) Fe II lines from the remnant centered at 0 km s-1 in near-UV FOS spectra. We …


The Tully-Fisher Relation And H0, Riccardo Giovanelli, Martha P. Haynes, Luiz N. Da Costa, Wolfram Freudling, John Salzer, Gary Wegner Mar 1997

The Tully-Fisher Relation And H0, Riccardo Giovanelli, Martha P. Haynes, Luiz N. Da Costa, Wolfram Freudling, John Salzer, Gary Wegner

Dartmouth Scholarship

The use of the Tully-Fisher (TF) relation for the determination of H0 relies on the availability of an adequate template TF relation and of reliable primary distances. Here we use a TF template relation with the best available kinematical zero point, obtained from a sample of 24 clusters of galaxies extending to cz ~ 9000 km s-1, and the most recent set of Cepheid distances for galaxies fit for TF use. The combination of these two ingredients yields H0 = 69 ± 5 km s-1 Mpc-1. The approach is significantly more accurate than …


The Peculiar Motions Of Early‐Type Galaxies In Two Distant Regions. Iv. The Photometric Fitting Procedure, R. P. Saglia, Edmund Bertschinger, G. Baggley, David Burstein, Matthew Colless, Roger L. Davies, Robert K. Mcmahan Jr., Gary Wegner Mar 1997

The Peculiar Motions Of Early‐Type Galaxies In Two Distant Regions. Iv. The Photometric Fitting Procedure, R. P. Saglia, Edmund Bertschinger, G. Baggley, David Burstein, Matthew Colless, Roger L. Davies, Robert K. Mcmahan Jr., Gary Wegner

Dartmouth Scholarship

The EFAR project is a study of 736 candidate early-type galaxies in 84 clusters lying in two regions toward Hercules-Corona Borealis and Perseus-Cetus at distances cz ≈ 6000-15,000 km s-1. In this paper we describe a new method of galaxy photometry adopted to derive the photometric parameters of the EFAR galaxies. The algorithm fits the circularized surface brightness profiles as the sum of two seeing-convolved components, an R1/4 and an exponential law. This approach allows us to fit the large variety of luminosity profiles displayed by the EFAR galaxies homogeneously and to derive (for at least a …


On The Power Of Multi-Objects, Prasad Jayanti, Sanjay Khanna Feb 1997

On The Power Of Multi-Objects, Prasad Jayanti, Sanjay Khanna

Computer Science Technical Reports

In the standard ``single-object'' model of shared-memory computing, it is assumed that a process accesses at most one shared object in each of its steps. In this paper, we consider a more powerful variant---the ``multi-object'' model---in which each process may access *any* finite number of shared objects atomically in each of its steps. We present results that relate the synchronization power of a type in the multi-object model to its synchronization power in the single-object model. Although the types fetch&add and swap have the same synchronization power in the single-object model, Afek, Merritt, and Taubenfeld showed that their synchronization powers …


A Mechanical Duffing Oscillator For The Undergraduate Laboratory, J. E. Berger, G. Nunes Feb 1997

A Mechanical Duffing Oscillator For The Undergraduate Laboratory, J. E. Berger, G. Nunes

Dartmouth Scholarship

The design and construction of a mechanical Duffing oscillator suitable for use in an undergraduate laboratory is described. The oscillator provides a straightforward introduction to nonlinear vibrations and chaotic behavior that is both pedagogically appealing and easily adapted to students at various levels of sophistication. Good agreement is observed between the motion of the oscillator and computer simulations, which provides students with an introduction to the power of mathematical modeling. Period-doubling routes to chaos can be observed both experimentally and numerically.


Pulsations And Accretion Geometry In Yy Draconis: A Study Based On Hubble Space Telescope Observations, Carole A. Haswell, Joseph Patterson, John R. Thorstensen, Coel Hellier Feb 1997

Pulsations And Accretion Geometry In Yy Draconis: A Study Based On Hubble Space Telescope Observations, Carole A. Haswell, Joseph Patterson, John R. Thorstensen, Coel Hellier

Dartmouth Scholarship

We present 1 Å resolution fast ultraviolet spectroscopy of YY Dra, coordinated U, B, V, R, and I photometry, and Hα spectroscopy. The UV continuum is strongly pulsed: we found 16% semiamplitude pulses with period 264.7(1) s; there was no evidence for power at twice this period. The UBV pulses are in phase with the UV continuum pulsation. A color temperature of 105 K was found for the pulse spectrum, with a corresponding area 0.5% of the white dwarf surface. We refine the white dwarf spin period, obtaining Pspin = 529.31 ± 0.02 s. Optical pulses at …