HST3D; a Computer Code for Simulation of Heat and Solute Transport in Three-dimensional Ground-water Flow Systems

The Heat- and Soil-Transport Program (HST3D) simulates groundwater flow and associated heat and solute transport in three dimensions. The three governing equations are coupled through the interstitial pore velocity, the dependence of the fluid density on pressure, temperature, the solute-mass fraction , and the dependence of the fluid viscosity on temperature and solute-mass fraction. The solute transport equation is for only a single, solute species with possible linear equilibrium sorption and linear decay. Finite difference techniques are used to discretize the governing equations using a point-distributed grid. The flow-, heat- and solute-transport equations are solved , in turn, after a particle Gauss-reduction scheme is used to modify them. The modified equations are more tightly coupled and have better stability for the numerical solutions. The basic source-sink term represents wells. A complex well flow model may be used to simulate specified flow rate and pressure conditions at the land surface or within the aquifer, with or without pressure and flow rate constraints. Boundary condition types offered include specified value, specified flux, leakage, heat conduction, and approximate free surface, and two types of aquifer influence functions. All boundary conditions can be functions of time. Two techniques are available for solution of the finite difference matrix equations. One technique is a direct-elimination solver, using equations reordered by alternating diagonal planes. The other technique is an iterative solver, using two-line successive over-relaxation. A restart option is available for storing intermediate results and restarting the simulation at an intermediate time with modified boundary conditions. This feature also can be used as protection against computer system failure. Data input and output may be in metric (SI) units or inch-pound units. Output may include tables of dependent variables and parameters, zoned-contour maps, and plots of the dependent variables versus time. (Lantz-PTT

Why are hyperlinks to business Websites created? A content analysis

Motivations for the creation of hyperlinks to business sites were analyzed through a content analysis approach. Links to 280 North American IT companies (71 Canadian companies and 209 U.S. companies) were searched through Yahoo!. Then a random sample of 808 links was taken from the links retrieved. The content as well as the context of each link was manually examined to determine why the link was created. The country location and the type of the site where the link came from were also identified. The study found that most links were created for business purposes confirming findings from early quantitative studies that links contain useful business information. Links to competitors were extremely rare but competitors were often co-linked, suggesting that co-link analysis is the direction to pursue for information on competitive intelligence. Copyright © 2006 Akadémiai Kiadó, Budapest. All rights reserved

Why are Websites co-linked? the case of Canadian universities

This study examined why Websites were co-linked using Canadian university Websites as the test set. Pages that co-linked to these university Websites were located using Yahool. A random sample of 859 co-linking pages (the page that initiated the co-link) was retrieved and the contents of the page, as well as the context of the link, were manually examined to record the following variables: language, country, type of Website, and the reasons for co-linking. The study found that in over 94% of cases, the two co-linked universities were related academically; many of these cases (38%) showed a relationship specifically in teaching or research. This confirms results, from previous quantitative studies, that Web co-links can be a measure of the similarity or relatedness of sites being co-linked and that Web co-link analysis can thus be used to study relationships among linked Websites. Copyright © 2007 Akadémiai Kiadó Budapest All rights reserved

A study of leeside flow field heat transfer on Shuttle Orbiter configuration

A coupled inviscid and viscous theoretical solution of the flow about the entire configuration is the desirable and comprehensive approach to defining thermal environments about the space shuttle orbiter. Simplified methods for predicting entry heating on leeside surfaces of the orbiter are considered. Wind tunnel heat transfer and oil flow data at Mach 6 and 10 and Reynolds numbers ranging from 500,000 to 73 million were used to develop correlations for the wing upper surface and the top surface of the fuselage. These correlations were extrapolated to flight Reynolds number and compared with heating data obtained during the shuttle STS-2 reentry. Efforts directed toward the wing leeside surface resulted in an approach which generally agreed with the flight data. Heating predictions for the upper fuselage were less successful due to the extreme complexity of local flow interactions and the associated heating environment

Singular value decomposition applied to compact binary coalescence gravitational-wave signals

We investigate the application of the singular value decomposition to compact-binary, gravitational-wave data-analysis. We find that the truncated singular value decomposition reduces the number of filters required to analyze a given region of parameter space of compact binary coalescence waveforms by an order of magnitude with high reconstruction accuracy. We also compute an analytic expression for the expected signal-loss due to the singular value decomposition truncation.Comment: 4 figures, 6 page

Composite gravitational-wave detection of compact binary coalescence

The detection of gravitational waves from compact binaries relies on a computationally burdensome processing of gravitational-wave detector data. The parameter space of compact-binary-coalescence gravitational waves is large and optimal detection strategies often require nearly redundant calculations. Previously, it has been shown that singular value decomposition of search filters removes redundancy. Here we will demonstrate the use of singular value decomposition for a composite detection statistic. This can greatly improve the prospects for a computationally feasible rapid detection scheme across a large compact binary parameter space.Comment: 6 pages, 3 figure