- 标题
- 摘要
- 关键词
- 实验方案
- 产品
-
[IEEE 2019 IEEE 3rd Conference on Energy Internet and Energy System Integration (EI2) - Changsha, China (2019.11.8-2019.11.10)] 2019 IEEE 3rd Conference on Energy Internet and Energy System Integration (EI2) - Fractional-order Sliding Mode Control Strategy for Quasi-Z Source Photovoltaic Grid-Connected Inverter
摘要： Existing algorithms for I/O Linear Temporal Logic (LTL) model checking usually output a single counterexample for a system which violates the property. However, in real-world applications, such as diagnosis and debugging in software and hardware system designs, people often need to have a set of counterexamples or even all counterexamples. For this purpose, we propose an I/O efficient approach for detecting all accepting cycles, called Detecting All Accepting Cycles (DAAC), where the properties to be verified are in LTL. Different from other algorithms for finding all cycles, DAAC first searches for the accepting strongly connected components (ASCCs), and then finds all accepting cycles of every ASCC, which can avoid searching for a great many paths that are impossible to be extended to accepting cycles. In order to further lower DAAC's I/O complexity and improve its performance, we propose an intersection computation technique and a dynamic path management technique, and exploit a minimal perfect hash function (MPHF). We carry out both complexity and experimental comparisons with the state-of-the-art algorithms including Detect Accepting Cycle (DAC), Maximal Accepting Predecessors (MAP) and Iterative-Deepening Depth-First Search (IDDFS). The comparative results show that our approach is better on the whole in terms of I/O complexity and practical performance, despite the fact that it finds all counterexamples.
关键词： Model checking,state space explosion,accepting strongly connected component,breath-first search,detection of all accepting cycles
更新于2025-09-19 17:13:59
-
[IEEE 2019 IEEE SENSORS - Montreal, QC, Canada (2019.10.27-2019.10.30)] 2019 IEEE SENSORS - Optical fiber methane sensor using refractometry
摘要： Cloud data owners prefer to outsource documents in an encrypted form for the purpose of privacy preserving. Therefore it is essential to develop efficient and reliable ciphertext search techniques. One challenge is that the relationship between documents will be normally concealed in the process of encryption, which will lead to significant search accuracy performance degradation. Also the volume of data in data centers has experienced a dramatic growth. This will make it even more challenging to design ciphertext search schemes that can provide efficient and reliable online information retrieval on large volume of encrypted data. In this paper, a hierarchical clustering method is proposed to support more search semantics and also to meet the demand for fast ciphertext search within a big data environment. The proposed hierarchical approach clusters the documents based on the minimum relevance threshold, and then partitions the resulting clusters into sub-clusters until the constraint on the maximum size of cluster is reached. In the search phase, this approach can reach a linear computational complexity against an exponential size increase of document collection. In order to verify the authenticity of search results, a structure called minimum hash sub-tree is designed in this paper. Experiments have been conducted using the collection set built from the IEEE Xplore. The results show that with a sharp increase of documents in the dataset the search time of the proposed method increases linearly whereas the search time of the traditional method increases exponentially. Furthermore, the proposed method has an advantage over the traditional method in the rank privacy and relevance of retrieved documents.
关键词： security,ciphertext search,hierarchical clustering,multi-keyword search,ranked search,Cloud computing
更新于2025-09-16 10:30:52
-
[IEEE 2019 18th International Conference on Optical Communications and Networks (ICOCN) - Huangshan, China (2019.8.5-2019.8.8)] 2019 18th International Conference on Optical Communications and Networks (ICOCN) - Enhanced Adaptive DBP Using Extended Godard’s Error for 16-QAM Coherent Optical Systems
摘要： An enhanced adaptive digital backpropagation (A-DBP) scheme based on extended Godard’s error is proposed for 16-quadrature amplitude (16QAM) modulation formats.
关键词： golden section search method (GSSM),extended Godard’s error,adaptive digital backpropagation(A-DBP)
更新于2025-09-16 10:30:52
-
Inverse analysis of the residual stress in laser-assisted milling
摘要： In laser-assisted milling, higher temperature in shear zone softens the material potentially resulting in a shift of mean residual stress, which significantly affects the damage tolerance and fatigue performance of product. In order to guide the selection of laser and cutting parameters based on the preferred mean residual stress, inverse analysis is conducted by predicting residual stress based on guessed process parameters, which is defined as the forward problem, and applying iterative gradient search to find process parameters for next iteration, which is defined as the inverse problem. An analytical inverse analysis is therefore proposed for the mean residual stress in laser-assisted milling. The forward problem is solved by analytical prediction of mean residual stress after laser-assisted milling. The residual stress profile is predicted through the calculation of thermal stress, by treating laser beam as heat source, and plastic stress by first assuming pure elastic stress in loading process, then obtaining true stress with kinematic hardening followed by the stress relaxation. The variance-based recursive method is applied to solve inverse problem by updating process parameters to match the measured mean residual stress. Three cutting parameters including depth of cut, feed per tooth, and cutting speed, and two laser parameters including laser-tool distance and laser power, are updated with respected to the minimization of resulting residual stress and measurement in each iteration. Experimental measurements are referred on the laser-assisted milling of Ti–6Al–4 V and Si3N4. The percentage difference between experiments and predictions is less than 5% for both materials, and the selection is completed within 50 loops.
关键词： Residual stress,Ti–6Al–4V,Si3N4,Laser-assisted milling,Inverse analysis,Iterative gradient search
更新于2025-09-16 10:30:52
-
[IEEE 2019 18th International Conference on Optical Communications and Networks (ICOCN) - Huangshan, China (2019.8.5-2019.8.8)] 2019 18th International Conference on Optical Communications and Networks (ICOCN) - Enhanced Adaptive DBP Using Extended Godard’s Error for 16-QAM Coherent Optical Systems
摘要： An enhanced adaptive digital backpropagation (A-DBP) scheme based on extended Godard’s error is proposed for 16-quadrature amplitude (16QAM) modulation formats. experimentally demonstrated and
关键词： golden section search method (GSSM),extended Godard’s error,adaptive digital backpropagation(A-DBP)
更新于2025-09-16 10:30:52
-
[IEEE 2020 International Conference on Information Networking (ICOIN) - Barcelona, Spain (2020.1.7-2020.1.10)] 2020 International Conference on Information Networking (ICOIN) - Design of Web-based Monitoring System for Solar Photovoltaic Power Plants
摘要： Fuzzy job-shop scheduling problems (FJSPs) with various imprecise factors are a category of combination optimization problems known as non-deterministic polynomial-hard problems. In this paper, a hybrid algorithm HICATS combining discrete imperialist competition algorithm (ICA) and Tabu search (TS) is proposed to solve FJSPs with fuzzy processing time and fuzzy due date. The objective function is maximizing the minimum agreement index, which is on the basis of the agreement index of fuzzy due date and fuzzy completion time. In the proposed algorithm, ICA conducts the global search and TS performs the local search. The imperialist is used to guide the colonies in the same empire. So, local search approach based on TS is applied to the imperialist to perform ?ne-grained exploitation. The 6 × 6 and 10 × 10 FJSPs with fuzzy processing time and fuzzy due date are tested to evaluate the performance of the proposed algorithm HICATS in this paper. The highly effective performance of HICATS is shown against the best performing algorithms from the literature. Experimental results demonstrate the advantages of our proposed algorithm HICATS on the feasibility and robustness compared with other algorithms.
关键词： fuzzy processing time and fuzzy due date,fuzzy job-shop scheduling problem,Tabu search,Discrete imperialist competition algorithm,maximizing the minimum agreement index
更新于2025-09-16 10:30:52
-
A MPPT Method based on Improved Fibonacci Search Photovoltaic Array
摘要： The P-U curve of photovoltaic arrays (PVAs) has multi-peak characteristics under uneven illumination environments, and the maximum power point tracking (MPPT) strategy for the single peak may fail. An improved Fibonacci search algorithm is proposed to carry out MPPT of photovoltaic arrays under uniform illumination or light mutation. A multiple-interval search algorithm based on a circuit analysis method is presented for different topology arrays and illumination distributions. The series array analysis adopts the current analysis method, the parallel array analysis adopts the voltage analysis method, and the series and parallel array analysis adopts the current and voltage analysis method; then, the output control volume is determined, and the search interval is divided. The search steps in the Fibonacci method and the real-time changes of parameters in the optimization process can be observed by MATLAB simulation. Experimental results show that the algorithm uses less computation time and small area search instead of global search.
关键词： Fibonacci search,MATLAB simulation,photovoltaic array,circuit analysis method,maximum power point tracking
更新于2025-09-16 10:30:52
-
Improving the Reliability of Photovoltaic and Wind Power Storage Systems Using Least Squares Support Vector Machine Optimized by Improved Chicken Swarm Algorithm
摘要： In photovoltaic and wind power storage systems, the reliability of the battery directly affects the overall reliability of the energy storage system. Failed batteries can seriously affect the stable operation of energy storage systems. This paper aims to improve the reliability of the storage systems by accurately predicting battery life and identifying failing batteries in time. The current prediction models mainly use artificial neural networks, Gaussian process regression and hybrid models. Although these models can achieve high prediction accuracy, the computational cost is high due to model complexity. Least squares support vector machine (LSSVM) is a computationally efficient alternative. Hence, this study combines the improved chicken swarm optimization algorithm (ICSO) and LSSVM into a hybrid ICSO-LSSVM model for the reliability of photovoltaic and wind power storage systems. The following are the contributions of this work. First, the optimal penalty parameter and kernel width are determined. Second, the chicken swarm optimization algorithm (CSO) is improved by introducing chaotic search behavior in the hen and an adaptive learning factor in the chicks. The performance of the ICSO algorithm is shown to be better than CSO using standard test problems. Third, the prediction accuracy of the three models is compared. For NMC1 battery, the predicted relative error of ICSO-LSSVM is 0.94%; for NMC2 battery, the relative error of ICSO-LSSVM is 1%. These findings show that the proposed model is suitable for predicting the failure of batteries in energy storage systems, which can improve preventive and predictive maintenance of such systems.
关键词： chaotic search,least squares support vector machine,chicken swarm optimization algorithm,storage system,sustainable lithium-ion battery
更新于2025-09-16 10:30:52
-
[IEEE 2019 Innovations in Power and Advanced Computing Technologies (i-PACT) - Vellore, India (2019.3.22-2019.3.23)] 2019 Innovations in Power and Advanced Computing Technologies (i-PACT) - Optimal setting and sizing of distributed solar photovoltaic generation in an electrical distribution system
摘要： In solar photovoltaic generation (SPVG) the sizing and setting of optimal of distribution is found very difficult. In this paper the optimal sizing and setting is found to be calculated by using beta distribution function (BDF) is used for the modulation of solar irradiance. The optimization problem is found and it is solved by using dynamic harmony search algorithm. The load is found uncertain and it is utilized by a boundary power flow. By considering the uncertainty of the load the new approach is done by using the radial electrical distribution system (EDS).
关键词： Dynamic harmony search algorithm,Renewable distributed generation,Electrical distribution systems,Boundary power loss
更新于2025-09-16 10:30:52
-
[IEEE 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Chicago, IL, USA (2019.6.16-2019.6.21)] 2019 IEEE 46th Photovoltaic Specialists Conference (PVSC) - Demonstration of High Efficiency Static Low-Concentration Photovoltaic Module Using Hybrid Lens Arrays
摘要： Existing algorithms for I/O Linear Temporal Logic (LTL) model checking usually output a single counterexample for a system which violates the property. However, in real-world applications, such as diagnosis and debugging in software and hardware system designs, people often need to have a set of counterexamples or even all counterexamples. For this purpose, we propose an I/O efficient approach for detecting all accepting cycles, called Detecting All Accepting Cycles (DAAC), where the properties to be verified are in LTL. Different from other algorithms for finding all cycles, DAAC first searches for the accepting strongly connected components (ASCCs), and then finds all accepting cycles of every ASCC, which can avoid searching for a great many paths that are impossible to be extended to accepting cycles. In order to further lower DAAC's I/O complexity and improve its performance, we propose an intersection computation technique and a dynamic path management technique, and exploit a minimal perfect hash function (MPHF). We carry out both complexity and experimental comparisons with the state-of-the-art algorithms including Detect Accepting Cycle (DAC), Maximal Accepting Predecessors (MAP) and Iterative-Deepening Depth-First Search (IDDFS). The comparative results show that our approach is better on the whole in terms of I/O complexity and practical performance, despite the fact that it finds all counterexamples.
关键词： Model checking,state space explosion,detection of all accepting cycles,breath-first search,accepting strongly connected component
更新于2025-09-16 10:30:52