Biocatalytic process intensification via efficient biocatalyst immobilization,miniaturization, and process integration

1. Download : Download high-res image (205KB)
2. Download : Download full-size image

     

Modal part analysis of slosh of the liquid in a cylindrical container in the case of small bond number

ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｍｏｔｉｏｎｏｆｔｈｅｉｎｖｉｓｃｉｄ,ｉｒｒｏｔａｔｉｏｎａｌａｎｄｉｎｃｏｍｐｒｅｓｓｉｂｌｅｆｌｕｉｄｉｎａｃｙｌｉｎｄｒｉｃａｌｃｏｎｔａｉｎｅｒｗｉｔｈｒａｄｉｕｓａｉｓｇｏｖｅｒｎｅｄｂｙＦｉｇ．１Ｓｌｏｓｈｏｆａｌｉｑｕｉｄｉｎａｃｙｌｉｎｄｒｉｃａｌｃｏｎｔａｉｎｅｒ２＝０　　（ｉｎＶ）,（１）ｒ＝０　　（ｏｎｒ＝ａ）,（２）ｚ＝０　　（ｏｎｚ＝－ｈ）,（３）ηｔ＋·η＝ｚ　　（ｏｎｚ＝η）,（４）ｔ＋１２｜…     

黄金数的整数次幂与Fibonacci-Lucas数的若干关系式

给出Fibonacci等距子列定义,由此入手得到黄金数的整数次幂与Fibonacci数以及Lucas数的若干关系式.     

模糊多属性群决策一致性分析研究

群决策过程中各成员可能以不同的方式给出决策信息,讨论了四种不同决策信息的统一方法,设置了模糊环境下进行一致性判断的准则,介绍了梯形模糊数在群决策过程中的运算方法,举例说明了这种方法的应用步骤.     

Halin-图的邻强边染色

图G(V,E)的正常κ-边染色f叫做图G(V,E)的κ-邻强边染色当且仅当任意uv∈E(G)满足f[u]≠f[v],其中,f[u]={f(uw)|uw∈E(G)},称f是G的κ-临强边染色,简记为κ-ASEC.并且x′_as(G)=min{k|κ-ASEC of G}叫做G(V,E)的邻强边色数.本文研究了△(G)≥5的Halin-图的邻强边色数.     

Connected Domatic Number in Planar Graphs

A dominating set in a graph G is a connected dominating set of G if it induces a connected subgraph of G. The connected domatic number of G is the maximum number of pairwise disjoint, connected dominating sets in V(G). We establish a sharp lower bound on the number of edges in a connected graph with a given order and given connected domatic number. We also show that a planar graph has connected domatic number at most 4 and give a characterization of planar graphs having connected domatic number 3.     

区间型多属性群体专家权重的确定方法

针对方案偏好和属性值均为区间数的多属性群决策问题,研究了群体专家权重的确定,并提出了一种新的群决策方法．通过定义区间数向量的内积,计算专家评判的相似度和差异度,进而客观地确定了专家的权重．求解最小化主、客观偏差的目标规划模型,得到了属性的权重,利用方案的群体综合属性值给出排序结果．供应商选择的应用实例验证了方法的可行性和合理性．     

Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K_(7,n) when 7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C(x) denote the set of colors of vertex x and of the edges incident with x, we call C(x) the color set of x. If C(u)≠ C(v) for any two different vertices u and v of V(G), then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by χ_(vt)~e(G) and is called the VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.     

图的倍图与补倍图

计算机科学数据库的关系中遇到了可归为倍图或补倍图的参数和哈密顿圈的问题．对简单图C,如果V（D（G））：V（G）∪V（G′）E（D（G））=E（C）∪E（C″）U{vivj′｜vi∈V（G）,Vj′∈V（G′）且vivj∈E（G））那么,称D（C）是C的倍图,如果V（D（G））=V（C）∪V（G′）,E（D（C））：E（C）∪E（G′）∪{vivj′}vi∈V（G）,vj′∈V（G’）and vivj∈（G））,称D（C）是G的补倍图,这里G′是G的拷贝．本文研究了D（G）和D的色数,边色数,欧拉性,哈密顿性和提出了D（G） 的边色数是D（G）的最大度等公开问题．     

Computing the conditioning of the components of a linear least‐squares solution

In this paper, we address the accuracy of the results for the overdetermined full rank linear least‐squares problem. We recall theoretical results obtained in (SIAM J. Matrix Anal. Appl. 2007; 29 (2):413–433) on conditioning of the least‐squares solution and the components of the solution when the matrix perturbations are measured in Frobenius or spectral norms. Then we define computable estimates for these condition numbers and we interpret them in terms of statistical quantities when the regression matrix and the right‐hand side are perturbed. In particular, we show that in the classical linear statistical model, the ratio of the variance of one component of the solution by the variance of the right‐hand side is exactly the condition number of this solution component when only perturbations on the right‐hand side are considered. We explain how to compute the variance–covariance matrix and the least‐squares conditioning using the libraries LAPACK (LAPACK Users' Guide (3rd edn). SIAM: Philadelphia, 1999) and ScaLAPACK (ScaLAPACK Users' Guide. SIAM: Philadelphia, 1997) and we give the corresponding computational cost. Finally we present a small historical numerical example that was used by Laplace (Théorie Analytique des Probabilités. Mme Ve Courcier, 1820; 497–530) for computing the mass of Jupiter and a physical application if the area of space geodesy. Copyright © 2008 John Wiley & Sons, Ltd.