期刊文献+
共找到103,527篇文章
< 1 2 250 >
每页显示 20 50 100
Glia-to-neuron reprogramming to the rescue?
1
作者 Jack W.Hickmott Cindi M.Morshead 《Neural Regeneration Research》 SCIE CAS 2025年第5期1395-1396,共2页
Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells c... Over the last two decades,the dogma that cell fate is immutable has been increasingly challenged,with important implications for regenerative medicine.The brea kth rough discovery that induced pluripotent stem cells could be generated from adult mouse fibroblasts is powerful proof that cell fate can be changed.An exciting extension of the discovery of cell fate impermanence is the direct cellular reprogram ming hypothesis-that terminally differentiated cells can be reprogrammed into other adult cell fates without first passing through a stem cell state. 展开更多
关键词 programming PASSiNG proof
在线阅读 下载PDF
Neurocircuit regeneration by extracellular matrix reprogramming
2
作者 Shengzhang Su Ian N.Levasseur Kimberly M.Alonge 《Neural Regeneration Research》 SCIE CAS 2025年第8期2300-2301,共2页
The brain's extracellular matrix(ECM),which is comprised of protein and glycosaminoglycan(GAG)scaffolds,constitutes 20%-40% of the human brain and is considered one of the largest influencers on brain cell functio... The brain's extracellular matrix(ECM),which is comprised of protein and glycosaminoglycan(GAG)scaffolds,constitutes 20%-40% of the human brain and is considered one of the largest influencers on brain cell functioning(Soles et al.,2023).Synthesized by neural and glial cells,the brain's ECM regulates a myriad of homeostatic cellular processes,including neuronal plasticity and firing(Miyata et al.,2012),cation buffering(Moraws ki et al.,2015),and glia-neuron interactions(Anderson et al.,2016).Considering the diversity of functions,dynamic remodeling of the brain's ECM indicates that this understudied medium is an active participant in both normal physiology and neurological diseases. 展开更多
关键词 MATRiX programming
在线阅读 下载PDF
Evaluation of Integer Programming Solvers to Improve the Efficiency of Individual Work Planning
3
作者 Keiichi Takahashi 《Open Journal of Modelling and Simulation》 2025年第1期51-64,共14页
This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digiti... This study proposes a novel approach to optimizing individual work schedules for book digitization using mixed-integer programming (MIP). By leveraging the power of MIP solvers, we aimed to minimize the overall digitization time while considering various constraints and process dependencies. The book digitization process involves three key steps: cutting, scanning, and binding. Each step has specific requirements and limitations such as the number of pages that can be processed simultaneously and potential bottlenecks. To address these complexities, we formulate the problem as a one-machine job shop scheduling problem with additional constraints to capture the unique characteristics of book digitization. We conducted a series of experiments to evaluate the performance of our proposed approach. By comparing the optimized schedules with the baseline approach, we demonstrated significant reductions in the overall processing time. In addition, we analyzed the impact of different weighting schemes on the optimization results, highlighting the importance of identifying and prioritizing critical processes. Our findings suggest that MIP-based optimization can be a valuable tool for improving the efficiency of individual work schedules, even in seemingly simple tasks, such as book digitization. By carefully considering specific constraints and objectives, we can save time and leverage resources by carefully considering specific constraints and objectives. 展开更多
关键词 Mixed integer programming Scheduling Optimization Work Planning Book Scanning Gantt Chart
在线阅读 下载PDF
Recent Progress in Reinforcement Learning and Adaptive Dynamic Programming for Advanced Control Applications 被引量:7
4
作者 Ding Wang Ning Gao +2 位作者 Derong Liu Jinna Li Frank L.Lewis 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第1期18-36,共19页
Reinforcement learning(RL) has roots in dynamic programming and it is called adaptive/approximate dynamic programming(ADP) within the control community. This paper reviews recent developments in ADP along with RL and ... Reinforcement learning(RL) has roots in dynamic programming and it is called adaptive/approximate dynamic programming(ADP) within the control community. This paper reviews recent developments in ADP along with RL and its applications to various advanced control fields. First, the background of the development of ADP is described, emphasizing the significance of regulation and tracking control problems. Some effective offline and online algorithms for ADP/adaptive critic control are displayed, where the main results towards discrete-time systems and continuous-time systems are surveyed, respectively.Then, the research progress on adaptive critic control based on the event-triggered framework and under uncertain environment is discussed, respectively, where event-based design, robust stabilization, and game design are reviewed. Moreover, the extensions of ADP for addressing control problems under complex environment attract enormous attention. The ADP architecture is revisited under the perspective of data-driven and RL frameworks,showing how they promote ADP formulation significantly.Finally, several typical control applications with respect to RL and ADP are summarized, particularly in the fields of wastewater treatment processes and power systems, followed by some general prospects for future research. Overall, the comprehensive survey on ADP and RL for advanced control applications has d emonstrated its remarkable potential within the artificial intelligence era. In addition, it also plays a vital role in promoting environmental protection and industrial intelligence. 展开更多
关键词 Adaptive dynamic programming(ADP) advanced control complex environment data-driven control event-triggered design intelligent control neural networks nonlinear systems optimal control reinforcement learning(RL)
在线阅读 下载PDF
Uncertainty quantification of inverse analysis for geomaterials using probabilistic programming 被引量:1
5
作者 Hongbo Zhao Shaojun Li +3 位作者 Xiaoyu Zang Xinyi Liu Lin Zhang Jiaolong Ren 《Journal of Rock Mechanics and Geotechnical Engineering》 SCIE CSCD 2024年第3期895-908,共14页
Uncertainty is an essentially challenging for safe construction and long-term stability of geotechnical engineering.The inverse analysis is commonly utilized to determine the physico-mechanical parameters.However,conv... Uncertainty is an essentially challenging for safe construction and long-term stability of geotechnical engineering.The inverse analysis is commonly utilized to determine the physico-mechanical parameters.However,conventional inverse analysis cannot deal with uncertainty in geotechnical and geological systems.In this study,a framework was developed to evaluate and quantify uncertainty in inverse analysis based on the reduced-order model(ROM)and probabilistic programming.The ROM was utilized to capture the mechanical and deformation properties of surrounding rock mass in geomechanical problems.Probabilistic programming was employed to evaluate uncertainty during construction in geotechnical engineering.A circular tunnel was then used to illustrate the proposed framework using analytical and numerical solution.The results show that the geomechanical parameters and associated uncertainty can be properly obtained and the proposed framework can capture the mechanical behaviors under uncertainty.Then,a slope case was employed to demonstrate the performance of the developed framework.The results prove that the proposed framework provides a scientific,feasible,and effective tool to characterize the properties and physical mechanism of geomaterials under uncertainty in geotechnical engineering problems. 展开更多
关键词 Geological engineering Geotechnical engineering inverse analysis Uncertainty quantification Probabilistic programming
在线阅读 下载PDF
Adaptive Optimal Discrete-Time Output-Feedback Using an Internal Model Principle and Adaptive Dynamic Programming 被引量:1
6
作者 Zhongyang Wang Youqing Wang Zdzisław Kowalczuk 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第1期131-140,共10页
In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed metho... In order to address the output feedback issue for linear discrete-time systems, this work suggests a brand-new adaptive dynamic programming(ADP) technique based on the internal model principle(IMP). The proposed method, termed as IMP-ADP, does not require complete state feedback-merely the measurement of input and output data. More specifically, based on the IMP, the output control problem can first be converted into a stabilization problem. We then design an observer to reproduce the full state of the system by measuring the inputs and outputs. Moreover, this technique includes both a policy iteration algorithm and a value iteration algorithm to determine the optimal feedback gain without using a dynamic system model. It is important that with this concept one does not need to solve the regulator equation. Finally, this control method was tested on an inverter system of grid-connected LCLs to demonstrate that the proposed method provides the desired performance in terms of both tracking and disturbance rejection. 展开更多
关键词 Adaptive dynamic programming(ADP) internal model principle(iMP) output feedback problem policy iteration(Pi) value iteration(Vi)
在线阅读 下载PDF
基于Dynamo的Revit-Midas/Civil斜拉桥模型信息转换
7
作者 蔡金标 刘鸾翔 +2 位作者 冯倩 何欣 徐荣桥 《湖南大学学报(自然科学版)》 北大核心 2025年第1期132-138,共7页
BIM模型不支持有限元计算,且BIM模型与有限元分析模型数据交互困难,故BIM技术正向设计过程中存在建模效率低、模型修改困难等问题,无法做到BIM结构设计与有限元力学分析一体化,增加了结构模型建模与纠错成本.本文依托Revit和Midas/Civi... BIM模型不支持有限元计算,且BIM模型与有限元分析模型数据交互困难,故BIM技术正向设计过程中存在建模效率低、模型修改困难等问题,无法做到BIM结构设计与有限元力学分析一体化,增加了结构模型建模与纠错成本.本文依托Revit和Midas/Civil软件平台,在Dynamo环境下采用IronPython语言设计了一套Revit-Midas/Civil的模型信息转换程序.以博士大桥主桥为对象,通过程序自动实现:1)Revit模型桥梁构件分解、截面特性计算、拉索及梁塔弹性连接处理,并转换成适用于Midas/Civil的语言格式MCT文件,实现了Revit向Midas/Civil模型信息自动转换;2)将有限元计算结果反馈到Revit模型中,对作用效应信息按数值大小赋予渐变颜色,实现了在BIM模型中显示有限元分析结果的展示功能.本文程序可实现Revit-Midas/Civil模型信息转换,有效提高了BIM正向应用效率,弥补了BIM技术在桥梁结构分析方面的不足. 展开更多
关键词 斜拉桥 模型转换 Dynamo混合编程 REViT MiDAS/CiViL
在线阅读 下载PDF
Combining reinforcement learning with mathematical programming:An approach for optimal design of heat exchanger networks
8
作者 Hui Tan Xiaodong Hong +4 位作者 Zuwei Liao Jingyuan Sun Yao Yang Jingdai Wang Yongrong Yang 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2024年第5期63-71,共9页
Heat integration is important for energy-saving in the process industry.It is linked to the persistently challenging task of optimal design of heat exchanger networks(HEN).Due to the inherent highly nonconvex nonlinea... Heat integration is important for energy-saving in the process industry.It is linked to the persistently challenging task of optimal design of heat exchanger networks(HEN).Due to the inherent highly nonconvex nonlinear and combinatorial nature of the HEN problem,it is not easy to find solutions of high quality for large-scale problems.The reinforcement learning(RL)method,which learns strategies through ongoing exploration and exploitation,reveals advantages in such area.However,due to the complexity of the HEN design problem,the RL method for HEN should be dedicated and designed.A hybrid strategy combining RL with mathematical programming is proposed to take better advantage of both methods.An insightful state representation of the HEN structure as well as a customized reward function is introduced.A Q-learning algorithm is applied to update the HEN structure using theε-greedy strategy.Better results are obtained from three literature cases of different scales. 展开更多
关键词 Heat exchanger network Reinforcement learning Mathematical programming Process design
在线阅读 下载PDF
In vivo astrocyte reprogramming following spinal cord injury
9
作者 Yannick N.Gerber Florence E.Perrin 《Neural Regeneration Research》 SCIE CAS CSCD 2024年第3期487-488,共2页
Harmful and helpful roles of astrocytes in spinal cord injury(SCI):SCI induce gradable sensory,motor and autonomic impairments that correlate with the lesion severity and the rostro-caudal location of the injury site.... Harmful and helpful roles of astrocytes in spinal cord injury(SCI):SCI induce gradable sensory,motor and autonomic impairments that correlate with the lesion severity and the rostro-caudal location of the injury site.The absence of spontaneous axonal regeneration after injury results from neuron-intrinsic and neuron-extrinsic parameters.Indeed,not only adult neurons display limited capability to regrow axons but also the injury environment contains inhibitors to axonal regeneration and a lack of growth-promoting factors.Amongst other cell populations that respond to the lesion,reactive astrocytes were first considered as only detrimental to spontaneous axonal regeneration.Indeed,astrocytes. 展开更多
关键词 iNJURY iMPAiRMENT programming
在线阅读 下载PDF
Metabolic reprogramming in skeletal cell differentiation
10
作者 Joshua C.Bertels Guangxu He Fanxin Long 《Bone Research》 SCIE CAS CSCD 2024年第3期539-554,共16页
The human skeleton is a multifunctional organ made up of multiple cell types working in concert to maintain bone and mineral homeostasis and to perform critical mechanical and endocrine functions.From the beginning st... The human skeleton is a multifunctional organ made up of multiple cell types working in concert to maintain bone and mineral homeostasis and to perform critical mechanical and endocrine functions.From the beginning steps of chondrogenesis that prefigures most of the skeleton,to the rapid bone accrual during skeletal growth,followed by bone remodeling of the mature skeleton,cell differentiation is integral to skeletal health. 展开更多
关键词 FUNCTiONS SKELETON programming
在线阅读 下载PDF
Transcriptional reprogramming during human osteoclast differentiation identifies regulators of osteoclast activity
11
作者 Morten S.Hansen Kaja Madsen +6 位作者 Maria Price Kent Søe Yasunori Omata Mario M.Zaiss Caroline M.Gorvin Morten Frost Alexander Rauch 《Bone Research》 SCIE CAS CSCD 2024年第1期180-198,共19页
Enhanced osteoclastogenesis and osteoclast activity contribute to the development of osteoporosis,which is characterized by increased bone resorption and inadequate bone formation.As novel antiosteoporotic therapeutic... Enhanced osteoclastogenesis and osteoclast activity contribute to the development of osteoporosis,which is characterized by increased bone resorption and inadequate bone formation.As novel antiosteoporotic therapeutics are needed,understanding the genetic regulation of human osteoclastogenesis could help identify potential treatment targets.This study aimed to provide an overview of transcriptional reprogramming during human osteoclast differentiation.Osteoclasts were differentiated from CD14+monocytes from eight female donors.RNA sequencing during differentiation revealed 8980 differentially expressed genes grouped into eight temporal patterns conserved across donors.These patterns revealed distinct molecular functions associated with postmenopausal osteoporosis susceptibility genes based on RNA from iliac crest biopsies and bone mineral density SNPs.Network analyses revealed mutual dependencies between temporal expression patterns and provided insight into subtype-specific transcriptional networks.The donor-specific expression patterns revealed genes at the monocyte stage,such as filamin B(FLNB)and oxidized low-density lipoprotein receptor 1(OLR1,encoding LOX-1),that are predictive of the resorptive activity of mature osteoclasts.The expression of differentially expressed G-protein coupled receptors was strong during osteoclast differentiation,and these receptors are associated with bone mineral density SNPs,suggesting that they play a pivotal role in osteoclast differentiation and activity.The regulatory effects of three differentially expressed G-protein coupled receptors were exemplified by in vitro pharmacological modulation of complement 5 A receptor 1(C5AR1),somatostatin receptor 2(SSTR2),and free fatty acid receptor 4(FFAR4/GPR120).Activating C5AR1 enhanced osteoclast formation,while activating SSTR2 decreased the resorptive activity of mature osteoclasts,and activating FFAR4 decreased both the number and resorptive activity of mature osteoclasts.In conclusion,we report the occurrence of transcriptional reprogramming during human osteoclast differentiation and identified SSTR2 and FFAR4 as antiresorptive G-protein coupled receptors and FLNB and LOX-1 as potential molecular markers of osteoclast activity.These data can help future investigations identify molecular regulators of osteoclast differentiation and activity and provide the basis for novel antiosteoporotic targets. 展开更多
关键词 OSTEOCLAST programming identif
在线阅读 下载PDF
Improved Unit Commitment with Accurate Dynamic Scenarios Clustering Based on Multi-Parametric Programming and Benders Decomposition
12
作者 Zhang Zhi Haiyu Huang +6 位作者 Wei Xiong Yijia Zhou Mingyu Yan Shaolian Xia Baofeng Jiang Renbin Su Xichen Tian 《Energy Engineering》 EI 2024年第6期1557-1576,共20页
Stochastic unit commitment is one of the most powerful methods to address uncertainty. However, the existingscenario clustering technique for stochastic unit commitment cannot accurately select representative scenario... Stochastic unit commitment is one of the most powerful methods to address uncertainty. However, the existingscenario clustering technique for stochastic unit commitment cannot accurately select representative scenarios,which threatens the robustness of stochastic unit commitment and hinders its application. This paper providesa stochastic unit commitment with dynamic scenario clustering based on multi-parametric programming andBenders decomposition. The stochastic unit commitment is solved via the Benders decomposition, which decouplesthe primal problem into the master problem and two types of subproblems. In the master problem, the committedgenerator is determined, while the feasibility and optimality of generator output are checked in these twosubproblems. Scenarios are dynamically clustered during the subproblem solution process through the multiparametric programming with respect to the solution of the master problem. In other words, multiple scenariosare clustered into several representative scenarios after the subproblem is solved, and the Benders cut obtainedby the representative scenario is generated for the master problem. Different from the conventional stochasticunit commitment, the proposed approach integrates scenario clustering into the Benders decomposition solutionprocess. Such a clustering approach could accurately cluster representative scenarios that have impacts on theunit commitment. The proposed method is tested on a 6-bus system and the modified IEEE 118-bus system.Numerical results illustrate the effectiveness of the proposed method in clustering scenarios. Compared withthe conventional clustering method, the proposed method can accurately select representative scenarios whilemitigating computational burden, thus guaranteeing the robustness of unit commitment. 展开更多
关键词 Stochastic programming unit commitment scenarios clustering Benders decomposition multi-parametric programming
在线阅读 下载PDF
Branch and Bound Algorithm for Globally Solving Minimax Linear Fractional Programming
13
作者 WANG Hui-man SHEN Pei-ping LIANG Yu-xin 《Chinese Quarterly Journal of Mathematics》 2024年第4期388-398,共11页
In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,... In this paper,we study the minimax linear fractional programming problem on a non-empty bounded set,called problem(MLFP),and we design a branch and bound algorithm to find a globally optimal solution of(MLFP).Firstly,we convert the problem(MLFP)to a problem(EP2)that is equivalent to it.Secondly,by applying the convex relaxation technique to problem(EP2),a convex quadratic relaxation problem(CQRP)is obtained.Then,the overall framework of the algorithm is given and its convergence is proved,the worst-case iteration number is also estimated.Finally,experimental data are listed to illustrate the effectiveness of the algorithm. 展开更多
关键词 Minimax linear fractional programming Global optimal solution Branch and bound
在线阅读 下载PDF
Intelligent prediction model of tunnelling-induced building deformation based on genetic programming and its application
14
作者 XU Jing-min WANG Chen-cheng +3 位作者 CHENG Zhi-liang XU Tao ZHANG Ding-wen LI Zi-li 《Journal of Central South University》 CSCD 2024年第11期3885-3899,共15页
This paper aims to explore the ability of genetic programming(GP)to achieve the intelligent prediction of tunnelling-induced building deformation considering the multifactor impact.A total of 1099 groups of data obtai... This paper aims to explore the ability of genetic programming(GP)to achieve the intelligent prediction of tunnelling-induced building deformation considering the multifactor impact.A total of 1099 groups of data obtained from 22 geotechnical centrifuge tests are used for model development and analysis using GP.Tunnel volume loss,building eccentricity,soil density,building transverse width,building shear stiffness and building load are selected as the inputs,and shear distortion is selected as the output.Results suggest that the proposed intelligent prediction model is capable of providing a reasonable and accurate prediction of framed building shear distortion due to tunnel construction with realistic conditions,highlighting the important roles of shear stiffness of framed buildings and the pressure beneath the foundation on structural deformation.It has been proven that the proposed model is efficient and feasible to analyze relevant engineering problems by parametric analysis and comparative analysis.The findings demonstrate the great potential of GP approaches in predicting building distortion caused by tunnelling.The proposed equation can be used for the quick and intelligent prediction of tunnelling induced building deformation,providing valuable guidance for the practical design and risk assessment of urban tunnel construction projects. 展开更多
关键词 building deformation genetic programming tunnel construction modification factor
在线阅读 下载PDF
Rapid Prototype Development Approach for Genetic Programming
15
作者 Pei He Lei Zhang 《Journal of Computer and Communications》 2024年第2期67-79,共13页
Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of ... Genetic Programming (GP) is an important approach to deal with complex problem analysis and modeling, and has been applied in a wide range of areas. The development of GP involves various aspects, including design of genetic operators, evolutionary controls and implementations of heuristic strategy, evaluations and other mechanisms. When designing genetic operators, it is necessary to consider the possible limitations of encoding methods of individuals. And when selecting evolutionary control strategies, it is also necessary to balance search efficiency and diversity based on representation characteristics as well as the problem itself. More importantly, all of these matters, among others, have to be implemented through tedious coding work. Therefore, GP development is both complex and time-consuming. To overcome some of these difficulties that hinder the enhancement of GP development efficiency, we explore the feasibility of mutual assistance among GP variants, and then propose a rapid GP prototyping development method based on πGrammatical Evolution (πGE). It is demonstrated through regression analysis experiments that not only is this method beneficial for the GP developers to get rid of some tedious implementations, but also enables them to concentrate on the essence of the referred problem, such as individual representation, decoding means and evaluation. Additionally, it provides new insights into the roles of individual delineations in phenotypes and semantic research of individuals. 展开更多
关键词 Genetic programming Grammatical Evolution Gene Expression programming Regression Analysis Mathematical Modeling Rapid Prototype Development
在线阅读 下载PDF
A Dimensional Reduction Approach Based on Essential Constraints in Linear Programming
16
作者 Eirini I. Nikolopoulou George S. Androulakis 《American Journal of Operations Research》 2024年第1期1-31,共31页
This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted av... This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted average and the cosine simplex algorithm. The first approach identifies binding constraints by using the weighted average of each constraint, whereas the second algorithm is based on the cosine similarity between the vector of the objective function and the constraints. These two approaches are complementary, and when used together, they locate the essential subset of initial constraints required for solving medium and large-scale linear programming problems. After reducing the dimension of the linear programming problem using the subset of the essential constraints, the solution method can be chosen from any suitable method for linear programming. The proposed approach was applied to a set of well-known benchmarks as well as more than 2000 random medium and large-scale linear programming problems. The results are promising, indicating that the new approach contributes to the reduction of both the size of the problems and the total number of iterations required. A tree-based classification model also confirmed the need for combining the two approaches. A detailed numerical example, the general numerical results, and the statistical analysis for the decision tree procedure are presented. 展开更多
关键词 Linear programming Binding Constraints Dimension Reduction Cosine Similarity Decision Analysis Decision Trees
在线阅读 下载PDF
Prediction of seismic-induced bending moment and lateral displacement in closed and open-ended pipe piles:A genetic programming approach
17
作者 Laith Sadik Duaa Al-Jeznawi +2 位作者 Saif Alzabeebee Musab A.Q.Al-Janabi Suraparb Keawsawasvong 《Artificial Intelligence in Geosciences》 2024年第1期82-95,共14页
Ensuring the reliability of pipe pile designs under earthquake loading necessitates an accurate determination of lateral displacement and bending moment,typically achieved through complex numerical modeling to address... Ensuring the reliability of pipe pile designs under earthquake loading necessitates an accurate determination of lateral displacement and bending moment,typically achieved through complex numerical modeling to address the intricacies of soil-pile interaction.Despite recent advancements in machine learning techniques,there is a persistent need to establish data-driven models that can predict these parameters without using numerical simulations due to the difficulties in conducting correct numerical simulations and the need for constitutive modelling parameters that are not readily available.This research presents novel lateral displacement and bending moment predictive models for closed and open-ended pipe piles,employing a Genetic Programming(GP)approach.Utilizing a soil dataset extracted from existing literature,comprising 392 data points for both pile types embedded in cohesionless soil and subjected to earthquake loading,the study intentionally limited input parameters to three features to enhance model simplicity:Standard Penetration Test(SPT)corrected blow count(N60),Peak Ground Acceleration(PGA),and pile slenderness ratio(L/D).Model performance was assessed via coefficient of determination(R^(2)),Root Mean Squared Error(RMSE),and Mean Absolute Error(MAE),with R^(2) values ranging from 0.95 to 0.99 for the training set,and from 0.92 to 0.98 for the testing set,which indicate of high accuracy of prediction.Finally,the study concludes with a sensitivity analysis,evaluating the influence of each input parameter across different pile types. 展开更多
关键词 Genetic programming Pipe piles Lateral response Bending moment Earthquake loading Standard penetration test Machine learning
在线阅读 下载PDF
Optimization Techniques for GPU-Based Parallel Programming Models in High-Performance Computing
18
作者 Shuntao Tang Wei Chen 《信息工程期刊(中英文版)》 2024年第1期7-11,共5页
This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from g... This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from graphic-centric processors to versatile computing units,it delves into the nuanced optimization of memory access,thread management,algorithmic design,and data structures.These optimizations are critical for exploiting the parallel processing capabilities of GPUs,addressingboth the theoretical frameworks and practical implementations.By integrating advanced strategies such as memory coalescing,dynamic scheduling,and parallel algorithmic transformations,this research aims to significantly elevate computational efficiency and throughput.The findings underscore the potential of optimized GPU programming to revolutionize computational tasks across various domains,highlighting a pathway towards achieving unparalleled processing power and efficiency in HPC environments.The paper not only contributes to the academic discourse on GPU optimization but also provides actionable insights for developers,fostering advancements in computational sciences and technology. 展开更多
关键词 Optimization Techniques GPU-Based Parallel programming Models High-Performance Computing
在线阅读 下载PDF
A genetic programming approach with adaptive region detection to skin cancer image classification
19
作者 Kunjie Yu Jintao Lian +3 位作者 Ying Bi Jing Liang Bing Xue Mengjie Zhang 《Journal of Automation and Intelligence》 2024年第4期240-249,共10页
Dermatologists typically require extensive experience to accurately classify skin cancer.In recent years,the development of computer vision and machine learning has provided new methods for assisted diagnosis.Existing... Dermatologists typically require extensive experience to accurately classify skin cancer.In recent years,the development of computer vision and machine learning has provided new methods for assisted diagnosis.Existing skin cancer image classification methods have certain limitations,such as poor interpretability,the requirement of domain knowledge for feature extraction,and the neglect of lesion area information in skin images.This paper proposes a new genetic programming(GP)approach to automatically learn global and/or local features from skin images for classification.To achieve this,a new function set and a new terminal set have been developed.The proposed GP method can automatically and flexibly extract effective local/global features from different types of input images,thus providing a comprehensive description of skin images.A new region detection function has been developed to select the lesion areas from skin images for feature extraction.The performance of this approach is evaluated on three skin cancer image classification tasks,and compared with three GP methods and six non-GP methods.The experimental results show that the new approach achieves significantly better or similar performance in most cases.Further analysis validates the effectiveness of our parameter settings,visualizes the multiple region detection functions used in the individual evolved by the proposed approach,and demonstrates its good convergence ability. 展开更多
关键词 Genetic programming Skin cancer image classification Region detection Feature extraction
在线阅读 下载PDF
An Integer Programming Approach for Scheduling a Professional Sports League
20
作者 Vardges Melkonian 《American Journal of Computational Mathematics》 2024年第4期401-423,共23页
This paper gives integer linear programming (ILP) models for scheduling the League Phase of one of the most popular professional club competitions in the world, UEFA Champion’s League. There are 36 teams in the compe... This paper gives integer linear programming (ILP) models for scheduling the League Phase of one of the most popular professional club competitions in the world, UEFA Champion’s League. There are 36 teams in the competition, but each team plays only 8 other teams in the League Phase. Thus, the difficulty or ease of a team’s opponents, known as strength of schedule (SOS), compared to other teams will be different. Our main ILP model aims to minimize the maximum difference between SOS of any two teams, thus making the schedule as fair as possible. We also give a model for creating a timetable of all the matchups obtained by the first model. The models were implemented and tested using optimization software AMPL. Our main model obtained a schedule with a difference 0.4 between the highest and the lowest SOS, while that difference is 19 for the actual 2024-2025 competition. Thus, our model returns a schedule that is significantly fairer compared to the actual competition. 展开更多
关键词 Sport Scheduling Optimization Modeling integer Linear programming
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部