The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents the development and evaluation of an algorithm for the prediction of NOx emissions from a biomass fired combustion process based on flame radical imaging, image processing and soft computing techniques. The investigation was performed on a biomass-gas fired test rig. An algorithm which combines texture analysis and non-negative matrix factorization (NMF) is studied for the image...
In this paper a new LMI method is proposed for the strong γk-γcl H∞ stabilization problem. Due to the introduction of a new slack variable, it is expected to be less conservative than the authors' previous work. Furthermore, several recently developed methods can be seen as its special cases. Meanwhile the extended bounded real lemma proposed lately can be adopted to improve the LMI design results...
The quantitative characterization of combustion flames has long been an important but challenging issue both in combustion research and industrial applications. The shape of a flame is recognized as one of most useful characteristics in the adjustment of combustion parameters. Although medial axis is a useful shape representation of a flame, limited work has been reported on how to extract the medial...
Mining frequent itemsets in data streams is a hot research topic in recent years. Due to the continuous, high-speed and unbounded properties of data streams, traditional algorithms on static dataset are not suitable for mining in data streams. In this paper we present bounded frequent itemsets stream (abbreviated as BFI-stream) algorithm, which uses a prefix-tree based structure, called BFI-tree,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.