35 research outputs found

    Stress field rotation or block rotation: An example from the Lake Mead fault system

    Get PDF
    The Coulomb criterion, as applied by Anderson (1951), has been widely used as the basis for inferring paleostresses from in situ fault slip data, assuming that faults are optimally oriented relative to the tectonic stress direction. Consequently if stress direction is fixed during deformation so must be the faults. Freund (1974) has shown that faults, when arranged in sets, must generally rotate as they slip. Nur et al., (1986) showed how sufficiently large rotations require the development of new sets of faults which are more favorably oriented to the principal direction of stress. This leads to the appearance of multiple fault sets in which older faults are offset by younger ones, both having the same sense of slip. Consequently correct paleostress analysis must include the possible effect of fault and material rotation, in addition to stress field rotation. The combined effects of stress field rotation and material rotation were investigated in the Lake Meade Fault System (LMFS) especially in the Hoover Dam area. Fault inversion results imply an apparent 60 degrees clockwise (CW) rotation of the stress field since mid-Miocene time. In contrast structural data from the rest of the Great Basin suggest only a 30 degrees CW stress field rotation. By incorporating paleomagnetic and seismic evidence, the 30 degrees discrepancy can be neatly resolved. Based on paleomagnetic declination anomalies, it is inferred that slip on NW trending right lateral faults caused a local 30 degrees counter-clockwise (CCW) rotation of blocks and faults in the Lake Mead area. Consequently the inferred 60 degrees CW rotation of the stress field in the LMFS consists of an actual 30 degrees CW rotation of the stress field (as for the entire Great Basin) plus a local 30 degrees CCW material rotation of the LMFS fault blocks

    Speaker Normalization for Self-supervised Speech Emotion Recognition

    Full text link
    Large speech emotion recognition datasets are hard to obtain, and small datasets may contain biases. Deep-net-based classifiers, in turn, are prone to exploit those biases and find shortcuts such as speaker characteristics. These shortcuts usually harm a model's ability to generalize. To address this challenge, we propose a gradient-based adversary learning framework that learns a speech emotion recognition task while normalizing speaker characteristics from the feature representation. We demonstrate the efficacy of our method on both speaker-independent and speaker-dependent settings and obtain new state-of-the-art results on the challenging IEMOCAP dataset.Comment: ICASSP 2

    Drugst.One -- A plug-and-play solution for online systems medicine and network-based drug repurposing

    Full text link
    In recent decades, the development of new drugs has become increasingly expensive and inefficient, and the molecular mechanisms of most pharmaceuticals remain poorly understood. In response, computational systems and network medicine tools have emerged to identify potential drug repurposing candidates. However, these tools often require complex installation and lack intuitive visual network mining capabilities. To tackle these challenges, we introduce Drugst.One, a platform that assists specialized computational medicine tools in becoming user-friendly, web-based utilities for drug repurposing. With just three lines of code, Drugst.One turns any systems biology software into an interactive web tool for modeling and analyzing complex protein-drug-disease networks. Demonstrating its broad adaptability, Drugst.One has been successfully integrated with 21 computational systems medicine tools. Available at https://drugst.one, Drugst.One has significant potential for streamlining the drug discovery process, allowing researchers to focus on essential aspects of pharmaceutical treatment research.Comment: 45 pages, 6 figures, 7 table

    תפישה בעידן המודרני: כיצד חשיפה לסביבות שונות משפיעה על זיהוי גירויים חיוביים

    No full text
    ניסוי במסגרת קורס פסיכולוגיה ניסויית, אוניברסיטת בן גוריון. סמסטר קיץ תשע"

    DOMINO: a network‐based active module identification algorithm with reduced rate of false calls

    No full text
    Abstract Algorithms for active module identification (AMI) are central to analysis of omics data. Such algorithms receive a gene network and nodes' activity scores as input and report subnetworks that show significant over‐representation of accrued activity signal (“active modules”), thus representing biological processes that presumably play key roles in the analyzed conditions. Here, we systematically evaluated six popular AMI methods on gene expression and GWAS data. We observed that GO terms enriched in modules detected on the real data were often also enriched on modules found on randomly permuted data. This indicated that AMI methods frequently report modules that are not specific to the biological context measured by the analyzed omics dataset. To tackle this bias, we designed a permutation‐based method that empirically evaluates GO terms reported by AMI methods. We used the method to fashion five novel AMI performance criteria. Last, we developed DOMINO, a novel AMI algorithm, that outperformed the other six algorithms in extensive testing on GE and GWAS data. Software is available at https://github.com/Shamir‐Lab
    corecore