常规公交线网运力配置双层规划模型

双层规划研究的是两个各具有目标函数的决策者之间按有序的和非合作方式进行的相互作用,上层决策者优先作出决策,下层决策者在上层决策信息下按自己的利益作出反应,由于一方的行为影响另一方的策略选择和目标的实现,并且任何一方又不能完全控制另一方的选择行为,因此上层决策者要根据下层的反应做出符合自身利益的最终决策。而公交车辆配置正符合双层规划模型的思想,所以本论文采用双层规划模型来描述车辆配置与客流量之间的相互作用,从而优化公交线网的车辆配置。     

Dirichlet空间上的循环复合算子

该文主要证明了在Dirichlet空间上由复合算子{C\-φ:φ∈Aut(D)}生成的代数为循环算子代数;同时对任意的解析映射φ:D→D,C\-φ都不可能为超循环算子给出了证明.     

Dirichlet型空间上的乘子

本文主要根据τ与μ的不同取值分三种情况刻划了Cn中单位球上Dirichlet 型空间上的点乘子空间M(Dτ,Dμ),并通过两个函数的构造表明:当τ≤n时,包含 关系M(Dτ)(?)Dτ和当τ>μ,τ>n-1时,包含关系M(Dτ)(?) M(Dμ)是严格的.     

Estimation over Curves of the Functions Given by Dirichlet Series on a Half-Plane

We study the maximal term of the Hadamard composition of Dirichlet series with real exponents. We obtain a lower estimate for the sum of a Dirichlet series over a curve arbitrarily approaching the convergence line.     

Translations and Associated Dirichlet Polyhedra in Complex Hyperbolic Space

We study a nonidentity transvection (i.e. (strictly) hyperbolic isometry) or nonidentity Heisenberg translation f of complex hyperbolic space H ⁿ and a Dirichlet polyhedron P of the cyclic group f. We have four main results: (a) If z & in H ⁿ and the axis of a nonidentity transvection are not complex collinear, then, roughly speaking, any two distinct 'naturally arising' geodesics passing through z are not complex collinear. (b) If g is also a transvection or Heisenberg translation of H ⁿ and z & in H ⁿ such that f(z)=g(z) and f ^–1(z)=g ^–1(z), then f=g. (c) We classify all this kind of polyhedra up to congruence in H ⁿ. (d) We obtain an equivalent condition for P to be cospinal (which means that the complex spines of the two sides of P coincide) in terms of the distance of the spines of the two sides of P.     

Nonlinear Filtering for Diffusions in Random Environments

Suppose that the signal X to be estimated is a diffusion process in a random medium W and the signal is correlated with the observation noise. We study the historical filtering problem concerned with estimating the signal path up until the current time based upon the back observations. Using Dirichlet form theory, we introduce a filtering model for general rough signal X ^W and establish a multiple Wiener integrals representation for the unnormalized pathspace filtering process. Then, we construct a precise nonlinear filtering model for the process X itself and give the corresponding Wiener chaos decomposition.     

On Non-Continuous Dirichlet Processes

We introduce here some Itô calculus for non-continuous Dirichlet processes. Such calculus extends what was known for continuous Dirichlet processes or for semimartingales. In particular we prove that non-continuous Dirichlet processes are stable under C ¹ transformation.     

On the Exceptional Zeros of Rankin–Selberg L-Functions

The main objects of study in this article are two classes of Rankin–Selberg L-functions, namely L(s,f×g) and L(s, sym²(g)× sym²(g)), where f,g are newforms, holomorphic or of Maass type, on the upper half plane, and sym²(g) denotes the symmetric square lift of g to GL(3). We prove that in general, i.e., when these L-functions are not divisible by L-functions of quadratic characters (such divisibility happening rarely), they do not admit any LandauSiegel zeros. Such zeros, which are real and close to s=1, are highly mysterious and are not expected to occur. There are corollaries of our result, one of them being a strong lower bound for special value at s=1, which is of interest both geometrically and analytically. One also gets this way a good bound onthe norm of sym²(g).     

A problem of D.H. Lehmer and its mean square value formula

Let q be an odd positive integer and let a be an integer coprime to q. For each integer b coprime to q with 1?b<q, there is a unique integer c coprime to q with 1?c<q such that . Let N(a,q) denote the number of solutions of the congruence equation with 1?b,c<q such that b,c are of opposite parity. The main purpose of this paper is to use the properties of Dedekind sums, the properties of Cochrane sums and the mean value theorem of Dirichlet L-functions to study the asymptotic property of the mean square value , and give a sharp asymptotic formula.     

Cyclic networks with general blocking and starvation

We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k₁..., k_m) subject to a fixed total buffer capacityK=k ₁ +... + k_m. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818.