TMD Design by an Entropy Index for Seismic Control of Tall Shear-Bending Buildings.

This study proposes a new arrangement-tuning method to maximize the potential of tuned mass dampers (TMDs) in decreasing the seismic responses of tall buildings. The method relies on a Grammian-based entropy index with the physical meaning of covariance responses to white noise without the involvement of external inputs. A twelve-story RC frame-shear wall building was used as an example to illustrate the method. Indices were computed for the building with TMDs placed on different stories and tuning to different modes and were compared with responses to white noise (colored) time histories. Results showed that greater index reduction cases agree well with greater story-drift reductions cases, despite the differences in the time step of the white noises and structural model types (pure shear vs. shear-bending), and the optimal TMD is not necessarily the traditional "roof-1st mode tuning" case. Comparisons were also made for the shear-bending building under seven earthquake excitations. It is found that, though TMDs are not full-band effective controllers, the index-selected TMDs still perform the best in three out of seven earthquakes. So, the proposed internal-property-based entropy index provides a good controller design for large-scale structures under unpredictable none-stationary excitations.

Star Identification Based on Multilayer Voting Algorithm for Star Sensors.

This paper describes the multilayer voting algorithm, a novel autonomous star identification method for spacecraft attitude determination. The proposed algorithm includes two processes: an initial match process and a verification process. In the initial match process, a triangle voting scheme is used to acquire candidates of the detected stars, in which the triangle unit is adopted as the basic voting unit. During the identification process, feature extraction is implemented, and each triangle unit is described by its singular values. Then the singular values are used to search for candidates of the imaged triangle units, which further improve the efficiency and robustness of the algorithm. After the initial match step, a verification method is applied to eliminate incorrect candidates from the initial results and then outputting the final match results of the imaged stars. Experiments show that our algorithm has more robustness to position noise, magnitude noise, and false stars than the other three algorithms, the identification speed of our algorithm is largely faster than the geometric voting algorithm and optimized grid algorithm. However, it takes more memory, and SVD also seems faster.

Relations between ordinary energy and energy of a self-loop graph.

Let G be a graph on n vertices with vertex set V(G) and let S⊆V(G) with |S|=α. Denote by GS, the graph obtained from G by adding a self-loop at each of the vertices in S. In this note, we first give an upper bound and a lower bound for the energy of GS (E(GS)) in terms of ordinary energy (E(G)), order (n) and number of self-loops (α). Recently, it is proved that for a bipartite graph GS, E(GS)≥E(G). Here we show that this inequality is strict for an unbalanced bipartite graph GS with 0<α

Selection of the most sensitive configuration of strip array detectors for x-ray beam monitoring in radiotherapy of cancer utilizing singular value decomposition.

We propose a concise mathematical framework in order to compare detector configurations efficiently for x-ray beam monitoring in radiotherapy of cancer. This framework consists of the singular value decomposition (SVD) of the system matrix and the definition of an effective information threshold based on the relative error inequality utilizing the condition number of a matrix. The goal of this paper is to present the mathematical argument as well as to demonstrate its use for modeling the best detector configuration for monitoring x-ray beams in external beam therapy. This analysis depends neither on specific measurements of a given set of x-ray beams, nor does it depend in specific reconstruction algorithms of the beam shape, and therefore represents a configuration meta-analysis. In the results section, we compare three possible detector designs, each leading to a highly underdetermined system, and are able to determine their effective information content relative to each other. Furthermore, by changing design parameters, such as the geometric detector configuration, number of detectors, detector pixel size, and the x-ray beam blur, deeper insight in this challenging inverse problem is achieved and the most sensitive monitoring scheme is determined. Graphical Abstract Illustration of the general approach for performing configuration meta-analysis.

A New Hybrid Inversion Method for 2D Nuclear Magnetic Resonance Combining TSVD and Tikhonov Regularization.

This paper is concerned with the reconstruction of relaxation time distributions in Nuclear Magnetic Resonance (NMR) relaxometry. This is a large-scale and ill-posed inverse problem with many potential applications in biology, medicine, chemistry, and other disciplines. However, the large amount of data and the consequently long inversion times, together with the high sensitivity of the solution to the value of the regularization parameter, still represent a major issue in the applicability of the NMR relaxometry. We present a method for two-dimensional data inversion (2DNMR) which combines Truncated Singular Value Decomposition and Tikhonov regularization in order to accelerate the inversion time and to reduce the sensitivity to the value of the regularization parameter. The Discrete Picard condition is used to jointly select the SVD truncation and Tikhonov regularization parameters. We evaluate the performance of the proposed method on both simulated and real NMR measurements.

Spectral neighbor joining for reconstruction of latent tree Models.

A common assumption in multiple scientific applications is that the distribution of observed data can be modeled by a latent tree graphical model. An important example is phylogenetics, where the tree models the evolutionary lineages of a set of observed organisms. Given a set of independent realizations of the random variables at the leaves of the tree, a key challenge is to infer the underlying tree topology. In this work we develop Spectral Neighbor Joining (SNJ), a novel method to recover the structure of latent tree graphical models. Given a matrix that contains a measure of similarity between all pairs of observed variables, SNJ computes a spectral measure of cohesion between groups of observed variables. We prove that SNJ is consistent, and derive a sufficient condition for correct tree recovery from an estimated similarity matrix. Combining this condition with a concentration of measure result on the similarity matrix, we bound the number of samples required to recover the tree with high probability. We illustrate via extensive simulations that in comparison to several other reconstruction methods, SNJ requires fewer samples to accurately recover trees with a large number of leaves or long edges.

Theory of adaptive SVD regularization for deep neural networks.

Deep networks can learn complex problems, however, they suffer from overfitting. To solve this problem, regularization methods have been proposed that are not adaptable to the dynamic changes in the training process. With a different approach, this paper presents a regularization method based on the Singular Value Decomposition (SVD) that adjusts the learning model adaptively. To this end, the overfitting can be evaluated by condition numbers of the synaptic matrices. When the overfitting is high, the matrices are substituted with their SVD approximations. Some theoretical results are derived to show the performance of this regularization method. It is proved that SVD approximation cannot solve overfitting after several iterations. Thus, a new Tikhonov term is added to the loss function to converge the synaptic weights to the SVD approximation of the best-found results. Following this approach, an Adaptive SVD Regularization (ASR) is proposed to adjust the learning model with respect to the dynamic training characteristics. ASR results are visualized to show how ASR overcomes overfitting. The different configurations of Convolutional Neural Networks (CNN) are implemented with different augmentation schemes to compare ASR with state-of-the-art regularization methods. The results show that on MNIST, F-MNIST, SVHN, CIFAR-10 and CIFAR-100, the accuracies of ASR are 99.4%, 95.7%, 97.1%, 93.2% and 55.6%, respectively. Although ASR improves the overfitting and validation loss, its elapsed time is not significantly greater than the learning without regularization.

MCDCalc: Markov Chain Molecular Descriptors Calculator for Medicinal Chemistry.

AIMS: Cheminformatics models are able to predict different outputs (activity, property, chemical reactivity) in single molecules or complex molecular systems (catalyzed organic synthesis, metabolic reactions, nanoparticles, etc.). BACKGROUND: Cheminformatics models are able to predict different outputs (activity, property, chemical reactivity) in single molecules or complex molecular systems (catalyzed organic synthesis, metabolic reactions, nanoparticles, etc.). OBJECTIVE: Cheminformatics prediction of complex catalytic enantioselective reactions is a major goal in organic synthesis research and chemical industry. Markov Chain Molecular Descriptors (MCDs) have been largely used to solve Cheminformatics problems. There are different types of Markov chain descriptors such as Markov-Shannon entropies (Shk), Markov Means (Mk), Markov Moments (πk), etc. However, there are other possible MCDs that have not been used before. In addition, the calculation of MCDs is done very often using specific software not always available for general users and there is not an R library public available for the calculation of MCDs. This fact, limits the availability of MCMDbased Cheminformatics procedures. METHODS: We studied the enantiomeric excess ee(%)[Rcat] for 324 α-amidoalkylation reactions. These reactions have a complex mechanism depending on various factors. The model includes MCDs of the substrate, solvent, chiral catalyst, product along with values of time of reaction, temperature, load of catalyst, etc. We tested several Machine Learning regression algorithms. The Random Forest regression model has R2 > 0.90 in training and test. Secondly, the biological activity of 5644 compounds against colorectal cancer was studied. RESULTS: We developed very interesting model able to predict with Specificity and Sensitivity 70-82% the cases of preclinical assays in both training and validation series. CONCLUSION: The work shows the potential of the new tool for computational studies in organic and medicinal chemistry.

Evaluation of electrohysterogram measured from different gestational weeks for recognizing preterm delivery: a preliminary study using random Forest.

Developing a computational method for recognizing preterm delivery is important for timely diagnosis and treatment of preterm delivery. The main aim of this study was to evaluate electrohysterogram (EHG) signals recorded at different gestational weeks for recognizing the preterm delivery using random forest (RF). EHG signals from 300 pregnant women were divided into two groups depending on when the signals were recorded: i) preterm and term delivery with EHG recorded before the 26th week of gestation (denoted by PE and TE group), and ii) preterm and term delivery with EHG recorded during or after the 26th week of gestation (denoted by PL and TL group). 31 linear features and nonlinear features were derived from each EHG signal, and then compared comprehensively within PE and TE group, and PL and TL group. After employing the adaptive synthetic sampling approach and six-fold cross-validation, the accuracy (ACC), sensitivity, specificity and area under the curve (AUC) were applied to evaluate RF classification. For PL and TL group, RF achieved the ACC of 0.93, sensitivity of 0.89, specificity of 0.97, and AUC of 0.80. Similarly, their corresponding values were 0.92, 0.88, 0.96 and 0.88 for PE and TE group, indicating that RF could be used to recognize preterm delivery effectively with EHG signals recorded before the 26th week of gestation.

Application of polynomial control to design a robust oscillation-damping controller in a multimachine power system.

This paper addresses the application of a static Var compensator (SVC) to improve the damping of interarea oscillations. Optimal location and size of SVC are defined using bifurcation and modal analysis to satisfy its primary application. Furthermore, the best-input signal for damping controller is selected using Hankel singular values and right half plane-zeros. The proposed approach is aimed to design a robust PI controller based on interval plants and Kharitonov's theorem. The objective here is to determine the stability region to attain robust stability, the desired phase margin, gain margin, and bandwidth. The intersection of the resulting stability regions yields the set of kp-ki parameters. In addition, optimal multiobjective design of PI controller using particle swarm optimization (PSO) algorithm is presented. The effectiveness of the suggested controllers in damping of local and interarea oscillation modes of a multimachine power system, over a wide range of loading conditions and system configurations, is confirmed through eigenvalue analysis and nonlinear time domain simulation.

Do muscle synergies reduce the dimensionality of behavior?

The muscle synergy hypothesis is an archetype of the notion of Dimensionality Reduction (DR) occurring in the central nervous system due to modular organization. Toward validating this hypothesis, it is important to understand if muscle synergies can reduce the state-space dimensionality while maintaining task control. In this paper we present a scheme for investigating this reduction utilizing the temporal muscle synergy formulation. Our approach is based on the observation that constraining the control input to a weighted combination of temporal muscle synergies also constrains the dynamic behavior of a system in a trajectory-specific manner. We compute this constrained reformulation of system dynamics and then use the method of system balancing for quantifying the DR; we term this approach as Trajectory Specific Dimensionality Analysis (TSDA). We then investigate the consequence of minimization of the dimensionality for a given task. These methods are tested in simulations on a linear (tethered mass) and a non-linear (compliant kinematic chain) system. Dimensionality of various reaching trajectories is compared when using idealized temporal synergies. We show that as a consequence of this Minimum Dimensional Control (MDC) model, smooth straight-line Cartesian trajectories with bell-shaped velocity profiles emerged as the optima for the reaching task. We also investigated the effect on dimensionality due to adding via-points to a trajectory. The results indicate that a trajectory and synergy basis specific DR of behavior results from muscle synergy control. The implications of these results for the synergy hypothesis, optimal motor control, motor development, and robotics are discussed.