It will be shown that a normed partially ordered vector space is linearly, norm, and order isomorphic to a subspace of a normed Riesz space if and only if its positive cone is closed and its norm p satisfies p(x)p(y) for all x and y with -yxy. A similar characterization of the subspaces of M-normed Riesz spaces is given. With aid of the first characterization, Krein's lemma on directedness of norm dual spaces can be directly derived from the result for normed Riesz spaces. Further properties of the norms ensuing from the characterization theorem are investigated. Also a generalization of the notion of Riesz norm is studied as an analogue of the r-norm from the theory of spaces of operators. Both classes of norms are used to extend results on spaces of operators between normed Riesz spaces to a setting with partially ordered vector spaces. Finally, a partial characterization of the subspaces of Riesz spaces with Riesz seminorms is given. 相似文献
We study two new cyclic reservation schemes for the efficient operation of systems consisting of a single server and multiple queues. The schemes are the Globally Gated regime and the Cyclic-Reservation Multiple-Access (CRMA). Both procedures possess mechanisms for prioritizing the queues and lend themselves to a closed-form analysis. The combination of these two properties allows for effective and efficient operation of the systems, for which we provide a thorough delay analysis and derive simple rules for optimal operation. 相似文献
We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by a shot-noise process. A shot-noise rate emerges naturally in cases where the arrival rate tends to exhibit sudden increases (or shots) at random epochs, after which the rate is inclined to revert to lower values. Exponential decay of the shot noise is assumed, so that the queueing systems are amenable to analysis. In particular, we perform transient analysis on the number of jobs in the queue jointly with the value of the driving shot-noise process. Additionally, we derive heavy-traffic asymptotics for the number of jobs in the system by using a linear scaling of the shot intensity. First we focus on a one-dimensional setting in which there is a single infinite-server queue, which we then extend to a network setting. 相似文献
We consider the GI/GI/1 queue with regularly varying service requirement distribution of index −α. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1−α, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index −α. That raises the question whether there exist service disciplines that give rise to a regularly varying sojourn time distribution
with any index −γ∈[−α,1−α]. In this paper that question is answered affirmatively. 相似文献
We consider a network of infinite-server queues where the input process is a Cox process of the following form: The arrival rate is a vector-valued linear transform of a multivariate generalized (i.e., being driven by a subordinator rather than a compound Poisson process) shot-noise process. We first derive some distributional properties of the multivariate generalized shot-noise process. Then these are exploited to obtain the joint transform of the numbers of customers, at various time epochs, in a single infinite-server queue fed by the above-mentioned Cox process. We also obtain transforms pertaining to the joint stationary arrival rate and queue length processes (thus facilitating the analysis of the corresponding departure process), as well as their means and covariance structure. Finally, we extend to the setting of a network of infinite-server queues.
This paper considers the supremumm of the service times of the customers served in a busy period. For theG/G/s queue the tail behaviour of the distributionm (w) ofm is compared with that of the service time distribution. For theEk/G/1 queue an expression for the joint distribution ofm and of the number of customers served in the busy period is derived.Finally some detailed results for theM/M/1 queue are mentioned.
Zusammenfassung Diese Arbeit befaßt sich mit dem Supremumm der Bedienungszeiten der in einer Arbeitsperiode bedienten Kunden. Im Falle des BedienungssystemsG/G/s werden die Wahrscheinlichkeiten für große Werte vonm verglichen mit den Wahrscheinlichkeiten für große Bedienungszeiten. Im Falle vonEk/G/1 wird ein expliziter Ausdruck für die gemeinsame Verteilung vonm und der Anzahl der in der Arbeitsperiode bedienten Kunden gewonnen. Einige Resultate fürM/M/1 bilden den Abschluß.
In this paper we consider a tandem queueing model for a sequence of multiplexers at the edge of an ATM network. All queues of the tandem queueing model have unit service times. Each successive queue receives the output of the previous queue plus some external arrivals. For the case of two queues in series, we study the end-to-end delay of a cell (customer) arriving at the first queue, and the covariance of its delays at both queues. The joint queue length process at all queues is studied in detail for the 2-queue and 3-queue cases, and we outline an approach to the case of an arbitrary number of queues in series.Part of the research of this author has been supported by the European Grant BRA-QMIPS of CEC DG XIII.The research of this author was done during the time that he was affiliated with CWI, in a joint project with PTT Research. 相似文献
Antisense oligonucleotide (AON)-mediated exon skipping is a powerful tool to manipulate gene expression. In the present study we investigated the potential of exon skipping by local injection in the central nucleus of the amygdala (CeA) of the mouse brain. As proof of principle we targeted the splicing of steroid receptor coactivator-1 (SRC-1), a protein involved in nuclear receptor function. This nuclear receptor coregulator exists in two splice variants (SRC-1a and SRC-1e) which display differential distribution and opposing activities in the brain, and whose mRNAs differ in a single SRC-1e specific exon.
Methods
For proof of principle of feasibility, we used immunofluorescent stainings to study uptake by different cell types, translocation to the nucleus and potential immunostimulatory effects at different time points after a local injection in the CeA of the mouse brain of a control AON targeting human dystrophin with no targets in the murine brain. To evaluate efficacy we designed an AON targeting the SRC-1e-specific exon and with qPCR analysis we measured the expression ratio of the two splice variants.
Results
We found that AONs were taken up by corticotropin releasing hormone expressing neurons and other cells in the CeA, and translocated into the cell nucleus. Immune responses after AON injection were comparable to those after sterile saline injection. A successful shift of the naturally occurring SRC-1a:SRC-1e expression ratio in favor of SRC-1a was observed, without changes in total SRC-1 expression.
Conclusions
We provide a proof of concept for local neuropharmacological use of exon skipping by manipulating the expression ratio of the two splice variants of SRC-1, which may be used to study nuclear receptor function in specific brain circuits. We established that exon skipping after local injection in the brain is a versatile and useful tool for the manipulation of splice variants for numerous genes that are relevant for brain function. 相似文献