从废水到新能源:光催化燃料电池的优化与应用

随着经济的飞速发展,社会对能源的需求日益扩大,对工业废水的无害化处理也提出了更高的要求。光催化燃料电池 (photocatalytic fuel cell, PFC) 在燃料电池中引入半导体光催化材料作为电极,实现了有机污染物高效降解和同步对外产电的双重功能,在废水无害化与资源化利用方面具有潜在的应用价值。半导体光催化电极是PFC系统高效运行的核心组件,增强其可见光响应和光生载流子分离是提高PFC性能的关键策略。反应器结构设计和运行参数优化也有利于改善PFC性能。本文从PFC基本原理和应用入手,综述了PFC在环境污染物资源化处理中的研究进展,并详细阐述了提高PFC的污染控制性能和产电效率的优化手段,为进一步设计高效稳定的PFC系统并实现其在水污染控制和清洁能源生产中的应用提供理论指导。     

VRPTW的扰动恢复及其TABU SEARCH算法

本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.     

All-optical frequency multiplication/recovery based on a semiconductor optical amplifier ring cavity

A novel scheme for all-optical frequency multiplication/recovery based on a semiconductor optical amplifier ring cavity is proposed and investigated numerically. The results show, for a 2.5 GHz driving pulse train, it can be generated 5-25 GHz repetition rate pulse trains with low clock amplitude jitter, polarization independence and high peak power. Furthermore, the extraction of the clock signal from a pseudorandom bit sequence signal can be realized based on the proposed scheme.     

Survivability in IP-over-WDM Networks: WDM Lightpath Protection versus IP LSP Protection

This article compares the performance of WDM lightpath protection and IP LSP protection schemes for IP-over-WDM networks. A mathematical formulation of the maximum throughput problem is presented and analytical expressions for recovery time are derived for both schemes. The throughputs and recovery times are analyzed and compared. Results show that the IP LSP protection scheme presents higher throughputs then WDM lightpath protection. The IP LSP protection scheme, providing individual IP LSP protection has, however, scalability problems. This scheme presents high recovery times when a failure affects many lightpaths and many hops are allowed for the primary routes of IP LSPs.     

具有消息恢复的数字签名方案的一个注记

对具有消息恢复的数字签名方案提出了两种攻击方法.此外,对原方案进行了改进,通过对改进方案的安全性分析得出结论:改进方案比原方案更安全,并且消息恢复过程只需要计算一次大数模幂乘和两次单向函数.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Sparse-grid finite-volume multigrid for 3D-problems

We introduce a multigrid algorithm for the solution of a second order elliptic equation in three dimensions. For the approximation of the solution we use a partially ordered hierarchy of finite-volume discretisations. We show that there is a relation with semicoarsening and approximation by more-dimensional Haar wavelets. By taking a proper subset of all possible meshes in the hierarchy, a sparse grid finite-volume discretisation can be constructed.The multigrid algorithm consists of a simple damped point-Jacobi relaxation as the smoothing procedure, while the coarse grid correction is made by interpolation from several coarser grid levels.The combination of sparse grids and multigrid with semi-coarsening leads to a relatively small number of degrees of freedom,N, to obtain an accurate approximation, together with anO(N) method for the solution. The algorithm is symmetric with respect to the three coordinate directions and it is fit for combination with adaptive techniques.To analyse the convergence of the multigrid algorithm we develop the necessary Fourier analysis tools. All techniques, designed for 3D-problems, can also be applied for the 2D case, and — for simplicity — we apply the tools to study the convergence behaviour for the anisotropic Poisson equation for this 2D case.     

统计优化迭代法测量质子交换波导折射率分布

提出了一种用于拟合测量渐变波导的折射率分布的新的理论处理。该方法把统计优化手段导入循环迭代法 ,可适用于费米函数这一类曲线变化范围大、且有多个自变量的函数。实验上用焦磷酸质子交换制备了LiNbO3波导样品 ,用该方法对退火后的折射率分布作了测量拟合 ,折射率拟合值与实验值的均方差为± 8.2× 10 - 4。     

一维问题的一种积分形式的流量重构算法

1引言我们考虑如下一维二阶椭圆边界值问题(-(β(x)p′)(x))′=f(x),x∈(a,b) p(a)=p(b)=0(1))其中β=β(x)是一恒正函数,且β∈H~1(a,b),f∈L~2(a,b)．事实上,在此条件下,我们可保证p∈H~2(a,b)(见[1],[2])．(1)之弱形式为：求p∈H_0~1(a,b)使得a(p,q)=(f,q),(?)q∈H_0~1(a,b),(2)其中a(p,q)=(?)_a~bβp′q′dx,(f,g)=(?)_a~bfqdx．给定(a,b)的一个分割α=x_0＜x_1＜…＜x_(n-1)＜x_n=b,令h=(?)(x_i-x_(i-1)),(?)_i表示通常相应于节点x_i的形状函数,即(?)_i是连续的分段线性函数且满足(?)_i(x_k)=δ_(ik),这里δ_(ik)=(?)i,k=0,1,…,n．又记V_h~0=span{(?)_1,(?)_2,…,(?)_(n-1)),取V_h~0作为p的逼近空间,则求解(1)的标准有限元格式为：求ph∈V_h~0使得     

FRS-XRSA与SAXS研究硬弹性聚丙烯的结晶度、取向与超结构Ⅲ应变与回复

应用全倒易空间Ｘ 射线散射理论分析（ＦＲＳ ＸＲＳＡ）与ＳＡＸＳ研究了ＨＥＰＰ在应变（ε）与回复（Ｒ）过程中结晶、取向与超结构的变化．结果指出，ε可以诱发结晶，但当ε≥３０％后，结晶度（ＸＷＣ）趋于不变：ε可以导致晶粒破碎；ε与Ｒ对取向分布与平均取向基本上无影响，这符合片晶平行分离模型，而非叶簧弯曲模型；发现，在ε≤３０％时，层状片晶的分离为主要过程，而当ε＞３０％后，则分离的片晶会发生断层滑移；ε可以诱发微孔，类似地当ε＞２０％，微孔尺寸亦趋不变．从凝聚态结构阐明了ＨＥＰＰ在ε Ｒ过程中不同阶段的结构变化