Miracle-dz/UniFAR-FTUs huggingface dataset:
Hormonal Regulation of Postnatal Growth in Children Born Small for Gestational Age

Children born small for gestational age (SGA) are at high risk of permanent short stature, with approximately 10% continuing to have stature below the third centile throughout childhood and adolescence and into adulthood. The mechanisms involved in catch-up growth, and those that prevent catch-up growth, are still unknown. To date, no reliable anthropometric or endocrine parameter predictive of postnatal catch-up growth has been identified. However, subtle abnormalities in the growth hormone-insulin-like growth factor axis, the hypothalamic-pituitary-adrenal axis and thyroid function have been described, and a mechanism involving intrauterine programming of hypothalamic-pituitary function has been proposed.
Document classification using nonnegative matrix factorization and underapproximation

In this study, we use nonnegative matrix factorization (NMF) and nonnegative matrix underapproximation (NMU) approaches to generate feature vectors that can be used to cluster Aviation Safety Reporting System (ASRS) documents obtained from the Distributed National ASAP Archive (DNAA). By preserving nonnegativity, both the NMF and NMU facilitate a sum-of-parts representation of the underlying term usage patterns in the ASRS document collection. Both the training and test sets of ASRS documents are parsed and then factored by both algorithms to produce a reduced-rank representations of the entire document space. The resulting feature and coefficient matrix factors are used to cluster ASRS documents so that the (known) associated anomalies of training documents are directly mapped to the feature vectors. Dominant features of test documents are then used to generate anomaly relevance scores for those documents.We demonstrate that the approximate solution obtained by NMU using Lagrangrian duality can lead to a better sum-of-parts representation and document classification accuracy.
Building a music search database using human computation

Systems able to find a song based on a sung, hummed, or whistled melody are called Query-By-Humming (QBH) systems. Hummed or sung queries are not directly compared to original recordings. Instead, systems employ search keys that are more similar to a cappella singing than the original pieces. Successful, deployed systems use human computation to create search keys: hand-entered midi melodies or recordings of a cappella singing. There are a number of human computation-based approaches that may be used to build a database of QBH search keys, but it is not clear what the best choice is based on cost, computation time, and search performance. In this paper we compare search keys built through human computation using two populations: paid local singers and Amazon Mechanical Turk workers. We evaluate them on quality, cost, computation time, and search performance.
The Development of A Novel Fault Identification Technique by Combining Minimum-Distance Pattern-Recognition and Discrete Wavelet Transform

In this paper, a new idea in machinery fault diagnostic by combining minimum-distance pattern-recognition and discrete wavelet transform (DWT) is presented. The method starts by forming the feature vector, which is basically the position vector of a point in the hyperspace spanned by the set of wavelet coefficients. These coefficients are obtained by expanding the measured signal from faulty machines using DWT. Fault identification is performed based on the distance between the feature vector of the measured signal and the reference feature vector. The basic idea comes from the fact that the wavelet expansion coefficients are unique for a particular signal, considering completeness of the wavelet series. In order to show the effectiveness of the method, two standard machinery faults, namely the unbalance case and the mechanical looseness, were simulated. Experimental results are very promising, since the method successfully identifies the simulated faults.
The Lipopeptide Antibiotic Friulimicin B Inhibits Cell Wall Biosynthesis through Complex Formation with Bactoprenol Phosphate

ABSTRACT Friulimicin B is a naturally occurring cyclic lipopeptide, produced by the actinomycete Actinoplanes friuliensis, with excellent activity against gram-positive pathogens, including multidrug-resistant strains. It consists of a macrocyclic decapeptide core and a lipid tail, interlinked by an exocyclic amino acid. Friulimicin is water soluble and amphiphilic, with an overall negative charge. Amphiphilicity is enhanced in the presence of Ca2+, which is also indispensable for antimicrobial activity. Friulimicin shares these physicochemical properties with daptomycin, which is suggested to kill gram-positive bacteria through the formation of pores in the cytoplasmic membrane. In spite of the fact that friulimicin shares features of structure and potency with daptomycin, we found that friulimicin has a unique mode of action and severely affects the cell envelope of gram-positive bacteria, acting via a defined target. We found friulimicin to interrupt the cell wall precursor cycle through the formation of a Ca2+-dependent complex with the bactoprenol phosphate carrier C55-P, which is not targeted by any other antibiotic in use. Since C55-P also serves as a carrier in teichoic acid biosynthesis and capsule formation, it is likely that friulimicin blocks multiple pathways that are essential for a functional gram-positive cell envelope.
On the Complexity of Verifying Consistency of XML Specifications

XML specifications often consist of a type definition (typically, a document type definition (DTD)) and a set of integrity constraints. It has been shown previously that such specifications can be inconsistent, and thus it is often desirable to check consistency at compile time. It is known [W. Fan and L. Libkin, J. ACM, 49 (2002), pp. 368-406] that for general keys, foreign keys, and DTDs the consistency problem is undecidable; however, it becomes NP-complete when all keys are one-attribute (unary) and tractable, if no foreign keys are used. In this paper, we consider a variety of previously studied constraints for XML data and investigate the complexity of the consistency problem. Our main conclusion is that, in the presence of foreign key constraints, compile-time verification of consistency is infeasible. We look at absolute constraints that hold in the entire document and relative constraints that hold only in a part of the document. For absolute constraints, we prove decidability and establish complexity bounds for primary multiattribute keys and unary foreign keys and study unary constraints that involve regular expressions. For relative constraints, we prove that even for unary constraints the consistency problem is undecidable. We also show that results continue to hold for extended DTDs, a more expressive typing mechanism for XML.
Using evolutionary costs to enhance the efficacy of malaria control via genetically manipulated mosquitoes

SUMMARY An earlier mathematical model exploring the use of genetically manipulated mosquitoes for malaria control suggested that the prevalence of malaria is reduced significantly only if almost all mosquitoes become completely resistant to malaria. Central to the model was the ‘cost of resistance’: the reduction of a resistant mosquito's evolutionary fitness in comparison with a sensitive one's. Here, we consider the possibility of obtaining more optimistic outcomes by taking into account the epidemiological (in addition to the evolutionary) consequences of a cost of resistance that decreases the life-span of adult mosquitoes (the most relevant parameter for the parasite's epidemiology). There are two main results. First, if despite its cost, resistance is fixed in the population, increasing the cost of resistance decreases the intensity of transmission. However, this epidemiological effect is weak if resistance is effective enough to be considered relevant for control. Second, if the cost of resistance prevents its fixation, increasing it intensifies transmission. Thus, the epidemiological effect of the cost of resistance cannot compensate for the lower frequency of resistant mosquitoes in the population. Overall, our conclusion remains pessimistic: so that genetic manipulation can become a promising method of malaria control, we need techniques that enable almost all mosquitoes to be almost completely resistant to infection.
Visual path following on a manifold in unstructured three-dimensional terrain

This paper describes the design and testing of a technique to enable long-range autonomous navigation using a stereo camera as the only sensor. During a learning phase, the rover is piloted along a route capturing stereo images. The images are processed into a manifold map of topologically-connected submaps that may be used for localization during an autonomous repeat traverse. Path following in non-planar terrain is handled by moving from localization in three dimensions, to path following in two dimensions using a local ground plane associated with each submap. The use of small submaps decouples the computational complexity of route repeating from the length of the path. We validate the algorithm by demonstrating its performance on a difficult three-dimensional route. Using this technique, a rover may autonomously traverse a multi-kilometer route in unstructured, three-dimensional terrain, without an accurate global reconstruction.
Expression of CD4+ forkhead box P3 (FOXP3)+ regulatory T cells in inflammatory bowel disease

OBJECTIVE: Forkhead box P3 (FOXP3) plays an important role in the development and function of CD4+ regulatory T (Treg) cells. In this study the percentage of CD4+ FOXP3+ Treg cells in peripheral blood mononuclear cells (PBMC) and the frequency of Treg cells in the colonic mucosa of patients with inflammatory bowel disease (IBD) were investigated.
Lipreading using spatiotemporal histogram of oriented gradients

We propose a visual speech parametrization based on histogram of oriented gradients (HOG) for the task of lipreading from frontal face videos. Inspired by the success of spatiotemporal local binary patterns, the features are designed to capture dynamic information contained in the input video sequence by combining HOG descriptors extracted from three orthogonal planes that span x, y and t axes. We integrate our features into a system based on hidden Markov model (HMM) and show that by utilizing robust and properly tuned parametrization this traditional scheme can outperform recent sophisticated embedding approaches to lipreading. We perform experiments on three different datasets, two of which are publicly available. In order to conduct an unbiased feature comparison, the process of model learning including hyperparameter tuning is as automatized as possible. To this end, we rely heavily on cross validation.
Kernelization Lower Bounds by Cross-Composition

We introduce the framework of cross-composition for proving kernelization lower bounds. A classical problem $L$ \and/or-cross-composes into a parameterized problem $\mathcal{Q}$ if it is possible to efficiently construct an instance of $\mathcal{Q}$ with polynomially bounded parameter value that expresses the logical and or or of a sequence of instances of $L$. Building on work by Bodlaender et al. and using results of Fortnow and Santhanam, Dell and van Melkebeek, and Drucker, we show that if an NP-hard problem and/or-cross-composes into a parameterized problem $\mathcal{Q}$, then $\mathcal{Q}$ does not admit a polynomial kernel unless $\mbox{NP}\subseteq \mbox{coNP/poly}$ and the polynomial hierarchy collapses. Our technique generalizes and strengthens the techniques of using composition algorithms and of transferring the lower bounds via polynomial parameter transformations. We show its applicability by proving kernelization lower bounds for a number of important graphs problems with structural (nonsta.
Mutations in the Arabidopsis Phosphoinositide Phosphatase Gene SAC9 Lead to Overaccumulation of PtdIns(4,5)P2 and Constitutive Expression of the Stress-Response Pathway1

Phosphoinositides (PIs) are signaling molecules that regulate cellular events including vesicle targeting and interactions between membrane and cytoskeleton. Phosphatidylinositol (PtdIns)(4,5)P2 is one of the best characterized PIs; studies in which PtdIns(4,5)P2 localization or concentration is altered lead to defects in the actin cytoskeleton and exocytosis. PtdIns(4,5)P2 and its derivative Ins(1,4,5)P3 accumulate in salt, cold, and osmotically stressed plants. PtdIns(4,5)P2 signaling is terminated through the action of inositol polyphosphate phosphatases and PI phosphatases including supressor of actin mutation (SAC) domain phosphatases. In some cases, these phosphatases also act on Ins(1,4,5)P3. We have characterized the Arabidopsis (Arabidopsis thaliana) sac9 mutants. The SAC9 protein is different from other SAC domain proteins in several ways including the presence of a WW protein interaction domain within the SAC domain. The rice (Oryza sativa) and Arabidopsis SAC9 protein sequences are similar, but no apparent homologs are found in nonplant genomes. High-performance liquid chromatography studies show that unstressed sac9 mutants accumulate elevated levels of PtdIns(4,5)P2 and Ins(1,4,5)P3 as compared to wild-type plants. The sac9 mutants have characteristics of a constitutive stress response, including dwarfism, closed stomata, and anthocyanin accumulation, and they overexpress stress-induced genes and overaccumulate reactive-oxygen species. These results suggest that the SAC9 phosphatase is involved in modulating phosphoinsitide signals during the stress response.
Planned Nanostructures of Colloidal Gold via Self-Assembly on Hierarchically Assembled Organic Bilayer Template Patterns with In-situ Generated Terminal Amino Functionality

We demonstrate a hierarchical self-assembly approach to the fabrication of planned nanostructures of colloidal gold particles on silicon, comprising the initial assembly of a molecular template pattern with terminal amino functionality, which then guides the surface assembly and site specific anchoring of gold nanoparticles from a colloidal solution. Well defined amino-terminated templates are obtained via a chemical functionalization process whereby highly ordered bilayer nanopatterns produced by constructive nanolithography (Maoz, R.; Frydman, E.; Cohen, S. R.; Sagiv, J. Adv. Mater. 2000, 12, 725−731) are in-situ modified to generate the top amine functions. This novel approach offers promising performance in terms of the precision, reproducibility, and structural robustness needed for the advancement of a reliable bottom-up nanofabrication methodology.
Architecture Design Recovery of a Family of Embedded Software Systems An Experience Report

: Understandability of the current system is a key issue in most reengineering processes. An architecture description of the system may increase its understandability. This paper presents experiences from architectural design recovery in a product family of large distributed, embedded systems. Automated recovery tools were hard to apply due to the nature of the source code. A qualitative evaluation procedure was applied on the performance of the recovery process. The results suggest that producing the necessary architectural documentation during the recovery project costs eight to twelve times as much as producing the same set of documentation during the original development project. By applying a common architectural style for all members of the product family, the component reuse made possible decreased source code volume by 65%.
A polynomial approximation algorithm for the minimum fill-in problem

In the minimum fill-in problem, one wishes to find a set of edges of smallest size, whose addition to a given graph will make it chordal. The problem has important applications in numerical algebra and has been studied intensively since the 1970s. We give the first polynomial approximation algorithm for the problem. Our algorithm constructs a triangulation whose size is at most eight times the optimum size squared. The algorithm builds on the recent parameterized algorithm of Kaplan, Shamir, and Tarjan for the same problem. For bounded degree graphs we give a polynomial approximation algorithm with a polylogarithmic approximation ratio. We also improve the parameterized algorithm.
Influence of process variables on development of camber during hot rolling of strip steel

Abstract Experimental design techniques have been used to study the effects of variations in horizontal scale breaker process parameters in relation to camber generation during the early reduction stages in a hot strip mill. A fractional factorial experiment was designed and performed to identify which process variables are most influential to camber generation. The parameters which emerge from this analysis as being significant are: slab wedge, temperature differentials across the strip width, the deviation of the slab from the mill centreline, and mill tilt. A full factorial experiment was then designed and performed to further investigate these significant process parameters to determine where to set influential and controllable variables so that camber is minimised. The results show that none of the process parameters is significant to camber generation when acting alone; however, they are all significant when combined with one or two other process parameters. This study has enabled a predictive equation to be developed which is able to predict camber to within ±4 mm. This equation may be used in conjunction with mill tilting strategies to reduce camber in the early reduction stages of a hot strip mill.
Location management of data items in mobile ad hoc networks

In this paper, we address techniques to manage locations of data items or replicas in mobile Ad Hoc networks and efficiently forward access requests to the locations. In order to manage locations of data items efficiently, a key issues is predicting the locations of data items that dynamically change. To predict the locations of data items, we use the information on replica allocation at every relocation time and the logs of past data accesses.
A Bayesian Overlapping Coalition Formation Game for Device-to-Device Spectrum Sharing in Cellular Networks

We consider the spectrum sharing problem between a set of device-to-device (D2D) links and multiple co-located cellular networks. Each cellular network is controlled by an operator which can provide service to a number of subscribers. Each D2D link can either access a sub-band occupied by a cellular subscriber or obtain an empty sub-band for its exclusive use. We introduce a new spectrum sharing mode for D2D communications in cellular networks by allowing two or more D2D links with exclusive use of sub-bands to share their sub-bands with each other without consulting the operators. We establish a new game theoretic model called Bayesian non-transferable utility overlapping coalition formation (BOCF) game. We show that our proposed game can be used to model and analyze the above spectrum sharing problem. However, we observe that the core of the BOCF game can be empty, and we derive a sufficient condition for which the core is non-empty. We propose a hierarchical matching algorithm which can detect whether the sufficient condition is satisfied and, if it is satisfied, achieve a stable and unique matching structure which coincides with the overlapping coalition agreement profile in the core of the BOCF game.
Efficient Reinforcement Learning with Relocatable Action Models

Realistic domains for learning possess regularities that make it possible to generalize experience across related states. This paper explores an environment-modeling framework that represents transitions as state-independent outcomes that are common to all states that share the same type. We analyze a set of novel learning problems that arise in this framework, providing lower and upper bounds. We single out one particular variant of practical interest and provide an efficient algorithm and experimental results in both simulated and robotic environments.
Computer Simulation of Milling Ball Motion in Mechanical Alloying (Overview)

A model simulation of milling-ball motion during mechanical alloying done by the author's group was reviewed. The Kelvin's dashpot-spring model and the discrete element method were employed in the simulation. One, two and three dimensional milling-ball motions for three types of ball milling ; vibratory, tumbling and planetary ball milling, were studied. The simulation formalism was first given, which takes into account the translational and rotational motion and three types of forces ; visco-elastic, frictional and gravitational force. The whole motion of the milling balls was traced contact by contact. The simulation provided for each of the milling types the ball motion trajectories, impact velocities and frequencies of the balls, as well as the energy consumption during mechanical alloying. The results of the simulation were supported by the experimental observation.
During muscle atrophy, thick, but not thin, filament components are degraded by MuRF1-dependent ubiquitylation

Loss of myofibrillar proteins is a hallmark of atrophying muscle. Expression of muscle RING-finger 1 (MuRF1), a ubiquitin ligase, is markedly induced during atrophy, and MuRF1 deletion attenuates muscle wasting. We generated mice expressing a Ring-deletion mutant MuRF1, which binds but cannot ubiquitylate substrates. Mass spectrometry of the bound proteins in denervated muscle identified many myofibrillar components. Upon denervation or fasting, atrophying muscles show a loss of myosin-binding protein C (MyBP-C) and myosin light chains 1 and 2 (MyLC1 and MyLC2) from the myofibril, before any measurable decrease in myosin heavy chain (MyHC). Their selective loss requires MuRF1. MyHC is protected from ubiquitylation in myofibrils by associated proteins, but eventually undergoes MuRF1-dependent degradation. In contrast, MuRF1 ubiquitylates MyBP-C, MyLC1, and MyLC2, even in myofibrils. Because these proteins stabilize the thick filament, their selective ubiquitylation may facilitate thick filament disassembly. However, the thin filament components decreased by a mechanism not requiring MuRF1.
Dependency Treebank : A Word on the Million Words

Prague Arabic Dependency Treebank (PADT) consists of refined multi-level linguistic annotations over the language of Modern Written Arabic. The kind of morphological and syntactic information comprised in PADT differs considerably from that of the Penn Arabic Treebank (PATB). This paper overviews the character of PADT and its motivations, and reports on converting and enhancing the PATB data in order to be included into PADT. The merged, rule-checked and revised annotations, which amount to over one million words, as well as the open-source computational tools developed in the project are considered for publication this year.
A CMOS potentiostatic glucose monitoring system for VACNF amperometric biosensors

In this paper we show a stable glucose monitoring system for vertically aligned carbon nanofiber based biosensors. The system is comprised of a modified grounded working electrode potentiostat using a common gate transimpedance amplifier and a current starved voltage controlled oscillator. The system provides a low power solution for portable applications and facilitates wireless data transfer. The system is implemented in a commercially available 0. 18μm 6 metal 1 poly standard CMOS process. The potentiostat consumes 72. 4μW of power from a 1.8V supply, and the system occupies 0.0457mm2 of chip area.