Different-Level Simultaneous Minimization Scheme for Fault Tolerance of Redundant Manipulator Aided with Discrete-Time Recurrent Neural Network.
Ontology highlight
ABSTRACT:
SUBMITTER: Jin L
PROVIDER: S-EPMC5601992 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model) motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all). We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.
| S-EPMC2670499 | biostudies-literature
Project description:There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.
| S-EPMC5001885 | biostudies-literature
Project description:Artificial neural networks (ANNs) are powerful computational tools that are designed to replicate the human brain and adopted to solve a variety of problems in many different fields. Fault tolerance (FT), an important property of ANNs, ensures their reliability when significant portions of a network are lost. In this paper, a fault/noise injection-based (FIB) genetic algorithm (GA) is proposed to construct fault-tolerant ANNs. The FT performance of an FIB-GA was compared with that of a common genetic algorithm, the back-propagation algorithm, and the modification of weights algorithm. The FIB-GA showed a slower fitting speed when solving the exclusive OR (XOR) problem and the overlapping classification problem, but it significantly reduced the errors in cases of single or multiple faults in ANN weights or nodes. Further analysis revealed that the fit weights showed no correlation with the fitting errors in the ANNs constructed with the FIB-GA, suggesting a relatively even distribution of the various fitting parameters. In contrast, the output weights in the training of ANNs implemented with the use the other three algorithms demonstrated a positive correlation with the errors. Our findings therefore indicate that a combination of the fault/noise injection-based method and a GA is capable of introducing FT to ANNs and imply that the distributed ANNs demonstrate superior FT performance.
| S-EPMC5055486 | biostudies-literature
Project description:Analysis of the topology of transcriptional regulatory networks (TRNs) is an effective way to study the regulatory interactions between the transcription factors (TFs) and the target genes. TRNs are characterized by the abundance of motifs such as feed forward loops (FFLs), which contribute to their structural and functional properties. In this paper, we focus on the role of motifs (specifically, FFLs) in signal propagation in TRNs and the organization of the TRN topology with FFLs as building blocks. To this end, we classify nodes participating in FFLs (termed motif central nodes) into three distinct roles (namely, roles A, B and C), and contrast them with TRN nodes having high connectivity on the basis of their potential for information dissemination, using metrics such as network efficiency, path enumeration, epidemic models and standard graph centrality measures. We also present the notion of a three tier architecture and how it can help study the structural properties of TRN based on connectivity and clustering tendency of motif central nodes. Finally, we motivate the potential implication of the structural properties of motif centrality in design of efficient protocols of information routing in communication networks as well as their functional properties in global regulation and stress response to study specific disease conditions and identification of drug targets.
| S-EPMC7296022 | biostudies-literature
Project description:Avoiding obstacle(s) is a challenging issue in the research of redundant robot manipulators. In addition, noise from truncation, rounding, and model uncertainty is an important factor that affects greatly the obstacle avoidance scheme. In this paper, based on the neural dynamics design formula, a new scheme with the pseudoinverse-type formulation is proposed for obstacle avoidance of redundant robot manipulators in a noisy environment. Such a scheme has the capability of suppressing constant and bounded time-varying noises, and it is thus termed as the noise-tolerant obstacle avoidance (NTOA) scheme in this paper. Theoretical results are also given to show the excellent property of the proposed NTOA scheme (particularly in noise situation). Based on a PA10 robot manipulator with point and window-shaped obstacles, computer simulation results are presented to further substantiate the efficacy and superiority of the proposed NTOA scheme for motion planning of redundant robot manipulators.
| S-EPMC6124349 | biostudies-literature
Project description:A maneuver to capture and detumble an orbiting space object using a chaser spacecraft equipped with a robotic manipulator is presented. In the proposed maneuver, the capture and detumble objectives are integrated into a unified set of terminal constraints. Terminal constraints on the end-effector's position and velocity ensure a successful capture, and a terminal constraint on the chaser's momenta ensures a post-capture chaser-target system with zero angular momentum. The manipulator motion required to achieve a smooth, impact-free grasp is gradually stopped after capture, equalizing the momenta across all bodies, rigidly connecting the two vehicles, and completing the detumble of the newly formed chaser-target system without further actuation. To guide this maneuver, an optimization-based approach that enforces the capture and detumble terminal constraints, avoids collisions, and satisfies actuation limits is used. The solution to the guidance problem is obtained by solving a collection of convex programming problems, making the proposed guidance approach suitable for onboard implementation and real-time use. This simultaneous capture and detumble maneuver is evaluated through numerical simulations and hardware-in-the-loop experiments. Videos of the numerically simulated and experimentally demonstrated maneuvers are included as Supplementary Material.
| S-EPMC7805840 | biostudies-literature
Project description:Based on fieldworks, trench excavation, archaeological evidence, and radiocarbon dating ages, we have identified at least three large normal faulting events within Aso caldera in the past ~3000 years, excluding the 2016 Mw 7.1 Kumamoto earthquake. These events took place in AD ~1000, BC ~100, and BC ~1100, respectively, suggesting an average recurrence interval of ~1000 years. These events coincide with the timings of three large inferred paleoearthquakes within the Hinagu-Futagawa Fault Zone (HFFZ), where the 2016 Kumamoto earthquake rupture began. On the basis of geological, geophysical, and seismic data, we conclude that the recurrent normal faulting events within Aso caldera were triggered by the active faults of the HFFZ. As for the 2016 Kumamoto earthquake, seismic rupture initiated on the southwest side of the caldera, propagated northeastward, and terminated inside it. These findings demonstrate that large recurring earthquakes within an active fault-volcano system can be studied to improve our understanding of the termination of coseismic rupture propagation, and that the magma chamber beneath Mt. Aso probably hinders the propagation of coseismic rupture during large earthquakes.
| S-EPMC6147789 | biostudies-literature
Project description:Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue since it has to consider several requirements such as system load, processing cost and time, user's deadline, and resource failure. This work attempts to design a resource allocation algorithm which is budget constrained and also targets load balancing, fault tolerance, and user satisfaction by considering the above requirements. The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization. The proposed MLFT algorithm is evaluated using Gridsim toolkit and the results are compared with the recent algorithms which separately concentrate on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts.
| S-EPMC4469845 | biostudies-other
Project description:The interactions among associating (macro)molecules are dynamic, which adds to the complexity of molecular recognition. While ligand flexibility is well accounted for in computational drug design, the effective inclusion of receptor flexibility remains an important challenge. The relaxed complex scheme (RCS) is a promising computational methodology that combines the advantages of docking algorithms with dynamic structural information provided by molecular dynamics (MD) simulations, therefore explicitly accounting for the flexibility of both the receptor and the docked ligands. Here, we briefly review the RCS and discuss new extensions and improvements of this methodology in the context of ligand binding to two example targets: kinetoplastid RNA editing ligase 1 and the W191G cavity mutant of cytochrome c peroxidase. The RCS improvements include its extension to virtual screening, more rigorous characterization of local and global binding effects, and methods to improve its computational efficiency by reducing the receptor ensemble to a representative set of configurations. The choice of receptor ensemble, its influence on the predictive power of RCS, and the current limitations for an accurate treatment of the solvent contributions are also briefly discussed. Finally, we outline potential methodological improvements that we anticipate will assist future development.
| S-EPMC2516539 | biostudies-other
Project description:Event time variables are often recorded in a discrete fashion, especially in the case of patient-reported outcomes. This work is motivated by a study of illicit drug users, in which time to drug use cessation has been recorded as a number of whole months. Existing approaches for handling such discrete data include treating the survival times as continuous (with adjustments for inevitable tied outcomes), or using discrete models that omit important features like random effects. We provide a general Bayesian discrete-time proportional hazards model, incorporating a number of features popular in continuous-time models such as competing risks and frailties. Our model also provides flexible baseline hazards for time effects, as well as generalized additive models style semiparametric incorporation of other time-varying covariates. Our specific modeling choices enable efficient Markov chain Monte Carlo inference algorithms, which we provide to the user in the form of a freely available R package called $\texttt{brea}$. We demonstrate that our model performs better on our motivating substance abuse application than existing approaches. We also present a reproducible application of the $\texttt{brea}$ software to a freely available data set from a clinical trial of anesthesia administration methods.
| S-EPMC8546916 | biostudies-literature