期刊文献+
共找到491篇文章
< 1 2 25 >
每页显示 20 50 100
A MIXED FINITE ELEMENT AND UPWIND MIXED FINITE ELEMENT MULTI-STEP METHOD FOR THE THREE-DIMENSIONAL POSITIVE SEMI-DEFINITE DARCY-FORCHHEIMER MISCIBLE DISPLACEMENT PROBLEM
1
作者 Yirang YUAN Changfeng LI +1 位作者 Huailing SONG Tongjun SUN 《Acta Mathematica Scientia》 2025年第2期715-736,共22页
In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow e... In this paper,a composite numerical scheme is proposed to solve the threedimensional Darcy-Forchheimer miscible displacement problem with positive semi-definite assumptions.A mixed finite element is used for the fow equation.The velocity and pressure are computed simultaneously.The accuracy of velocity is improved one order.The concentration equation is solved by using mixed finite element,multi-step difference and upwind approximation.A multi-step method is used to approximate time derivative for improving the accuracy.The upwind approximation and an expanded mixed finite element are adopted to solve the convection and diffusion,respectively.The composite method could compute the diffusion flux and its gradient.It possibly becomes an eficient tool for solving convection-dominated diffusion problems.Firstly,the conservation of mass holds.Secondly,the multi-step method has high accuracy.Thirdly,the upwind approximation could avoid numerical dispersion.Using numerical analysis of a priori estimates and special techniques of differential equations,we give an error estimates for a positive definite problem.Numerical experiments illustrate its computational efficiency and feasibility of application. 展开更多
关键词 Darcy-Forchheimer fow three-dimensional positive semi-definite problem upwind mixed finite element multi-step method conservation of mass convergence analysis
在线阅读 下载PDF
Two kinds of contact problems in three-dimensional icosahedral quasicrystals 被引量:11
2
作者 Xuefen ZHAO Xing LI Shenghu DING 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2015年第12期1569-1580,共12页
Two kinds of contact problems, i.e., the frictional contact problem and the adhesive contact problem, in three-dimensional (3D) icosahedral quasicrystals are dis- cussed by a complex variable function method. For th... Two kinds of contact problems, i.e., the frictional contact problem and the adhesive contact problem, in three-dimensional (3D) icosahedral quasicrystals are dis- cussed by a complex variable function method. For the frictional contact problem, the contact stress exhibits power singularities at the edge of the contact zone. For the adhe- sive contact problem, the contact stress exhibits oscillatory singularities at the edge of the contact zone. The numerical examples show that for the two kinds of contact problems, the contact stress exhibits singularities, and reaches the maximum value at the edge of the contact zone. The phonon-phason coupling constant has a significant effect on the contact stress intensity, while has little impact on the contact stress distribution regu- lation. The results are consistent with those of the classical elastic materials when the phonon-phason coupling constant is 0. For the adhesive contact problem, the indentation force has positive correlation with the contact displacement, but the phonon-phason cou- pling constant impact is barely perceptible. The validity of the conclusions is verified. 展开更多
关键词 three-dimensional (3D) icosahedral quasicrystal Riemann-Hilbert problem contact problem SINGULARITY complex variable function method
在线阅读 下载PDF
Three-dimensional Computational Fluid Dynamics Modeling of Two-phase Flow in a Structured Packing Column 被引量:4
3
作者 张小斌 姚蕾 +1 位作者 邱利民 张学军 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2013年第9期959-966,共8页
Characterizing the complex two-phase hydrodynamics in structured packed columns requires a power- ful modeling tool. The traditional two-dimensional model exhibits limitations when one attempts to model the de- tailed... Characterizing the complex two-phase hydrodynamics in structured packed columns requires a power- ful modeling tool. The traditional two-dimensional model exhibits limitations when one attempts to model the de- tailed two-phase flow inside the columns. The present paper presents a three-dimensional computational fluid dy- namics (CFD) model to simulate the two-phase flow in a representative unit of the column. The unit consists of an CFD calculations on column packed with Flexipak 1Y were implemented within the volume of fluid (VOF) mathe- matical framework. The CFD model was validated by comparing the calculated thickness of liquid film with the available experimental data. Special attention was given to quantitative analysis of the effects of gravity on the hy- drodynamics. Fluctuations in the liquid mass flow rate and the calculated pressure drop loss were found to be quali- tatively in agreement with the experimental observations. 展开更多
关键词 structured packing column two-phase flow computational fluid dynamics three-dimension
在线阅读 下载PDF
An Efficient Three-Dimensional Coupled Normal Mode Model and Its Application to Internal Solitary Wave Problems 被引量:1
4
作者 Ze-Zhong Zhang Wen-Yu Luo Ren-He Zhang 《Chinese Physics Letters》 SCIE CAS CSCD 2018年第8期36-39,共4页
We present an efficient three-dimensional coupled-mode model based on the Fourier synthesis technique. In principle, this model is a one-way model, and hence provides satisfactory accuracy for problems where the forwa... We present an efficient three-dimensional coupled-mode model based on the Fourier synthesis technique. In principle, this model is a one-way model, and hence provides satisfactory accuracy for problems where the forward scattering dominates. At the same time, this model provides an efficiency gain of an order of magnitude or more over two-way coupled-mode models. This model can be applied to three-dimensional range-dependent problems with a slowly varying bathymetry or internal waves. A numerical example of the latter is demonstrated in this work. Comparisons of both accuracy and efficiency between the present model and a benchmark model are also provided. 展开更多
关键词 An Efficient three-dimensional Coupled Normal Mode Model and Its Application to Internal Solitary Wave problems
原文传递
Exact analytical solution to three-dimensional phase change heat transfer problems in biological tissues subject to freezing
5
作者 李方方 刘静 乐恺 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2009年第1期63-72,共10页
Analytically solving a three-dimensional (3-D) bioheat transfer problem with phase change during a freezing process is extremely difficult but theoretically important. The moving heat source model and the Green func... Analytically solving a three-dimensional (3-D) bioheat transfer problem with phase change during a freezing process is extremely difficult but theoretically important. The moving heat source model and the Green function method are introduced to deal with the cryopreservation process of in vitro biomaterials. Exact solutions for the 3-D temperature transients of tissues under various boundary conditions, such as totally convective cooling, totally fixed temperature cooling and a hybrid between them on tissue surfaces, are obtained. Furthermore, the cryosurgical process in living tissues subject to freezing by a single or multiple cryoprobes is also analytically solved. A closed-form analytical solution to the bioheat phase change process is derived by considering contributions from blood perfusion heat transfer, metabolic heat generation, and heat sink of a cryoprobe. The present method is expected to have significant value for analytically solving complex bioheat transfer problems with phase change. 展开更多
关键词 three-dimensional phase change heat transfer problem CRYOSURGERY CRYOPRESERVATION moving heat source model bioheat transfer Green's function analytical solution
在线阅读 下载PDF
求解online packing problem的F-B绝对近似算法 被引量:1
6
作者 黄海 李松斌 《计算机工程与应用》 CSCD 北大核心 2017年第11期73-78,共6页
FF算法由于其在线特性在处理在线装箱问题得到广泛使用,但它无法预测后面达到物品造成装箱率低,提出一种预留一定比例的各类未装满箱体的装箱算法。首先对未装满箱体分类并给出相应的数据结构,接着设计一种绑定配对策略来预留各类未装... FF算法由于其在线特性在处理在线装箱问题得到广泛使用,但它无法预测后面达到物品造成装箱率低,提出一种预留一定比例的各类未装满箱体的装箱算法。首先对未装满箱体分类并给出相应的数据结构,接着设计一种绑定配对策略来预留各类未装满箱体数目,并引入间隔函数控制新箱体的启用,最后基于FF算法结合预留策略对物品进行装箱来保证装箱的绝对近似比。提出了一种预留绑定配对策略为后续输入物品提供预测空间,特别的是F-B算法能得到5/3的绝对近似比。 展开更多
关键词 在线装箱问题 预留箱体 绝对近似比 配对绑定
在线阅读 下载PDF
二维矩形Strip Packing问题的算法研究与改进
7
作者 蔡家尧 王磊 《计算机技术与发展》 2024年第7期138-146,共9页
二维矩形Strip Packing问题的约束条件及目标函数与基本型二维矩形Packing问题类似,都是在有限的矩形容器中,有效地摆放各个矩形块,以最大化容器利用率为目标。为了解决这一NP-hard问题,该文在邓见凯、王磊提出的拟人型全局优化算法的... 二维矩形Strip Packing问题的约束条件及目标函数与基本型二维矩形Packing问题类似,都是在有限的矩形容器中,有效地摆放各个矩形块,以最大化容器利用率为目标。为了解决这一NP-hard问题,该文在邓见凯、王磊提出的拟人型全局优化算法的基础上进行了深入的算法研究与改进。针对Strip Packing问题特点,提出了QHG(Quasi-Human Group)算法,其核心改进涵盖了多个方面,包括扩充初始点集合、删除和替换评价标准以及扩大邻域空间搜索范围。和单个局部极小值点的迭代相比,对局部极小值点集合进行迭代所生成布局优度更高,跳坑策略用于跳出局部极小值点,将搜索引向有希望的区域,优美度枚举有望进一步提高布局优度。通过这些措施,QHG算法更好地模拟人类决策过程,提高了全局搜索的效率。为评估QHG算法性能,对8组标准问题实例(C组、N组、NT组、CX组、NP组、ZDF组、2sp组、bwmv组)进行了大量实验。实验结果表明,QHG算法生成的布局优度优于当前国际文献中的几种较先进算法,展现了其在Strip Packing问题上的卓越性能。 展开更多
关键词 Strip packing问题 组合优化 全局优化 算法 拟人
在线阅读 下载PDF
A heuristic method for solving triangle packing problem 被引量:2
8
作者 陈传波 何大华 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2005年第6期565-570,共6页
Given a set of triangles and a rectangle container, the triangle packing problem is to determine if these triangles can be placed into the container without overlapping. Triangle packing problem is a special case of p... Given a set of triangles and a rectangle container, the triangle packing problem is to determine if these triangles can be placed into the container without overlapping. Triangle packing problem is a special case of polygon packing problem and also NP-hard, so it is unlikely that an efficient and exact algorithm can be developed to solve this problem. In this paper, a new concept of rigid placement is proposed, based on which a discrete solution space called rigid solution space is constructed. Each solution in the rigid solution space can be built by continuously applying legal rigid placements one by one until all the triangles are placed into the rectangle container without overlapping. The proposed Least-Destruction-First (LDF) strategy determines which rigid placement has the privilege to go into the rectangle container. Based on this, a heuristic algorithm is proposed to solve the problem. Combining Least-Destruction-First strategy with backtracking, the corresponding backtracking algorithm is proposed. Computa- tional results show that our proposed algorithms are efficient and robust. With slight modification, these techniques can be con- veniently used for solving polygon packing problem. 展开更多
关键词 Triangle packing problem Rigid placement FLEXIBILITY DESTRUCTION Least-Destruction-First (LDF) strategy BACKTRACKING
在线阅读 下载PDF
A Personified Annealing Algorithm for Circles Packing Problem 被引量:5
9
作者 ZHANGDe-Fu LIXin 《自动化学报》 EI CSCD 北大核心 2005年第4期590-595,共6页
Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating t... Circles packing problem is an NP-hard problem and is di?cult to solve. In this paper, ahybrid search strategy for circles packing problem is discussed. A way of generating new configurationis presented by simulating the moving of elastic objects, which can avoid the blindness of simulatedannealing search and make iteration process converge fast. Inspired by the life experiences of people,an e?ective personified strategy to jump out of local minima is given. Based on the simulatedannealing idea and personification strategy, an e?ective personified annealing algorithm for circlespacking problem is developed. Numerical experiments on benchmark problem instances show thatthe proposed algorithm outperforms the best algorithm in the literature. 展开更多
关键词 包装问题 模拟技术 退火算法 弹性物体
在线阅读 下载PDF
An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem 被引量:4
10
作者 ZHANG De-Fu CHEN Sheng-Da LIU Yan-Juan 《自动化学报》 EI CSCD 北大核心 2007年第9期911-916,共6页
与基因算法结合的改进启发式的递归的策略在这份报纸被介绍。第一,这个方法寻找一些矩形,它有一样的长度或宽度,到没有浪费空间,形成一些层,然后,计算留下包装顺序的高度使用启发式的递归的策略并且使用基因算法的进化能力减少高... 与基因算法结合的改进启发式的递归的策略在这份报纸被介绍。第一,这个方法寻找一些矩形,它有一样的长度或宽度,到没有浪费空间,形成一些层,然后,计算留下包装顺序的高度使用启发式的递归的策略并且使用基因算法的进化能力减少高度。基准问题的几个班上的计算结果证明了介绍算法能与已知的进化启发规则竞争。它特别为大测试问题更好表现。 展开更多
关键词 改良式 启发式 递归策略 遗传算法 矩形封装
在线阅读 下载PDF
THE CAPTURE RANGES AND THE DANGEROUS RANGES FOR THE THREE-DIMENSIONAL TWO-AIRCRAFT COMBAT PROBLEM
11
作者 Tong Minan and Wang LixinNorthwestern Polytechnical University 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 1990年第2期88-97,共10页
In this paper, we use differential game theory to study the three-dimensional two-aircraft air-to-air combat problem. We give the ways to determine the Capture Ranges (CR) and the Dangerous Ranges (DR) for these two a... In this paper, we use differential game theory to study the three-dimensional two-aircraft air-to-air combat problem. We give the ways to determine the Capture Ranges (CR) and the Dangerous Ranges (DR) for these two aircraft according to the target entry directions, barrier and isochronic lines respectively. The simulations are given by referring to two sets of real aircraft parameters. After discussing the simulation results, we have obtained some conclusions that match the real air-to-air combat situation quite well. 展开更多
关键词 CR DR THE CAPTURE RANGES AND THE DANGEROUS RANGES FOR THE three-dimensional TWO-AIRCRAFT COMBAT problem
在线阅读 下载PDF
A Dynamic Programming Approach for the Max-Min Cycle Packing Problem in Even Graphs
12
作者 Peter Recht 《Open Journal of Discrete Mathematics》 2016年第4期340-350,共11页
Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing probl... Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential. 展开更多
关键词 Maximum Edge-Disjoint Cycle packing Extremal problems in Graph Theory Dynamic Programming -Shortest Path Procedure
在线阅读 下载PDF
An Improved Binary Wolf Pack Algorithm Based on Adaptive Step Length and Improved Update Strategy for 0-1 Knapsack Problems
13
作者 Liting Guo Sanyang Liu 《国际计算机前沿大会会议论文集》 2017年第2期105-106,共2页
Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed... Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence. 展开更多
关键词 BINARY WOLF pack ALGORITHM 0-1 knapsack problem ADAPTIVE step length Update strategy
在线阅读 下载PDF
An Optimization Model for the Strip-packing Problem and Its Augmented Lagrangian Method
14
作者 于洪霞 张宏伟 张立卫 《Northeastern Mathematical Journal》 CSCD 2006年第4期441-450,共10页
This paper formulates a two-dimensional strip packing problem as a non- linear programming (NLP) problem and establishes the first-order optimality conditions for the NLP problem. A numerical algorithm for solving t... This paper formulates a two-dimensional strip packing problem as a non- linear programming (NLP) problem and establishes the first-order optimality conditions for the NLP problem. A numerical algorithm for solving this NLP problem is given to find exact solutions to strip-packing problems involving up to 10 items. Approximate solutions can be found for big-sized problems by decomposing the set of items into small-sized blocks of which each block adopts the proposed numerical algorithm. Numerical results show that the approximate solutions to big-sized problems obtained by this method are superior to those by NFDH, FFDH and BFDH approaches. 展开更多
关键词 strip-packing problem augmented lagrangian method first-order optimality condition
在线阅读 下载PDF
求解矩形Packing问题的砌墙式启发式算法 被引量:32
15
作者 张德富 韩水华 叶卫国 《计算机学报》 EI CSCD 北大核心 2008年第3期509-515,共7页
为求解正交矩形Packing问题提出了一个新颖而有效的砌墙式启发式算法.该算法主要基于砌墙式启发式策略,其思想主要来源于砖匠在砌墙过程中所积累的经验:基于基准砖的砌墙规则.对国际上公认的大量的Bench-mark问题例的计算结果表明,该算... 为求解正交矩形Packing问题提出了一个新颖而有效的砌墙式启发式算法.该算法主要基于砌墙式启发式策略,其思想主要来源于砖匠在砌墙过程中所积累的经验:基于基准砖的砌墙规则.对国际上公认的大量的Bench-mark问题例的计算结果表明,该算法的计算速度不仅比著名的现代启发式算法快,而且获得更优的高度. 展开更多
关键词 正交矩形packing问题 启发式 砌墙式规则 局部搜索 基准砖
在线阅读 下载PDF
求解方格packing问题的启发式算法 被引量:14
16
作者 黄文奇 朱虹 +1 位作者 许向阳 宋益民 《计算机学报》 EI CSCD 北大核心 1993年第11期829-836,共8页
沿着拟物与拟人的途径,本文为一类具有NP难度的方格packing问题得到了实用的近似求解算法,以此算法为基础可以发展出一种为大规模集成电路芯片裁切工作做计算机辅助设计的高效的软件系统。
关键词 方格 packing问题 CAD 启发式算法
在线阅读 下载PDF
用改进的散射搜索法求解带平衡约束的圆形Packing问题 被引量:21
17
作者 王奕首 史彦军 滕弘飞 《计算机学报》 EI CSCD 北大核心 2009年第6期1214-1221,共8页
以卫星布局为背景的带平衡约束的圆形Packing问题属NP难问题.该文用给出的改进的散射搜索方法求解.一是给出基于极坐标变换的散射搜索多样性生成策略,二是采取基于极角和极径差异度的参考集更新策略,三是用梯度下降法和Nelder-Mead直接... 以卫星布局为背景的带平衡约束的圆形Packing问题属NP难问题.该文用给出的改进的散射搜索方法求解.一是给出基于极坐标变换的散射搜索多样性生成策略,二是采取基于极角和极径差异度的参考集更新策略,三是用梯度下降法和Nelder-Mead直接搜索法分别作为散射搜索法中不同阶段所产生新解的改进方法,从而构成改进的散射搜索法,提高了散射搜索法的探索和搜索能力.数值实验结果表明了该改进散射搜索法的可行性和有效性. 展开更多
关键词 带平衡约束Pakcing问题 散射搜索 局部搜索 启发式方法
在线阅读 下载PDF
The application of three-dimensional textbook in English teaching 被引量:2
18
作者 张桂军 陈红梅 +1 位作者 高兴梅 申粒蒂 《Sino-US English Teaching》 2008年第7期17-20,共4页
The paper discusses the application of three-dimensional textbook in English teaching. The three-dimensional textbook plays an incomparable function than the traditional textbook and thus has an extensive application ... The paper discusses the application of three-dimensional textbook in English teaching. The three-dimensional textbook plays an incomparable function than the traditional textbook and thus has an extensive application in the college English education. It demonstrates the application through the usage of the three-dimensional textbook in the real teaching and shows that excessive usage of sound and pictures or drawings may distract the attention of students. It raises several suggestions at the end. 展开更多
关键词 three-dimensional textbook ADVANTAGE application problem THINKING
在线阅读 下载PDF
基于加权分治技术的set packing精确算法 被引量:7
19
作者 李绍华 王建新 +1 位作者 马振宇 陈建二 《小型微型计算机系统》 CSCD 北大核心 2010年第6期1180-1184,共5页
加权分治技术是算法分析中的一种新技术,该技术基于选择不同的量来描述分支子问题的大小,以求得到在最糟糕情况下最好的时间复杂度.setpacking问题是一典型的NP-hard问题,广泛应用于调度、代码优化和生物信息学等领域.本文对有n个子集的... 加权分治技术是算法分析中的一种新技术,该技术基于选择不同的量来描述分支子问题的大小,以求得到在最糟糕情况下最好的时间复杂度.setpacking问题是一典型的NP-hard问题,广泛应用于调度、代码优化和生物信息学等领域.本文对有n个子集的setpacking问题,引入符号全集变量N设计基于分支搜索策略的递归算法,并应用加权分治技术对算法加以分析,得到时间复杂度为O*(1.1686n+N)的精确算法,当N≤n/4时,比现有最佳的算法O*(1.2209n)更加有效. 展开更多
关键词 加权分治 SET packing问题 最大独立集 精确算法
在线阅读 下载PDF
基于粗精调技术的求解带平衡约束圆形Packing问题的拟物算法 被引量:8
20
作者 何琨 莫旦增 +1 位作者 许如初 黄文奇 《计算机学报》 EI CSCD 北大核心 2013年第6期1224-1234,共11页
带平衡约束的圆形Packing问题是以卫星舱布局为背景的具有NP难度的布局优化问题.文中建立了此问题相应的数学模型,同时提出了两个新的物理模型,并受工艺加工过程中"粗精加工"现象的启发,提出了基于粗精调技术的拟物算法QPCFA... 带平衡约束的圆形Packing问题是以卫星舱布局为背景的具有NP难度的布局优化问题.文中建立了此问题相应的数学模型,同时提出了两个新的物理模型,并受工艺加工过程中"粗精加工"现象的启发,提出了基于粗精调技术的拟物算法QPCFA.该算法既兼顾了搜索空间的多样性以利于全局搜索,又能对有前途的局部区域进行精细搜索以找到相应的局部最优解.同时,在计算过程中引入禁忌技术和跳坑策略,以提高算法的求解质量.对国际上11个代表性的算例进行了计算,QPCFA更新了其中7个算例的最好记录,其余4个与目前的最好记录基本持平,且与目前的最好结果相比在计算精度上均有较大的提高. 展开更多
关键词 packing问题 布局优化 拟物 平衡约束 粗精调技术
在线阅读 下载PDF
上一页 1 2 25 下一页 到第
使用帮助 返回顶部