期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到426篇文章
< 1 2 … 22 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
OPTIMAL SCHEME FOR SEQUENTIAL COMPUTATIONS OF F_m(z) INTEGRALS IN AB INITIO CALCULATIONS----COMBINATORY USE OF UPWARD AND DOWNWARD RECURSIONS 认领 引用
1
《Chemical Research in Chinese Universities》 SCIE CAS 1986年第1期76-84,共9页
The quantitative rules of the transfer and variation of errors,when the Gaussian integral functions F.(z) are evaluated sequentially by recurring,have been expounded.The traditional viewpoint to negate the applicabili... The quantitative rules of the transfer and variation of errors,when the Gaussian integral functions F.(z) are evaluated sequentially by recurring,have been expounded.The traditional viewpoint to negate the applicability and reliability of upward recursive formula in principle is amended.An optimal scheme of upward-and downward-joint recursions has been developed for the sequential F(z) computations.No additional accuracy is needed with the fundamental term of recursion because the absolute error of Fn(z) always decreases with the recursive approach.The scheme can be employed in modifying any of existent subprograms for Fn computations.In the case of p-d-f-and g-type Gaussians,combining this method with Schaad's formulas can reduce,at least,the additive operations by a factor 40%;the multiplicative and exponential operations by a factor 60%. 展开更多
关键词 COMBINATORY USE OF UPWARD AND DOWNWARD RECURSIONS INTEGRALS IN AB INITIO CALCULATIONS OPTIMAL SCHEME FOR SEQUENTIAL COMPUTATIONS OF F_m down AB
暂未订购 下载PDF
Cooperative finite transmit-receive antenna selection and power allocation strategy for multi-target CFAR-detection in multisite MIMO radar intelligent group system under external uncertainty 认领 引用
2
作者 Cheng QI Junwei XIE +6 位作者 Haowei ZHANG Bo WANG Jinlin ZHANG Weijian LIU Weike FENG Qun ZHANG Rennong YANG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2026年第1期534-552,共19页
Within the domain of Intelligent Group Systems(IGSs),this paper develops a resourceaware multitarget Constant False Alarm Rate(CFAR)detection framework for multisite MIMO radar systems.It underscores the necessity of ... Within the domain of Intelligent Group Systems(IGSs),this paper develops a resourceaware multitarget Constant False Alarm Rate(CFAR)detection framework for multisite MIMO radar systems.It underscores the necessity of managing finite transmit and receive antennas and transmit power systematically to enhance detection performance.To tackle the multidimensional resource optimization challenge,we introduce a Cooperative Transmit-Receive Antenna Selection and Power Allocation(CTRSPA)strategy.It employs a perception-action cycle that incorporates uncertain external support information to optimize worst-case detection performance with multiple targets.First,we derive a closed-form expression that incorporates uncertainty for the noncoherent integration squared-law detection probability using the Neyman-Pearson criterion.Subsequently,a joint optimization model for antenna selection and power allocation in CFAR detection is formulated,incorporating practical radar resource constraints.Mathematically,this represents an NPhard problem involving coupled continuous and Boolean variables.We propose a three-stage method—Reformulation,Node Picker,and Convex Power Allocation—that capitalizes on the independent convexity of the optimization model for each variable,ensuring a near-optimal result.Simulations confirm the approach's effectiveness,efficiency,and timeliness,particularly for large-scale radar networks,and reveal the impact of threat levels,system layout,and detection parameters on resource allocation. 展开更多
关键词 Combinatorial optimization Constant False Alarm Rate(CFAR) Intelligent Group System Multisite MIMO radar Resource management Target detection
暂未订购 下载PDF
Quantitative Analysis Method of Lubricant Base Oil Composition Based on Combined Optimized Characteristic Wavenumber 认领 引用
3
作者 XIA Yanqiu NAY MINAUNG +1 位作者 WANG Yuxing FENG Xin 《摩擦学学报（中英文）》 EI CAS CSCD 北大核心 2026年第2期283-297,共15页
For the quantitative analysis of lube oil base oil components,three oil components,mineral oil(KN4010),hydrocarbon-based synthetic oil(PAO40),and synthetic ester(PriEco 3000)were selected as quantitative analysis obje... For the quantitative analysis of lube oil base oil components,three oil components,mineral oil(KN4010),hydrocarbon-based synthetic oil(PAO40),and synthetic ester(PriEco 3000)were selected as quantitative analysis objects,and then the mid-infrared spectral data of lube oil base oil samples formulated in different ratios were collected.The synergy interval partial least squares-binary grey wolf optimization algorithm(SiPLS-BGWO)combination optimization method was used to screen the characteristic wavenumbers in the full range to eliminate redundant invalid information and reduce the search space dimension.By optimizing the selection of characteristic wavenumbers,the SiPLS-BGWO approach not only enhanced the prediction accuracy but also demonstrated its ability to address challenges associated with overlapping spectral features in complex mixtures.The test results showed that the combined optimization model’s error indexes were significantly improved for the content prediction of mineral oil,hydrocarbonbased synthetic oil,and polyol ester.The RMSE(root mean square error)was reduced by up to 60.58% compared to using all spectral wavenumbers,and the fit indexes’R2 values were higher than 99%.The significant reduction in RMSE underscored the method’s capability to identify and eliminate irrelevant or noisy spectral information,ensuring that the predictive model focused only on relevant features.In addition,the SiPLS-BGWO method had reduced the number of characteristic wavenumbers to less than 40,significantly reducing the operational burden and effectively improving the accuracy and applicability of the quantitative analysis model for multi-matter components.The ability to reduce the number of characteristic wavenumbers to below 40 demonstrated the algorithm’s efficiency in dimensionality reduction while retaining essential predictive information.The results affirmed that the SiPLS-BGWO model was a powerful tool for predictive modeling,providing a balance between accuracy and efficiency in the quantitative analysis of multicomponent systems.And a novel framework for bridging the gap between spectral data complexity and actionable chemical insights,setting a precedent for future developments in the field. 展开更多
关键词 lubricant base oil mid-infrared spectroscopy feature wavenumber screening interval band screening combinatorial optimization model
暂未订购 下载PDF
Graph Guide Diffusion Solvers with Noises for Travelling Salesman Problem 认领 引用
4
作者 Yan Kong Xinpeng Guo Chih-Hsien Hsia 《Computers, Materials & Continua》 SCIE EI 2026年第3期689-707,共19页
With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard... With the development of technology,diffusion model-based solvers have shown significant promise in solving Combinatorial Optimization(CO)problems,particularly in tackling Non-deterministic Polynomial-time hard(NP-hard)problems such as the Traveling Salesman Problem(TSP).However,existing diffusion model-based solvers typically employ a fixed,uniform noise schedule(e.g.,linear or cosine annealing)across all training instances,failing to fully account for the unique characteristics of each problem instance.To address this challenge,we present GraphGuided Diffusion Solvers(GGDS),an enhanced method for improving graph-based diffusion models.GGDS leverages Graph Neural Networks(GNNs)to capture graph structural information embedded in node coordinates and adjacency matrices,dynamically adjusting the noise levels in the diffusion model.This study investigates the TSP by examining two distinct time-step noise generation strategies:cosine annealing and a Neural Network(NN)-based approach.We evaluate their performance across different problem scales,particularly after integrating graph structural information.Experimental results indicate that GGDS outperforms previous methods with average performance improvements of 18.7%,6.3%,and 88.7%on TSP-500,TSP-100,and TSP-50,respectively.Specifically,GGDS demonstrates superior performance on TSP-500 and TSP-50,while its performance on TSP-100 is either comparable to or slightly better than that of previous methods,depending on the chosen noise schedule and decoding strategy. 展开更多
关键词 Combinatorial optimization problem diffusion model noise schedule traveling salesman problem
暂未订购 下载PDF
THE COMBINATORY METHOD FOR DETERMINATION OF THE TURBULENT FLUXES AND UNIVERSAL FUNCTIONS IN THE SURFACE LAYER 认领 引用 被引量：3
5
作者 胡隐樵 奇跃进 《Acta meteorologica Sinica》 1993年第1期101-109,共9页
A combinatory method of determining the turbulent fluxes in the surface layer has been developed and their general representations have been thus obtained.The universal functions of the (M-O) similarity in the surface... A combinatory method of determining the turbulent fluxes in the surface layer has been developed and their general representations have been thus obtained.The universal functions of the (M-O) similarity in the surface layer can be de- termined by the method.The results calculated by using the ITCE's data indicate that the method is feasible. 展开更多
关键词 combinatory method turbulent flux universal function surface layer
Imination enables efficient formation of a pillararene-inspired host with endo-cavity hydrogen-bonding capability 认领 引用
6
作者 Sem Bleus Sergio Ribone +3 位作者 Renny Maria Losus Liliana Dobrzańska Luc Van Meervelt Wim Dehaen 《Chinese Chemical Letters》 SCIE CAS CSCD 2026年第6期563-567,共5页
The efficient design of novel macrocycles with enhanced properties over their parent scaffold represents a major challenge in supramolecular chemistry.Here,we exemplify imination as a purification-free method to devel... The efficient design of novel macrocycles with enhanced properties over their parent scaffold represents a major challenge in supramolecular chemistry.Here,we exemplify imination as a purification-free method to develop novel pillar[n]arene-like macrocycles with partial-belt nitrogen functionalization.Compared to similarly sized pillar[n]arene-inspired arenes,the strategy provides an increased scalability and an up to 16-fold improvement in macrocyclization yield.X-ray crystallography and theoretical calculations reveal a similar electron density and cavity size as pillar[5]arene.The altered geometry and enhanced flexibility,however,permit complexing di-,tri-and tetrasubstituted cyanobenzenes,generating guest complementarity to all-carbon pillar[n]arenes.The suitable positioning of hydrogen bond acceptors facilitates binding based on endo-cavity hydrogen bonding,a feature largely unreported in peralkylated pillar[n]arenes.Reduction straightforwardly afforded a polyamine macrocycle of modified geometry. 展开更多
关键词 Supramolecular chemistry Host-guest Macrocycle Pillararene Dynamic combinatorial chemistry
暂未订购 下载PDF
Hybrid neuromorphic optoelectronic Ising machine via dynamic steep-activation feedback 认领 引用
7
作者 ZHENTONG LI XUELONG MA +7 位作者 QI CHEN ZHOUJUAN CUI MIAOMIAO WEI ZEZHOU TAN YANGRUI YOU ZHIRONG FAN YE XIAO MING LI 《Photonics Research》 SCIE EI CAS CSCD 2026年第7期2946-2957,共12页
Optoelectronic Ising machines have emerged as promising accelerators for combinatorial optimization,yet their performance is fundamentally hindered by intrinsic amplitude inhomogeneity,which distorts the effective Ham... Optoelectronic Ising machines have emerged as promising accelerators for combinatorial optimization,yet their performance is fundamentally hindered by intrinsic amplitude inhomogeneity,which distorts the effective Hamiltonian and traps the system in suboptimal local minima.Drawing inspiration from neural activation annealing,we propose and experimentally demonstrate the hybrid neuromorphic optoelectronic Ising machine(HNOIM),driven by a dynamic steep-activation feedback mechanism.This architecture orchestrates a synergistic temporal phase transition:initiating with a soft-activation analog phase to foster global exploration across energy barriers,followed by a rigorous digital locking phase that enforces discrete binary constraints.Benchmark evaluations on the G-set(G1-G21)demonstrate that the HNOIM consistently reaches the best known solutions(BKSs)on challenging instances,achieving a peak accuracy of 99.68%with a sub-millisecond time-to-solution(TTS≈0.44 ms).This performance represents a three-orders-of-magnitude speedup over optimized simulated annealing(SA≈199.61 ms)while maintaining superior solution fidelity.Crucially,in scalability stress tests on fully connected,9-bit weighted graphs(N=1601),the proposed method suppresses the residual energy gap from 2.93%to a negligible 0.068%.This 43-fold suppression of optimality error confirms that the timemultiplexed digital feedback effectively decouples solution fidelity from the cumulative noise of large-scale networks,establishing a robust and high-speed pathway for high-fidelity neuromorphic computing. 展开更多
关键词 neural activation annealingwe combinatorial optimizationyet amplitude inhomogeneitywhich combinatorial optimization dynamic steep activation feedback hybrid neuromorphic optoelectronic ising machine optoelectronic ising machines hybrid neuromorphic optoelectronic ising machine hnoim driven
暂未订购 下载PDF
High-Throughput Mapping of the Superconducting Phase Diagram Combining Composition-Spread FeSe1-xTexFilm with Carrier Doping 认领 引用
8
作者 Xuewei Wang Changhong Yuan +11 位作者 Tianxiang Liu Qiuyan Shi Yating Jiang Zhiyu Huang Yutong Wang Yuhan Jin Xingyu Jiang Beiyi Zhu Jie Yuan Zefeng Lin Qihong Chen Kui Jin 《Chinese Physics Letters》 SCIE EI CAS CSCD 2026年第5期174-181,共8页
A high-throughput method is developed to investigate the superconducting phase diagram of combinatorial(composition-spread)FeSe1-xTex(0≤x≤1)films under electron doping.Composition-spread FeSe1-xTexfilms ... A high-throughput method is developed to investigate the superconducting phase diagram of combinatorial(composition-spread)FeSe1-xTex(0≤x≤1)films under electron doping.Composition-spread FeSe1-xTexfilms are fabricated on single CaF2substrates using combinatorial laser molecular beam epitaxy.An integrated device structure combining ionic-liquid gating with FeSe1-xTex films enables simultaneous transport measurements over the whole composition range.Electrochemical gating significantly enhances the superconducting transition temperature(Tc)in the Se-rich region,reaching values above 40 K.With increasing Te content,both the maximum Tc and the gating efficiency gradually decrease.A comprehensive two-dimensional superconducting phase diagram is constructed as a function of Te content and doping level.These results establish an ideal approach for rapidly exploring the correlation between chemical composition,carrier doping,and superconductivity in Fe-based superconductors. 展开更多
关键词 ionic liquid gating composition spread fese x te x films electron dopingcomposition spread superconducting phase diagram high throughput mapping combinatorial laser molecular beam epitaxyan carrier doping transport measurements
暂未订购 下载PDF
Evolutionary hypergraph dismantling via deep reinforcement learning 认领 引用
9
作者 Junjie Qian Wenlan Wang +3 位作者 Hanyun Wang Qiqi Wang Yao Zhang Huijia Li 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第6期886-898,共13页
Assessing the vulnerability of complex systems requires effective hypergraph dismantling strategies,yet existing methods struggle with the dynamic nature of cascading failures and the rugged optimization landscapes of... Assessing the vulnerability of complex systems requires effective hypergraph dismantling strategies,yet existing methods struggle with the dynamic nature of cascading failures and the rugged optimization landscapes of high-order networks.In this paper,we propose a novel framework:hypergraph dismantling via evolutionary deep reinforcement learning(HD-EDR).First,we model a realistic dismantling environment incorporating hyperdegree-based and residual-capacitybased load redistribution mechanisms.Second,we introduce a hybrid learning architecture that synergizes the global exploration of evolutionary strategies with the gradient-based exploitation of deep reinforcement learning.A bidirectional parameter synchronization mechanism is designed to prevent the agent from being trapped in local optima.Furthermore,we integrate an inductive encoder to capture the evolving high-order dependencies of the residual network in real time.Extensive experiments across nine real-world datasets demonstrate that our framework significantly outperforms state-of-the-art baselines,providing a highly effective and robust strategy for maximizing structural damage in high-order networks. 展开更多
关键词 network dismantling hypergraph deep reinforcement learning evolutionary strategies combinatorial optimization
暂未订购 下载PDF
Enhanced multiscale quantum approximate optimization algorithm in multibody combinatorial optimization problems 认领 引用
10
作者 Lei-Lei Chen Ping Zou Ya-Fei Yu 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第7期424-434,共11页
At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability def... At present,the quantum approximate optimization algorithm(QAOA)faces scalability challenges in high-dimensional combinatorial optimization problems due to exponentially growing computational costs and reachability deficits for noisy intermediate-scale quantum(NISQ)devices.This study focuses on the multiscale quantum approximate optimization algorithm(MQAOA),which integrates renormalization group(RG)transformations with QAOA to address these limitations.Based on the connections between the variables in the problem to be solved,the weighted maximal matching method is employed to generate a variable partitioning strategy guiding the RG transformation.This approach not only extends the applicability of MQAOA to satisfiability(SAT)problems—including those with three-body and higher-order interactions in the problem Hamiltonian—but also eliminates the algorithm's sensitivity to problem density.Validations conducted on quantum simulators show that,after running two-round MQAOA,its capability is enhanced to identify optimal solutions with approximately 97%success probability as defined by the ground-state overlap for Max-2-SAT problems(78%success probability for Max-3-SAT problems).The results confirm the feasibility of MQAOA and establish it as a resource-efficient framework for complex combinatorial optimization problems,providing a pathway for NISQ-era deployment. 展开更多
关键词 quantum algorithm parameterized quantum circuit renormalization group transformation combinatorial optimization Max-SAT problems
暂未订购 下载PDF
Non-Markovian dynamical solver for efficient combinatorial optimization 认领 引用
11
作者 Haijie Xu Zhe Yuan 《Chinese Physics B》 SCIE EI CAS CSCD 2026年第2期583-590,共8页
We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into e... We incorporate a non-Markovian feedback mechanism into the simulated bifurcation method for dynamical solvers addressing combinatorial optimization problems.By reinjecting a portion of dissipated kinetic energy into each spin in a history-dependent and trajectory-informed manner,the method effectively suppresses early freezing induced by inelastic boundaries and enhances the system's ability to explore complex energy landscapes.Numerical results on the maximum cut(MAX-CUT)instances of fully connected Sherrington–Kirkpatrick(SK)spin glass models,including the 2000-spin K2000benchmark,demonstrate that the non-Markovian algorithm significantly improves both solution quality and convergence speed.Tests on randomly generated SK instances with 100 to 1000 spins further indicate favorable scalability and substantial gains in computational efficiency.Moreover,the proposed scheme is well suited for massively parallel hardware implementations,such as field-programmable gate arrays,providing a practical and scalable approach for solving large-scale combinatorial optimization problems. 展开更多
关键词 non-Markovian dynamics simulated bifurcation combinatorial optimization maximum cut(MAX-CUT)problem spin glass
暂未订购 下载PDF
Precedence Criteria and Gradient-Based Scheduling Algorithm for the Airplane Refueling Problem 认领 引用
12
作者 LIN Hao HE Cheng 《Chinese Quarterly Journal of Mathematics》 2026年第1期38-49,共12页
The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilom... The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilometer).As soon as one airplane runs out of fuel,it is dropping out of the flight.The problem asks for finding a refueling scheme such that the last plane in the air reach a maximal distance.An equivalent version is the n-vehicle exploration problem.The computational complexity of this non-linear combinatorial optimization problem is open so far.This paper employs the neighborhood exchange method of single-machine scheduling to study the precedence relations of jobs,so as to improve the necessary and sufficiency conditions of optimal solutions,and establish an efficient heuristic algorithm which is a generalization of several existing special algorithms. 展开更多
关键词 Combinatorial optimization Scheduling method The airplane refueling problem Optimality criteria Heuristic algorithm
暂未订购 下载PDF
COMBINATORY LOGIC AS THE FIRST-ORDER MATHEMATICAL THEORY 认领 引用
13
作者 江明德 文蕙 《Chinese Science Bulletin》 1989年第24期2079-2083,共5页
I. INTRODUCTION The exploration for a unified basis of the combinatory logic and the predicate calculus will promote laying a strict and thorough mathematical foundation of the programming language possessing itself o... I. INTRODUCTION The exploration for a unified basis of the combinatory logic and the predicate calculus will promote laying a strict and thorough mathematical foundation of the programming language possessing itself of the functional and logic paradigms. The purpose of this note, proceeding from the algebraic oersoective, is to formulize the first-order mathematical 展开更多
关键词 combinatory logic predicate calculus first-order mathemtical theory.
Consistency and axiomatization of a natural extensional combinatory logic 认领 引用
14
作者 蒋颖 《Science China Mathematics》 1996年第9期897-908,共12页
In the light of a question of J. L. Krivine about the consistency of an extensional λ-theory,an extensional combinatory logic ECL+U(G)+RU_∞+ is established, with its consistency model provedtheoretically and it is s... In the light of a question of J. L. Krivine about the consistency of an extensional λ-theory,an extensional combinatory logic ECL+U(G)+RU_∞+ is established, with its consistency model provedtheoretically and it is shown the it is not equivalent to any system of universal axioms. It is expressed bythe theory in first order logic that, for every given group G of order n, there simultaneously exist infinitelymany universal retractions and a surjective n-tuple notion, such that each element of G acts as a permutationof the components of the n-tuple, and as an Ap-automorphism of the model; further each of the universalretractions is invarian under the action of the Ap-automorphisms induced by G The difference between thetheory and that of Krivine is the G need not be a symmetric group. 展开更多
关键词 λ-theory an exteaional combinatory logic consistency
暂未订购 下载PDF
Convergence of Combinatorial p-th Ricci Flows in Euclidean Background Geometry 认领 引用
15
作者 Li Zhengkun Song Kai 《数学理论与应用》 2026年第2期68-79,共12页
Lin and Zhang first introduced the combinatorial p-th Ricci flows and generalized Chow-Luo’s classical results on combinatorial Ricci flows(when p=2)to any p>1.However,their generalization in Euclidean background ... Lin and Zhang first introduced the combinatorial p-th Ricci flows and generalized Chow-Luo’s classical results on combinatorial Ricci flows(when p=2)to any p>1.However,their generalization in Euclidean background geometry is incomplete:they only proved the convergence of discrete curvatures along the flow,but failed to establish the convergence of circle packing metrics.In this paper,by introducing a time-dependent normalization term C(t),we overcome the core obstacle arising from the lack of compactness for solutions to combinatorial p-th Ricci flows.Our results improve those of Lin and Zhang and generalize Chow-Luo’s classical results in Euclidean background geometry from p=2 to any p>1 in full generality. 展开更多
关键词 Combinatorial p-th Ricci flow;Time-dependent normalization term;Circle packing;Euclidean background geometry;Constant curvature metric
暂未订购 下载PDF
Advancements in production planning and scheduling within steel manufacturing:A review and its intelligent development 认领 引用 被引量：2
16
作者 Yongzhou Wang Zhong Zheng +4 位作者 Liang Guo Yongjie Yang Shiyu Zhang Xueying Liu Xiaoqiang Gao 《International Journal of Minerals,Metallurgy and Materials》 SCIE EI CAS CSCD 2025年第10期2322-2340,共19页
In the context of reducing its carbon emissions,the Chinese steel industry is currently undergoing an intelligent transformation to enhance its profitability and sustainability.The optimization of production planning ... In the context of reducing its carbon emissions,the Chinese steel industry is currently undergoing an intelligent transformation to enhance its profitability and sustainability.The optimization of production planning and scheduling plays a pivotal role in realizing these objectives such as improving production efficiency,saving energy,reducing carbon emissions,and enhancing quality.However,current practices in steel enterprises are largely dependent on experience-driven manual decision approaches supported by information systems,which are inadequate to meet the complex requirements of the industry.This study explores the current situation in production planning and scheduling,analyzes the characteristics and limitations of existing methods,and emphasizes the necessity and trends of intelligent systems.It surveys the current literature on production planning and scheduling in steel enterprises and analyzes the theoretical advancements and practical challenges associated with combinatorial and sequential optimization in this field.A key focus is on the limitations of current models and algorithms in effectively addressing the multi-objective and multiconstraint characteristics of steel produc-tion.To overcome these challenges,a novel framework for intelligent production planning and scheduling is proposed.This framework leverages data-and knowledge-driven decision-making and scenario adaptability,enabling the system to respond dynamically to real-time production conditions and market fluctuations.By integrating artificial intelligence and advanced optimization methodologies,the proposed framework improves the efficiency,cost-effectiveness,and environmental sustainability of steel manufacturing. 展开更多
关键词 steel manufacturing production planning and scheduling intelligent decision-making data-and knowledge-driven scene ad-aptability combinatorial and sequential optimization
暂未订购 下载PDF
Combinatorial innovation and lifecycle analysis of low-carbon energy technologies in China 认领 引用 被引量：1
17
作者 Zerun Jin Shengjun Zhu 《Geography and Sustainability》 CSCD 2025年第2期228-239,共12页
Measuring the lifecycle of low-carbon energy technologies is critical to better understanding the innovation pattern.However,previous studies on lifecycle either focus on technical details or just provide a general ov... Measuring the lifecycle of low-carbon energy technologies is critical to better understanding the innovation pattern.However,previous studies on lifecycle either focus on technical details or just provide a general overview,due to the lack of connection with innovation theories.This article attempts to fill this gap by analyzing the lifecycle from a combinatorial innovation perspective,based on patent data of ten low-carbon energy technologies in China from 1999 to 2018.The problem of estimating lifecycle stages can be transformed into analyzing the rise and fall of knowledge combinations.By building the international patent classification(IPC)co-occurrence matrix,this paper demonstrates the lifecycle evolution of technologies and develops an efficient quantitative index to define lifecycle stages.The mathematical measurement can effectively reflect the evolutionary pattern of technologies.Additionally,this article relates the macro evolution of lifecycle to the micro dynamic mechanism of technology paradigms.The sign of technology maturity is that new inventions tend to follow the patterns established by prior ones.Following this logic,this paper identifies different trends of paradigms in each technology field and analyze their transition.Furthermore,catching-up literature shows that drastic transformation of technology paradigms may open“windows of opportunity”for laggard regions.From the results of this paper,it is clear to see that latecomers can catch up with pioneers especially when there is a radical change in paradigms.Therefore,it is important for policy makers to capture such opportunities during the technology lifecycle and coordinate regional innovation resources. 展开更多
关键词 Combinatorial innovation Technology lifecycle Low-carbon energy technologies Catching-up
暂未订购 下载PDF
Systematic identification of terpene synthases from sacred lotus(Nelumbo nucifera)and heterologous biosynthesis of the insecticidal and antimicrobial compound γ-eudesmol 认领 引用
18
作者 Zhenni Xu Xueting Fang +8 位作者 Yao Zhi Xiaochun Xiao Jing Yang Jie Hu Hangzhi Zhu Fangfang Chen Weijia Cheng Tiangang Liu Li Lu 《Horticulture Research》 SCIE CSCD 2025年第10期223-231,共9页
Sacred lotus is widely used in the agricultural,nutraceutical,and pharmaceutical industries.Terpenes are not only crucial components of sacred lotus essential oil,but also serve as signaling molecules involved in plan... Sacred lotus is widely used in the agricultural,nutraceutical,and pharmaceutical industries.Terpenes are not only crucial components of sacred lotus essential oil,but also serve as signaling molecules involved in plantenvironment interactions.However,the biosynthesis of terpenes in sacred lotus has not yet been reported.Thus,gene-directed heterologous mining and combinatorial biosynthesis methods were used in this study to systematically characterize the function of terpene synthase genes in the sacred lotus.As a result,two monoterpene,11 sesquiterpene,and three diterpene products were synthesized,and a highly efficient γ-eudesmol synthase was discovered.In addition,a mechanistic study revealed that N314 is the key amino acid responsible for the secondary cyclization that produces γ-eudesmol.In vitro assays demonstrated that γ-eudesmol exhibited substantial insecticidal and antimicrobial activities.Furthermore,de novo biosynthesis of γ-eudesmol was achieved in a yeast chassis through a series of metabolic engineering strategies,reaching a titer of 801.66 mg/L in a shake flask,the highest yield reported to date.The present study uncovered the biosynthesis of terpenes in sacred lotus,as well as successfully synthesized the bioactive compound γ-eudesmol by synthetic biology.This comprehensive strategy can be readily adapted for investigation and the production of other valuable plant-derived natural products. 展开更多
关键词 systematically characterize function terpene synthase genes heterologous biosynthesis eudesmol sacred lotus Nelumbo nucifera terpene synthases combinatorial biosynthesis methods signaling molecules
暂未订购 下载PDF
An Adaptive Hybrid Metaheuristic for Solving the Vehicle Routing Problem with Time Windows under Uncertainty 认领 引用
19
作者 Manuel J.C.S.Reis 《Computers, Materials & Continua》 SCIE EI 2025年第11期3023-3039,共17页
The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic ... The Vehicle Routing Problem with Time Windows(VRPTW)presents a significant challenge in combinatorial optimization,especially under real-world uncertainties such as variable travel times,service durations,and dynamic customer demands.These uncertainties make traditional deterministic models inadequate,often leading to suboptimal or infeasible solutions.To address these challenges,this work proposes an adaptive hybrid metaheuristic that integrates Genetic Algorithms(GA)with Local Search(LS),while incorporating stochastic uncertainty modeling through probabilistic travel times.The proposed algorithm dynamically adjusts parameters—such as mutation rate and local search probability—based on real-time search performance.This adaptivity enhances the algorithm’s ability to balance exploration and exploitation during the optimization process.Travel time uncertainties are modeled using Gaussian noise,and solution robustness is evaluated through scenario-based simulations.We test our method on a set of benchmark problems from Solomon’s instance suite,comparing its performance under deterministic and stochastic conditions.Results show that the proposed hybrid approach achieves up to a 9%reduction in expected total travel time and a 40% reduction in time window violations compared to baseline methods,including classical GA and non-adaptive hybrids.Additionally,the algorithm demonstrates strong robustness,with lower solution variance across uncertainty scenarios,and converges faster than competing approaches.These findings highlight the method’s suitability for practical logistics applications such as last-mile delivery and real-time transportation planning,where uncertainty and service-level constraints are critical.The flexibility and effectiveness of the proposed framework make it a promising candidate for deployment in dynamic,uncertainty-aware supply chain environments. 展开更多
关键词 Vehicle routing problem with time windows(VRPTW) hybrid metaheuristic genetic algorithm local search uncertainty modeling stochastic optimization adaptive algorithms combinatorial optimization transportation and logistics robust scheduling
暂未订购 下载PDF
New Series Involving Binomial Coefficients(Ⅲ) 认领 引用
20
作者 SUN Zhi-wei 《Chinese Quarterly Journal of Mathematics》 2025年第4期372-392,共21页
We evaluate some series with summands involving a single binomial coefficient(^6k 3k).For example,we prove that■Motivated by Galois theory,we introduce the so-called Duality Principle for irrational series of Ramanu... We evaluate some series with summands involving a single binomial coefficient(^6k 3k).For example,we prove that■Motivated by Galois theory,we introduce the so-called Duality Principle for irrational series of Ramanujan’s type or Zeilberger’s type,and apply it to find 26 new irrational series identities.For example,we conjecture that■where ■for any integer d≡0,1 (mod 4) with (d/k) the Kronecker symbol. 展开更多
关键词 Binomial coefficient Combinatorial identity Infinite series Kronecker symbol L-function
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 22 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈