Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (9)
  • Open Access


    A Novel Method for the Application of the ECMS (Equivalent Consumption Minimization Strategy) to Reduce Hydrogen Consumption in Fuel Cell Hybrid Electric Vehicles

    Wen Sun, Hao Liu, Ming Han, Ke Sun, Shuzhan Bai*, Guoxiang Li*

    FDMP-Fluid Dynamics & Materials Processing, Vol.18, No.4, pp. 867-882, 2022, DOI:10.32604/fdmp.2022.018923

    Abstract Fuel cell hybrid electric vehicles are currently being considered as ideal means to solve the energy crisis and global warming in today’s society. In this context, this paper proposes a method to solve the problem related to the dependence of the so-called optimal equivalent factor (determined in the framework of the equivalent consumption minimum strategy-ECMS) on the working conditions. The simulation results show that under typical conditions (some representative cities being considered), the proposed strategy can maintain the power balance; for different initial battery’s states of charge (SOC), after the SOC stabilizes, the fuel consumption is 5.25 L/100 km. More >

  • Open Access


    Two-Machine Hybrid Flow-Shop Problems in Shared Manufacturing

    Qi Wei*, Yong Wu

    CMES-Computer Modeling in Engineering & Sciences, Vol.131, No.2, pp. 1125-1146, 2022, DOI:10.32604/cmes.2022.019754

    Abstract In the “shared manufacturing” environment, based on fairness, shared manufacturing platforms often require manufacturing service enterprises to arrange production according to the principle of “order first, finish first” which leads to a series of scheduling problems with fixed processing sequences. In this paper, two two-machine hybrid flow-shop problems with fixed processing sequences are studied. Each job has two tasks. The first task is flexible, which can be processed on either of the two machines, and the second task must be processed on the second machine after the first task is completed. We consider two objective functions: to minimize the makespan… More >

  • Open Access


    Multiple Images Steganography of JPEG Images Based on Optimal Payload Distribution

    Yang Pei1,2, Xiangyang Luo1,2,*, Yi Zhang2, Liyan Zhu2

    CMES-Computer Modeling in Engineering & Sciences, Vol.125, No.1, pp. 417-436, 2020, DOI:10.32604/cmes.2020.010636

    Abstract Multiple images steganography refers to hiding secret messages in multiple natural images to minimize the leakage of secret messages during transmission. Currently, the main multiple images steganography algorithms mainly distribute the payloads as sparsely as possible in multiple cover images to improve the detection error rate of stego images. In order to enable the payloads to be accurately and efficiently distributed in each cover image, this paper proposes a multiple images steganography for JPEG images based on optimal payload redistribution. Firstly, the algorithm uses the principle of dynamic programming to redistribute the payloads of the cover images to reduce the… More >

  • Open Access


    Application of Dynamic Programming Algorithm Based on Model Predictive Control in Hybrid Electric Vehicle Control Strategy

    Xiaokan Wang*, Qiong Wang

    Journal on Internet of Things, Vol.2, No.2, pp. 81-87, 2020, DOI:10.32604/jiot.2020.010225

    Abstract A good hybrid vehicle control strategy cannot only meet the power requirements of the vehicle, but also effectively save fuel and reduce emissions. In this paper, the construction of model predictive control in hybrid electric vehicle is proposed. The solving process and the use of reference trajectory are discussed for the application of MPC based on dynamic programming algorithm. The simulation of hybrid electric vehicle is carried out under a specific working condition. The simulation results show that the control strategy can effectively reduce fuel consumption when the torque of engine and motor is reasonably distributed, and the effectiveness of… More >

  • Open Access


    Model Predictive Control for Nonlinear Energy Management of a Power Split Hybrid Electric Vehicle

    Dehua Shi1,4, Shaohua Wang1,2,*, Yingfeng Cai1, Long Chen1, ChaoChun Yuan1, ChunFang Yin3

    Intelligent Automation & Soft Computing, Vol.26, No.1, pp. 27-39, 2020, DOI:10.31209/2018.100000062

    Abstract Model predictive control (MPC), owing to the capability of dealing with nonlinear and constrained problems, is quite promising for optimization. Different MPC strategies are investigated to optimize HEV nonlinear energy management for better fuel economy. Based on Bellman’s principle, dynamic programming is firstly used in the limited horizon to obtain optimal solutions. By considering MPC as a nonlinear programming problem, sequential quadratic programming (SQP) is used to obtain the descent directions of control variables and the current control input is further derived. To reduce computation and meet the requirements of real-time control, the nonlinear model of the system is approximated… More >

  • Open Access


    A Longest Matching Resource Mapping Algorithm with State Compression Dynamic Programming Optimization

    Zhang Min, Teng Haibin, Jiang Ming, Wen Tao, Tang Jingfan

    Intelligent Automation & Soft Computing, Vol.25, No.3, pp. 625-635, 2019, DOI:10.31209/2019.100000117

    Abstract Mapping from sentence phrases to knowledge graph resources is an important step for applications such as search engines, automatic question answering systems based on acknowledge base and knowledge graphs. The existing solution maps a simple phrase to a knowledge graph resource strictly or approximately from the text. However, it is difficult to detect phrases and map the composite semantic resource. This paper proposes a longest matching resource mapping scheme to solve this problem, namely, to find the longest substring in a sentence that can match the knowledge base resource. Based on this scheme, we propose an optimization algorithm based on… More >

  • Open Access


    Weight And Reliability Optimization Of A Helicopter Composite Armor Using Dynamic Programming

    V.C. Santos1, P.S. Lopes1, R. Gärtner2, A.B. Jorge1

    The International Conference on Computational & Experimental Engineering and Sciences, Vol.4, No.2, pp. 53-58, 2007, DOI:10.3970/icces.2007.004.053

    Abstract This work presents an approach for weight and reliability optimization of aeronautical armors. Military and police helicopters are usually exposed to highly risky situations, with a high probability for these aircrafts to be hit by projectiles. In this context, floor aircraft armor can be used to protect the crews' lives. However, the armoring of an aircraft causes an increase in weight. If this extra weight is poorly arranged, the changes in aircraft centroid position may even destabilize the aircraft. Thus, it is essential to design an armor not only to protect the aircraft, but also not to conflict with aircraft… More >

  • Open Access


    Matching Contours in Images through the use of Curvature, Distance to Centroid and Global Optimization with Order-Preserving Constraint

    Francisco P. M. Oliveira1, João Manuel R. S. Tavares1

    CMES-Computer Modeling in Engineering & Sciences, Vol.43, No.1, pp. 91-110, 2009, DOI:10.3970/cmes.2009.043.091

    Abstract This paper presents a new methodology to establish the best global match of objects' contours in images. The first step is the extraction of the sets of ordered points that define the objects' contours. Then, by using the curvature value and its distance to the corresponded centroid for each point, an affinity matrix is built. This matrix contains information of the cost for all possible matches between the two sets of ordered points. Then, to determine the desired one-to-one global matching, an assignment algorithm based on dynamic programming is used. This algorithm establishes the global matching of the minimum global… More >

  • Open Access


    Algorithm of Dynamic Programming for Optimization of the Global Matching between Two Contours Defined by Ordered Points

    Francisco. P. M. Oliveira1, João Manuel R. S. Tavares1

    CMES-Computer Modeling in Engineering & Sciences, Vol.31, No.1, pp. 1-12, 2008, DOI:10.3970/cmes.2008.031.001

    Abstract This paper presents a new assignment algorithm with order restriction. Our optimization algorithm was developed using dynamic programming. It was implemented and tested to determine the best global matching that preserves the order of the points that define two contours to be matched. In the experimental tests done, we used the affinity matrix obtained via the method proposed by Shapiro, based on geometric modeling and modal matching. \newline The proposed algorithm revealed an optimum performance, when compared with classic assignment algorithms: Hungarian Method, Simplex for Flow Problems and LAPm. Indeed, the quality of the matching improved when compared with these… More >

Displaying 1-10 on page 1 of 9. Per Page  

Share Link