Miracle-dz/UniFAR-FTUs huggingface dataset:
Reduced Renshaw Recurrent Inhibition after Neonatal Sciatic Nerve Crush in Rats

Renshaw recurrent inhibition (RI) plays an important gated role in spinal motion circuit. Peripheral nerve injury is a common disease in clinic. Our current research was designed to investigate the change of the recurrent inhibitory function in the spinal cord after the peripheral nerve crush injury in neonatal rat. Sciatic nerve crush was performed on 5-day-old rat puppies and the recurrent inhibition between lateral gastrocnemius-soleus (LG-S) and medial gastrocnemius (MG) motor pools was assessed by conditioning monosynaptic reflexes (MSR) elicited from the sectioned dorsal roots and recorded either from the LG-S and MG nerves by antidromic stimulation of the synergist muscle nerve. Our results demonstrated that the MSR recorded from both LG-S or MG nerves had larger amplitude and longer latency after neonatal sciatic nerve crush. The RI in both LG-S and MG motoneuron pools was significantly reduced to virtual loss (15–20% of the normal RI size) even after a long recovery period upto 30 weeks after nerve crush. Further, the degree of the RI reduction after tibial nerve crush was much less than that after sciatic nerve crush indicatig that the neuron-muscle disconnection time is vital to the recovery of the spinal neuronal circuit function during reinnervation. In addition, sciatic nerve crush injury did not cause any spinal motor neuron loss but severally damaged peripheral muscle structure and function. In conclusion, our results suggest that peripheral nerve injury during neonatal early development period would cause a more sever spinal cord inhibitory circuit damage, particularly to the Renshaw recurrent inhibition pathway, which might be the target of neuroregeneration therapy.
Faint H I 21 cm Emission Line Wings at Forbidden Velocities

We present the results of a search for faint H I 21 cm emission line wings at velocities forbidden by Galactic rotation in the Galactic plane using the Leiden/Dwingeloo H I Survey data and the H I Southern Galactic Plane Survey data. These "forbidden-velocity wings" (FVWs) appear as protruding excessive emission in comparison with their surroundings in limited (≲2°) spatial regions over velocity extents of more than ~20 km s-1 in large-scale (ℓ, v) diagrams. Their high velocities imply that there should be some dynamical phenomena associated. We have identified 87 FVWs. We present their catalog and discuss their distribution and statistical properties. We found that 85% of FVWs are not coincident with known supernova remnants (SNRs), galaxies, or high-velocity clouds. Their natures are currently unknown. We suspect that many of them are fast-moving H I shells and filaments associated with the oldest SNRs that are essentially invisible except via their H I line emission. We discuss other possible origins.
Segmentation of liver tumor using HMRF-EM algorithm with Bootstrap resampling

Volume measurement of liver tumor is an important task for surgical planning and cancer following-up. The computation of this volume requires an efficient liver tumor segmentation method. This work deals with liver tumor segmentation from computed tomography (CT) images. We are interested by HMRF-EM classification method. This method considers the spatial information given by voxel neighbors. A Bootstrap resampling, based on selecting randomly an optimal representative set of voxels, is proposed to accelerate the classification process. In order to extract correctly the tumor region, a post-treatment based on morphological operators and active contours method is needed. The entire approach was evaluated on two clinical data sets with manually generated ground truth segmentation by radiologists and has presented promising results.
A K Definition of Scheme

This paper presents an executable rewriting logic semantics of RRS Scheme using the K definitional technique [19]. We refer to this definition as K-Scheme. The presented semantics follows the K language definitional style but is almost entirely equational. It can also be regarded as a denotational specification with an initial model semantics of Scheme. Equational specifications can be executed on common rewrite engines, provided that equations are oriented into rewrite rules, typically from left-to-right. The rewriting logic semantics in this paper is the most complete formal definition of Scheme that we are aware of, in the sense that it provides definitions for more Scheme language features than any other similar attempts. The presented executable definition, K-Scheme, can serve as a platform for experimentation with variants and extensions of Scheme, for example concurrency. K-Scheme also serves to show the viability of K as a definitional framework for programming languages.
Security and usability research using a microworld environment

Technological developments and the addition of new features to existing applications or services require the inclusion of security mechanisms to protect the user. When using these mechanisms the user faces a tradeoff between more risky and more efficient or safer and less efficient use of the system. We discuss this tradeoff and present a novel complementary experimental system which provides researchers and corporations the ability to explore and model the usability and security tradeoff in the context of user interaction with security systems and psychological acceptability, even before the actual development and implementation processes have ended.
Revisiting Lee, Kim, & Yoo Authenticated Key Agreement Protocol

In recent issue of Journal of Applied Mathematics and Computation (2005), Lee, Kim, & Yoo revealed an attack on Hsu, Wu, & Wu (2003) authenticated key agreement protocol, and then presented an improved protocol. However, Lee, Kim, & Yoo (2005) present only heuristic argument with no formal proof of security. In this work, we revealed previously unpublished flaw in the protocol. We may speculate that such errors could have been found by protocol designers if proofs of security were to be constructed, and hope this work will encourage future protocol designers to provide proofs of security. We conclude with a countermeasure due to Choo, Boyd, & Hitchcock (2005).
Index reduction for Brauer classes via stable sheaves (with an appendix by Bhargav Bhatt)

We use twisted sheaves to study the problem of index reduction for Brauer classes. In general terms, this problem may be phrased as follows: given a field $k$, a $k$-variety $X$, and a class $\alpha \in \Br(k)$, compute the index of the class $\alpha_{k(X)} \in \Br(X)$ obtained from $\alpha$ by extension of scalars to $k(X)$. We give a general method for computing index reduction which refines classical results of Schofield and van den Bergh. When $X$ is a curve of genus 1, we use Atiyah's theorem on the structure of stable vector bundles with integral slope to show that our formula simplifies dramatically, giving a complete solution to the index reduction problem in this case. Using the twisted Fourier-Mukai transform, we show that a similarly simple formula describes homogeneous index reduction on torsors under higher-dimensional abelian varieties.
Chapter 3 Delay-Dependent Generalized H 2 Control for Discrete-Time Fuzzy Systems with Infinite-Distributed Delays

In recent years, there has been significant interest in the study of stability analysis and con‐ troller synthesis for Takagi-Sugeno(T-S) fuzzy systems, which has been used to approximate certain complex nonlinear systems [1]. Hence it is important to study their stability analysis and controller synthesis. A rich body of literature has appeared on the stability analysis and synthesis problems for T-S fuzzy systems [2-6]. However, these results rely on the existence of a common quadratic Lyapunov function (CQLF) for all the local models. In fact, such a CQLF might not exist for many fuzzy systems, especially for highly nonlinear complex sys‐ tems. Therefore, stability analysis and controller synthesis based on CQLF tend to be more conservative. At the same time, a number of methods based on piecewise quadratic Lyapu‐ nov function (PQLF) for T-S fuzzy systems have been proposed in [7-14]. The basic idea of these methods is to design a controller for each local model and to construct a global piece‐ wise controller from closed-loop fuzzy control system is established with a PQLF. The au‐ thors in [7,13] considered the information of membership function, a novel piecewise continuous quadratic Lyapunov function method has been proposed for stability analysis of T-S fuzzy systems. It is shown that the PQLF is a much richer class of Lyapunov function candidates than CQLF, it is able to deal with a large class of fuzzy systems and obtained re‐ sults are less conservative.
HOW MANY SUBJECTS SHOW THE EFFECT ? 1 HOW MANY SUBJECTS SHOW THE EFFECT ?

Computing the average 'effect', the difference in means of the dependent variable between conditions, is by far the most common way of analyzing experimental data. In many settings, however, the proportion of people individually exhibiting the effect in question (or the opposite one) is of interest also. This paper puts forward an assumption-free and computationally efficient algorithm that estimates a sharp lower-bound for such a statistic. Its use and usefulness are demonstrated by reanalyzing data from various behavioral economics experiments. Lower bounds of the share of subjects behaving contrary to standard economic theory in those experiments are shown to be sufficiently high and estimated with enough precision to be considered informative. Promising applications in behavioral economics more broadly, in experimental development economics, and in clinical medical trials are discussed.
Birth, life and death of nascent polypeptide chains

The journey of nascent polypeptides from synthesis at the peptidyl transferase center of the ribosome (“birth”) to full function (“maturity”) involves multiple interactions, constraints, modifications and folding events. Each step of this journey impacts the ultimate expression level and functional capacity of the translated protein. It has become clear that the kinetics of protein translation is predominantly modulated by synonymous codon usage along the mRNA, and that this provides an active mechanism for coordinating the synthesis, maturation and folding of nascent polypeptides. Multiple quality control systems ensure that proteins achieve their native, functional form. Unproductive co‐translational folding intermediates that arise during protein synthesis may undergo enhanced interaction with components of these systems, such as chaperones, and/or be subjects of co‐translational degradation (“death”). This review provides an overview of our current understanding of the complex co‐translational events that accompany the synthesis, maturation, folding and degradation of nascent polypeptide chains.
The Bayesian Score Statistic

We propose a novel Bayesian test under a (noninformative) Jeffreys'priorspecification. We check whether the fixed scalar value of the so-calledBayesian Score Statistic (BSS) under the null hypothesis is aplausiblerealization from its known and standardized distribution under thealternative. Unlike highest posterior density regions the BSS isinvariantto reparameterizations. The BSS equals the posterior expectation oftheclassical score statistic and it provides an exact test procedure,whereasclassical tests often rely on asymptotic results. Since the statisticisevaluated under the null hypothesis it provides the Bayesiancounterpart ofdiagnostic checking. This result extends the similarity of classicalsampling densities of maximum likelihood estimators and Bayesianposteriordistributions based on Jeffreys' priors, towards score statistics. Weillustrate the BSS as a diagnostic to test for misspecification inlinearand cointegration models.
Trading accuracy for faster named entity linking

Named entity linking ( NEL ) can be applied to documents such as ﬁnancial reports, web pages and news articles, but state of the art disambiguation techniques are currently too slow for web-scale applications because of a high complexity with respect to the number of candidates. In this paper, we accelerate NEL by taking two successful disambiguation features (popularity and context comparability) and use them to reduce the number of candidates before further disambiguation takes place. Popularity is measured by in-link score, and context similarity is measured by locality sensitive hashing. We present a novel approach to locality sensitive hashing which embeds the projection matrix into a smaller array and extracts columns of the projection matrix us-ing feature hashing, resulting in a low-memory approximation. We run the linker on a test set in 63% of the baseline time with an accuracy loss of 0.72%.
Domain-adapted named-entity linker using Linked Data

We present REDEN, a tool for graph-based Named Entity Linking that allows for the disambiguation of entities using domainspecific Linked Data sources and different configurations (e.g. context size). It takes TEI-annotated texts as input and outputs them enriched with external references (URIs). The possibility of customizing indexes built from various knowledge sources by defining temporal and spatial extents makes REDEN particularly suited to handle domain-specific corpora such as enriched digital editions in the Digital Humanities.
PDNI: A Distributed Framework for NFV Infrastructure

Network Function Virtualization (NFV) is an attempt to help operators more effectively manage their networks by implementing traditional network functions embedded in specialized hardware platforms in term of virtualized software instances. And, existing NFV infrastructure solutions are always architected on a general-purpose x86 server, which makes the performance of NFs limited by the hosted single server. However, this implementation may limit the performance of software network functions within a single server. This approach is inflexible and unsuitable for being extended with the trend of increasing sprawl when a NF is beyond the capability of a simple server. To address this challenge, we present Pooled Distributed Networking Infrastructure (PDNI for short), a distributed framework for NFV infrastructure that explores the way of consolidating multiple physical servers into a unified logical platform. By this, software network functions on PDNI could be transparently scaled onto more than one server to break up upper capability limit.
An improved method for unsupervised analysis of ECG beats based on WT features and J-means clustering

Clustering is advisable technique for analysis and interpretation of long-term ECG Holter records. As a non-supervised method, several challenges are posed due to factors such as signal length (very long duration), noise presence, dynamic behavior and morphology variability (different patient physiology and/or pathology). This work describes an improved version of the k-means clustering algorithm (J-means) for this task. In order to reduce the number of heartbeats to process, a preclustering stage is also employed. Dissimilarity measure calculation is based on the Dynamic Time Warping approach. To assess the validity of the proposed method, a comparative study is carried out, using k-means, k-medians, hk-means, and J-means. Heartbeat features are extracted by means of WT coefficients and trace segmentation. Best results were achieved by the J-means algorithm, which reduces the clustering error down to 4.5% while the critical error tends to the minimal value.
AN Extension of the ICP Algorithm Considering Scale Factor

The ICP algorithm is accurate and fast for registration between two point sets in a same scale, but it doesn't handle the case with different scales. This paper instead introduces a novel approach named the scaling iterative closest point (SICP) algorithm which integrates a scale matrix with boundaries into the original ICP algorithm for scaling registration. This method uses a simple iterative algorithm with the SVD algorithm and the properties of parabola incorporated to compute the translation, rotation and scale transformations at each iterative step, and its convergence is rapid with only a few iterations. The SICP algorithm is independent of shape representation and feature extraction; thereby it is general for scaling registration. Experimental results demonstrate its robustness and fast speed compared with the standard ICP algorithm.
Brain Evoked Potentials under Magnetic Stimulation at Acupuncture Point and at Mock Point

Magnetic stimulation is a non-invasive technique. Acupuncture point (acupoint) is a specific point in human body with high sensitivity to acupuncture treatment. In this paper, magnetic stimulation was used to stimulate Neiguan (PC6) acupoint and a mock point. 64-channel EEG signals in three stages (before, during and after magnetic stimulation) were recorded to determine the difference of effects between magnetic stimulation at PC6 acupoint and at mock point. The results showed that brain evoked potential component P300 was extracted during magnetic stimulation at PC6 acupoint, while it was not extracted during magnetic stimulation at the mock point. P300 was located at hippocampus of brain. It suggested that P300 was specific to magnetic stimulation at PC6 acupoint, and magnetic stimulation at PC6 acupoint could possess more complicated brain activities than that at mock point.
Effectiveness of behavioral-cognitive group therapy on depression, anxiety, and stress of patients with coronary heart disease

Objective. An appropriate psychological intervention to promote the level of mental health of patients with a coronary heart has a great importance. The existing investigation aimed to study the effectiveness of the behavioral-cognitive group therapy on depression, anxiety, and stress of patients with coronary heart disease. Methodology. The current study was quasi-experimental with a pretest-posttest that used a control group. Hence, 30 of the patients with coronary heart disease in Shahid Rajaee heart center in Tehran chose to use the convenience sampling method and were put in an experimental group and a control group. Both groups were pretested by using a demographic questionnaire, and scale of depression, anxiety, and stress DASS-42. Afterwards, the experimental group was trained for eight sessions of cognitive-behavioral club therapy and the control society gained no intervention. Later, both groups were post-tested, and the acquired information were analyzed by using inferential and descriptive statistical methods accompanied by SPSS 21 software. Findings. The results indicated that the cognitive-behavioral group therapy training significantly reduced depression, anxiety, and stress in patients with coronary heart disease. Conclusion. What should be understood from this study is that the cognitive-behavioral group therapy training had a great positive impact on the decrease of depression, anxiety, and tension in patients with coronary heart disease, since it had an economic cost and a great acceptability by the cases, especially when it was performed in a group.
UNIX Password Security

This document was written to make system administrators aware of the importance of wellchosen passwords. Easy-to-guess passwords offer hackers1 the possibility to enter a system. More and more computers are being connected to the world-wide Internet (the latest estimations speak of about 1.5 billion systems). This means there will be more and more users, and therefore more and more hackers. By means of good password-security, one can protect a system from newbie hackers.
Scheduling of Multi-Stream Gossip Systems

Many distributed applications are beginning to employ gossip-based message dissemination, where the burden of content distribution is shared democratically among the recipient nodes, e.g., for RSS distribution. However, such systems have many communication channels, i.e., multiple gossip streams may be present within the same application, e.g., an RSS content distribution system involves several publishers sending out streams to overlapping groups of subscribers (i.e., “nodes”). Yet, most existing gossiping approaches tend to have nodes treat each gossip stream independently of one another. This leads to each node being burdened with a message overhead that is the sum from all gossip streams. In this paper, we show that if all nodes instead use a scheduling strategy on the multiple gossip streams that they receive and forward, this leads to a significant reduction in overhead, but without affecting the original reliability, scalability, or latency. Simply put, our approach piggybacks messages from streams atop one another. However, in doing so, we take into account the different frequencies of gossiping for streams, and affinities of streams to one another. We formulate these constraints in a new model that we call the “semblance graph”. After formally stating our gossip scheduling problem, we show that finding an optimal solution to it is an NP-complete problem. We then present two greedy heuristics for the problem, one being Prim-like and the other being Kruskal-like (though the MST problem is different from ours). Our experimental results are in two categories – (1) a semblance graph-based evaluation that shows the heuristics come within 3.5% of the optimal solution, and (2) a distributed system simulation that shows the message savings are up to 85% compared to the default gossiping approach without scheduling.
Proteasome Inhibitors Enhance Endothelial Thrombomodulin Expression via Induction of Krüppel-Like Transcription Factors

Objective—Impairment of the thrombomodulin–protein C anticoagulant pathway has been implicated in pathological thrombosis associated with malignancy. Patients who receive proteasome inhibitors as part of their chemotherapeutic regimen appear to be at decreased risk for thromboembolic events. We investigated the effects of proteasome inhibitors on endothelial thrombomodulin expression and function. Methods and Results—Proteasome inhibitors as a class markedly induced the expression of thrombomodulin and enhanced the protein C activating capacity of endothelial cells. Thrombomodulin upregulation was independent of NF-&kgr;B signaling, a principal target of proteasome inhibitors, but was instead a direct consequence of increased expression of the Krüppel-like transcription factors, KLF2 and KLF4. These effects were confirmed in vivo, where systemic administration of a proteasome inhibitor enhanced thrombomodulin expression that was paralleled by changes in the expression of KLF2 and KLF4. Conclusions—These findings identify a novel mechanism of action of proteasome inhibitors that may help to explain their clinically observed thromboprotective effects.