As synthetic biology advances,the necessity for robust biocontainment strategies for genetically engineered organisms(GEOs)grows increasingly critical to mitigate biosafety risks related to their potential environment...As synthetic biology advances,the necessity for robust biocontainment strategies for genetically engineered organisms(GEOs)grows increasingly critical to mitigate biosafety risks related to their potential environmental release.This paper aims to evaluate environment signal-dependent biocontainment systems for engineered organisms,focusing specifically on leveraging triggered responses and combinatorial systems.There are different types of triggers-chemical,light,temperature,and pH-this review illustrates how these systems can be designed to respond to environmental signals,ensuring a higher safety profile.It also focuses on combinatorial biocontainment to avoid consequences of unintended GEO release into an external environment.Case studies are discussed to demonstrate the practical applications of these systems in real-world scenarios.展开更多
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.展开更多
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 K_(2000)benchmark,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.展开更多
For combinatorial system of multilayer dynamics of fluids in porous media, the second order and first order upwind finite difference fractional steps schemes applicable to parallel arithmetic are put forward and two-d...For combinatorial system of multilayer dynamics of fluids in porous media, the second order and first order upwind finite difference fractional steps schemes applicable to parallel arithmetic are put forward and two-dimensional and three-dimensional schemes are used to form a complete set. Some techniques, such as implicit-explicit difference scheme, calculus of variations, multiplicative commutation rule of difference operators, decomposition of high order difference operators and prior estimates, are adopted. Optimal order estimates in L 2 norm are derived to determine the error in the second order approximate solution. This method has already been applied to the numerical simulation of migration-accumulation of oil resources. Keywords: combinatorial system, multilayer dynamics of fluids in porous media, two-class upwind finite difference fractional steps method, convergence, numerical simulation of energy sources.展开更多
The subsea production system is a vital equipment for offshore oil and gas production.The control system is one of the most important parts of it.Collecting and processing the signals of subsea sensors is the only way...The subsea production system is a vital equipment for offshore oil and gas production.The control system is one of the most important parts of it.Collecting and processing the signals of subsea sensors is the only way to judge whether the subsea production control system is normal.However,subsea sensors degrade rapidly due to harsh working environments and long service time.This leads to frequent false alarm incidents.A combinatorial reasoning-based abnormal sensor recognition method for subsea production control system is proposed.A combinatorial algorithm is proposed to group sensors.The long short-term memory network(LSTM)is used to establish a single inference model.A counting-based judging method is proposed to identify abnormal sensors.Field data from an offshore platform in the South China Sea is used to demonstrate the effect of the proposed method.The results show that the proposed method can identify the abnormal sensors effectively.展开更多
External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in...External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in the quantum computing epoch. Three hard problems on this new platform, Subgroup Root Problem, Multi-variant Subgroup Root Problem and Subgroup Action Problem are presented and well analyzed, which all have no relations with conjugacy. New secure public key encryption system and key agreement protocol are designed based on these hard problems. The new cryptosystems can be implemented in a general group environment other than in braid or Artin groups.展开更多
Contemporary world is developing system and we must have the new models. Any complex system interacts with its changing environment and its viability depends on its adaptability. The number of arbitrary coefficients i...Contemporary world is developing system and we must have the new models. Any complex system interacts with its changing environment and its viability depends on its adaptability. The number of arbitrary coefficients in the structure of equivalent equations of complex system changes in the process of learning. In systems with more than six variables, the number of arbitrary coefficients increases first, and then, passing through the maximum, begins to decrease. This phenomenon makes it possible to explain the processes of system growth, complication and death in biological, economical and physical-engineering systems. The author uses the Linguo-combinatorial method of investigation of complex systems, in taking key words for building equivalent equations. This phenomenon is able to increase the adaptability of different systems.展开更多
Auctions are important market mechanisms for the allocation of goods and services. Combinatorial auctions are those auctions in which buyers can place bids on combinations of items. Combinatorial auctions have many ap...Auctions are important market mechanisms for the allocation of goods and services. Combinatorial auctions are those auctions in which buyers can place bids on combinations of items. Combinatorial auctions have many applications. The paper presents the CRAB software system. CRAB is a non-commercial software system for generating, solving, and testing of combinatorial auction problems. The system solves problems by Balas’ method or by the primal-dual algo-rithm. CRAB is implemented in Ruby and it is distributed as the file crab.rb. The system is freely available on web pag-es for all interested展开更多
Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into...Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.展开更多
The complexity of cloud environments challenges secure resource management,especially for intrusion detection systems(IDS).Existing strategies struggle to balance efficiency,cost fairness,and threat resilience.This pa...The complexity of cloud environments challenges secure resource management,especially for intrusion detection systems(IDS).Existing strategies struggle to balance efficiency,cost fairness,and threat resilience.This paper proposes an innovative approach to managing cloud resources through the integration of a genetic algorithm(GA)with a“double auction”method.This approach seeks to enhance security and efficiency by aligning buyers and sellers within an intelligent market framework.It guarantees equitable pricing while utilizing resources efficiently and optimizing advantages for all stakeholders.The GA functions as an intelligent search mechanism that identifies optimal combinations of bids from users and suppliers,addressing issues arising from the intricacies of cloud systems.Analyses proved that our method surpasses previous strategies,particularly in terms of price accuracy,speed,and the capacity to manage large-scale activities,critical factors for real-time cybersecurity systems,such as IDS.Our research integrates artificial intelligence-inspired evolutionary algorithms with market-driven methods to develop intelligent resource management systems that are secure,scalable,and adaptable to evolving risks,such as process innovation.展开更多
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 optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology.However,they often belong to the computational class of NP-hard,presenting signific...Combinatorial optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology.However,they often belong to the computational class of NP-hard,presenting significant computational challenges.Traditional algorithms inspired by statistical physics like simulated annealing have been widely adopted.Recently,advancements in Ising machines,such as quantum annealers and coherent Ising machines,offer new paradigms for solving these problems efficiently by embedding them into the analog evolution of nonlinear dynamical systems.However,existing dynamics-based algorithms often suffer from low convergence rates and local minima traps.In this work,we introduce the dual mean-field dynamics into Ising machines.The approach integrates the gradient force and the transverse force into the dynamics of Ising machines in solving combinatorial optimization problems,making it easier for the system to jump out of the local minimums and allowing the dynamics to explore wider in configuration space.We conduct extensive numerical experiments using the Sherrington–Kirkpatrick spin glass up to 10000 spins and the maximum cut problems with the standard G-set benchmarks.The numerical results demonstrate that our dual mean-field dynamics approach enhances the performance of base Ising machines,providing a more effective solution for large-scale combinatorial optimization problems.展开更多
A necessary and suffcient condition is given for the equation Ax4+ 1 =By2 to have positive integer solution, and an effective method is derived for solving equation a2x4 + 1 = By2 in positive integers x, y for given h...A necessary and suffcient condition is given for the equation Ax4+ 1 =By2 to have positive integer solution, and an effective method is derived for solving equation a2x4 + 1 = By2 in positive integers x, y for given ho and B completely. Also, using a recently result of Ribet, Darmon and Merel, we proved that Erdos’ conjecture on combinatorial number is right.展开更多
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.展开更多
Objective:To evaluate simultaneous detection and differentiates of Brucella abortus(B.abortus) and Brucella melitensis(B.melitensis) through the combinatorial POR method.Methods:This study was designed using three pri...Objective:To evaluate simultaneous detection and differentiates of Brucella abortus(B.abortus) and Brucella melitensis(B.melitensis) through the combinatorial POR method.Methods:This study was designed using three primers that could simultaneously identify and differentiate two major species of pathogenic Brucella in humans and animals.Identification and differentiation of each species using the size of the PCR product were determined.To determine the specifieity of the method,bacteria close to the genus Brucella were used.Finally,to confirm PCR products.In addition to the products sequence,RFLP was performed on PCR products using restriction enzymes.Results:The method of optimized combinatorial PCR in this study could simultaneously detect and differentiate B.abortus and B.melitensis with high specificity and sensitivity in clinical samples.Differentiation of species is based on the resulting bands: therefore,the band 494 bp for B.abortus and 733 bp for B.melitensis were obtained.RFLP and sequencing results confirmed PCR results.Conclusions:The results of this study shows that without routine diagnostic methods such as culture and serology tests,using the molecular method of combinatorial PCR,important species of Brucella can be simultaneously identified and differentiated in clinical samples.展开更多
Conventionally, an experimentally determined phase diagram requires studies of phase formation at a range of temperatures for each composition, which takes years of effort from multiple research groups. Combinatorial ...Conventionally, an experimentally determined phase diagram requires studies of phase formation at a range of temperatures for each composition, which takes years of effort from multiple research groups. Combinatorial materials chip technology, featuring high-throughput synthesis and characterization, is able to determine the phase diagram of an entire composition spread of a binary or ternary system at a single temperature on one materials library, which, though significantly increasing efficiency, still requires many libraries processed at a series of temperatures in order to complete a phase diagram. In this paper, we propose a "one-chip method" to construct a complete phase diagram by individually synthesizing each pixel step by step with a progressive pulse of energy to heat at different temperatures while monitoring the phase evolution on the pixel in situ in real time. Repeating this process pixel by pixel throughout the whole chip allows the entire binary or ternary phase diagram to be mapped on one chip in a single experiment. The feasibility of this methodology is demonstrated in a study of a Ge-Sb-Te ternary alloy system, on which the amorphouscrystalline phase boundary is determined.展开更多
Hopfield neural network is a single layer feedforward neural network. Hopfield network requires some control parameters to be carefully selected, else the network is apt to converge to local minimum. An ant system is ...Hopfield neural network is a single layer feedforward neural network. Hopfield network requires some control parameters to be carefully selected, else the network is apt to converge to local minimum. An ant system is a nature inspired meta heuristic algorithm. It has been applied to several combinatorial optimization problems such as Traveling Salesman Problem, Scheduling Problems, etc. This paper will show an ant system may be used in tuning the network control parameters by a group of cooperated ants. The major advantage of this network is to adjust the network parameters automatically, avoiding a blind search for the set of control parameters. This network was tested on two TSP problems, 5 cities and 10 cities. The results have shown an obvious improvement.展开更多
Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems....Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.展开更多
The increasing complexity of modern functional materials leads to the demandof a cost efficient tool for the development of new products. One possible approach to this questionis the adaptation of combinatorial method...The increasing complexity of modern functional materials leads to the demandof a cost efficient tool for the development of new products. One possible approach to this questionis the adaptation of combinatorial methods to the specific requirements of materials industry.These methods, originally developed for the pharmaceutical industry, have recently been applied tothe screening of superconductive, magnetoresistant and photoluminescent materials. The principle ofthese combinatorial approaches is the deposition of large materials libraries in one processcombined with fast methods for the determination of the resulting properties. In this paper, thedeposition and characterization of laterally graded materials libraries (composition spread) ispresented. The films have been deposited by reactive magnetron sputtering, using two or threemetallic targets at a low angle to the substrate surface as well as a system of apertures. Toillustrate the advantages of combinatorial approaches for the development of advanced materials, themulticomponent metastable hardcoatings (Ti,Al)N and Ti-Al-Si-N are discussed with special emphasison the relations between structure and composition on the one hand and the oxidation resistance ofthese coatings on the other. The results illustrate that the composition spread approach is apowerful and cost efficient tool for the development and optimization of new multicomponentfunctional materials.展开更多
This paper presents a novel regular Quasi-Cyclic (QC)Low Density Parity Check (LDPC)codes with columnweight three and girth at least eight.These are designed on the basis of combinatorial design in which subsets appli...This paper presents a novel regular Quasi-Cyclic (QC)Low Density Parity Check (LDPC)codes with columnweight three and girth at least eight.These are designed on the basis of combinatorial design in which subsets applied for the construction of circulant matrices are determined by a particular subset.Considering the nonexistence of cycles four and six in the structure of the parity check matrix,a bound for their minimum weight is proposed.The simtdations conducted confirm that without applying a masking technique,the newly implemented codes have a performance similar to or better than other well-known codes.This is evident in the waterfall region, while their error floor at very low Bit Error Rate (BER)is expected.展开更多
基金supported by the Major Student Project,Manipal Institute of Technology,Manipal Academy of Higher Educa-tion,Manipal.
文摘As synthetic biology advances,the necessity for robust biocontainment strategies for genetically engineered organisms(GEOs)grows increasingly critical to mitigate biosafety risks related to their potential environmental release.This paper aims to evaluate environment signal-dependent biocontainment systems for engineered organisms,focusing specifically on leveraging triggered responses and combinatorial systems.There are different types of triggers-chemical,light,temperature,and pH-this review illustrates how these systems can be designed to respond to environmental signals,ensuring a higher safety profile.It also focuses on combinatorial biocontainment to avoid consequences of unintended GEO release into an external environment.Case studies are discussed to demonstrate the practical applications of these systems in real-world scenarios.
基金supported by the National Natural Science Foundation of China(Nos.62071482 and 62471348)the Shaanxi Association of Science and Technology Youth Talent Support Program Project,China(No.20230137)+1 种基金the Innovative Talents Cultivate Program for Technology Innovation Team of Shaanxi Province,China(No.2024RS-CXTD-08)the Youth Innovation Team of Shaanxi Universities,China。
文摘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.
基金supported by the National Key Research and Development Program of China(Grant No.2024YFA1408500)the National Natural Science Foundation of China(Grant Nos.12174028 and 12574115)the Open Fund of the State Key Laboratory of Spintronics Devices and Technologies(Grant No.SPL-2408)。
文摘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 K_(2000)benchmark,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.
基金This work was supported by the Major State Basic Research Program of China(Grant No. 1990328) the National Tackling Key Problem Program, the National Natural Science Foundation of China (Grant Nos. 19871051 and 19972039) the Doctorate Foundation
文摘For combinatorial system of multilayer dynamics of fluids in porous media, the second order and first order upwind finite difference fractional steps schemes applicable to parallel arithmetic are put forward and two-dimensional and three-dimensional schemes are used to form a complete set. Some techniques, such as implicit-explicit difference scheme, calculus of variations, multiplicative commutation rule of difference operators, decomposition of high order difference operators and prior estimates, are adopted. Optimal order estimates in L 2 norm are derived to determine the error in the second order approximate solution. This method has already been applied to the numerical simulation of migration-accumulation of oil resources. Keywords: combinatorial system, multilayer dynamics of fluids in porous media, two-class upwind finite difference fractional steps method, convergence, numerical simulation of energy sources.
基金supported by the National Key Research and Development Program of China (No.2022YFC2806102)the National Natural Science Foundation of China (No.52171287,52325107)+3 种基金High-tech Ship Research Project of Ministry of Industry and Information Technology (No.2023GXB01-05-004-03,No.GXBZH2022-293)the Science Foundation for Distinguished Young Scholars of Shandong Province (No.ZR2022JQ25)the Taishan Scholars Project (No.tsqn201909063)the Fundamental Research Funds for the Central Universities (No.24CX10006A)。
文摘The subsea production system is a vital equipment for offshore oil and gas production.The control system is one of the most important parts of it.Collecting and processing the signals of subsea sensors is the only way to judge whether the subsea production control system is normal.However,subsea sensors degrade rapidly due to harsh working environments and long service time.This leads to frequent false alarm incidents.A combinatorial reasoning-based abnormal sensor recognition method for subsea production control system is proposed.A combinatorial algorithm is proposed to group sensors.The long short-term memory network(LSTM)is used to establish a single inference model.A counting-based judging method is proposed to identify abnormal sensors.Field data from an offshore platform in the South China Sea is used to demonstrate the effect of the proposed method.The results show that the proposed method can identify the abnormal sensors effectively.
基金Supported by the National Natural Science Funda-tion of China (60403027)
文摘External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in the quantum computing epoch. Three hard problems on this new platform, Subgroup Root Problem, Multi-variant Subgroup Root Problem and Subgroup Action Problem are presented and well analyzed, which all have no relations with conjugacy. New secure public key encryption system and key agreement protocol are designed based on these hard problems. The new cryptosystems can be implemented in a general group environment other than in braid or Artin groups.
文摘Contemporary world is developing system and we must have the new models. Any complex system interacts with its changing environment and its viability depends on its adaptability. The number of arbitrary coefficients in the structure of equivalent equations of complex system changes in the process of learning. In systems with more than six variables, the number of arbitrary coefficients increases first, and then, passing through the maximum, begins to decrease. This phenomenon makes it possible to explain the processes of system growth, complication and death in biological, economical and physical-engineering systems. The author uses the Linguo-combinatorial method of investigation of complex systems, in taking key words for building equivalent equations. This phenomenon is able to increase the adaptability of different systems.
基金supported by Grants No.402/07/0166No.P402/10/0197 from the Grant Agency of Czech Republic.
文摘Auctions are important market mechanisms for the allocation of goods and services. Combinatorial auctions are those auctions in which buyers can place bids on combinations of items. Combinatorial auctions have many applications. The paper presents the CRAB software system. CRAB is a non-commercial software system for generating, solving, and testing of combinatorial auction problems. The system solves problems by Balas’ method or by the primal-dual algo-rithm. CRAB is implemented in Ruby and it is distributed as the file crab.rb. The system is freely available on web pag-es for all interested
文摘Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.
文摘The complexity of cloud environments challenges secure resource management,especially for intrusion detection systems(IDS).Existing strategies struggle to balance efficiency,cost fairness,and threat resilience.This paper proposes an innovative approach to managing cloud resources through the integration of a genetic algorithm(GA)with a“double auction”method.This approach seeks to enhance security and efficiency by aligning buyers and sellers within an intelligent market framework.It guarantees equitable pricing while utilizing resources efficiently and optimizing advantages for all stakeholders.The GA functions as an intelligent search mechanism that identifies optimal combinations of bids from users and suppliers,addressing issues arising from the intricacies of cloud systems.Analyses proved that our method surpasses previous strategies,particularly in terms of price accuracy,speed,and the capacity to manage large-scale activities,critical factors for real-time cybersecurity systems,such as IDS.Our research integrates artificial intelligence-inspired evolutionary algorithms with market-driven methods to develop intelligent resource management systems that are secure,scalable,and adaptable to evolving risks,such as process innovation.
基金supported by the Natural Science Foundation of China(Grants No.42122006,42471187).
文摘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.
基金supported by Projects 12325501,12047503,12247104,and 12322501 of the National Natural Science Foundation of ChinaProject ZDRW-XX-2022-302 of the Chinese Academy of Sciencespartially supported by the Innovation Program for Quantum Science and Technology project 2021ZD0301900。
文摘Combinatorial optimization problems and ground state problems of spin glasses are crucial in various fields of science and technology.However,they often belong to the computational class of NP-hard,presenting significant computational challenges.Traditional algorithms inspired by statistical physics like simulated annealing have been widely adopted.Recently,advancements in Ising machines,such as quantum annealers and coherent Ising machines,offer new paradigms for solving these problems efficiently by embedding them into the analog evolution of nonlinear dynamical systems.However,existing dynamics-based algorithms often suffer from low convergence rates and local minima traps.In this work,we introduce the dual mean-field dynamics into Ising machines.The approach integrates the gradient force and the transverse force into the dynamics of Ising machines in solving combinatorial optimization problems,making it easier for the system to jump out of the local minimums and allowing the dynamics to explore wider in configuration space.We conduct extensive numerical experiments using the Sherrington–Kirkpatrick spin glass up to 10000 spins and the maximum cut problems with the standard G-set benchmarks.The numerical results demonstrate that our dual mean-field dynamics approach enhances the performance of base Ising machines,providing a more effective solution for large-scale combinatorial optimization problems.
基金Supported by the Natural Science Foundation of Heilongjiang Province
文摘A necessary and suffcient condition is given for the equation Ax4+ 1 =By2 to have positive integer solution, and an effective method is derived for solving equation a2x4 + 1 = By2 in positive integers x, y for given ho and B completely. Also, using a recently result of Ribet, Darmon and Merel, we proved that Erdos’ conjecture on combinatorial number is right.
基金supported by the National Science and Technology Council,Taiwan,under grant no.NSTC 114-2221-E-197-005-MY3.
文摘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.
基金supported by Molecular Biology Research Center,Baqiyatallah University of Medical Sciences,with grant number BMSU/MBRC- 89-009
文摘Objective:To evaluate simultaneous detection and differentiates of Brucella abortus(B.abortus) and Brucella melitensis(B.melitensis) through the combinatorial POR method.Methods:This study was designed using three primers that could simultaneously identify and differentiate two major species of pathogenic Brucella in humans and animals.Identification and differentiation of each species using the size of the PCR product were determined.To determine the specifieity of the method,bacteria close to the genus Brucella were used.Finally,to confirm PCR products.In addition to the products sequence,RFLP was performed on PCR products using restriction enzymes.Results:The method of optimized combinatorial PCR in this study could simultaneously detect and differentiate B.abortus and B.melitensis with high specificity and sensitivity in clinical samples.Differentiation of species is based on the resulting bands: therefore,the band 494 bp for B.abortus and 733 bp for B.melitensis were obtained.RFLP and sequencing results confirmed PCR results.Conclusions:The results of this study shows that without routine diagnostic methods such as culture and serology tests,using the molecular method of combinatorial PCR,important species of Brucella can be simultaneously identified and differentiated in clinical samples.
基金supported in part by National High Technology Research and Development Program (2015AA034204)the National Natural Science Foundation of China (51472044)
文摘Conventionally, an experimentally determined phase diagram requires studies of phase formation at a range of temperatures for each composition, which takes years of effort from multiple research groups. Combinatorial materials chip technology, featuring high-throughput synthesis and characterization, is able to determine the phase diagram of an entire composition spread of a binary or ternary system at a single temperature on one materials library, which, though significantly increasing efficiency, still requires many libraries processed at a series of temperatures in order to complete a phase diagram. In this paper, we propose a "one-chip method" to construct a complete phase diagram by individually synthesizing each pixel step by step with a progressive pulse of energy to heat at different temperatures while monitoring the phase evolution on the pixel in situ in real time. Repeating this process pixel by pixel throughout the whole chip allows the entire binary or ternary phase diagram to be mapped on one chip in a single experiment. The feasibility of this methodology is demonstrated in a study of a Ge-Sb-Te ternary alloy system, on which the amorphouscrystalline phase boundary is determined.
文摘Hopfield neural network is a single layer feedforward neural network. Hopfield network requires some control parameters to be carefully selected, else the network is apt to converge to local minimum. An ant system is a nature inspired meta heuristic algorithm. It has been applied to several combinatorial optimization problems such as Traveling Salesman Problem, Scheduling Problems, etc. This paper will show an ant system may be used in tuning the network control parameters by a group of cooperated ants. The major advantage of this network is to adjust the network parameters automatically, avoiding a blind search for the set of control parameters. This network was tested on two TSP problems, 5 cities and 10 cities. The results have shown an obvious improvement.
基金This work was supported by an EPSRC grant (No.EP/C520696/1).
文摘Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.
基金The financial support is granted by the Deutsche Forschungsgemeinschaft, Collabo-rative Research Center 289. "Forming of metals in the semi solid state and their properties" is gratefully acknowledged.
文摘The increasing complexity of modern functional materials leads to the demandof a cost efficient tool for the development of new products. One possible approach to this questionis the adaptation of combinatorial methods to the specific requirements of materials industry.These methods, originally developed for the pharmaceutical industry, have recently been applied tothe screening of superconductive, magnetoresistant and photoluminescent materials. The principle ofthese combinatorial approaches is the deposition of large materials libraries in one processcombined with fast methods for the determination of the resulting properties. In this paper, thedeposition and characterization of laterally graded materials libraries (composition spread) ispresented. The films have been deposited by reactive magnetron sputtering, using two or threemetallic targets at a low angle to the substrate surface as well as a system of apertures. Toillustrate the advantages of combinatorial approaches for the development of advanced materials, themulticomponent metastable hardcoatings (Ti,Al)N and Ti-Al-Si-N are discussed with special emphasison the relations between structure and composition on the one hand and the oxidation resistance ofthese coatings on the other. The results illustrate that the composition spread approach is apowerful and cost efficient tool for the development and optimization of new multicomponentfunctional materials.
文摘This paper presents a novel regular Quasi-Cyclic (QC)Low Density Parity Check (LDPC)codes with columnweight three and girth at least eight.These are designed on the basis of combinatorial design in which subsets applied for the construction of circulant matrices are determined by a particular subset.Considering the nonexistence of cycles four and six in the structure of the parity check matrix,a bound for their minimum weight is proposed.The simtdations conducted confirm that without applying a masking technique,the newly implemented codes have a performance similar to or better than other well-known codes.This is evident in the waterfall region, while their error floor at very low Bit Error Rate (BER)is expected.
