基于理想点-矢量投影法的创新需求权重确定方法

现有的创新需求权重计算方法大多只考虑顾客、技术人员和决策者三者中的一方或者两方对创新需求权重的影响,鲜有方法将三方同时纳入需求权重计算过程,这很容易造成因信息考虑不全面,造成需求权重的精确度不高或失准等问题。鉴于此,本文提出一种基于理想点-矢量投影法的创新需求权重确定方法,它将顾客、技术人员和决策者三方的诉求在三维矢量空间中进行集成。分别计算创新需求的需求类别因子、需求技术成熟度和需求偏好度,采用理想点-矢量投影法得到理想需求矢量,并在此基础上计算每项创新需求权重值。文章最后通过汽车方向盘的研发的案例,验证了所提方法的有效性和可行性。     

Finite element computations of viscoelastic two-phase flows using local projection stabilization

A three-field local projection stabilized (LPS) finite element method is developed for computations of a three-dimensional axisymmetric buoyancy driven liquid drop rising in a liquid column where one of the liquid is viscoelastic. The two-phase flow is described by the time-dependent incompressible Navier-Stokes equations, whereas the viscoelasticity is modeled by the Giesekus constitutive equation in a time-dependent domain. The arbitrary Lagrangian-Eulerian (ALE) formulation with finite elements is used to solve the governing equations in the time-dependent domain. Interface-resolved moving meshes in ALE allows to incorporate the interfacial tension force and jumps in the material parameters accurately. A one-level LPS based on an enriched approximation space and a discontinuous projection space is used to stabilize the numerical scheme. A comprehensive numerical investigation is performed for a Newtonian drop rising in a viscoelastic fluid column and a viscoelastic drop rising in a Newtonian fluid column. The influence of the viscosity ratio, Newtonian solvent ratio, Giesekus mobility factor, and the Eötvös number on the drop dynamics are analyzed. The numerical study shows that beyond a critical Capillary number, a Newtonian drop rising in a viscoelastic fluid column experiences an extended trailing edge with a cusp-like shape and also exhibits a negative wake phenomena. However, a viscoelastic drop rising in a Newtonian fluid column develops an indentation around the rear stagnation point with a dimpled shape.     

基于自由曲面反射镜的低投射比超短焦投影物镜的光学设计

为了设计低投射比的超短焦投影物镜,本文采用自由曲面和折反式的光路结构设计了一种具有低投射比的超短焦投影物镜系统。该物镜由一个旋转对称的折射透镜组和一个自由曲面反射镜组成。采用11.938 mm的数字微镜器件(DMD)作为空间光调制器产生图像源。采用法线加权迭代优化的方法计算自由曲面。最后,分析了系统的性能。仿真结果表明:超短焦投影物镜可在580 mm的投影距离处实现3048 mm尺寸的大屏幕投影,系统的投射比低至0.19,系统的最大畸变小于0.72%。能够满足低投射比超短焦投影物镜的设计要求。该投影系统具有低投射比、低畸变、投影效果好等优点,可为超短焦投影系统的进一步发展提供有益参考。     

平板几何迁移算子的特征值问题

研究L^p(1相似文献   

Effects of pulsatile flow and straight length on low-density lipoprotein transport in a curved arterial wall

Abnormal accumulation of macromolecules such as low-density lipoproteins (LDLs) in the arterial wall causes narrowing and blockage of vessels, which leads to atherosclerosis. Effects of pulsatile nature of blood flows as well as the initial length on transport of the LDL species in the arterial boundary layer region are analyzed numerically in the present work. The set of governing equations consisting of continuity, Navier-Stokes, and species transport is solved using a projection method based on the second-order central difference discretization. The obtained results are in excellent agreement with the pertinent data. The computational results imply that the flow field and concentration distribution are time dependent but the variation of the filtration velocity can be ignored. The LDL concentration boundary layer thickness decreases in the outer part and increases in the inner part for both with or without straight length. Presence of initial straight length generates about 26% growth in the boundary layer thickness, although its effect on the LDL surface concentration (LSC) is negligible. The maximum LSC is related to the regions with minimum wall shear stress in the inner part of the curved artery, which have more potential for formation of atherosclerosis. A new numerical correlation between the LSC and boundary layer thickness is proposed and examined.     

Uncertainty principles for locally compact quantum groups

In this paper, we prove the Donoho–Stark uncertainty principle for locally compact quantum groups and characterize the minimizer which are bi-shifts of group-like projections. We also prove the Hirschman–Beckner uncertainty principle for compact quantum groups and discrete quantum groups. Furthermore, we show Hardy's uncertainty principle for locally compact quantum groups in terms of bi-shifts of group-like projections.     

On the solutions of the equation AXB = C under Toeplitz‐like and Hankel matrices constraint

In this paper, we are mainly concerned with 2 types of constrained matrix equation problems of the form AXB=C, the least squares problem and the optimal approximation problem, and we consider several constraint matrices, such as general Toeplitz matrices, upper triangular Toeplitz matrices, lower triangular Toeplitz matrices, symmetric Toeplitz matrices, and Hankel matrices. In the first problem, owing to the special structure of the constraint matrix , we construct special algorithms; necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions. In the second problem, we use von Neumann alternating projection algorithm to obtain the solutions of problem. Then we give 2 numerical examples to demonstrate the effectiveness of the algorithms.     

A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings

In this paper, by using Bregman distance, we introduce a new iterative process involving products of resolvents of maximal monotone operators for approximating a common element of the set of common fixed points of a finite family of multi-valued Bregman relatively nonexpansive mappings and the solution set of the multiple-sets split feasibility problem and common zeros of maximal monotone operators. We derive a strong convergence theorem of the proposed iterative algorithm under appropriate situations. Finally, we mention several corollaries and two applications of our algorithm.     

Corrigendum to: on the inheritance of the strongly π-extending property

In this corrigendum, we provide correct versions of Theorem 2.8 and Corollary 3.2, retract two consequences of the previous form of the Theorem 2.8. To this end, the main results of the article remain after the aforementioned changes.     

Meyniel's conjecture holds for random d‐regular graphs

In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3.