cycle detection
Recently Published Documents


TOTAL DOCUMENTS

121
(FIVE YEARS 26)

H-INDEX

18
(FIVE YEARS 2)

2021 ◽  
Author(s):  
Bill Kay ◽  
Catherine Schuman ◽  
Jade O'Connor ◽  
Prasanna Date ◽  
Thomas Potok

Energies ◽  
2021 ◽  
Vol 14 (11) ◽  
pp. 3117
Author(s):  
Junghwan Kim

Engine knock determination has been conducted in various ways for spark timing calibration. In the present study, a knock classification model was developed using a machine learning algorithm. Wavelet packet decomposition (WPD) and ensemble empirical mode decomposition (EEMD) were employed for the characterization of the in-cylinder pressure signals from the experimental engine. The WPD was used to calculate 255 features from seven decomposition levels. EEMD provided total 70 features from their intrinsic mode functions (IMF). The experimental engine was operated at advanced spark timings to induce knocking under various engine speeds and load conditions. Three knock intensity metrics were employed to determine that the dataset included 4158 knock cycles out of a total of 66,000 cycles. The classification model trained with 66,000 cycles achieved an accuracy of 99.26% accuracy in the knock cycle detection. The neighborhood component analysis revealed that seven features contributed significantly to the classification. The classification model retrained with the seven significant features achieved an accuracy of 99.02%. Although the misclassification rate increased in the normal cycle detection, the feature selection decreased the model size from 253 to 8.25 MB. Finally, the compact classification model achieved an accuracy of 99.95% with the second dataset obtained at the knock borderline (KBL) timings, which validates that the model is sufficient for the KBL timing determination.


2021 ◽  
Vol 115 ◽  
pp. 102017
Author(s):  
Heejong Park ◽  
Arvind Easwaran ◽  
Etienne Borde

Author(s):  
Jaco van de Pol ◽  
Laure Petrucci ◽  
Jaime Arias ◽  
Étienne André

Author(s):  
Yuchen R. He ◽  
Shenghua He ◽  
Mikhail E. Kandel ◽  
Young Jae Lee ◽  
Nahil Sobh ◽  
...  

Author(s):  
Étienne André ◽  
Jaime Arias ◽  
Laure Petrucci ◽  
Jaco van de Pol

AbstractWe study semi-algorithms to synthesise the constraints under which a Parametric Timed Automaton satisfies some liveness requirement. The algorithms traverse a possibly infinite parametric zone graph, searching for accepting cycles. We provide new search and pruning algorithms, leading to successful termination for many examples. We demonstrate the success and efficiency of these algorithms on a benchmark. We also illustrate parameter synthesis for the classical Bounded Retransmission Protocol. Finally, we introduce a new notion of completeness in the limit, to investigate if an algorithm enumerates all solutions.


Sign in / Sign up

Export Citation Format

Share Document