Search

The traditional method for transformer moisture diagnosis is to establish empirical equations between feature parameters extracted from frequency domain spectroscopy (FDS) and the transformer’s moisture content. However, the established empirical equation may not be applicable to a novel testing environment, resulting in an unreliable evaluation result. In this regard, it is acknowledged that FDS combined with machine learning is more suitable for estimating moisture content in a variety of test environments. Nonetheless, the accuracy of the estimation results obtained using the existing method is limited by the algorithm’s inability to generalize. To address this issue, we propose an AdaBoost algorithm-enhanced back-propagation neural network (BP_AdaBoost). This study creates a database by extracting feature parameters from the FDS that characterize the insulation states of the prepared samples. Then, using the BP_AdaBoost algorithm and the newly constructed database, the moisture estimation models are trained. Finally, the results of the estimation are discussed in terms of laboratory and field transformers. By comparing the proposed BP_AdaBoost algorithm to other intelligence algorithms, it is demonstrated that it not only performs better in generalization, but also maintains a high level of accuracy. [ABSTRACT FROM AUTHOR]

Presents a study which showed how curve and surface representations of fiber network, fiber wall and fiber lumen can be computed using distance transform based algorithms. Motive for analyzing volume images of paper; Uses of the representations; Levels of detail in which the analysis of paper and paper fibers can be divided.

Dirty paper coding (DPC) scheme is the capacity achieving transmission technique in multiuser MIMO downlink channels. As a suboptimal solution to DPC, successive zero-forcing DPC (SZF-DPC) has been proposed recently. The zero-interference constraint in designing the precoding matrices limits the number of supportable users. In this correspondence, we propose three low-complexity suboptimal user scheduling algorithms to exploit the multiuser diversity gain in SZF-DPC as the number of users grows. The first algorithm greedily maximizes the true sum rate. The second algorithm is based on eigenvalues. The third algorithm relies on the diagonal elements of the effective channel matrix since eigenvalues and diagonal entries of a Hermitian matrix have a strong relationship. Simulation results show that the proposed scheduling algorithms can obtain a significant fraction of sum rate of the optimal solution. Furthermore, the performance analysis is provided to prove that the proposed user selection algorithms can achieve the same asymptotic sum rate as that of DPC. [ABSTRACT FROM AUTHOR]

A new dirty paper coding technique that is robust against the gain attack is presented. Such a robustness is obtained by adopting a set of (orthogonal) equienergetic codewords and a correlation-based decoder. Due to the simple structure of orthogonal codes, we developed a simple yet powerful technique to embed the hidden message within the host signal. The proposed technique is an optimal one, in that the embedding distortion is minimized for a given robustness level, where robustness is measured through the maximum pairwise error probability in the presence of an additive Gaussian attack of given strength. The performance of the dirty coding algorithm is further improved by replacing orthogonal with quasi- orthogonal codes, namely, Gold sequences, and by concatenating them with an outer turbo code. To this aim, the inner decoder is modified to produce a soft estimate of the embedded message. Performance analysis is carried out by means of extensive simulations proving the validity of the novel watermarking scheme. [ABSTRACT FROM AUTHOR]

This paper proposes and evaluates two robust sheet tension estimation algorithms based on unwind and rewind variables, respectively. The proper sheet tension estimation is guaranteed by a continuous monitoring of the differences between the actual estimated values and the values predicted from the last calibration of the estimation parameters. The evaluation was performed with the aid of a developed winder emulator that allowed the offline testing in a real-time field environment, including the initial setting of the estimation constants, and evaluation of both four- and six-shipping-roll cycles. The sheet tension estimation results confirm the precise and stable operation of the proposed robust estimation algorithms, in tests conducted with signals from a winder model, and with tests involving actual field signals from an operational winder. [ABSTRACT FROM AUTHOR]

Recently developed monitoring-systems show the need as also the possibilities for online- and offline-onsite-diagnostics. The limit in sensitivity for electrical pd-measurements according to IEC 60270 which is reached using filters for sinusoidal disturbances and compensation for corona impulses is still not satisfactory. The acoustic partial discharge measurement (pd-measurement) is also a well known and reliable method often used by transformer manufacturers in testing. In laboratory setups a gain in sensitivity of the acoustic in comparison to the electrical pd measurements could be established. This is reached by adapting the sensors to the propagation path, a modern but moderately priced acquisition hardware and the introduction of new signal processing algorithms. The developed sophisticated measuring, systems show remarkable results in online acoustic pd-measurements onsite. [ABSTRACT FROM AUTHOR]

To satisfy the requirement of quality control in printing and packaging industry, a sheet counting apparatus is developed, which adopts a line-scan camera to image the fringes of sheet stack and is able to provide a real-time and noncontact measurement of their quantity. With a brief introduction of the system architecture, our main work focuses on the sheet counting algorithms. The basic principle is to identify each sheet profile from the 1-D image with a robust ridge strength measurement. First, a multiscale bi-Gaussian ridge likelihood measurement and a ridge-valley descriptor are utilized to improve adjacent objects detection by increasing local contrast around sheet fringes. Then, a sheet recognition scheme, which integrates a peak detection algorithm and the ridge region criteria for verification, is proposed to discriminate true sheets from the obtained ridgeness measure. According to experiments and tests in real production lines, our apparatus can reach a very high measuring accuracy for printing papers or cards with a thickness not <0.2 mm. [ABSTRACT FROM PUBLISHER]

Online sensing of sheet modulus of elasticity in the dry-end spans of printing grade paper machines (PMs) will permit the machine operators to control the mechanical properties of the produced paper. This paper develops an integrated sensorless tension control and sheet modulus of elasticity estimation algorithm, which is tested using field-recorded signals from a production PM and using a full model of the dry-end sections of this machine. Results show the ability of the proposed estimation algorithm to predict the sheet tension (tensile force) and sheet modulus of elasticity even in the presence of rapid changes in the speed and/or in other process operating conditions. The developed algorithms offer the papermaker new insights into the papermaking process. The ability to understand how modulus changes in real time provides a pathway to optimizing the operation of the PM drive system. [ABSTRACT FROM PUBLISHER]

Nonconvex constraints are valuable regularizers in many optimization problems. In particular, sparsity constraints have had a significant impact on sampling theory, where they are used in compressed sensing and allow structured signals to be sampled far below the rate traditionally prescribed. Nearly, all of the theory developed for compressed sensing signal recovery assumes that samples are taken using linear measurements. In this paper, we instead address the compressed sensing recovery problem in a setting where the observations are nonlinear. We show that, under conditions similar to those required in the linear setting, the iterative hard thresholding algorithm can be used to accurately recover sparse or structured signals from few nonlinear observations. Similar ideas can also be developed in a more general nonlinear optimization framework. In the second part of this paper, we therefore present related result that shows how this can be done under sparsity and union of subspaces constraints, whenever a generalization of the restricted isometry property traditionally imposed on the compressed sensing system holds. [ABSTRACT FROM PUBLISHER]

Fighting against the pandemic diseases with unique characters requires new sophisticated approaches like the artificial intelligence. This paper develops an artificial intelligence algorithm to produce multi-dimensional policies for controlling and minimizing the pandemic casualties under the limited pharmacological resources. In this respect, a comprehensive parametric model with a priority and age-specific vaccination policy and a variety of non-pharmacological policies are introduced. This parametric model is utilized for constructing an artificial intelligence algorithm by following the exact analogy of the model-based solution. Also, this parametric model is manipulated by the artificial intelligence algorithm to seek for the best multi-dimensional non-pharmacological policies that minimize the future pandemic casualties as desired. The role of the pharmacological and non-pharmacological policies on the uncertain future casualties are extensively addressed on the real data. It is shown that the developed artificial intelligence algorithm is able to produce efficient policies which satisfy the particular optimization targets such as focusing on minimization of the death casualties more than the infected casualties or considering the curfews on the people age over 65 rather than the other non-pharmacological policies. The paper finally analyses a variety of the mutant virus cases and the corresponding non-pharmacological policies aiming to reduce the morbidity and mortality rates. [ABSTRACT FROM AUTHOR]

Visual text analytics has recently emerged as one of the most prominent topics in both academic research and the commercial world. To provide an overview of the relevant techniques and analysis tasks, as well as the relationships between them, we comprehensively analyzed 263 visualization papers and 4,346 mining papers published between 1992-2017 in two fields: visualization and text mining. From the analysis, we derived around 300 concepts (visualization techniques, mining techniques, and analysis tasks) and built a taxonomy for each type of concept. The co-occurrence relationships between the concepts were also extracted. Our research can be used as a stepping-stone for other researchers to 1) understand a common set of concepts used in this research topic; 2) facilitate the exploration of the relationships between visualization techniques, mining techniques, and analysis tasks; 3) understand the current practice in developing visual text analytics tools; 4) seek potential research opportunities by narrowing the gulf between visualization and mining techniques based on the analysis tasks; and 5) analyze other interdisciplinary research areas in a similar way. We have also contributed a web-based visualization tool for analyzing and understanding research trends and opportunities in visual text analytics. [ABSTRACT FROM AUTHOR]

A robust stability test for a class of constrained cross-directional controllers is found. Under special circumstances, the stability test is executed on a mode-by-mode basis and greatly simplified to a frequency-domain criterion. The test is also exploited to develop tuning algorithms. The control system involves a quadratic program embedded within an internal model control antiwindup structure and achieves optimal steady-state performance when the plant is known. Both the nonlinearity in the controller and the plant uncertainty satisfy certain integral quadratic inequalities. This allows us to obtain conditions for robust stability that can be expressed as linear matrix inequalities via the Kalman–Yakubovich–Popov lemma. [ABSTRACT FROM AUTHOR]

The Marching Cubes paper by Bill Lorensen and Harvey Cline, "Marching Cubes: A High Resolution 3D Surface Construction Algorithm," was published at SIGGRAPH 1987.1 According to Google Scholar, their paper has 15,667 citations (as of January 17, 2020), the most highly cited paper in computer graphics. Sadly, while writing this article Bill Lorensen passed away on December 12, 2019. Origins Department Editor Chris Johnson contributed the text in italics. EARLY [ABSTRACT FROM AUTHOR]

Since H.264/A VC achieves a high compression atio by reducing spatio-temporal redundancy in video equences, the payload of a single packet can often contain a vhole frame encoded by H.264/AVC. Therefore, the loss of a ingle packet does not only cause the loss of a whole frame, `ut also produce error propagation into succeeding frames. ~o deal with this problem, in this paper, we propose a novel ~rame error concealment method for ff264/A VC. First, the iroposed method extrapolates motion vectors from available reighboring frames onto the lost frame. Then, inter-modes of rh macroblocks in the lost frame are adaptively estimated by rsing the extrapolated motion vectors and features of 1.264/A VC. Experimental results exhibit that the proposed ~iethod outperforms the conventional methods in terms of roth objective and subjective video quality. [ABSTRACT FROM AUTHOR]

This paper focuses on minimum-time path tracking, a subproblem in motion planning of robotic systems. We generate a time-optimal velocity profile for robotic manipulators taking into account kinematic and dynamic constraints. Based on the special structure of the constraints (called peaked constraints), profile generation is formulated as a linear programming (LP) problem. The LP-based control problem is solved by a sequential optimization method. The presented algorithm has reduced computational time compared to a general LP solver. [ABSTRACT FROM AUTHOR]

This article presents a bibliography of the papers related to relay literature. The papers listed in this bibliography include references to the subjects of service restoration, testing and methods of calculation well as to the field of relaying. The references also include the title, author, publication information and a summary of the subject matter. Some of the entries in this bibliography are: "Symmetrical Components Estimation through Non-Recursive Newton-type Numerical Algorithm," "Signal Processing Module for Power System applications," "Variable-Window Algorithm for Ultra-High-Speed Distance Protection," "Wavelet-Based ANN Approach for Transmission Line Protection," and "Enhanced Transmission Line Protection Settings."

Many datasets including social media data and bibliographic data can be modeled as graphs. Clustering such graphs is able to provide useful insights into the structure of the data. To improve the quality of clustering, node attributes can be taken into account, resulting in attributed graphs. Existing attributed graph clustering methods generally consider attribute similarity and structural similarity separately. In this paper, we represent attributed graphs as star-schema heterogeneous graphs, where attributes are modeled as different types of graph nodes. This enables the use of personalized pagerank (PPR) as a unified distance measure that captures both structural and attribute similarities. We employ DBSCAN for clustering, and we update edge weights iteratively to balance the importance of different attributes. The rapidly growing volume of data nowadays challenges traditional clustering algorithms, and thus, a distributed method is required. Hence, we adopt a popular distributed graph computing system Blogel, based on which, we develop four exact and approximate approaches that enable efficient PPR score computation when edge weights are updated. To improve the effectiveness of the clustering, we propose a simple yet effective edge weight update strategy based on entropy. In addition, we present a game theory based method that enables trading efficiency for result quality. Extensive experiments on real-life datasets offer insights into the effectiveness and efficiency of our proposals. [ABSTRACT FROM AUTHOR]

This paper is concerned with online coverage of unknown planar environments by a mobile robot of size D operating with a limited energy capacity battery. The battery capacity is represented by the path length L that the robot can travel under a full battery charge. Starting at S, the robot has to cover a planar environment containing unknown obstacles, and return to S upon task completion. During task execution, the robot may return to S at any time to recharge its battery. This paper first describes a battery powered offline coverage methodology, then introduces the battery powered coverage (BPC) algorithm that performs online battery powered coverage using position and local obstacle detection sensors. The performance of the BPC algorithm is measured by its competitiveness, determined by measuring the mobile robot’s total online path length, l, relative to the optimal offline solution lopt. This paper establishes that the BPC algorithm has a competitive performance of l \leq ( L/ D) lopt. This paper additionally establishes a universal lower bound of l \geq \log ( L/ 4 D) lopt over all online battery powered coverage algorithms. Execution example illustrates the usefulness of the BPC algorithm. [ABSTRACT FROM AUTHOR]

The latest of a series of classified lists of power system relaying references, begun in 1927, is presented. This bibliography is in continuation to the bibliographies of relay literature, which were published previously and are contained in the following volumes of the IEEE Transactions: [ABSTRACT FROM AUTHOR]

This paper presents an integrated color imaging system for taking images in extremely high dynamic range scenes. The system first fuses several differently exposed raw images to acquire more intensity information. The effective dynamic range of the image raw data can be extended to 256 times ~five differently exposed images are fused. Then it runs edge detection iterations to extract the image details in different luminance levels. The proposed tone reproduction algorithm equalizes the histogram of the extracted fine edges which tends to assign larger dynamic range for highly populated regions. Finally, the local contrast enhancement is performed to further refine the image details. The experimental results show that the proposed high dynamic range imaging system has good performance on both tone and color reproduction'. [ABSTRACT FROM AUTHOR]

Many networked embedded sensing and control systems can be modeled as hybrid systems with interacting continuous and discrete dynamics. These systems present significant challenges for monitoring and diagnosis. Many existing model-based approaches focus on diagnostic reasoning assuming appropriate fault signatures have been generated. However, an important missing piece is the integration of model-based techniques with the acquisition and processing of sensor signals and the modeling of faults to support diagnostic reasoning. This paper addresses key modeling and computational problems at the interface between model-based diagnosis techniques and signature analysis to enable the efficient detection and isolation of incipient and abrupt faults in hybrid systems. A hybrid automata model that parameterizes abrupt and incipient faults is introduced. Based on this model, an approach for diagnoser design is presented. The paper also develops a novel mode estimation algorithm that uses model-based prediction to focus distributed processing signal algorithms. Finally. the paper describes a diagnostic system architecture that integrates the modeling, prediction, and diagnosis components. The implemented architecture is applied to fault diagnosis of a complex electro-mechanical machine, the Xerox DC265 printer, and the experimental results presented validate the approach. A number of design trade-otis that were made to support implementation of the algorithms for online applications are also described. [ABSTRACT FROM AUTHOR]

High quality scholarship requires technical excellence but also connects the work to the primary references in the field. In this way, the reader advances their knowledge and gains perspective. The TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING supports these goals by recognizing the best paper chosen by the Associate Editors and reviewers. The winning paper was selected from 140 papers published by TSM in 2015. The winner is “An Algorithm of Multi-Subpopulation Parameters With Hybrid Estimation of Distribution for Semiconductor Scheduling With Constrained Waiting Time” by Hung-Kai Wang, Chen-Fu Chien, and Mitsuo Gen published in the August 2015 issue of the IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING (10.1109/TSM.2015.2439054). I congratulate the authors on their selection. [ABSTRACT FROM AUTHOR]

In one of the several manifestations, the future cellular networks are required to accommodate a massive number of devices, several orders of magnitude compared to today’s networks. At the same time, the future cellular networks will have to fulfill stringent latency constraints. To that end, one problem that is posed as a potential showstopper is extreme congestion for requesting uplink scheduling over the physical random access channel (PRACH). Indeed, such congestion drags along scheduling delay problems. In this paper, the use of self-organized device-to-device (D2D) clustering is advocated for mitigating PRACH congestion. To this end, this paper proposes two D2D clustering schemes, namely, random-based clustering and channel-gain-based clustering. Accordingly, this paper sheds light on random access within the proposed D2D clustering schemes and presents a case study based on a stochastic geometry framework. For the sake of objective evaluation, the D2D clustering is benchmarked by the conventional scheduling request procedure. Accordingly, this paper offers insights into useful scenarios that minimize the scheduling delay for each clustering scheme. Finally, this paper discusses the implementation algorithm and some potential implementation issues and remedies. [ABSTRACT FROM AUTHOR]

The presence of condensate inside the dryer cylinders of a paper machine produces a significant increase in the power required to accelerate the section, risking a drive overload and/or section shutdown. In previous works, the authors developed a robust estimation algorithm for the condensate power and a generalized correlation for the estimation of condensate loads in industrial dryer cylinders up to 55 mm of condensate rim. This paper presents and evaluates a rule-based expert system (ES) capable of detecting the presence and amount of condensate in up to three groups of cylinders with different condensate loads. The ES can give an early warning message to the operators and determine the condensate load and number of cylinders within each group. Evaluation is done using a combined condensate load for a fictitious 1500-mm eight-cylinder dryer section. Results show the capacity of the developed ES to give an early warning as well as a correct estimation of the condensate loads and number of cylinders involved. [ABSTRACT FROM PUBLISHER]

Craters are among the most abundant features on the surface of many planets with great importance for planetary scientists. They reveal chronology information about planets and may be used for autonomous spacecraft navigation and landing. Although numerous research efforts have been carried out in the field of crater detection, existing crater detection algorithms (CDAs) are only helpful in a limited number of applications. A promising crater detection approach involves two main steps: 1) hypothesis generation (HG) and 2) hypothesis verification (HV). During HG, potential crater locations are detected. The validity of the hypothesized crater locations is then tested in a HV step. In this context, we discuss some commonly used algorithms for HG such as highlight-shadow region detection and Hough transform as well as our novel and enhanced algorithms based on interest point detection and convex grouping. A key objective of this paper is to analyze their performance while paying special attention to how they affect the accuracy of the verification step. To deal with different size craters, we focus on multiscale HG. For HV, we have chosen convolutional neural networks which have recently achieved state-of-the-art performance in many computer vision applications. Due to the variation of test sets in the literature, it is often challenging to compare the performance of different CDAs in a fair way. In this paper, we present a comprehensive performance evaluation and comparison of CDAs. Each algorithm has been trained/tested using common data sets generated by a systematic approach. [ABSTRACT FROM AUTHOR]

Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch. While throughput maximizing algorithms in a switch are well-understood, delay analysis was developed only recently. It was recently shown that the well-known MaxWeight algorithm achieves optimal scaling of mean queue lengths in steady state in the heavy-traffic regime, and is within a factor less than 2 of a universal lower bound. However, MaxWeight is not used in practice because of its high time complexity. In this paper, we study several low complexity algorithms and show that their heavy-traffic performance is identical to that of MaxWeight. We first present a negative result that picking a random schedule does not have optimal heavy-traffic scaling of queue lengths even under uniform traffic. We then show that if one picks the best among two matchings or modifies a random matching even a little, using the so-called flip operation, it leads to MaxWeight like heavy-traffic performance under uniform traffic. We then focus on the case of non-uniform traffic and show that a large class of low time complexity algorithms have the same heavy-traffic performance as MaxWeight, as long as it is ensured that a MaxWeight matching is picked often enough. We also briefly discuss the performance of these algorithms in the large scale heavy-traffic regime when the size of the switch increases simultaneously with the load. Finally, we perform empirical study on a new algorithm to compare its performance with some existing algorithms. [ABSTRACT FROM AUTHOR]

This article discusses how a hybrid algorithm based on a genetic algorithm (GA) and linear programming helps minimize distribution costs for the Scandinavian pulp producer Sodra Cell. The GA considers a planner's perspective by defining an individual schedule as the sequences of routes for all ships in a fixed fleet. Because the GA operates on a pool of potential solutions, constantly adjusting them to better fit the requirements, it can suggest multiple solutions. Furthermore, it can serve as a core algorithm in a support system where one can apply small changes to the set of constraints without a cold start. Applying the GA to Sodra Cell's real-world case and comparing it to mixed-integer-programming approach revealed competitive results. INSET: Related Work in Genetic Algorithms..

The presence of condensate inside the dryer cylinders produces a significant increase in the power requirements during starting, putting at risk the capacity of the drive to complete a successful start. In past papers, authors developed estimation algorithms for the detection of condensate during section starting. This paper proposes and evaluates a new strategy that will complement the previous algorithms. This strategy will detect the presence of condensate from the condensate collapsing during the section shutdown. The proposed correlations are derived through a complete experimental evaluation in two experimental cylinders covering rim thicknesses up to 55 mm. The estimation algorithms are split into a low-/moderate-condensate-load zone and a high-condensate-load zone. Results confirm the robustness and accuracy of the proposed algorithms. [ABSTRACT FROM PUBLISHER]

In recent years, the steady-state visual evoked potentials (SSVEP) based brain control method has been employed to help people with disabilities because of its advantages of high information transmission rate and low training time. However, the existing SSVEP brain control methods cannot adapt to dynamic or unstructured environments. Moreover, the recognition accuracy from the conventional decoding algorithm still needs to improve. To address the above problems, this study proposed a steady-state hybrid visual evoked potentials (SSHVEP) paradigm using the grasping targets in their environment to improve the connection between the subjects' and their dynamic environments. Moreover, a novel EEG decoding method, using the multivariate variational mode decomposition (MVMD) algorithm for adaptive sub-band division and convolutional neural network (CNN) for target recognition, was applied to improve the decoding accuracy of the SSHVEPs. 18 subjects participated in the offline and online experiments. The offline accuracy across 18 subjects by the 9-target SSHVEP paradigm was up to 95.41 ± 2.70 %, which is a 5.80% improvement compared to the conventional algorithm. To further validate the performance of the proposed method, the brain-controlled grasping robot system using the SSHVEP paradigm was built. The average accuracy reached 93.21 ± 10.18 % for the online experiment. All the experimental results demonstrated the effectiveness of the brain-computer interaction method based on the SSHVEP paradigm and the MVMD combined CNN algorithm studied in this paper.

The steady-state visual evoked potential (SSVEP) has become one of the most prominent BCI paradigms with high information transfer rate, and has been widely applied in rehabilitation and assistive applications. This paper proposes a least-square (LS) unified framework to summarize the correlation analysis (CA)-based SSVEP spatial filtering methods from a machine learning perspective. Within this framework, the commonalities and differences between various spatial filtering methods appear apparent, the interpretation of computational factors becomes intuitive, and spatial filters can be determined by solving a generalized optimization problem with non-linear and regularization items. Moreover, the proposed LS framework provides the foundation of utilizing the knowledge behind these spatial filtering methods in further classification/regression model designs. Through a comparative analysis of existing representative spatial filtering methods, recommendations are made for the superior and robust design strategies. These recommended strategies are further integrated to fill the research gaps and demonstrate the ability of the proposed LS framework to promote algorithmic improvements, resulting in five new spatial filtering methods. This study could offer significant insights in understanding the relationships between various design strategies in the spatial filtering methods from the machine learning perspective, and would also contribute to the development of the SSVEP recognition methods with high performance.

Timely diagnosis of mild traumatic brain injury (mTBI) remains challenging due to the rapid recovery of acute symptoms and the absence of evidence of injury in static neuroimaging scans. Furthermore, while longitudinal tracking of mTBI is essential in understanding how the diseases progresses/regresses over time for enhancing personalized patient care, a standardized approach for this purpose is not yet available. Recent functional neuroimaging studies have provided evidence of brain function alterations following mTBI, suggesting mTBI-detection models can be built based on these changes. Most of these models, however, rely on manual feature engineering, but the optimal set of features for detecting mTBI may be unknown. Data-driven approaches, on the other hand, may uncover hidden relationships in an automated manner, making them suitable for the problem of mTBI detection. This paper presents a data-driven framework based on Siamese Convolutional Neural Network (SCNN) to detect mTBI and to monitor the recovery state from mTBI over time. The proposed framework is tested on the cortical images of Thy1-GCaMP6s mice, obtained via widefield calcium imaging, acquired in a longitudinal study. Results show that the proposed model achieves a classification accuracy of 96.5%. To track the state of the injured brain over time, a reference distance map is constructed, which together with the SCNN model, are employed to assess the recovery state in subsequent sessions after injury, revealing that the recovery progress varies among subjects. The promising results of this work suggest that a similar approach could be potentially applicable for monitoring recovery from mTBI, in humans.

Various measures have been proposed to quantify upper-limb use through wrist-worn inertial measurement units. The two most popular traditional measures of upper-limb use - thresholded activity counts (TAC) and the gross movement (GM) score suffer from high sensitivity and low specificity, and vice versa. We previously proposed a hybrid version of these two measures - the GMAC - that showed better overall detection performance than TAC and GM. In this paper, we answer two critical questions to improve the GMAC measure's usefulness: (a) can it be implemented using only the accelerometer data? (b) what are its optimal parameter values? Here, we propose a modified GMAC using only the accelerometer data and optimize its parameters to develop: (a) a generic measure that is both limb- and subject-independent, and (b) limb-specific measures that were only subject-independent. The optimized GMAC showed better detection performance than the previous GMAC and surprisingly had comparable performance to the best-performing machine learning-based measure (random forest inter-subject model). In hemiparetic data, its performance was similar to the previous GMAC and the random forest inter-subject model; the limb-specific GMAC measure, however, had a better performance than the generic measure. The optimized limb-specific GMAC is a simple, interpretable alternative to a machine learning-based inter-subject model. The optimized GMAC can be a valuable measure for offline or real-time detection and feedback of upper limb use. The preliminary results of this study, based on a small dataset, need to be validated on a larger dataset to evaluate its generalizability.

Many challenges exist in the study of using orthotics, exoskeletons or exosuits as tools for rehabilitation and assistance of healthy people in daily activities due to the requirements of portability and safe interaction with the user and the environment. One approach to dealing with these challenges is to design a control system that can be deployed in a portable device to identify the relationships that exist between the gait variables and gait cycle for different locomotion modes. In order to estimate the knee and ankle angles in the sagittal plane for different locomotion modes, a novel multimodal feature-decoupled kinematic estimation system consisting of a multimodal locomotion classifier and an optimal joint angle estimator is proposed in this paper. The multi-source information output from different conventional primary models are fused by assigning the non-fixed weight. To improve the performance of the primary models, a data augmentation module based on the time-frequency domain analysis method is designed. The results show that the inclusion of the data augmentation module and multi-source information fusion modules has improved the classification accuracy to 98.56% and kinematic estimation performance (PCC) to 0.904 (walking), 0.956 (running), 0.899 (stair ascent), 0.851 (stair descent), respectively. The kinematic estimation quality is generally higher for faster speed (running) or proximal joint (knee) compared to other modes and ankle. The limitations and advantages of the proposed approach are discussed. Based on our findings, the multimodal kinematic estimation system has potential in facilitating the deployment for human-in-loop control of lower-limb intelligent assistive devices.

Modeling the muscle response to functional electrical stimulation (FES) is an important step during model-based FES control system design. The Hammerstein structure is widely used in simulating this nonlinear biomechanical response. However, a fixed relationship cannot cope well with the time-varying property of muscles and muscle fatigue. In this paper, we proposed an adaptive Hammerstein model to predict ankle joint torque induced by electrical stimulation, which used variable forgetting factor recursive least squares (VFFRLS) method to update the model parameters. To validate the proposed model, ten healthy individuals were recruited for short-duration FES experiments, ten for long-duration FES experiments, and three stroke patients for both. The isometric ankle dorsiflexion torque induced by FES was measured, and then the test performance of the fixed-parameter Hammerstein model, the adaptive Hammerstein model based on fixed forgetting factor recursive least squares (FFFRLS) and the adaptive Hammerstein model based on VFFRLS was compared. The goodness of fit, root mean square error, peak error and success rate were applied to evaluate the accuracy and stability of the model. The results indicate a significant improvement in both the accuracy and stability of the proposed adaptive model compared to the fixed-parameter model and the adaptive model based on FFFRLS. The proposed adaptive model enhances the ability of the model to cope with muscle changes.

The olfactory system enables humans to smell different odors, which are closely related to emotions. The high temporal resolution and non-invasiveness of Electroencephalogram (EEG) make it suitable to objectively study human preferences for odors. Effectively learning the temporal dynamics and spatial information from EEG is crucial for detecting odor-induced emotional valence. In this paper, we propose a deep learning architecture called Temporal Attention with Spatial Autoencoder Network (TASA) for predicting odor-induced emotions using EEG. TASA consists of a filter-bank layer, a spatial encoder, a time segmentation layer, a Long Short-Term Memory (LSTM) module, a multi-head self-attention (MSA) layer, and a fully connected layer. We improve upon the previous work by utilizing a two-phase learning framework, using the autoencoder module to learn the spatial information among electrodes by reconstructing the given input with a latent representation in the spatial dimension, which aims to minimize information loss compared to spatial filtering with CNN. The second improvement is inspired by the continuous nature of the olfactory process; we propose to use LSTM-MSA in TASA to capture its temporal dynamics by learning the intercorrelation among the time segments of the EEG. TASA is evaluated on an existing olfactory EEG dataset and compared with several existing deep learning architectures to demonstrate its effectiveness in predicting olfactory-triggered emotional responses. Interpretability analyses with DeepLIFT also suggest that TASA learns spatial-spectral features that are relevant to olfactory-induced emotion recognition.

Robot-assisted motor training is applied for neurorehabilitation in stroke patients, using motor imagery (MI) as a representative paradigm of brain-computer interfaces to offer real-life assistance to individuals facing movement challenges. However, the effectiveness of training with MI may vary depending on the location of the stroke lesion, which should be considered. This paper introduces a multi-task electroencephalogram-based heterogeneous ensemble learning (MEEG-HEL) specifically designed for cross-subject training. In the proposed framework, common spatial patterns were used for feature extraction, and the features according to stroke lesions are shared and selected through sequential forward floating selection. The heterogeneous ensembles were used as classifiers. Nine patients with chronic ischemic stroke participated, engaging in MI and motor execution (ME) paradigms involving finger tapping. The classification criteria for the multi-task were established in two ways, taking into account the characteristics of stroke patients. In the cross-subject session, the first involved a direction recognition task for two-handed classification, achieving a performance of 0.7419 (±0.0811) in MI and 0.7061 (±0.1270) in ME. The second task focused on motor assessment for lesion location, resulting in a performance of 0.7457 (±0.1317) in MI and 0.6791 (±0.1253) in ME. Comparing the specific-subject session, except for ME on the motor assessment task, performance on both tasks was significantly higher than the cross-subject session. Furthermore, classification performance was similar to or statistically higher in cross-subject sessions compared to baseline models. The proposed MEEG-HEL holds promise in improving the practicality of neurorehabilitation in clinical settings and facilitating the detection of lesions.

As an essential cognitive function, attention has been widely studied and various indices based on EEG have been proposed for its convenience and easy availability for real-time attention monitoring. Although existing indices based on spectral power of empirical frequency bands are able to describe the attentional state in some way, the reliability still needs to be improved. This paper proposed a subject-specific attention index based on the weighted spectral power. Unlike traditional indices, the ranges of frequency bands are not empirical but obtained from subject-specific change patterns of spectral power of electroencephalograph (EEG) to overcome the great inter-subject variance. In addition, the contribution of each frequency component in the frequency band is considered different. Specifically, the ratio of power spectral density (PSD) function in attentional and inattentional state is utilized to calculate the weight to enhance the effectiveness of the proposed index. The proposed subject-specific attention index based on the weighted spectral power is evaluated on two open datasets including EEG data of a total of 44 subjects. The results of the proposed index are compared with 3 traditional attention indices using various statistical analysis methods including significance tests and distribution variance measurements. According to the experimental results, the proposed index can describe the attentional state more accurately. The proposed index respectively achieves accuracies of 86.21% and 70.00% at the 1% significance level in both the t-test and Wilcoxon rank-sum test for two datasets, which obtains improvements of 41.38% and 20.00% compared to the best result of the traditional indices. These results indicate that the proposed index provides an efficient way to measure attentional state.

The existing surface electromyography-based pattern recognition system (sEMG-PRS) exhibits limited generalizability in practical applications. In this paper, we propose a stacked weighted random forest (SWRF) algorithm to enhance the long-term usability and user adaptability of sEMG-PRS. First, the weighted random forest (WRF) is proposed to address the issue of imbalanced performance in standard random forests (RF) caused by randomness in sampling and feature selection. Then, the stacking is employed to further enhance the generalizability of WRF. Specifically, RF is utilized as the base learner, while WRF serves as the meta-leaning layer algorithm. The SWRF is evaluated against classical classification algorithms in both online experiments and offline datasets. The offline experiments indicate that the SWRF achieves an average classification accuracy of 89.06%, outperforming RF, WRF, long short-term memory (LSTM), and support vector machine (SVM). The online experiments indicate that SWRF outperforms the aforementioned algorithms regarding long-term usability and user adaptability. We believe that our method has significant potential for practical application in sEMG-PRS.

Electroencephalogram (EEG) signals are widely utilized in the field of cognitive workload decoding (CWD). However, when the recognition scenario is shifted from subject-dependent to subject-independent or spans a long period, the accuracy of CWD deteriorates significantly. Current solutions are either dependent on extensive training datasets or fail to maintain clear distinctions between categories, additionally lacking a robust feature extraction mechanism. In this paper, we tackle these issues by proposing a Bi-Classifier Joint Domain Adaptation (BCJDA) model for EEG-based cross-time and cross-subject CWD. Specifically, the model consists of a feature extractor, a domain discriminator, and a Bi-Classifier, containing two sets of adversarial processes for domain-wise alignment and class-wise alignment. In the adversarial domain adaptation, the feature extractor is forced to learn the common domain features deliberately. The Bi-Classifier also fosters the feature extractor to retain the category discrepancies of the unlabeled domain, so that its classification boundary is consistent with the labeled domain. Furthermore, different adversarial distance functions of the Bi-Classifier are adopted and evaluated in this model. We conduct classification experiments on a publicly available BCI competition dataset for recognizing low, medium, and high cognitive workload levels. The experimental results demonstrate that our proposed BCJDA model based on cross-gradient difference maximization achieves the best performance.

Physical therapists play a crucial role in guiding patients through effective and safe rehabilitation processes according to medical guidelines. However, due to the therapist-patient imbalance, it is neither economical nor feasible for therapists to provide guidance to every patient during recovery sessions. Automated assessment of physical rehabilitation can help with this problem, but accurately quantifying patients' training movements and providing meaningful feedback poses a challenge. In this paper, an Expert-knowledge-based Graph Convolutional approach is proposed to automate the assessment of the quality of physical rehabilitation exercises. This approach utilizes experts' knowledge to improve the spatial feature extraction ability of the Graph Convolutional module and a Gated pooling module for feature aggregation. Additionally, a Transformer module is employed to capture long-range temporal dependencies in the movements. The attention scores and weight matrix obtained through this approach can serve as interpretability tools to help therapists understand the assessment model and assist patients in improving their exercises. The effectiveness of the proposed method is verified on the KIMORE dataset, achieving state-of-the-art performance compared to existing models. Experimental results also illustrate the interpretability of the method in both spatial and temporal dimensions.

Electroencephalography (EEG) signals are the brain signals acquired using the non-invasive approach. Owing to the high portability and practicality, EEG signals have found extensive application in monitoring human physiological states across various domains. In recent years, deep learning methodologies have been explored to decode the intricate information embedded in EEG signals. However, since EEG signals are acquired from humans, it has issues with acquiring enormous amounts of data for training the deep learning models. Therefore, previous research has attempted to develop pre-trained models that could show significant performance improvement through fine-tuning when data are scarce. Nonetheless, existing pre-trained models often struggle with constraints, such as the necessity to operate within datasets of identical configurations or the need to distort the original data to apply the pre-trained model. In this paper, we proposed the domain-free transformer, called DFformer, for generalizing the EEG pre-trained model. In addition, we presented the pre-trained model based on DFformer, which is capable of seamless integration across diverse datasets without necessitating architectural modification or data distortion. The proposed model achieved competitive performance across motor imagery and sleep stage classification datasets. Notably, even when fine-tuned on datasets distinct from the pre-training phase, DFformer demonstrated marked performance enhancements. Hence, we demonstrate the potential of DFformer to overcome the conventional limitations in pre-trained model development, offering robust applicability across a spectrum of domains.

Sleep staging serves as a fundamental assessment for sleep quality measurement and sleep disorder diagnosis. Although current deep learning approaches have successfully integrated multimodal sleep signals, enhancing the accuracy of automatic sleep staging, certain challenges remain, as follows: 1) optimizing the utilization of multi-modal information complementarity, 2) effectively extracting both long- and short-range temporal features of sleep information, and 3) addressing the class imbalance problem in sleep data. To address these challenges, this paper proposes a two-stream encode-decoder network, named TSEDSleepNet, which is inspired by the depth sensitive attention and automatic multi-modal fusion (DSA2F) framework. In TSEDSleepNet, a two-stream encoder is used to extract the multiscale features of electrooculogram (EOG) and electroencephalogram (EEG) signals. And a self-attention mechanism is utilized to fuse the multiscale features, generating multi-modal saliency features. Subsequently, the coarser-scale construction module (CSCM) is adopted to extract and construct multi-resolution features from the multiscale features and the salient features. Thereafter, a Transformer module is applied to capture both long- and short-range temporal features from the multi-resolution features. Finally, the long- and short-range temporal features are restored with low-layer details and mapped to the predicted classification results. Additionally, the Lovász loss function is applied to alleviate the class imbalance problem in sleep datasets. Our proposed method was tested on the Sleep-EDF-39 and Sleep-EDF-153 datasets, and it achieved classification accuracies of 88.9% and 85.2% and Macro-F1 scores of 84.8% and 79.7%, respectively, thus outperforming conventional traditional baseline models. These results highlight the efficacy of the proposed method in fusing multi-modal information. This method has potential for application as an adjunct tool for diagnosing sleep disorders.

This study presents a novel high density surface electromyography (EMG) decomposition method, named as 2CFastICA, because it incorporates two key algorithms: kernel constrained FastICA and correlation constrained FastICA. The former focuses on overcoming the local convergence of FastICA without requiring the peel-off strategy used in the progressive FastICA peel-off (PFP) framework. The latter further refines the output of kernel constrained FastICA by correcting possible erroneous or missed spikes. The two constrained FastICA algorithms supplement each other to warrant the decomposition performance. The 2CFastICA method was validated using simulated surface EMG signals with different motor unit numbers and signal to noise ratios (SNRs). Two source validation was also performed by simultaneous high density surface EMG and intramuscular EMG recordings, showing a matching rate (MR) of (97.2 ± 3.5)% for 170 common motor units. In addition, a different form of two source validation was also conducted taking advantages of the high density surface EMG characteristics of patients with amyotrophic lateral sclerosis, showing a MR of (99.4 ± 0.9)% for 34 common motor units from interference and sparse datasets. Both simulation and experimental results indicate that 2CFastICA can achieve similar decomposition performance to PFP. However, the efficiency of decomposition can be greatly improved by 2CFastICA since the complex signal processing procedures associated with the peel-off strategy are not required any more. Along with this paper, we also provide the MATLAB open source code of 2CFastICA for high density surface EMG decomposition.

Machine vision and artificial intelligence hold promise across healthcare applications. In this paper, we focus on the emerging research direction of infant action recognition, and we specifically consider the task of reaching which is an important developmental milestone. We develop E-babyNet, a lightweight yet effective neural-network-based framework for infant action recognition that leverages the spatial and temporal correlation of bounding boxes of infants' hands and objects to reach for to determine the onset and offset of the reaching action. E-babyNet consists of two main layers based on two LSTM and a Bidirectional LSTM (BiLSTM) model, respectively. The first layer provides a pre-evaluation of the reaching action for each hand by providing onset and offset keyframes. Then, the biLSTM model merges the previous outputs to deliver an outcome of the reaching actions detection for each frame including the reaching hand. We evaluated our approach against four other lightweight structures using a dataset comprising 5,865 annotated images resulting in 16,337 bounding boxes from 375 distinctive infant reaching actions performed while sitting by different subjects in unconstrained (home/clinic) environments. Results illustrate the effectiveness of our approach and ability to provide reliable reaching action detection and offer onset and offset keyframes with a precision of one frame. Moreover, the biLSTM layer can handle the transition between reaching actions and help reduce false detections.

Extreme events can cause severe power system damage. Resilience-driven operation of networked microgrids (MGs) has been heavily studied in literature. There is, though, little research considering the influence of resilience on decision making for planning. In this paper, a three-level model is suggested to solve the optimal sizing problem of networked MGs considering both resilience and cost. In the first level, a meta-heuristic technique based on an adaptive genetic algorithm (AGA) is utilized to tackle the normal sizing problem, while a time-coupled AC OPF is utilized to capture stability properties for accurate decision-making. The second and third levels are combined as a defender-attacker-defender model. In the former, the suggested AGA is utilized to generate attacking plans capturing load profile uncertainty and contingencies for load shedding maximization, while a multi-objective optimization problem is suggested for the latter to obtain a trade-off between cost and resilience. Simulations considering meshed networks and load distinction into critical and non-critical are developed to demonstrate algorithm effectiveness on capturing resilience at the planning stage and optimally sizing multiple parameters. The results indicate that higher resilience levels lead to higher investment cost, while sizing networked MGs leads to decreased investment in comparison with standalone MGs sizing. [ABSTRACT FROM AUTHOR]

This paper derives the maximum achievable sum-rate and presents the optimal encoding/decoding framework for rate-diverse wireless network coding (RD-WNC) over broadband channels consisting of multiple parallel subchannels. RD-WNC applies to a communication scenario in which a base station wants to deliver two different messages with different rates to two users. The base station combines the two separate messages into one network-coded message and broadcasts the network-coded message to both users. Each user then extracts its desired message from the network-coded message by subtracting from it the other message, which we assume to be side information available to the user. Deriving the maximum achievable sum-rate for RD-WNC is challenging when the channel consists of multiple parallel subchannels with different channel coefficients (e.g., the subcarrier channels of OFDM systems), since apart from the rate allocation between the two users, optimal power allocation among multiple subchannels needs to be identified. The first contribution of this paper is a new “mountain-leveling” power allocation algorithm to achieve the maximum sum-rate. With the resulting power allocation, we can then achieve the corresponding optimal sum-rate by having a separate encoding/decoding mechanism for each subchannels, but doing so is cumbersome and complex when the number of subchannels is large. The second contribution of this paper is a practical encoding/decoding framework using only one encoder-decoder mechanism for all subchannels without sacrificing sum-rate optimality. We provide numerical results to corroborate our theoretical findings and to demonstrate the benefits of our encoding/decoding framework. [ABSTRACT FROM AUTHOR]

In an interesting paper, Prof. C. Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and dimension over the same finite field. However, not much is known about these codes. In this paper, we explain some of the numerical data by developing a general method on cyclic codes of composite length and on estimating the minimum distance. We also provide a general construction of cyclic codes of composite length which are related to Ding’s constructions. Numerical data shows that it produces many best cyclic codes as well. Finally, we point out how these cyclic codes can be used to construct convolutional codes with large free distance. [ABSTRACT FROM AUTHOR]