期刊文献+
共找到105,599篇文章
< 1 2 250 >
每页显示 20 50 100
Reprogramming induced neurons from olfactory ensheathing glial cells: A feasible approach for spinal cord injury repair
1
作者 Javier Sierra María Portela-Lomba +1 位作者 Diana Simón M.Teresa Moreno-Flores 《Neural Regeneration Research》 2026年第1期296-297,共2页
Every year, around the world, between 250,000 and 500,000 people suffer a spinal cord injury(SCI). SCI is a devastating medical condition that arises from trauma or disease-induced damage to the spinal cord, disruptin... Every year, around the world, between 250,000 and 500,000 people suffer a spinal cord injury(SCI). SCI is a devastating medical condition that arises from trauma or disease-induced damage to the spinal cord, disrupting the neural connections that allow communication between the brain and the rest of the body, which results in varying degrees of motor and sensory impairment. Disconnection in the spinal tracts is an irreversible condition owing to the poor capacity for spontaneous axonal regeneration in the affected neurons. 展开更多
关键词 iNJURY feasible programming
暂未订购
Quality-guaranteed Dubins Path Planning for USV Based on Mixed-integer Piecewise linear Programming for Addressing the Extended Minimum-time Intercept Problem
2
作者 Xing Zhou Kelin Zhu +3 位作者 Shuang Liu Zhaoqing Li Wenxin Zhang Kang Du 《哈尔滨工程大学学报(英文版)》 2026年第1期216-227,共12页
During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive... During the use of robotics in applications such as antiterrorism or combat,a motion-constrained pursuer vehicle,such as a Dubins unmanned surface vehicle(USV),must get close enough(within a prescribed zero or positive distance)to a moving target as quickly as possible,resulting in the extended minimum-time intercept problem(EMTIP).Existing research has primarily focused on the zero-distance intercept problem,MTIP,establishing the necessary or sufficient conditions for MTIP optimality,and utilizing analytic algorithms,such as root-finding algorithms,to calculate the optimal solutions.However,these approaches depend heavily on the properties of the analytic algorithm,making them inapplicable when problem settings change,such as in the case of a positive effective range or complicated target motions outside uniform rectilinear motion.In this study,an approach employing a high-accuracy and quality-guaranteed mixed-integer piecewise-linear program(QG-PWL)is proposed for the EMTIP.This program can accommodate different effective interception ranges and complicated target motions(variable velocity or complicated trajectories).The high accuracy and quality guarantees of QG-PWL originate from elegant strategies such as piecewise linearization and other developed operation strategies.The approximate error in the intercept path length is proved to be bounded to h^(2)/(4√2),where h is the piecewise length. 展开更多
关键词 Minimum-time intercept problem Dubins vehicle Mixed-integer piecewise-linear program LiNEARiZATiON Approximate error trigonometric function USV
在线阅读 下载PDF
Safe flight corridor constrained sequential convex programming for efficient trajectory generation of fixed-wing UAVs 被引量:2
3
作者 Jing SUN Guangtong XU +2 位作者 Zhu WANG Teng LONG Jingliang SUN 《Chinese Journal of Aeronautics》 2025年第1期537-550,共14页
Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequent... Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time. 展开更多
关键词 Fixed-wing unmanned aerial vehicle Efficient trajectory planning Safe flight corridor Sequential convex programming Customized convex optimizer
原文传递
Glia-to-neuron reprogramming to the rescue?
4
作者 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
暂未订购
Neurocircuit regeneration by extracellular matrix reprogramming
5
作者 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
基于CDIO理念的“Python程序设计”课程教学实践改革
6
作者 骆岩红 曹维萍 《计算机应用文摘》 2026年第1期53-55,62,共4页
针对传统程序设计语言课程中普遍存在的理论与实践脱节、学生知识应用能力薄弱等问题,文章基于CDIO工程教育模式,提出了一套“Python程序设计”课程教学改革方案。该方案以培养学生解决实际工程问题的能力为核心目标,通过将CDIO理念深... 针对传统程序设计语言课程中普遍存在的理论与实践脱节、学生知识应用能力薄弱等问题,文章基于CDIO工程教育模式,提出了一套“Python程序设计”课程教学改革方案。该方案以培养学生解决实际工程问题的能力为核心目标,通过将CDIO理念深度融入教学内容与教学方法,旨在帮助学生掌握编程技术的实践应用,激发学生对程序设计课程的学习兴趣。改革方案更加注重学生在学习过程中应具备的能力与素质培养,强调创新能力、团队协作能力和实践能力的综合发展,从而有效提升学生的实际应用水平与就业竞争力。 展开更多
关键词 CDiO Python程序设计 项目驱动
在线阅读 下载PDF
Research on Human-Computer Collaboration Paradigm in AIGC-Empowered High-Level Language Programming Courses
7
作者 Hongyuan Wang Baokai Zu +2 位作者 Yafang Li Wanting Zhu Hongli Chen 《Journal of Contemporary Educational Research》 2025年第5期285-289,共5页
With the rapid development of artificial intelligence technology,AIGC(Artificial Intelligence-Generated Content)has triggered profound changes in the field of high-level language programming courses.This paper deeply ... With the rapid development of artificial intelligence technology,AIGC(Artificial Intelligence-Generated Content)has triggered profound changes in the field of high-level language programming courses.This paper deeply explored the application principles,advantages,and limitations of AIGC in intelligent code generation,analyzed the new mode of human-computer collaboration in high-level language programming courses driven by AIGC,discussed the impact of human-computer collaboration on programming efficiency and code quality through practical case studies,and looks forward to future development trends.This research aims to provide theoretical and practical guidance for high-level language programming courses and promote innovative development of high-level language programming courses under the human-computer collaboration paradigm. 展开更多
关键词 Human-computer collaboration AiGC High-level language programming intelligence programming Efficiency improvement
在线阅读 下载PDF
A 28 nm 576K RRAM-based computing-in-memory macro featuring hybrid programming with area efficiency of 2.82 TOPS/mm^(2)
8
作者 Siqi Liu Songtao Wei +7 位作者 Peng Yao Dong Wu Lu Jie Sining Pan Jianshi Tang Bin Gao He Qian Huaqiang Wu 《Journal of Semiconductors》 2025年第6期112-119,共8页
Computing-in-memory(CIM)has been a promising candidate for artificial-intelligent applications thanks to the absence of data transfer between computation and storage blocks.Resistive random access memory(RRAM)based CI... Computing-in-memory(CIM)has been a promising candidate for artificial-intelligent applications thanks to the absence of data transfer between computation and storage blocks.Resistive random access memory(RRAM)based CIM has the advantage of high computing density,non-volatility as well as high energy efficiency.However,previous CIM research has predominantly focused on realizing high energy efficiency and high area efficiency for inference,while little attention has been devoted to addressing the challenges of on-chip programming speed,power consumption,and accuracy.In this paper,a fabri-cated 28 nm 576K RRAM-based CIM macro featuring optimized on-chip programming schemes is proposed to address the issues mentioned above.Different strategies of mapping weights to RRAM arrays are compared,and a novel direct-current ADC design is designed for both programming and inference stages.Utilizing the optimized hybrid programming scheme,4.67×programming speed,0.15×power saving and 4.31×compact weight distribution are realized.Besides,this macro achieves a normalized area efficiency of 2.82 TOPS/mm2 and a normalized energy efficiency of 35.6 TOPS/W. 展开更多
关键词 computing-in-memory on-chip programming scheme hybrid programming resistive random access memory matrix-vector-multiplication acceleration
在线阅读 下载PDF
From flying dreams to programming pioneer
9
作者 孙启禄 《疯狂英语(新读写)》 2025年第7期24-27,76,共5页
More than seventy years before airplanes were invented,a twelve⁃year⁃old girl named Ada Lovelace dreamed of flying.She studied birds and experimented with materials to make wings,even writing a guide called Flyology.B... More than seventy years before airplanes were invented,a twelve⁃year⁃old girl named Ada Lovelace dreamed of flying.She studied birds and experimented with materials to make wings,even writing a guide called Flyology.But her curiosity didnt stop there. 展开更多
关键词 GUiDE flyology ada lovelace programming pioneer FLYiNG
在线阅读 下载PDF
Evaluation of Integer Programming Solvers to Improve the Efficiency of Individual Work Planning
10
作者 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
Adapting High-Level Language Programming(C Language)Education in the Era of Large Language Models
11
作者 Baokai Zu Hongyuan Wang +1 位作者 Hongli Chen Yafang Li 《Journal of Contemporary Educational Research》 2025年第5期264-269,共6页
With the widespread application of large language models(LLMs)in natural language processing and code generation,traditional High-Level Language Programming courses are facing unprecedented challenges and opportunitie... With the widespread application of large language models(LLMs)in natural language processing and code generation,traditional High-Level Language Programming courses are facing unprecedented challenges and opportunities.As a core programming language for computer science majors,C language remains irreplaceable due to its foundational nature and engineering adaptability.This paper,based on the rapid development of large model technologies,proposes a systematic reform design for C language teaching,focusing on teaching objectives,content structure,teaching methods,and evaluation systems.The article suggests a teaching framework centered on“human-computer collaborative programming,”integrating prompt training,AI-assisted debugging,and code generation analysis,aiming to enhance students’problem modeling ability,programming expression skills,and AI collaboration literacy. 展开更多
关键词 Large language models(LLMs) High-level language programming C language Human-computer collaborative programming
在线阅读 下载PDF
Teaching Reform of the C Programming Language Course Integrating OBE Concept and AI Assistance under the New Engineering Background
12
作者 Arzigul Ahat Gulnaz Alimjan 《Journal of Contemporary Educational Research》 2025年第7期197-202,共6页
With the continuous advancement of the New Engineering Education initiative,universities are raising the standards for cultivating engineering talents.C Programming Language,as a core course for computer science and r... With the continuous advancement of the New Engineering Education initiative,universities are raising the standards for cultivating engineering talents.C Programming Language,as a core course for computer science and related majors,plays a fundamental role in developing logical thinking,programming skills,and engineering practice.However,problems such as outdated content,weak practical connections,and single assessment methods still exist in current teaching,which affects both learning outcomes and students’skill development.Based on the outcome-based education(OBE)approach and supported by AI-assisted teaching tools,this paper proposes a reform plan focusing on teaching content,instructional methods,and evaluation systems.The goal is to enhance students’overall abilities and practical innovation skills,and to align the course more closely with modern industry needs. 展开更多
关键词 New Engineering C programming Language Teaching reform OBE concept Ai-assisted instruction
在线阅读 下载PDF
Regular control surfaces of a toric patch and integer programming
13
作者 WANG Han ZHU Chun-gang 《Applied Mathematics(A Journal of Chinese Universities)》 2025年第4期853-867,共15页
Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When al... Toric patch is a kind of rational multisided patch,which is associated with a finite integer lattice points set A.A set of weights is defined which depend on a parameter according to regular decomposition of A.When all weights of the patch tend to infinity,we obtain the limiting form of toric patch which is called its regular control surface.The diferent weights may induce the diferent regular control surfaces of the same toric patch.It prompts us to consider that how many regular control surfaces of a toric patch.In this paper,we study the regular decompositions of A by using integer programming method firstly,and then provide the relationship between all regular decompositions of A and corresponding state polytope.Moreover,we present that the number of regular control surfaces of a toric patch associated with A is equal to the number of regular decompositions of A.An algorithm to calculate the number of regular control surfaces of toric patch is provided.The algorithm also presents a method to construct all of the regular control surfaces of a toric patch.At last,the application of proposed result in shape deformation is demonstrated by several examples. 展开更多
关键词 toric patch regular control surfaces integer programming regular decompositions state poly-tope
在线阅读 下载PDF
Glucocorticoid-insulin like growth factor 1 axis programming might be involved in pancreaticβ-cell dysplasia and dysfunction in female offspring rats exposed to caffeine prenatally
14
作者 Shuxia Gui Xiaoling Guo +2 位作者 Yongguo Dai Hao Kou Hui Wang 《Food Science and Human Wellness》 2025年第10期4262-4277,共16页
Prenatal caffeine exposure(PCE)leads to intrauterine growth retardation and altered glucose homeostasis after birth,but the underlying mechanism remains unclear.This study aims to investigate the alteration of pancrea... Prenatal caffeine exposure(PCE)leads to intrauterine growth retardation and altered glucose homeostasis after birth,but the underlying mechanism remains unclear.This study aims to investigate the alteration of pancreatic development and insulin biosynthesis in the PCE female offspring and explore the intrauterine programming mechanism.Pregnant rats were orally treated with 120 mg/(kg·day)of caffeine from gestational day(GD)9 to 20.Results showed that fetal pancreaticβ-cells in the PCE group exhibited reduced mass and impaired insulin synthesis function,as evidenced by decreased expression of developmental and functional genes and reduced pancreatic insulin content.At postnatal week(PW)12,the PCE offspring exhibited glucose intolerance,diminishedβ-cell mass,and lower blood insulin levels.However,by PW28,glucose tolerance showed some improvement.Both in vivo and in vitro findings collectively indicated that excessive serum corticosterone(CORT)levels of the PCE fetuses may act through the activation of the pancreatic glucocorticoid receptor(GR)and recruitment of histone deacetylase 9(HDAC9),leading to H3K9 deacetylation in promoter and downregulation of insulin-like growth factor 1(IGF1),thereby inhibiting pancreatic islet morphogenesis and insulin synthesis in fetal rats.Furthermore,the PCE offspring after birth exhibited decreased blood CORT levels,increased H3K9 acetylation in promoter and upregulated gene expression of the pancreatic IGF1 promoter region,accompanied by elevated insulin biosynthesis.However,when exposed to chronic stress,the above changes were totally reversed.Conclusively,“glucocorticoid-insulin like growth factor 1(GC-IGF1)axis”programming may be involved in pancreaticβ-cell dysplasia and dysfunction in the PCE female offspring. 展开更多
关键词 Prenatal caffeine exposure Pancreatic development GLUCOCORTiCOiDS insulin-like growth factor 1 intrauterine programming
暂未订购
A selective survey on mathematical programming in macroeconomics
15
作者 CAI Zong-wu HU Jing-xian 《Applied Mathematics(A Journal of Chinese Universities)》 2025年第4期955-989,共35页
This paper surveys the literature for the optimization problems in both discrete and continuous time models in macroeconomics,and provides an overview over some related computational methods to solve the models linear... This paper surveys the literature for the optimization problems in both discrete and continuous time models in macroeconomics,and provides an overview over some related computational methods to solve the models linearly and nonlinearly,and to compute the transition dynamics and the impulse response functions.Also,the introduction of the financial sectors,the continuous time analysis,and the advanced mathematical tools into the general equilibrium framework expands greatly the scope of the interdisciplinary research to mathematics,statistics and econometrics,and creates further space for exploration and collaboration.Finally,some future research issues related to this topic are highlighted. 展开更多
关键词 diffusion models dynamic programming general equilibrium finite difference methods nonlinear models
在线阅读 下载PDF
Cat Swarm Algorithm Generated Based on Genetic Programming Framework Applied in Digital Watermarking
16
作者 Shu-Chuan Chu Libin Fu +2 位作者 Jeng-Shyang Pan Xingsi Xue Min Liu 《Computers, Materials & Continua》 2025年第5期3135-3163,共29页
Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programm... Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programming(GP),characterized by its tree-based solution structure,is a widely adopted technique for optimizing the structure of mathematical models tailored to real-world problems.This paper introduces a GP-based framework(GPEAs)for the autonomous generation of update formulas,aiming to reduce human intervention.Partial modifications to tree-based GP have been instigated,encompassing adjustments to its initialization process and fundamental update operations such as crossover and mutation within the algorithm.By designing suitable function sets and terminal sets tailored to the selected evolutionary algorithm,and ultimately derive an improved update formula.The Cat Swarm Optimization Algorithm(CSO)is chosen as a case study,and the GP-EAs is employed to regenerate the speed update formulas of the CSO.To validate the feasibility of the GP-EAs,the comprehensive performance of the enhanced algorithm(GP-CSO)was evaluated on the CEC2017 benchmark suite.Furthermore,GP-CSO is applied to deduce suitable embedding factors,thereby improving the robustness of the digital watermarking process.The experimental results indicate that the update formulas generated through training with GP-EAs possess excellent performance scalability and practical application proficiency. 展开更多
关键词 Cat swarm algorithm genetic programming digital watermarking update mode mode generation framework
在线阅读 下载PDF
Evaluation of underground hard rock mine pillar stability using gene expression programming and decision tree-support vector machine models
17
作者 Mohammad H.Kadkhodaei Ebrahim Ghasemi +1 位作者 Jian Zhou Melika Zahraei 《Deep Underground Science and Engineering》 2025年第1期18-34,共17页
Assessing the stability of pillars in underground mines(especially in deep underground mines)is a critical concern during both the design and the operational phases of a project.This study mainly focuses on developing... Assessing the stability of pillars in underground mines(especially in deep underground mines)is a critical concern during both the design and the operational phases of a project.This study mainly focuses on developing two practical models to predict pillar stability status.For this purpose,two robust models were developed using a database including 236 case histories from seven underground hard rock mines,based on gene expression programming(GEP)and decision tree-support vector machine(DT-SVM)hybrid algorithms.The performance of the developed models was evaluated based on four common statistical criteria(sensitivity,specificity,Matthews correlation coefficient,and accuracy),receiver operating characteristic(ROC)curve,and testing data sets.The results showed that the GEP and DT-SVM models performed exceptionally well in assessing pillar stability,showing a high level of accuracy.The DT-SVM model,in particular,outperformed the GEP model(accuracy of 0.914,sensitivity of 0.842,specificity of 0.929,Matthews correlation coefficient of 0.767,and area under the ROC of 0.897 for the test data set).Furthermore,upon comparing the developed models with the previous ones,it was revealed that both models can effectively determine the condition of pillar stability with low uncertainty and acceptable accuracy.This suggests that these models could serve as dependable tools for project managers,aiding in the evaluation of pillar stability during the design and operational phases of mining projects,despite the inherent challenges in this domain. 展开更多
关键词 decision tree-support vector machine(DT-SVM) gene expression programming(GEP) hard rock pillar stability underground mining
原文传递
Mixed integer programming modeling for the satellite three-dimensional component assignment and layout optimization problem
18
作者 Yufeng XIA Xianqi CHEN +3 位作者 Zhijia LIU Weien ZHOU Wen YAO Zhongneng ZHANG 《Chinese Journal of Aeronautics》 2025年第6期427-447,共21页
Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to en... Satellite Component Layout Optimization(SCLO) is crucial in satellite system design.This paper proposes a novel Satellite Three-Dimensional Component Assignment and Layout Optimization(3D-SCALO) problem tailored to engineering requirements, aiming to optimize satellite heat dissipation while considering constraints on static stability, 3D geometric relationships between components, and special component positions. The 3D-SCALO problem is a challenging bilevel combinatorial optimization task, involving the optimization of discrete component assignment variables in the outer layer and continuous component position variables in the inner layer,with both influencing each other. To address this issue, first, a Mixed Integer Programming(MIP) model is proposed, which reformulates the original bilevel problem into a single-level optimization problem, enabling the exploration of a more comprehensive optimization space while avoiding iterative nested optimization. Then, to model the 3D geometric relationships between components within the MIP framework, a linearized 3D Phi-function method is proposed, which handles non-overlapping and safety distance constraints between cuboid components in an explicit and effective way. Subsequently, the Finite-Rectangle Method(FRM) is proposed to manage 3D geometric constraints for complex-shaped components by approximating them with a finite set of cuboids, extending the applicability of the geometric modeling approach. Finally, the feasibility and effectiveness of the proposed MIP model are demonstrated through two numerical examples"and a real-world engineering case, which confirms its suitability for complex-shaped components and real engineering applications. 展开更多
关键词 Mixed integer programming modeling Three-dimensional component assignment Layout optimization Phi-function Finite-rectangle method
原文传递
Improved Polytope Generation for CRC-Aided Adaptive Linear Programming Polar Decoding
19
作者 Xie Mutong Du Zhongze +2 位作者 Zou Guoxue Tian Lin Yuan Jinhong 《China Communications》 2025年第12期124-136,共13页
Linear programming(LP)decoding is a classic decoding method for linear block codes,and has attracted recent researches because its potential in joint channel processing.However,for polar codes,LP decoders has long bee... Linear programming(LP)decoding is a classic decoding method for linear block codes,and has attracted recent researches because its potential in joint channel processing.However,for polar codes,LP decoders has long been outperformed by CRCaided successive cancellation list(CA-SCL)decoders.To increase the competitiveness of 5G NR LP polar decoding,it is possible to gain performance improvements by exploiting the cyclic redundancy check(CRC)setup.In this paper,we propose a combined scheme of reduced sparsified factor graph-sparsified CRC(RSFG-SCRC)and augmented generator matrix-CRC(AGM-CRC),for polytope generation in adaptive linear programming(ALP)decoder for 5G polar codes.Augmented generator matrix(AGM)polytope and improved maximum cycle strategy-auxiliary node pairs 4(MCS-ANP-4)algorithm are proposed,to make efficient use of CRC constraints and minimize the constraint size for the decoder.Numerical simulations show that adaptive linear programming decoders with our proposed RSFG-SCRC and AGM-CRC polytopes can achieve significantly better block error rate(BLER)performance than a benchmark CA-SCL-8 decoder especially in harsh low-to-medium SNR regions. 展开更多
关键词 codeword polytope cyclic redundancy check 5G NR linear programming decoding polar code
在线阅读 下载PDF
Residential Energy Scheduling With Solar Energy Based on Dyna Adaptive Dynamic Programming
20
作者 Kang Xiong Qinglai Wei Hongyang Li 《IEEE/CAA Journal of Automatica Sinica》 2025年第2期403-413,共11页
Learning-based methods have become mainstream for solving residential energy scheduling problems. In order to improve the learning efficiency of existing methods and increase the utilization of renewable energy, we pr... Learning-based methods have become mainstream for solving residential energy scheduling problems. In order to improve the learning efficiency of existing methods and increase the utilization of renewable energy, we propose the Dyna actiondependent heuristic dynamic programming(Dyna-ADHDP)method, which incorporates the ideas of learning and planning from the Dyna framework in action-dependent heuristic dynamic programming. This method defines a continuous action space for precise control of an energy storage system and allows online optimization of algorithm performance during the real-time operation of the residential energy model. Meanwhile, the target network is introduced during the training process to make the training smoother and more efficient. We conducted experimental comparisons with the benchmark method using simulated and real data to verify its applicability and performance. The results confirm the method's excellent performance and generalization capabilities, as well as its excellence in increasing renewable energy utilization and extending equipment life. 展开更多
关键词 Adaptive dynamic programming(ADP) dynamic residential scenarios optimal residential energy management smart grid
在线阅读 下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部