Perkinsmckenzie0798

In this article, a class of distributed nonlinear placement problems is considered for a multicluster system. The task is to determine the positions of the agents in each cluster subject to the constraints on agent positions and the network topology. In particular, the agents in each cluster are placed to form the desired shape and minimize the sum of squares of the Euclidean lengths of the links amongst the center of each cluster and its corresponding cluster members. The problem is converted into a time-varying noncooperative game and then a distributed Nash equilibrium-seeking algorithm is designed based on a distributed observer method. A new iterative approach is employed to prove the convergence with the aid of the Lyapunov stability theorem. The effectiveness of the distributed algorithm is validated by numerical examples.The B-mode ultrasound (BUS) based computer-aided diagnosis (CAD) has shown its effectiveness for developmental dysplasia of the hip (DDH) in infants. In this work, a two-stage meta-learning based deep exclusivity regularized machine (TML-DERM) is proposed for the BUS-based CAD of DDH. TML-DERM integrates deep neural network (DNN) and exclusivity regularized machine into a unified framework to simultaneously improve the feature representation and classification performance. Moreover, the first-stage meta-learning is mainly conducted on the DNN module to alleviate the overfitting issue caused by the significantly increased parameters in DNN, and a random sampling strategy is adopted to self-generate the meta-tasks; while the second-stage meta-learning mainly learns the combination of multiple weak classifiers by a weight vector to improve the classification performance, and also optimizes the unified framework again. The experimental results on a DDH ultrasound dataset show the proposed TML-DERM achieves the superior classification performance with the mean accuracy of 85.89%, sensitivity of 86.54%, and specificity of 85.23%.Fetal Heart Rate(FHR), an important recording in Cardiotocography(CTG)-based fetal health status monitoring, is the only information that clinical obstetricians can directly obtain and use. A challenge, however, is that missing samples are very common in FHR due to various causes such as fetal movements and sensor malfunctions. The aim is the development of an inpainting tool which is suitable for different missing lengths q and various total missing percentages Q, as well as for use in online mode. This study focused on two major impediments to existing inpainting methods the longer the missing length, the more difficult it is to recover with mathematical methods; the reliance on tens of thousands of training samples, and the computational burden caused by full batch-based dictionary learning algorithms. We present a regularized minimization approach to signal recovery, which combines a L0.6-norm minimized sparse dictionary learning algorithm (MSDL) and a model optimization strategy for using a mini-batch version for signal recovery. Using 100 FHR recordings with 2 protocols designed to simulate missing clinical data scenarios, the combined method performed favorably in terms of 5 data analysis metrics and 3 clinical indicators. Comparing 4 inpainting methods, we were able to prove the superiority of the proposed algorithm for both large q and large Q. buy Daurisoline The experimental results showed the lowest values (2.64 (MAE), 4.68 (RMSE)) when Q=5% with short interval lengths. The developed architecture provides a reference value for the practical application of recovering missing samples online.We review the current literature concerned with information plane (IP) analyses of neural network (NN) classifiers. While the underlying information bottleneck theory and the claim that information-theoretic compression is causally linked to generalization are plausible, empirical evidence was found to be both supporting and conflicting. We review this evidence together with a detailed analysis of how the respective information quantities were estimated. Our survey suggests that compression visualized in IPs is not necessarily information-theoretic but is rather often compatible with geometric compression of the latent representations. This insight gives the IP a renewed justification. Aside from this, we shed light on the problem of estimating mutual information in deterministic NNs and its consequences. Specifically, we argue that, even in feedforward NNs, the data processing inequality needs not to hold for estimates of mutual information. Similarly, while a fitting phase, in which the mutual information is between the latent representation and the target increases, is necessary (but not sufficient) for good classification performance, depending on the specifics of mutual information estimation, such a fitting phase needs to not be visible in the IP.In this work, we investigate the use of three information-theoretic quantities--entropy, mutual information with the class variable, and a class selectivity measure based on Kullback-Leibler (KL) divergence--to understand and study the behavior of already trained fully connected feedforward neural networks (NNs). We analyze the connection between these information-theoretic quantities and classification performance on the test set by cumulatively ablating neurons in networks trained on MNIST, FashionMNIST, and CIFAR-10. Our results parallel those recently published by Morcos et al., indicating that class selectivity is not a good indicator for classification performance. However, looking at individual layers separately, both mutual information and class selectivity are positively correlated with classification performance, at least for networks with ReLU activation functions. We provide explanations for this phenomenon and conclude that it is ill-advised to compare the proposed information-theoretic quantities across layers. Furthermore, we show that cumulative ablation of neurons with ascending or descending information-theoretic quantities can be used to formulate hypotheses regarding the joint behavior of multiple neurons, such as redundancy and synergy, with comparably low computational cost. We also draw connections to the information bottleneck theory for NNs.The use of artificial neural networks (NNs) as models of chaotic dynamics has been rapidly expanding. Still, a theoretical understanding of how NNs learn chaos is lacking. Here, we employ a geometric perspective to show that NNs can efficiently model chaotic dynamics by becoming structurally chaotic themselves. We first confirm NN's efficiency in emulating chaos by showing that a parsimonious NN trained only on few data points can reconstruct strange attractors, extrapolate outside training data boundaries, and accurately predict local divergence rates. We then posit that the trained network's map comprises sequential geometric stretching, rotation, and compression operations. These geometric operations indicate topological mixing and chaos, explaining why NNs are naturally suitable to emulate chaotic dynamics.Seizure generation is thought to be a process driven by epileptogenic networks; thus, network analysis tools can help determine the efficacy of epilepsy treatment. Studies have suggested that low-frequency (LF) to high-frequency (HF) cross-frequency coupling (CFC) is a useful biomarker for localizing epileptogenic tissues. However, it remains unclear whether the LF or HF coordinated CFC network hubs are more critical in determining the treatment outcome. We hypothesize that HF hubs are primarily responsible for seizure dynamics. Stereo-electroencephalography (SEEG) recordings of 36 seizures from 16 intractable epilepsy patients were analyzed. We propose a new approach to model the temporal-spatial-spectral dynamics of CFC networks. Graph measures are then used to characterize the HF and LF hubs. In the patient group with Engel Class (EC) I outcome, the strength of HF hubs was significantly higher inside the resected regions during the early and middle stages of seizure, while such a significant difference was not observed in the EC III group and only for the early stage in the EC II group. For the LF hubs, a significant difference was identified at the late stage and only in the EC I group. Our findings suggest that HF hubs increase at early and middle stages of the ictal interval while LF hubs increase activity at the late stages. In addition, HF hubs can predict treatment outcomes more precisely, compared to the LF hubs of the CFC network. The proposed method promises to identify more accurate targets for surgical interventions or neuromodulation therapies.Robustly handling collisions between individual particles in a large particle-based simulation has been a challenging problem. We introduce particle merging-and-splitting, a simple scheme for robustly handling collisions between particles that prevents inter-penetrations of separate objects without introducing numerical instabilities. This scheme merges colliding particles at the beginning of the time-step and then splits them at the end of the time-step. Thus, collisions last for the duration of a time-step, allowing neighboring particles of the colliding particles to influence each other. We show that our merging-and-splitting method is effective in robustly handling collisions and avoiding penetrations in particle-based simulations. We also show how our merging-and-splitting approach can be used for coupling different simulation systems using different and otherwise incompatible integrators. We present simulation tests involving complex solid-fluid interactions, including solid fractures generated by fluid interactions.Anomaly detection is a common analytical task that aims to identify rare cases that differ from the typical cases that make up the majority of a dataset. When analyzing event sequence data, the task of anomaly detection can be complex because the sequential and temporal nature of such data results in diverse definitions and flexible forms of anomalies. This, in turn, increases the difficulty in interpreting detected anomalies. In this paper, we propose a visual analytic approach for detecting anomalous sequences in an event sequence dataset via an unsupervised anomaly detection algorithm based on Variational AutoEncoders. We further compare the anomalous sequences with their reconstructions and with the normal sequences through a sequence matching algorithm to identify event anomalies. A visual analytics system is developed to support interactive exploration and interpretations of anomalies through novel visualization designs that facilitate the comparison between anomalous sequences and normal sequences. Finally, we quantitatively evaluate the performance of our anomaly detection algorithm, demonstrate the effectiveness of our system through case studies, and report feedback collected from study participants.We present a semi-automatic method for producing human bas-relief from a single photograph. Given an input photo of one or multiple persons, our method first estimates a 3D skeleton for each person in the image. SMPL models are then fitted to the 3D skeletons to generate a 3D guide model. To align the 3D guide model with the image, we compute a 2D warping field to non-rigidly register the projected contours of the guide model with the body contours in the image. Then the normal map of the 3D guide model is warped by the 2D deformation field to reconstruct an overall base shape. Finally, the base shape is integrated with a fine-scale normal map to produce the final bas-relief. To tackle the complex intra- and inter-body interactions, we design an occlusion relationship resolution method that operates at the level of 3D skeletons with minimal user inputs. To tightly register the model contours to the image contours, we propose a non-rigid point matching algorithm harnessing user-specified sparse correspondences.