检索结果-南通市图书馆

complexity analysis of blast-induced vibrations in underground mining: A case study

International Journal of Mining Science and Technology 2012年第1期22卷 125-131页

作者： Cardu Marilena Dompieri Mauricio Seccatore Jacopo Department of Land Environment and Geotechnology (DITAG) Corso Duca degli Abruzzi IGAG C.N.R. Corso Duca degli Abruzzi Ontonix Brasil Rua Madre Rita Amada de Jesus Sao Paulo Brazil Mining and Petroleum Engineering Department University of Sao Paulo Sao Paulo Brazil

Blasting in geological bodies is an industrial process acting in an environment characterized by high uncertainties (natural joints, faults, voids, abrupt structural changes), which are transposed into the process parameters (e.g. energetic transfer to rock mass, hole deviations, misfires, vibrations, fly-rock, etc.). The approach to this problem searching for the "optimum" result can be ineffective. The geological environment is marked out by too many uncertainties, to have an "optimum" suitable to different applications. Researching for "Robustness" in a blast design gives rise to much more efficiency. Robustness is the capability of the system to behave constantly under varying conditions, without leading to unexpected results. Since the geology varies from site to site, setting a robust method can grant better results in varying environments, lowering the costs and increasing benefits and safety. complexity analysis (C.A.) is an innovative approach to systems. C.A. allows analyzing the complexity of the Blast System and the criticality of each variable (drilling, charging and initiation parameters). The lower is the complexity, the more robust is the system, and the lower is the possibility of unexpected results. The paper presents the results obtained thanks to the C.A. approach in an underground gypsum quarry (Italy), exploited by conventional rooms and pillars method by drilling and blasting. The application of C.A. led to a reliable solution to reduce the charge per delay, hence reducing the impact of ground vibration on the surrounding structures. The analysis of the correlation degree between the variables allowed recognizing empirical laws as well.

关键词： Drilling and blasting complexity analysis Vibrations control

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

complexity analysis and Algorithm Design of Pooling Problem

引用

Journal of the Operations Research Society of China 2018年第2期6卷 249-266页

作者： Yu-Hong Dai Rui Diao Kai Fu State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China

The pooling problem,also called the blending problem,is fundamental in production planning of *** can be formulated as an optimization problem similar with the minimum-cost flow ***,Alfaki and Haugland(J Glob Optim 56:897–916,2013)proved the strong NP-hardness of the pooling problem in general *** also pointed out that it was an open problem to determine the computational complexity of the pooling problem with a fixed number of *** this paper,we prove that the pooling problem is still strongly NP-hard even with only one *** means the quality is an essential difference between minimum-cost flow problem and the pooling *** solving large-scale pooling problems in real applications,we adopt the non-monotone strategy to improve the traditional successive linear programming *** convergence of the algorithm is *** numerical experiments show that the non-monotone strategy is effective to push the algorithm to explore the global minimizer or provide a good local *** results for real problems from factories show that the proposed algorithm is competitive to the one embedded in the famous commercial software Aspen PIMS.

关键词： Pooling problem complexity analysis Successive linear programming Non-monotone

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Nonlinear characteristics analyses of particle motion for predicting flow regimes

引用

Particuology 2020年第6期18卷 134-141页

作者： Panxing Kang Yujian Lu Lei Yang Libin Liu Xiayi(Eric)Hu Xiao Luo Hongbo Chen Yefeng Zhou Rui Zhang National and Local United Engineering Research Centre for Chemical Process Simulation and Intensification Chemical Process Simulation and Optimization Engineering Research Center of the Ministry of EducationXiangtan UniversityXiangtan 411105China College of Chemistry and Chemical Engineering Hunan UniversityChangsha 410082China

Gas-solid flow regimes have a significant impact on particle transport and separation in a fluidized bed *** this study,to determine flow regime transitions in gas-solid fluidized beds,an acoustic technique was used to detect and analyze the behavior of gas and *** complexity,fluctuation complexity,and Shannon entropy analyses of acoustic emission signals were performed to examine non linear system characteristics,and to determine the flow regime transiti on velocities uc,uk,and ufd-Moreover,using the standard deviation of pressure signals,pressure measurements and acoustic measurements were *** relative deviations(RDs)between the experimental and empirical values of uk were 8.8%,13.7%,8.8%,and 30.4%for the algorithm complexity,fluctuation complexity,Shannon entropy,and pressure signal standard deviation,respectively,while the respective RDs for Ufd were 15.7%,23.9%,15.7%,and 97.8%.The RDs between the experimental and empirical values of uc were all 6.4%.The experimental values obtained from acoustic signal measurements were therefore closer to the empirical *** summary,the integration of non-intrusive acoustic measurements,complexity analysis,and Shannon entropy analysis is suitable for identifying flow regime transitions.

关键词： Acoustic emission Nonlinear characteristics complexity analysis Shannon entropy Flow regime transition

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Two new predictor-corrector algorithms for second-order cone programming

引用

Applied Mathematics and Mechanics(English Edition) 2011年第4期32卷 521-532页

作者：曾友芳白延琴简金宝唐春明 Department of Mathematics Shanghai University College of Mathematics and Information Science Guangxi University

Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming （SOCP） are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton （AHO） directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O（rln（εo/ε）） is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective.

关键词： second-order cone programming infeasible interior-point algorithm predictor-corrector algorithm global convergence complexity analysis

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Novel Kernel Function With a Hyperbolic Barrier Term to Primal-dual Interior Point Algorithm for SDP Problems

引用

Acta Mathematicae Applicatae Sinica 2022年第1期38卷 44-67页

作者： Imene TOUIL Wided CHIKOUCHE LMPA Mohammed Seddik Ben Yahia UniversityJijel 18000Algeria

In this paper,we introduce for the first time a new eligible kernel function with a hyperbolic barrier term for semidefinite programming(SDP).This add a new type of functions to the class of eligible kernel *** prove that the interior-point algorithm based on the new kernel function meets O(n3/4 logε/n)iterations as the worst case complexity bound for the large-update *** coincides with the complexity bound obtained by the first kernel function with a trigonometric barrier term proposed by El Ghami et ***2012,and improves with a factor n(1/4)the obtained iteration bound based on the classic kernel *** present some numerical simulations which show the effectiveness of the algorithm developed in this paper.

关键词： Linear Semidefinite Programming Primal-Dual Interior Point Methods Hyperbolic Kernel Function complexity analysis Large and small-update methods

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Optimizing Connections:Applied Shortest Path Algorithms for MANETs

引用

Computer Modeling in Engineering & Sciences 2024年第10期141卷 787-807页

作者： Ibrahim Alameri Jitka Komarkova Tawfik Al-Hadhrami Abdulsamad Ebrahim Yahya Atef Gharbi Faculty of Medical Sciences Jabir Ibn Hayyan Medical UniversityAlkufaNajaf54001Iraq Faculty of Economics and Administration University of PardubiceStudentskaPardubice53210Czech Republic Computer Science Department School of Science and TechnologyNottingham Trent UniversityNottinghamNG118NSUK Department of Information Technology College of Computing and Information TechnologyNorthern Border UniversityArar91431Saudi Arabia Department of Information System College of Computing and Information TechnologyNorthern Border UniversityArar91431Saudi Arabia

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of *** objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static ***,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for *** paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in *** results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse *** theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional *** adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of ***,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional *** paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.

关键词： Dijkstra’s algorithm optimization complexity analysis shortest path first comparative algorithm analysis nondeterministic polynomial(NP)-complete

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Cubic Regularization Methods with Second-Order complexity Guarantee Based on a New Subproblem Reformulation

引用

Journal of the Operations Research Society of China 2022年第3期10卷 471-506页

作者： Ru-Jun Jiang Zhi-Shuo Zhou Zi-Rui Zhou School of Data Science Fudan UniversityShanghai 200433China Huawei Technologies Canada BurnabyBCCanada

The cubic regularization(CR)algorithm has attracted a lot of attentions in the literature in recent *** propose a new reformulation of the cubic regularization *** reformulation is an unconstrained convex problem that requires computing the minimum eigenvalue of the ***,based on this reformulation,we derive a variant of the(non-adaptive)CR provided a known Lipschitz constant for the Hessian and a variant of adaptive regularization with cubics(ARC).We show that the iteration complexity of our variants matches the best-known bounds for unconstrained minimization algorithms using first-and second-order ***,we show that the operation complexity of both of our variants also matches the state-of-the-art bounds in the *** experiments on test problems from CUTEst collection show that the ARC based on our new subproblem reformulation is comparable to the existing algorithms.

关键词： Cubic regularization subproblem First-order methods Constrained convex optimization complexity analysis

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Regular Splitting and Potential Reduction Method for Solving Quadratic Programming Problem with Box Constraints

引用

Journal of Computational Mathematics 2002年第6期20卷 643-652页

作者： Zi-Luan Wei(Institute of Computational Mathematics and Scientific / Engineering Computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences, P.O. Box 2719, Beijing, 100080) Institute of Computational Mathematics and Scientific / Engineering Computing Academy of Mathematics and System Sciences Chinese Academy of Sciences P.O. Box 2719 北京 100080

Presents a regular splitting and potential reduction method for solving a quadratic programming problem with box constraints. Discussion on the regular splitting and potential reduction algorithm; complexity analysis ... 详细信息

关键词： quadratic programming problem regular splitting potential reduction algorithm complexity analysis

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

THE MIGRATION SCHEME BASED ON SCHEMA THEOREM OF PGAs

引用

Journal of Electronics(China) 2002年第3期19卷 315-319页

作者： GuanYu XuBaowen 等 DepartmentofComputerScienceandEngineering SoutheastUniversityNanjing210096 StateKeyLaboratoryofSoftwareEngineering WuhanUniversityWuhan430072

Genetic Algorithms (GAs) are efficient non-gradient stochastic search methods and Parallel GAs (PGAs) are proposed to overcome the deficiencies of the sequential GAs, such as low speed, aptness to local convergence, etc. However, the tremendous increase in the communication costs accompanied with the parallelization stunts the further improvements of PGAs. This letter takes the decrease of the communication costs as the key to this problem and advances a new Migration Scheme based on Schema Theorem (MSST). MSST distills schemata from the populations and then proportionately disseminates them to other populations, which decreases the total communication cost among the populations and arms the multiple-population model with higher speed and better scalability.

关键词： Parallel genetic algorithms Migration scheme Multiple-population model complexity analysis

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

异质预期下双寡头企业碳减排决策的复杂性分析

引用

管理科学 2023年第6期

作者：赵刘威金帅姜鸿运彭振革

针对碳减排环境下的政府碳配额分配和企业产量与减排研发决策问题，基于古诺双寡头垄断模型，建立了考虑有限理性和异质性预期的碳排放依赖型企业碳减排决策模型，从市场复杂性演化的内部视角出发，分析市场竞争波动的内在机制；并通过... 详细信息

针对碳减排环境下的政府碳配额分配和企业产量与减排研发决策问题，基于古诺双寡头垄断模型，建立了考虑有限理性和异质性预期的碳排放依赖型企业碳减排决策模型，从市场复杂性演化的内部视角出发，分析市场竞争波动的内在机制；并通过非线性动力学理论探讨企业不同的响应速度对于市场稳定性的影响。结果表明，技术减排成本系数、碳交易价格对低碳产品的偏好系数是影响两企业竞争策略的关键因素，两个因素的取值不同甚至会彻底改变均衡状态下两企业相对的减排投资力度和相对的盈利能力及市场的稳定性。针对市场竞争出现的波动现象，通过时滞反馈控制方法高效、快速的控制动力系统的不稳定行为，使得市场迅速恢复稳定、有序的状态，为决策者有效解决市场不稳定现象提供了科学依据。

关键词：碳减排 Cournot竞争异质预期复杂性分析 carbon reduction cournot competition heterogeneous expectations complexity analysis

来源：人大复印报刊资料评论

在线全文

人大复印报刊资料

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：