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.
In this paper, we propose a method to estimate muscular fatigue in exercises with load fluctuations. Muscular fatigue is an important property when evaluating the state of a muscle. However, it is extremely difficult to apply general methods, which depend on the relative changes in the signal power or frequency characteristics of a surface EMG, during exercise. We define two qualitative factors of...
We are working the recognition of inaudible Japanese speech by using surface electromyography. During natural speech, muscle activity changes continuously and gently under the influence of the preceding or succeeding phoneme, even within the utterance of a single vowel. We need to detect the temporal positions of such changes to extract stable features of phonemes. In our previous works, we expected...
The result of document classification is not unique and there can be many other results from the different perspectives. In other words, the classification results can vary according to user's viewpoints of classification. If a document classification system ignores the user's viewpoints, the result of classification will be different from the result desired by the user and the difference between...
In this paper, we develop a simplicial branch-and-bound algorithm for generating globally optimal solutions to concave minimization problems with low rank nonconvex structures. We propose to remove all additional constraints imposed on the usual linear programming relaxed problem. Therefore, in each bounding operation, we solve a linear programming problem whose constraints are exactly the same as...
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.