The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a...The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a class of signals is mainly well suited to digital processing of increasing practical importance.A low autocorrelation binary sequence(LABS)is a complex combinatorial problem.The main problems of LABS are low Merit Factor(MF)and shorter length sequences.Besides,the maximum possible MF equals 12.3248 as infinity length is unable to be achieved.Therefore,this study implemented two techniques to propose a new metaheuristic algorithm based on Hybrid Modified Sine Cosine Algorithm with Cuckoo Search Algorithm(HMSCACSA)using Inverse Filtering(IF)and clipping method to achieve better results.The proposed algorithms,LABS-IF and HMSCACSA-IF,achieved better results with two large MFs equal to 12.12 and 12.6678 for lengths 231 and 237,respectively,where the optimal solutions belong to the skew-symmetric sequences.The MF outperformed up to 24.335%and 2.708%against the state-of-the-art LABS heuristic algorithm,xLastovka,and Golay,respectively.These results indicated that the proposed algorithm’s simulation had quality solutions in terms of fast convergence curve with better optimal means,and standard deviation.展开更多
In uncertainty analysis and reliability-based multidisciplinary design and optimization(RBMDO)of engineering structures,the saddlepoint approximation(SA)method can be utilized to enhance the accuracy and efficiency of...In uncertainty analysis and reliability-based multidisciplinary design and optimization(RBMDO)of engineering structures,the saddlepoint approximation(SA)method can be utilized to enhance the accuracy and efficiency of reliability evaluation.However,the random variables involved in SA should be easy to handle.Additionally,the corresponding saddlepoint equation should not be complicated.Both of them limit the application of SA for engineering problems.The moment method can construct an approximate cumulative distribution function of the performance function based on the first few statistical moments.However,the traditional moment matching method is not very accurate generally.In order to take advantage of the SA method and the moment matching method to enhance the efficiency of design and optimization,a fourth-moment saddlepoint approximation(FMSA)method is introduced into RBMDO.In FMSA,the approximate cumulative generating functions are constructed based on the first four moments of the limit state function.The probability density function and cumulative distribution function are estimated based on this approximate cumulative generating function.Furthermore,the FMSA method is introduced and combined into RBMDO within the framework of sequence optimization and reliability assessment,which is based on the performance measure approach strategy.Two engineering examples are introduced to verify the effectiveness of proposed method.展开更多
The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with...The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a graph.No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale.However,several algorithms are proposed that solve the problem approximately in a short polynomial time scale.Such algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational resources.The MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising etc.This work aims to solve the MVCP approximately by a novel graph decomposition approach.The decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or paths.In order to reduce complexity of the algorithm a new strategy is also proposed.The reduction strategy can be used for any algorithm solving MVCP.Based on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the MVCP.These algorithms are tested using well known standard benchmark graphs.The key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs.展开更多
This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVC...This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVCA is based on the idea of（l） including the vertex having maximum degree in the vertex cover and （2） rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.展开更多
An improved randomized algorithm of the equivalent 2-catalog segmentation problem is presented. The result obtained in this paper makes some progress to answer the open problem by analyze this algorithm with performan...An improved randomized algorithm of the equivalent 2-catalog segmentation problem is presented. The result obtained in this paper makes some progress to answer the open problem by analyze this algorithm with performance guarantee. A 0.6378-approximation for the equivalent 2-catalog segmentation problem is obtained.展开更多
提出了一种带有启动空间的约束装箱问题(start-up bin packing problem,简称SBPP),即不同类型的物品放入同一箱子中需要一个启动空间.该问题在工作分配、任务调度和日常生活中的包装等问题中有着广泛的应用背景.给出了一个求解SBPP的线...提出了一种带有启动空间的约束装箱问题(start-up bin packing problem,简称SBPP),即不同类型的物品放入同一箱子中需要一个启动空间.该问题在工作分配、任务调度和日常生活中的包装等问题中有着广泛的应用背景.给出了一个求解SBPP的线性脱线算法C-NF,其最坏情况渐近性能比为2,与启动空间的大小无关.对该算法的平均性能进行了实验分析.另外,还分析了SBPP的在线特性,指出大量的经典在线装箱算法应用于SBPP都不存在确定的最坏情况渐近性能比,也给出了一种具有确定的最坏情况渐近性能比的在线算法.展开更多
文摘The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a class of signals is mainly well suited to digital processing of increasing practical importance.A low autocorrelation binary sequence(LABS)is a complex combinatorial problem.The main problems of LABS are low Merit Factor(MF)and shorter length sequences.Besides,the maximum possible MF equals 12.3248 as infinity length is unable to be achieved.Therefore,this study implemented two techniques to propose a new metaheuristic algorithm based on Hybrid Modified Sine Cosine Algorithm with Cuckoo Search Algorithm(HMSCACSA)using Inverse Filtering(IF)and clipping method to achieve better results.The proposed algorithms,LABS-IF and HMSCACSA-IF,achieved better results with two large MFs equal to 12.12 and 12.6678 for lengths 231 and 237,respectively,where the optimal solutions belong to the skew-symmetric sequences.The MF outperformed up to 24.335%and 2.708%against the state-of-the-art LABS heuristic algorithm,xLastovka,and Golay,respectively.These results indicated that the proposed algorithm’s simulation had quality solutions in terms of fast convergence curve with better optimal means,and standard deviation.
基金support from the Key R&D Program of Shandong Province(Grant No.2019JZZY010431)the National Natural Science Foundation of China(Grant No.52175130)+1 种基金the Sichuan Science and Technology Program(Grant No.2022YFQ0087)the Sichuan Science and Technology Innovation Seedling Project Funding Projeet(Grant No.2021112)are gratefully acknowledged.
文摘In uncertainty analysis and reliability-based multidisciplinary design and optimization(RBMDO)of engineering structures,the saddlepoint approximation(SA)method can be utilized to enhance the accuracy and efficiency of reliability evaluation.However,the random variables involved in SA should be easy to handle.Additionally,the corresponding saddlepoint equation should not be complicated.Both of them limit the application of SA for engineering problems.The moment method can construct an approximate cumulative distribution function of the performance function based on the first few statistical moments.However,the traditional moment matching method is not very accurate generally.In order to take advantage of the SA method and the moment matching method to enhance the efficiency of design and optimization,a fourth-moment saddlepoint approximation(FMSA)method is introduced into RBMDO.In FMSA,the approximate cumulative generating functions are constructed based on the first four moments of the limit state function.The probability density function and cumulative distribution function are estimated based on this approximate cumulative generating function.Furthermore,the FMSA method is introduced and combined into RBMDO within the framework of sequence optimization and reliability assessment,which is based on the performance measure approach strategy.Two engineering examples are introduced to verify the effectiveness of proposed method.
文摘The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph theory.The MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a graph.No algorithm exits till date that can exactly solve the problem in a deterministic polynomial time scale.However,several algorithms are proposed that solve the problem approximately in a short polynomial time scale.Such algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational resources.The MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising etc.This work aims to solve the MVCP approximately by a novel graph decomposition approach.The decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or paths.In order to reduce complexity of the algorithm a new strategy is also proposed.The reduction strategy can be used for any algorithm solving MVCP.Based on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the MVCP.These algorithms are tested using well known standard benchmark graphs.The key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs.
文摘This paper describes an extremely fast polynomial time algorithm, the NOVCA （Near Optimal Vertex Cover Algorithm） that produces an optimal or near optimal vertex cover for any known undirected graph G （V, E）. NOVCA is based on the idea of（l） including the vertex having maximum degree in the vertex cover and （2） rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.
基金This work is supported by National Natural Key product Foundations of China 10231060This work is supported by the Younth Key Fundation of UESTC: JX04042.
文摘An improved randomized algorithm of the equivalent 2-catalog segmentation problem is presented. The result obtained in this paper makes some progress to answer the open problem by analyze this algorithm with performance guarantee. A 0.6378-approximation for the equivalent 2-catalog segmentation problem is obtained.
文摘提出了一种带有启动空间的约束装箱问题(start-up bin packing problem,简称SBPP),即不同类型的物品放入同一箱子中需要一个启动空间.该问题在工作分配、任务调度和日常生活中的包装等问题中有着广泛的应用背景.给出了一个求解SBPP的线性脱线算法C-NF,其最坏情况渐近性能比为2,与启动空间的大小无关.对该算法的平均性能进行了实验分析.另外,还分析了SBPP的在线特性,指出大量的经典在线装箱算法应用于SBPP都不存在确定的最坏情况渐近性能比,也给出了一种具有确定的最坏情况渐近性能比的在线算法.
