期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到5篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Deep-Learning-Based Constitutive Method for Geomaterials Using a Neural Cutting Plane Algorithm 认领 引用
1
作者 Qingxiang Meng Zijie He +1 位作者 Yajun Cao Weijiang Chu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第6期158-180,共23页
Constitutive modeling for geomaterials remains challenging because of limited data availability,strong nonlinearity,pressure sensitivity,and the non-smooth characteristics of commonly used yield surfaces.This study pr... Constitutive modeling for geomaterials remains challenging because of limited data availability,strong nonlinearity,pressure sensitivity,and the non-smooth characteristics of commonly used yield surfaces.This study presents a deep-learning-based constitutive method for geomaterials that incorporates a neural stress-integration procedure based on the cutting plane algorithm(CPA).Two compact fully connected networks are trained to learn the yield function and its stress gradient from an augmented stress-state dataset.The trained networks are then incorporated into a cutting plane return-mapping procedure,in which only first-order information is required for the plastic stress return.This avoids explicit analytical yield expressions and second-derivative evaluations and is therefore more naturally compatible with non-smooth Mohr-Coulomb-type yield-surface representations in a first-order returnmapping sense.Numerical results show that the proposed method reproduces the reference Mohr-Coulomb response along the examined monotonic triaxial compression paths.Compared with the finite-difference closest-point projection method(CPPM)implementation considered in this study,the CPA-based neural stress-update procedure requires fewer network calls per update,indicating a more economical implementation for the present learned constitutive framework. 展开更多
关键词 Geomaterials constitutive modeling deep learning cutting plane algorithm stress integration
暂未订购 下载PDF
Research on Prepreg Tape Cutting Platform with Two Cutters 认领 引用 被引量：1
2
作者 WEN Liwei HUANG Xiaochuan +2 位作者 QIN Lihua WANG Xianfeng LI Yong 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2019年第3期442-448,共7页
The concept of cutting platform is proposed and realized based on the latest two step automated tape laying (Two step ATL)technology,which separates prepreg cutting process from tape laying to improve productivity for... The concept of cutting platform is proposed and realized based on the latest two step automated tape laying (Two step ATL)technology,which separates prepreg cutting process from tape laying to improve productivity for large parts with small features.Two step ATL is more efficient than conventional layup because ply patches are pre cut in a separate operation.The concept of the prepreg tape cutting experimental platform with two cutters is introduced.Further,based on the automatic tape laying trajectory planning software,a two cutter cutting algorithm is proposed.Cutting experiments are reported to validate both the concept of cutting platform and cutting algorithm. 展开更多
关键词 two-step automated tape laying(Two-step ATL) cutting platform with two cutters cutting algorithm cutter distribution
暂未订购 下载PDF
A Branch and Cut Algorithm for Two-Echelon Inventory Routing Problem with End-of-Tour Replenishment Policy 认领 引用
3
作者 Bi Kouaï Bertin Kayé Doffou Jerome Diako Zacrada Françoise Odile Trey 《Open Journal of Applied Sciences》 2024年第11期3100-3126,共27页
This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution centers (DCs) and several ret... This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution centers (DCs) and several retailers on a multi-period planning horizon. A formulation of the problem based on vehicle indices is proposed in the form of a mixed integer linear program (MILP). The mathematical model of the problem is solved using a branch and cut (B&C) algorithm. The results of the tests are compared to the results of a branch and price (B&P) algorithm from the literature on 2E-IRP with a classical distribution policy. The results of the tests show that the B&C algorithm solves 197 out of 200 instances (98.5%). The comparison of the B&C and B&P results shows that 185 best solutions are obtained with the B&C algorithm on 197 instances (93.9%). Overall, the B&C algorithm achieves cost reductions ranging from 0.26% to 41.44% compared to the classic 2E-IRP results solved with the B&P algorithm, with an overall average reduction of 18.08%. 展开更多
关键词 Multi-Depots 2E-IRP Branch and Cut Algorithm End-of-Tour Replenishment Policy Vendor Managed Inventory
暂未订购 下载PDF
Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges 认领 引用
4
作者 Robert Bredereck Jiehua Chen +3 位作者 Piotr Faliszewski Jiong Guo Rolf Niedermeier Gerhard J.Woeginger 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期358-373,共16页
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science（including Artificial Intelligence and ... Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science（including Artificial Intelligence and Multiagent Systems） on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context. This work is dedicated to Jianer Chen, one of the strongest problem solvers in the history of parameterized algorithmics,on the occasion of his 60 th birthday. 展开更多
关键词 NP-hard problems parameterized complexity fixed-parameter tractability kernelization exact algorithms voting decision making cake cutting
暂未订购 下载PDF
NEW TRIGONOMETRIC BASIS POSSESSING EXPONENTIAL SHAPE PARAMETERS 认领 引用 被引量：6
5
作者 Yuanpeng Zhu Xuli Han 《Journal of Computational Mathematics》 SCIE CSCD 2015年第6期642-684,共43页
Four new trigonometric Bernstein-like basis functions with two exponential shape pa- rameters are constructed, based on which a class of trigonometric Bézier-like curves, anal- ogous to the cubic Bézier curv... Four new trigonometric Bernstein-like basis functions with two exponential shape pa- rameters are constructed, based on which a class of trigonometric Bézier-like curves, anal- ogous to the cubic Bézier curves, is proposed. The corner cutting algorithm for computing the trigonometric Bézier-like curves is given. Any arc of an eliipse or a parabola can be represented exactly by using the trigonometric Bézier-like curves. The corresponding trigonometric Bernstein-like operator is presented and the spectral analysis shows that the trigonometric Bézier-like curves are closer to the given control polygon than the cu- bic Bézier curves. Based on the new proposed trigonometric Bernstein-like basis, a new class of trigonometric B-spline-like basis functions with two local exponential shape pa- rameters is constructed. The totally positive property of the trigonometric B-spline-like basis is proved. For different values of the shape parameters, the associated trigonometric B-spline-like curves can be C2 N FC3 continuous for a non-uniform knot vector, and C3 or C5 continuous for a uniform knot vector. A new class of trigonometric Bézier-like basis functions over triangular domain is also constructed. A de Casteljau-type algorithm for computing the associated trigonometric Bézier-like patch is developed. The conditions for G1 continuous joining two trigonometric Bézier-like patches over triangular domain arededuced． 展开更多
关键词 Trigonometric Bernstein-like basis Trigonometric B-spline-like basis Corner cutting algorithm Totally positive property Shape parameter Triangular domain.
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈