喀斯特河流溶解态稀土元素组成变化及其控制因素

以化学萃取一反萃取分离法为手段，结合等离子质谱分析仪测量了喀斯特地区乌江、沅江两大水系的枯水期河流的溶解态稀土元素含量。该两河流的化学组成代表了流经碳酸盐岩地层的河水的化学组成。与世界其它地区低pH的河水不同，喀斯特地区河水溶解态稀土元素含量较低，页岩标准化配分模式并不平坦，轻、重稀土元素分异因河流的不同而不同，乌江水系上游轻稀土元素(LREE)相对重稀土元素(HREE)富集，中下游HREE相对于LREE富集，沅江水系河水HREE相对于LREE富集，页岩标准化配分模式具明显的Ce、Eu负异常。乌江、沅江及其支流有高的溶解盐，含有较高的溶质浓度，河水水化学(高碱度、高离子含量、高pH值)和水／粒相互作用控制了喀斯特河水中溶解态稀土元素的含量和轻、重稀土元素的分异。

Salicylic acid dependent signaling promotes basal thermotolerance but is not essential for acquired thermotolerance in Arabidopsis thaliana

Clarke, S. M., Mur, L. A. J., Wood, J. E., & Scott, I. M. (2004). Salicylic acid dependent signaling promotes basal thermotolerance but is not essential for acquired thermotolerance in Arabidopsis thaliana. The Plant Journal, 38(3), 432-447. Sponsorship: BBSRC RAE2008

Stability of time-delay systems via Lyapunov functions

In this paper, a Lyapunov function candidate is introduced for multivariable systems with inner delays, without assuming a priori stability for the nondelayed subsystem. By using this Lyapunov function, a controller is deduced. Such a controller utilizes an input-output description of the original system, a circumstance that facilitates practical applications of the proposed approach.

Dynamic Window-Constrained Scheduling for Real-Time Media Streaming

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while at the same time guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for link bandwidth by a set of real-time (i.e., window-constrained) streams can exceed 100% and still ensure all window-constraints are met. In fact, we show how it is possible to guarantee worst-case per-stream bandwidth and delay constraints while utilizing all available link capacity. Finally, we show how best-effort packets can be serviced with fast response time, in the presence of window-constrained traffic.

Application-Level Document Caching in the Internet

With the increasing demand for document transfer services such as the World Wide Web comes a need for better resource management to reduce the latency of documents in these systems. To address this need, we analyze the potential for document caching at the application level in document transfer services. We have collected traces of actual executions of Mosaic, reflecting over half a million user requests for WWW documents. Using those traces, we study the tradeoffs between caching at three levels in the system, and the potential for use of application-level information in the caching system. Our traces show that while a high hit rate in terms of URLs is achievable, a much lower hit rate is possible in terms of bytes, because most profitably-cached documents are small. We consider the performance of caching when applied at the level of individual user sessions, at the level of individual hosts, and at the level of a collection of hosts on a single LAN. We show that the performance gain achievable by caching at the session level (which is straightforward to implement) is nearly all of that achievable at the LAN level (where caching is more difficult to implement). However, when resource requirements are considered, LAN level caching becomes much more desirable, since it can achieve a given level of caching performance using a much smaller amount of cache space. Finally, we consider the use of organizational boundary information as an example of the potential for use of application-level information in caching. Our results suggest that distinguishing between documents produced locally and those produced remotely can provide useful leverage in designing caching policies, because of differences in the potential for sharing these two document types among multiple users.

Inferring Intersection Typings that are Equivalent to Call-by-Name and Call-by-Value Evaluations

We present a procedure to infer a typing for an arbitrary λ-term M in an intersection-type system that translates into exactly the call-by-name (resp., call-by-value) evaluation of M. Our framework is the recently developed System E which augments intersection types with expansion variables. The inferred typing for M is obtained by setting up a unification problem involving both type variables and expansion variables, which we solve with a confluent rewrite system. The inference procedure is compositional in the sense that typings for different program components can be inferred in any order, and without knowledge of the definition of other program components. Using expansion variables lets us achieve a compositional inference procedure easily. Termination of the procedure is generally undecidable. The procedure terminates and returns a typing if the input M is normalizing according to call-by-name (resp., call-by-value). The inferred typing is exact in the sense that the exact call-by-name (resp., call-by-value) behaviour of M can be obtained by a (polynomial) transformation of the typing. The inferred typing is also principal in the sense that any other typing that translates the call-by-name (resp., call-by-value) evaluation of M can be obtained from the inferred typing for M using a substitution-based transformation.

Use of semiconductor optical amplifiers in signal processing applications

We describe a 42.6 Gbit/s all-optical pattern recognition system which uses semiconductor optical amplifiers (SOAs). A circuit with three SOA-based logic gates is used to identify the presence of specific port numbers in an optical packet header.

Les facteurs de transcription du groupe PEA3: Régulateurs transcriptionnels dans le processus de cancérisation

Erm, Er81, and Pea3 are the three members of the PEA3 group which belong to the Ets transcription factors family. These proteins regulate transcription of multiple target genes, such as those encoding several matrix metalloproteinases (MMP), which are enzymes degrading the extracellular matrix during cancer metastasis. In fact, PEA3-group genes are often overexpressed in different types of human cancers that also over-express these MMP and display a disseminating phenotype. In experimental models, regulation of PEA3 group member expression has been shown to influence the metastatic process, thus suggesting that these factors play a key role in metastasis. © John Libbey Eurotext.

The Ets transcription factors of the PEA3 group: Transcriptional regulators in metastasis

The PEA3 group is composed of three highly conserved Ets transcription factors: Erm, Er81, and Pea3. These proteins regulate transcription of multiple genes, and their transactivating potential is affected by post-translational modifications. Among their target genes are several matrix metalloproteases (MMPs), which are enzymes degrading the extracellular matrix during normal remodelling events and cancer metastasis. In fact, PEA3-group genes are often over-expressed in different types of cancers that also over-express these MMPs and display a disseminating phenotype. Experimental regulation of the synthesis of PEA3 group members influences the metastatic process. This suggests that these factors play a key role in metastasis. © 2006 Elsevier B.V. All rights reserved.

The 26S proteasome system degrades the ERM transcription factor and regulates its transcription-enhancing activity

ERM is a member of the ETS transcription factor family. High levels of the corresponding mRNA are detected in a variety of human breast cancer cell lines, as well as in aggressive human breast tumors. As ERM protein is almost undetectable in these cells, high degradation of this transcription factor has been postulated. Here we have investigated whether ERM degradation might depend on the proteasome pathway. We show that endogenous and ectopically expressed ERM protein is short-lived protein and undergoes proteasome-dependent degradation. Deletion mutagenesis studies indicate that the 61 C-terminal amino acids of ERM are critical for its proteolysis and serve as a degradation signal. Although ERM conjugates with ubiquitin, this post-translational modification does not depend on the C-terminal domain. We have used an Ets-responsive ICAM-1 reporter plasmid to show that the ubiquitin-proteasome pathway can affect transcriptional function of ERM. Thus, ERM is subject to degradation via the 26S proteasome pathway, and this pathway probably plays an important role in regulating ERM transcriptional activity. © 2007 Nature Publishing Group. All rights reserved.

Cannibal Animal Games: A new variant of Tic-Tac-Toe

This paper presents a new partial two-player game, called the cannibal animal game, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each round a player chooses and occupies free cells. The first player Alice can occupy a cell in each turn and wins if she occupies a set of cells, the union of a subset of which is a translated, reflected and/or rotated copy of a previously agreed upon polyomino P (called an animal). The objective of the second player Bob is to prevent Alice from creating her animal by occupying in each round a translated, reflected and/or rotated copy of P. An animal is a cannibal if Bob has a winning strategy, and a non-cannibal otherwise. This paper presents some new tools, such as the bounding strategy and the punching lemma, to classify animals into cannibals or non-cannibals. We also show that the pairing strategy works for this problem.

Expression of the Ets transcription factor Erm is regulated through a conventional PKC signaling pathway in the Molt4 lymphoblastic cell line.

Erm, a member of the PEA3 group within the Ets family of transcription factors, is expressed in murine and human lymphocytes. Here, we show that in the human Molt4 lymphoblastic cell line, the erm gene expression is regulated by the conventional PKC (cPKC) pathway. To better characterize the molecular mechanism by which cPKC regulates Erm transcription in Molt4 cells, we tested proximal promoter deletions of the human gene, and identified a specific cPKC-regulated region between positions -420 and -115 upstream of the first exon.

A coarse grid extraction of sound signals for computational aeroacoustics

Sound waves are propagating pressure fluctuations, which are typically several orders of magnitude smaller than the pressure variations in the flow field that account for flow acceleration. On the other hand, these fluctuations travel at the speed of sound in the medium, not as a transported fluid quantity. Due to the above two properties, the Reynolds averaged Navier–Stokes equations do not resolve the acoustic fluctuations. This paper discusses a defect correction method for this type of multi-scale problems in aeroacoustics. Numerical examples in one dimensional and two dimensional are used to illustrate the concept. Copyright (C) 2002 John Wiley & Sons, Ltd.

Guided waves in a fluid-loaded transversely isotropic place

Dispersion relations are obtained for the propagation of symmetric and antisymmetric modes in a free transversely isotropic plate. Dispersion curves are plotted for the first four symmetric modes for a magnesium plate immersed in water. The first mode is highly damped and switches over to the second mode when the normalized frequency exceeds 12.

Research and perspectives on processing instruction

This volume tracks the impact processing instruction has made since its conception. It provides an overview of new research trends on measuring the relative effects of processing instruction. Firstly, the authors explain processing instruction, both its main theoretical underpinnings as well as the guidelines for developing structured input practices. Secondly, they review the empirical research conducted, to date, so that readers have an overview of new research carried out on the effects of processing instruction. The authors finally reflect on the generalizability and limits of the research on processing instruction and offer future directions for processing instruction research.