Miracle-dz/UniFAR-FTUs huggingface dataset:
Lysine-Specific Demethylase 1A as a Promising Target in Acute Myeloid Leukemia

Acute myeloid leukemia (AML) is a heterogeneous hematopoietic malignancy characterized by the accumulation of incompletely differentiated progenitor cells (blasts) in the bone marrow and blood, and by suppression of normal hematopoiesis. It has recently become apparent that the AML genome is characterized by recurrent mutations and dysregulations in epigenetic regulators. These mutations frequently occur before the onset of full blown leukemia, at the pre-leukemic phase, and persist in residual disease that remains after therapeutic intervention, thus suggesting that targeting the AML epigenome may help to eradicate minimal residual disease and prevent relapse. Within the AML epigenome, lysine-specific demethylase 1 A (LSD1) is a histone demethylase that is found frequently overexpressed, albeit not mutated, in AML. LSD1 is a required constituent of critical transcription repressor complexes like CoREST and nucleosome remodeling and deacetylase (NuRD), and abrogation of LSD1 expression results in impaired self-renewal and proliferation, and increased differentiation and apoptosis in AML models and primary cells, particularly in AMLs with MLL- and AML1-rearrangements, or erythroid and megakaryoblastic differentiation block. On this basis, a number of LSD1 inhibitors have been developed in the past decade, and few of them are currently being tested in clinical trials for patients with AML, along with other malignancies. To date, the most promising application of this therapeutic strategy appears to be combination therapy of LSD1 inhibitors with all-trans retinoic acid (ATRA) to reactivate myeloid differentiation in cells that are not spontaneously susceptible to ATRA treatment. In this review, we provide an overview of LSD1 function in normal hematopoiesis and leukemia, and of the current clinical application of LSD1 inhibitors for the treatment of patients with AML.
An Ontology for a Patient-Centric Healthcare Interoperability Framework

Healthcare clients are increasingly interested to be involved and informed of their healthcare delivery and status [1] [2]. They need to be able to access, view, and analyze their health data easily and securely. Clients need one single gateway to their medical records. Some healthcare providers are creating portals for their clients to flow some data for them to view [3]. In addition, clients can request a portion of their health data in paper format from their healthcare providers by filling in forms and manually submitting their requests. But, this is not sufficient for the average healthcare client. There is a need for a platform independent tool that can automatically gather and combine a client’s health information from the various providers in their circle of care and provide the information securely and electronically without inconveniencing the client with multiple requests and sharing agreements [4]. Healthcare providers can also benefit from such a tool in the sense of gaining insights from their colleagues’ efforts automatically and without starting a separate quest for each piece of information. In this paper we propose framework and toolset that can provide a secure single point of access to a client’s full picture of their personal health information. In particular, we delve into one of the key components of our framework which is our proposed ontology.
Mutode: generic JavaScript and Node.js mutation testing tool

Mutation testing is a technique in which faults (mutants) are injected into a program or application to assess its test suite effectiveness. It works by inserting mutants and running the application’s test suite to identify if the mutants are detected (killed) or not (survived) by the tests. Although computationally expensive, it has proven to be an effective method to assess application test suites. Several mutation testing frameworks and tools have been built for the various programing languages, however, very few tools have been built for the JavaScript language, more specifically, there is a lack of mutation testing tools for the Node.js runtime and npm based applications. The npm Registry is a public collection of modules of open-source code for Node.js, front-end web applications, mobile applications, robots, routers, and countless other needs of the JavaScript community. The over 700,000 packages hosted in npm are downloaded more than 5 billion times per week. More and more software is published in npm every day, representing a huge opportunity to share code and solutions, but also to share bugs and faulty software. In this paper, we briefly describe prior work for mutation operators in JavaScript and Node.js, and propose Mutode, an open source tool which leverages the npm package ecosystem to perform mutation testing for JavaScript and Node.js applications. We empirically evaluated Mutode effectiveness by running it on 12 of the top 20 npm modules that have automated test suites.
An Integrated Tri-Band/UWB Polarization Diversity Antenna for Vehicular Networks

The design, fabrication, and testing of an integrated polarization diversity antenna array for maximizing the wireless channel link in vehicular networks are presented in this paper. The diversity antenna is constructed using unit cell radiators that provide two operating modes. The mode transition is achieved using a pair of PIN diodes. In one state, the antenna provides multiband operation centered at 2.4, 3.5, and 5.8 GHz. In the other state, the antenna covers the entire ultra-wideband (UWB) spectrum. The unit cell radiators are distributed in the horizontal and vertical plane to achieve polarization diversity. Apart from offering a polarization diversity antenna, the orientation of antennas offers a reliable link with the communication devices. The prototype antenna array is fabricated and tested for diversity performance. The performance metrics such as envelope correlation coefficient, diversity gain, and mean effective gain under isotropic, indoor, and outdoor conditions are evaluated and presented.
Codes With Hierarchical Locality From Covering Maps of Curves

Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the codeword without having to access each of the remaining coordinates. A subfamily of LRC codes with hierarchical locality (H-LRC codes) provides added flexibility to the construction by introducing several tiers of recoverability for correcting different numbers of erasures. We present a general construction of codes with 2-level hierarchical locality from maps between algebraic curves and specialize it to several code families obtained from quotients of curves by a subgroup of the automorphism group, including rational, elliptic, Kummer, and Artin–Schreier curves. We further address the question of H-LRC codes with availability, and suggest a general construction of such codes from fiber products of curves. Detailed calculations of parameters for H-LRC codes with availability are performed for Reed–Solomon- and Hermitian-like code families. Finally, we construct asymptotically good families of H-LRC codes from curves related to the Garcia–Stichtenoth tower.
Self-regulation of emotional responses to Zika: Spiral of fear

Fear of infectious disease can create a variety of problems not the least of which is fear itself. An important question is how individuals attempt to manage their fear. The appearance of Zika in the U.S. presented an opportunity to examine this issue in a consequential natural context. Beginning nine days after the W.H. O. declared Zika a world health crisis, two-waves of survey data were collected from women ages 18–35 who were living in the Southern U.S. (N = 561). Most respondents (71%) used one or more emotion regulation strategies and a plurality (41%) utilized multiple strategies. Fear of Zika showed no demonstrable effect on avoidance, reappraisal, or contesting and none of these three strategies were effective at down-regulating fear. Fear and suppression, however, showed a self-reinforcing cycle in which fear increased use of suppression and suppression increased intensity of the fear response. Although the observed associations were small, even modest effects can be consequential when cumulated over time or across large numbers of individuals.
Protecting Operation-Time Privacy of Primary Users in Downlink Cognitive Two-Tier Networks

Dynamic Spectrum Sharing (DSS) has a great potential in fully utilizing the scarce spectrum resources, and heterogeneous two-tier network has been regarded as one major solution for achieving it. Without privacy protection in operation-time, however, the primary users will be reluctant to share their spectrum with secondary users. In this paper, we present PriDSS in two-tier wireless networks, the first scheme for the administrator of a dynamic spectrum sharing system to select secondary users in a differentially operation-time private manner. First, we describe the operation-time inference attacks on the traditional secondary users auction without privacy. Then, we bring up a ranking metric to quantify the administrator's preference for secondary users. Moreover, based on the exponential mechanism, we calculate the probability of each secondary user being selected as a winner through the ranking metric. Finally, a truthful payment method is designed according to that probability. Extensively theoretical analysis and evaluations show that PriDSS can simultaneously achieve truthfulness, approximate social welfare maximization, and differential operation-time privacy.
Ghrelin Through GHSR1a and OX1R Heterodimers Reveals a Gαs–cAMP-cAMP Response Element Binding Protein Signaling Pathway in Vitro

Growth hormone secretagogue receptor 1α (GHSR1a) and Orexin 1 receptor (OX1R) are involved in various important physiological processes, and have many similar characteristics in function and distribution in peripheral tissues and the central nervous system. We explored the possibility of heterodimerization between GHSR1a and OX1R and revealed a signal transduction pathway mechanism. In this study, bioluminescence and fluorescence resonance energy transfer and co-immunoprecipitation (Co-IP) analyses were performed to demonstrate the formation of functional GHSR1a/OX1R heterodimers. This showed that a peptide corresponding to the 5-transmembrane domain of OX1R impaired heterodimer construction. We found that ghrelin stimulated GHSR1a/OX1R heterodimer cells to increase the activation of Gαs protein, compared to the cells that express GHSR1a. Stimulation of GHSR1a/OX1R heterodimers with orexin-A did not alter GPCR interactions with Gα protein subunits. GHSR1a/OX1R heterodimers induced Gαs and downstream signaling pathway activity, including increase of cAMP-response element luciferase reporter activity and cAMP levels. In addition, ghrelin induced a higher proliferation rate in SH-SY5Y cells than in controls. This suggests that ghrelin GHSR1a/OX1R heterodimers promotes an upregulation of a Gαs-cAMP-cAMP-responsive element signaling pathway in vitro and an increase in neuroblastoma cell proliferation.
Approach for Imitation of Manned Lunar Rover Acceleration Using a Prototype Vehicle With Imitation Handling Ratio on the Earth

The lunar surface is a complicated and unknown terrain, and hence, astronauts must be trained to travel on that surface by using a prototype vehicle on the Earth's terrain. However, the gravity of the Earth is six times that of the Moon; thus, the acceleration of a prototype vehicle on the Earth will differ from that of a manned lunar rover on the Moon, when the same acceleration handling input is provided. To obtain the same acceleration in the prototype vehicle on the Earth as that obtained on the Moon, an imitation handling ratio describing the relationship between the acceleration handling input and the wheel rolling speed is proposed in order to replicate the lunar gravitational conditions on the Earth. First, a whole-vehicle acceleration model was established based on the mechanical model of a deformable wheel with a mesh surface. Thereby an acceleration imitation algorithm was derived. A prototype vehicle for use on the Earth is proposed for the purpose of imitating the manned lunar rover under four different vehicle conditions. Fitted functions were used in order to obtain the imitation handling ratio. Finally, experiments were conducted to verify the imitation method; the results revealed that the prototype vehicle on the Earth could effectively approximate the same accelerations experienced by a manned lunar rover, when equivalent acceleration handling inputs were provided.
Improved Transmitter Jitter Modeling for Accurate Bit Error Rate (BER) Eye Contours Using Transient Simulation of Short Bit Patterns

Increase in the signaling speeds has led to decrease in jitter budget available for the channel to pass the product specifications. The current serial link specifications are based on a bit-error-rate (BER) metric and hence there is a need to account for jitter statistically. Accurately capturing jitter through the channel is very important to have confidence in the product specifications. Current statistical eye approaches are based on either single pulse/step response or multiple edge responses, which do not account for transmitter (Tx) driver jitter accurately since jitter interaction between the edges is ignored. There is an inherent assumption in pulse/step response methods that there is zero correlation between independent responses created from 2n combinations for n cursor pulse response where n is number where the tail settles, hence one zero crossing does not impact an adjacent zero crossing. Transient simulation accurately accounts for Tx jitter but is time consuming and requires large memory when simulating very large bit sequences. A new methodology is proposed to generate BER contours that capture the Tx driver jitter and inter symbol interference (ISI) through the channel accurately using unique waveforms created from truth table bit combinations. It utilizes 2N short N bit patterns as waveforms with jitter correlation from current bit patterns into adjacent bit patterns to get equivalent transient simulation of a desired pseudo random bit sequence. The method accounts for the edge interactions from any current bit pattern to next successive bit pattern to account for ISI accurately. The statistical eye diagram generated with the above approach includes nonideal channel characteristics, including ISI, XTK from nearby aggressor channels, and jitter through the channel.
Multi-bit Leveled Homomorphic Encryption of Message Matrices

Fully homomorphic encryption (FHE) makes it easier for cloud computing to be consistent with privacy. But the efficiency of existing FHE schemes is still far from the actual needs. The main cause is that most of existing FHE schemes are single-bit encryption. Hiromasa, Abe and Okamoto (PKC 2015) reached the major milestone by constructing the first fully homomorphic encryption (FHE) scheme that encrypted message matrices (with single-bit matrices components) and supported homomorphic matrix addition and multiplication. In this paper, we propose a more efficient variant of Hiromasa, Abe and Okamoto with a lower factor noise-expansion factor for homomorphic multiplication from Θ(poly(n)) to Θ(1) and multi-bit matrices components.
Sipjeondaebo-tang in patients with breast cancer with fatigue: a protocol for a pilot, randomised, double-blind, placebo-controlled, cross-over trial

Introduction Cancer-related fatigue is a frequent symptom in patients with cancer and one of the most distressing symptoms in patients with breast cancer. Sipjeondaebo-tang (Juzen-taiho-to in Japanese or Shi-Quan-Da-Bu-Tang in Chinese) is a widely used herbal medicine for the treatment of fatigue in Korea, China and Japan. The purpose of the present study is to evaluate the feasibility of Sipjeondaebo-tang for cancer-related fatigue. Methods and analysis The present study is a randomised, double-blind, placebo-controlled, cross-over study. Forty-eight patients with breast cancer who are indicated for doxorubicin and cyclophosphamide will be recruited. The participants will receive 3 g of Sipjeondaebo-tang or a placebo three times a day for 56 days. The primary outcome measurement is the change in the Brief Fatigue Inventory scores. The secondary outcome measurements include the changes in the Visual Analogue Scale (VAS) of fatigue, and quality of life measured by the European Organization for Research and Treatment of Cancer—QLQ-C30 and QLQ-BR23. VAS of fatigue will be measured on every visit, and other outcomes will be measured on visits 2, 4, 6 and 7. The total study period is 14 weeks. Ethics and dissemination This study has been approved by the Institutional Review Board of the Catholic Kwandong University International St Mary’s Hospital (reference IS16MNSI0011). The results of this study will be published in a peer-reviewed journal and presented at a scientific conference. Trial registration number NCT02858856; Pre-results.
TA-Update: An Adaptive Update Scheme with Tree-Structured Transmission in Erasure-Coded Storage Systems

Erasure coding has received considerable attentions due to the better tradeoff between the space efficiency and reliability. The frequent update of the stored data in the distributed storage systems has posed a new challenge for erasure codes: how to update the erasure-coded data in a general, efficient and adaptive way. However, existing update schemes of erasure codes are inadequate to meet these requirements, since their code-related update manners lead to a low generality, their star-structured data transmission manners lead to a low update efficiency, and their redo manners when encountering the node failure lead to a low adaptivity. In this paper, we propose an adaptive update scheme with the tree-structured transmission, called TA-Update, which consists of a code-independent update framework and three algorithms: the rack-aware tree construction algorithm, the top-down data processing algorithm and the rollback-based failure processing algorithm. For generality, we propose a code-independent update framework with the tree structure to support the MDS code with any coding parameter. For efficiency, a rack-aware tree construction algorithm is proposed to achieve the high available bandwidth, which organizes the data node and parity nodes as an update tree. Moreover, a top-down data processing algorithm is proposed to achieve the high transmission and computation efficiency, which pipelines the data transmission along the update tree and distributes the encoding computations among all the participating nodes. For adaptivity, we propose a rollback-based failure processing algorithm to achieve high adaptivity, which handles the node failure during update with the existing update tree in a rollback manner. To evaluate the performance of TA-Update, we conduct experiments on HDFS-RAID under various parameter settings on both 30 physical and 200 virtual machines. Extensive experiments confirm that TA-Update could support the various erasure codes with any parameter, improve the update efficiency by 30 percent and the adaptivity by 47 percent on average compared with the state-of-the-art approaches under various parameter settings.
Recurrent Capsule Network for Relations Extraction: A Practical Application to the Severity Classification of Coronary Artery Disease

Coronary artery disease (CAD) is one of the leading causes of cardiovascular disease deaths. CAD condition progresses rapidly, if not diagnosed and treated at an early stage may eventually lead to an irreversible state of the heart muscle death. Invasive coronary arteriography is the gold standard technique for CAD diagnosis. Coronary arteriography texts describe which part has stenosis and how much stenosis is in details. It is crucial to conduct the severity classification of CAD. In this paper, we propose a recurrent capsule network (RCN) to extract semantic relations between clinical named entities in Chinese coronary arteriography texts, through which we can automatically find out the maximal stenosis for each lumen to inference how severe CAD is according to the improved method of Gensini. Experimental results on the corpus collected from Shanghai Shuguang Hospital show that our proposed RCN model achieves a F$_1$-score of 0.9641 in relation extraction, which outperforms the baseline methods.
Spectrum Analysis of LTI Continuous-Time Systems With Constant Delays: A Literature Overview of Some Recent Results

In recent decades, increasingly intensive research attention has been given to dynamical systems containing delays and those affected by the after-effect phenomenon. Such research covers a wide range of human activities and the solutions of related engineering problems often require interdisciplinary cooperation. The knowledge of the spectrum of these so-called time-delay systems (TDSs) is very crucial for the analysis of their dynamical properties, especially stability, periodicity, and dumping effect. A great volume of mathematical methods and techniques to analyze the spectrum of the TDSs have been developed and further applied in the most recent times. Although a broad family of nonlinear, stochastic, sampled-data, time-variant or time-varying-delay systems has been considered, the study of the most fundamental continuous linear time-invariant (LTI) TDSs with fixed delays is still the dominant research direction with ever-increasing new results and novel applications. This paper is primarily aimed at a (systematic) literature overview of recent (mostly published between 2013 to 2017) advances regarding the spectrum analysis of the LTI-TDSs. Specifically, a total of 137 collected articles–which are most closely related to the research area–are eventually reviewed. There are two main objectives of this review paper: First, to provide the reader with a detailed literature survey on the selected recent results on the topic and Second, to suggest possible future research directions to be tackled by scientists and engineers in the field.
A Framework for Moment Invariants

For more than half a century, moments have attracted lot ot interest in the pattern recognition community.The moments of a distribution (an object) provide several of its characteristics as center of gravity, orientation, disparity, volume. Moments can be used to define invariant characteristics to some transformations that an object can undergo, commonly called moment invariants. This work provides a simple and systematic formalism to compute geometric moment invariants in n-dimensional space.
Bipedal Walking Robot using Deep Deterministic Policy Gradient

Machine learning algorithms have found several applications in the field of robotics and control systems. The control systems community has started to show interest towards several machine learning algorithms from the sub-domains such as supervised learning, imitation learning and reinforcement learning to achieve autonomous control and intelligent decision making. Amongst many complex control problems, stable bipedal walking has been the most challenging problem. In this paper, we present an architecture to design and simulate a planar bipedal walking robot(BWR) using a realistic robotics simulator, Gazebo. The robot demonstrates successful walking behaviour by learning through several of its trial and errors, without any prior knowledge of itself or the world dynamics. The autonomous walking of the BWR is achieved using reinforcement learning algorithm called Deep Deterministic Policy Gradient(DDPG). DDPG is one of the algorithms for learning controls in continuous action spaces. After training the model in simulation, it was observed that, with a proper shaped reward function, the robot achieved faster walking or even rendered a running gait with an average speed of 0.83 m/s. The gait pattern of the bipedal walker was compared with the actual human walking pattern. The results show that the bipedal walking pattern had similar characteristics to that of a human walking pattern. The video presenting our experiment is available at this https URL.