Media Convergence: Creating Content, Questioning Relationships

The development, dissemination, and proliferation of multimedia and media convergent texts raise a number of pressing questions for literacy scholars in general and compositionists in particular. What kinds of literacy practices are students developing through their use and composition of multimodal and new media texts? What genres are used in the creation of such texts, and why? Are there particular genres that are favored? How are older genres remediated or recast through media convergence? What research methodology challenges are posed when attempting to study multimodal and new media texts? How might compositionists use media convergence to teach students about academic literacies, about research, about the changing nature of “writing?” What might media convergence look like in the future? Perhaps most immediately, the phrase itself—“media convergence”—begs a question: what, exactly, is converging? This special issue of Computers and Composition on “Media Convergence” poses answers—sometimes tentative, sometimes provocative—to these questions.     

Simple fiber-optic confocal microscopy with nanoscale depth resolution beyond the diffraction barrier

A novel fiber-optic confocal approach for ultrahigh depth-resolution (相似文献   

On delay-derivative-dependent stability of systems with fast-varying delays

Stability of linear systems with uncertain bounded time-varying delays is studied under the assumption that the nominal delay values are not equal to zero. An input-output approach to stability of such systems is known to be based on the bound of the L₂-norm of a certain integral operator. There exists a bound on this operator norm in two cases: in the case where the delay derivative is not greater than 1 and in the case without any constraints on the delay derivative. In the present note we fill the gap between the two cases by deriving a tight operator bound which is an increasing and continuous function of the delay derivative upper bound d?1. For d→∞ the new bound corresponds to the second case and improves the existing bound. As a result, for the first time, delay-derivative-dependent frequency domain and time domain stability criteria are derived for systems with the delay derivative greater than 1.     

Nonsmooth optimization for multiband frequency domain control design

Multiband frequency domain synthesis consists in the minimization of a finite family of closed-loop transfer functions on prescribed frequency intervals. This is an algorithmically difficult problem due to its inherent nonsmoothness and nonconvexity. We extend our previous work on nonsmooth H_∞ synthesis to develop a nonsmooth optimization technique to compute local solutions to multiband synthesis problems. The proposed method is shown to perform well on illustrative examples.     

Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems

In this paper we investigate data structures obtained by a recursive partitioning of the multi- dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree . It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. We show that under the assumption that the input points have limited precision (i.e., are drawn from the integer grid of size u ) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant number of dimensions. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball. Received January 19, 1999; revised November 4, 1999.     

Efficient matching of nonrectangular shapes

Most known two-dimensional matching algorithms have a rectangular text (image) and rectangular pattern (template) as their input. These matching algorithms perform a row by row analysis followed by some column processing. These techniques are only efficient if all the rows are of equal length, hence the necessity for rectangular patterns.We present a novel method for analysing patterns with rows of different lengths. This enables finding all occurrences of a nonrectangular figure of heightm in ann×n text in time . We make use of thesmaller matching problem.The smaller matching problem is that of finding all appearances of a numerical one dimensional pattern in a numerical one-dimensional text, where every element of the pattern is no greater than the corresponding text element.Partially supported by NSF grant CCR-88-03641 and a University of Maryland full year research award.Supported by a University of Maryland Graduate Fellowship, an ACM Samuel M. Alexander Fellowship and NSF grant CCR-88-03641.     

Numerical Simulation of Submarine Groundwater Flow in the Coastal Aquifer at the Palmahim Area, the Mediterranean Coast of Israel

The lower sub-aquifers of the Mediterranean coastal aquifer of Israel, at the Palmahim area, are hypothesized to be laterally blocked to connection with the sea, and thus to seawater intrusion. This is mostly due to the detection of fresh water bodies at these sub-aquifers. This study examine this hypothesis by using two dimensional numerical model simulations of the groundwater flow system at this area, which conducted in order to reveal which hydrogeological setting enables the existence of these fresh water bodies in the lower sub-aquifers and to assess the on-land pumping rates that will prevent their salinization. The hydrogeological settings were examined by steady state simulations followed by simulations of the last 15,000 years sea level changes. These simulations imply that the presence of fresh water in the lower sub-aquifer, whether blocked or connected to the sea, requires offshore separation between the upper and lower sub-aquifers. On-land pumping simulations, with a well located inside the lower sub-aquifers at the shoreline, show a maximum pumping rate of 250 m³/m strip width/year, hereafter m²/year, to prevent the salinization of the lower sub-aquifers. The various pumping scenarios revealed differences in salinization trends between the scenarios with impermeable separating layers and those with semi permeable layers. Scenarios with extreme pumping rates emphasize these differences, and together with field test, can allow assessing the amount of separation between the sub-aquifers.     

Evaluation of suspended load transport rate using transport formulas and artificial neural network models （Case study： Chelchay Catchment）＊

Accurate estimation of sediment load or transport rate is very important to a wide range of water resources projects. This study was undertaken to determine the most appropriate model to predict suspended load in the Chelchay Watershed, northeast of Iran. In total, 59 data series were collected from four gravel bed-rivers and a sand bed river and two depth integrating suspended load samplers to evaluate nine suspended load formulas and feed forward backpropagation Artificial Neural Network (ANN) structures. Although the Chang formula with higher correlation coefficient (r = 0.69) and lower Root Mean Square Error (RMSE = 0.013) is the best suspended load predictor among the nine studied formulas, the ANN models significantly outperform traditional suspended load formulas and show their superior performance for all statistical parameters. Among different ANN structures two models including 4 inputs, 4 hidden and one output neurons, and 4 inputs, 4 and one hidden and one output neurons provide the best simulation with the RMSE values of 0.0009 and 0.001, respectively.     

Efficient biodegradation of naphthalene by a newly characterized indigenous Achromobacter sp. FBHYA2 isolated from Tehran Oil Refinery Complex

A bacterial strain, FBHYA2, capable of degrading naphthalene, was isolated from the American Petroleum Institute (API) separator of the Tehran Oil Refinery Complex (TORC). Strain FBHYA2 was identified as Achromobacter sp. based on physiological and biochemical characteristics and also phylogenetic similarity of 16S rRNA gene sequence. The optimal growth conditions for strain FBHYA2 were pH 6.0, 30 °C and 1.0% NaCl. Strain FBHYA2 can utilize naphthalene as the sole source of carbon and energy and was able to degrade naphthalene aerobically very fast, 48 h for 96% removal at 500 mg/L concentration. The physiological response of Achromobacter sp., FBHYA2 to several hydrophobic chemicals (aliphatic and aromatic hydrocarbons) was also investigated. No biosurfactant was detected during bacterial growth on any aliphatic/aromatic hydrocarbons. The results of hydrophobicity measurements showed no significant difference between naphthalene- and LB-grown cells. The capability of the strain FBHYA2 to degrade naphthalene completely and rapidly without the need to secrete biosurfactant may make it an ideal candidate to remediate polycyclic aromatic hydrocarbon (PAH)-contaminated sites.