Miracle-dz/UniFAR-FTUs huggingface dataset:
Aromatic Amino Acid-Dependent Expression of Indole-3-Pyruvate Decarboxylase Is Regulated by TyrR in Enterobacter cloacae UW5

ABSTRACT The plant growth-promoting rhizobacterium Enterobacter cloacae UW5 synthesizes the plant growth hormone indole-3-acetic acid (IAA) via the indole-3-pyruvate pathway utilizing the enzyme indole-3-pyruvate decarboxylase that is encoded by ipdC. In this bacterium, ipdC expression and IAA production occur in stationary phase and are induced by an exogenous source of tryptophan, conditions that are present in the rhizosphere. The aim of this study was to identify the regulatory protein that controls the expression of ipdC. We identified a sequence in the promoter region of ipdC that is highly similar to the recognition sequence for the Escherichia coli regulatory protein TyrR that regulates genes involved in aromatic amino acid transport and metabolism. Using a tyrR insertional mutant, we demonstrate that TyrR is required for IAA production and for induction of ipdC transcription. TyrR directly induces ipdC expression, as was determined by real-time quantitative reverse transcription-PCR, by ipdC promoter-driven reporter gene activity, and by electrophoretic mobility shift assays. Expression increases in response to tryptophan, phenylalanine, and tyrosine. This suggests that, in addition to its function in plant growth promotion, indolepyruvate decarboxylase may be important for aromatic amino acid uptake and/or metabolism.
RTL design of LDPC decoder for IEEE802.11n WLAN

Recently, wireless local area network (WLAN) requires high-speed and high-reliability for multimedia access at home, office and etc. The WLAN standard: IEEE802.11n, which enhanced them compared with the existing IEEE802.11a/b/g, can achieve a maximum throughput of at least 100Mbps at the medium access control (MAC) layer. In the other hand low density parity check (LDPC) which is among the most powerful error correcting codes (ECC), can achieve performance close to the Shannon limit. In this paper we report RTL design of a high-throughput LDPC decoder using the min-sum algorithm.
Treatment for Advanced Tumors: Src Reclaims Center Stage

The non–receptor protein tyrosine, Src, is a 60-kDa protein that is the archetypal member of a nine-gene family, including Src, Yes, Fyn, Lyn, Lck, Hck, Fgr, Blk, and Yrk, that plays a critical role in regulation of proliferation, differentiation, migration, adhesion, invasion, angiogenesis, and
Monitoring of Functioning Status in Subjects With Chronic Stroke in South Korea Using WHODAS II

Objective To follow up the long-term functioning in a community through assessing personal background and status based on the International Classification of Functioning, Disability and Health (ICF) after a stroke, by using a Korean version of World Health Organization Disability Assessment Scale II (K-WHODAS II). Methods We surveyed 146 patients diagnosed at the first-onset of acute stroke and discharged after Inha University Hospital, and 101 patients answered the K-WHODAS II survey. We analyzed the relationship of six functioning domains of K-WHODAS II with K-MMSE (Korean version of Mini-Mental State Examination) and K-MBI (Korean version of Modified Barthel Index) at admission and discharge, and personal background. All subjects were divided into five groups, according to the disease durations, to assess the functional changes and the differences of K-MMSE and K-MBI at the admission and discharge. Results K-MBI and K-MMSE at admission and discharge showed no significant differences in all five groups, respectively (p>0.05), reflecting no baseline disparity for long-term follow-up. All subjects showed positive gains of K-MBI and K-MMSE at discharge (p<0.05). The six functioning domains and total scores of K-WHODAS II had decreasing trends until 3 years after the stroke onset, but rose thereafter. Higher scores of K-MBI and K-MMSE, younger age, women, working status, higher educational level, and living with a partner were correlated with lower scores of K-WHODAS II (p<0.05). Conclusion The long-term functioning after stroke was affected not only by cognitive and motor status in hospital, but also by certain kinds of personal background. K-WHODAS II may be used to monitor functioning status in a community and to assess personal backgrounds in subjects with chronic stroke.
PowerAdviser: An RTL power platform for interactive sequential optimizations

Power has become the overriding concern for most modern electronic applications today. To reduce clock power, sequential clock gating is increasingly getting used over and above combinational clock gating. Given the complexity of manually identifying sequential clock gating changes, automatic tools are becoming popular. However, since these tools always work within the scope of the design and the constraints provided, they do not provide any insight into additional power savings that might still be possible. In this paper we present an interactive sequential analysis flow, PowerAdviser, which besides performing automatic sequential changes also provides information for additional power savings that the user can realize through manual changes. Using this new flow we have achieved dynamic power reduction upto 45% more than a purely automated flow.
On-farm Participatory Evaluation of Technologies for Soil Fertility Managementin the Sahel, West Africa

We conducted on-farm participatory experiments over three years at six villages in the Fakara commune of Western Niger to demonstrate, verify, and evaluate the relevance of soil fertility management methods based on mil- let/cowpea intercropping. We tested six methods using one of three organic fertilizers (millet husks, manure, or neither) with or without mineral fertilizer and one using millet/hibiscus intercropping with millet husks. We evaluated farmers' preferences by measuring the self-selected proportions of plots that farmers used for each condition. The results demon- strate the effectiveness of millet/cowpea intercropping; the application of mineral fertilizer, manure, and millet husks; and alternating-year application—all of them are affordable for farmers in the Sahel. Both the demonstration and farmer- directed trials made farmers aware of the effects of these methods. Farmers' selection of methods depended on availabil- ity. The dissemination of agricultural methods mainly depends on the availability of input materials in the absence of other constraints such as money and accessibility.
Performance evaluation of a wireless hierarchical data dissemination system

Various techniques have been developed to improve the performance of wireless information services. Techniques such as information broadcasting, caching of frequently accessed data, and point-to-point channels for pull-based data requests are often used to reduce data access time. To efficiently utilize information broadcast, indexing and scheduling schemes are employed for the organization of data broadcast. Most of the studies in the literature focused either on individual technique or a combination of them with some restrictive assumptions. There is no study considering these techniques working together in an integrated manner. In this paper, we propose a dynamic data delivery model for wireless communication environments. An important feature of our model is that data are disseminated through various storage mediums according to the dynamically collected data access patterns. Various results are presented in a set of simulation studies, which give some of the intuitions behind the design of a wireless data delivery system.
An information extraction system from patient historical documents

Nowadays, document image retrieval systems are increasingly applicable by various businesses, governmental and academic organizations. ELEPAP (Hellenic Protection and Rehabilitation Centre for Disabled Children) is an organization which needs more efficient ways of managing its huge volume of archived documents. This paper deals with the preprocessing procedures of well-known OCR systems in order to extract specific features from ELEPAP's patients' cards. It is shown that our proposed methodology can provide good IT solutions for ELEPAP in order to extract information from its old archives.
Diffusion tensor imaging in children with unilateral hearing loss: a pilot study

Objective: Language acquisition was assumed to proceed normally in children with unilateral hearing loss (UHL) since they have one functioning ear. However, children with UHL score poorly on speech-language tests and have higher rates of educational problems compared to normal hearing (NH) peers. Diffusion tensor imaging (DTI) is an imaging modality used to measure microstructural integrity of brain white matter. The purpose of this pilot study was to investigate differences in fractional anisotropy (FA) and mean diffusivity (MD) in hearing- and non-hearing-related structures in the brain between children with UHL and their NH siblings. Study Design: Prospective observational cohort. Setting: Academic medical center. Subjects and Methods: Sixty one children were recruited, tested and imaged. Twenty nine children with severe-to-profound UHL were compared to 20 siblings with NH using IQ and oral language testing, and MRI with DTI. Twelve children had inadequate MRI data. Parents provided demographic data and indicated whether children had a need for an individualized educational program (IEP) or speech therapy (ST). DTI parameters were measured in auditory and non-auditory regions of interest (ROIs). Between-group comparisons were evaluated with non-parametric tests. Results: Lower FA of left lateral lemniscus was observed for children with UHL compared to their NH siblings, as well as trends toward differences in other auditory and non-auditory regions. Correlation analyses showed associations between several DTI parameters and outcomes in children with UHL. Regression analyses revealed relationships between educational outcome variables and several DTI parameters, which may provide clinically useful information for guidance of speech therapy. Discussion/Conclusion: Our data suggests that white matter microstructural patterns in several brain regions are preserved despite unilateral rather than bilateral auditory input which contrasts with findings in patients with bilateral hearing loss.
Online Monotone Optimization

This paper presents a new framework for analyzing and designing no-regret algorithms for dynamic (possibly adversarial) systems. The proposed framework generalizes the popular online convex optimization framework and extends it to its natural limit allowing it to capture a notion of regret that is intuitive for more general problems such as those encountered in game theory and variational inequalities. The framework hinges on a special choice of a system-wide loss function we have developed. Using this framework, we prove that a simple update scheme provides a no-regret algorithm for monotone systems. While previous results in game theory prove individual agents can enjoy unilateral no-regret guarantees, our result proves monotonicity sufficient for guaranteeing no-regret when considering the adjustments of multiple agent strategies in parallel. Furthermore, to our knowledge, this is the first framework to provide a suitable notion of regret for variational inequalities. Most importantly, our proposed framework ensures monotonicity a sufficient condition for employing multiple online learners safely in parallel.
Secure HARQ With Multiple Encoding Over Block Fading Channels: Channel Set Characterization and Outage Analysis

We consider a scenario where agent Alice aims at transmitting a message to agent Bob, while keeping it secret from a third eavesdropper agent Eve. The transmissions occur on block-fading channels, and Alice only has a statistical channel state information (CSI) on both Bob and Eve channels. In this paper, we add secrecy features to hybrid automatic repeat request (HARQ) in what becomes a secure HARQ (S-HARQ) scheme. In particular, Alice encodes the secret message and splits the codeword into blocks. Then, she transmits one block at a time and after each transmission Bob feeds back an acknowledge (ACK) (not acknowledge (NACK)) packet, indicating he was (was not) able to decode the secret message. Upon an ACK Alice stops transmission, while upon a NACK Alice re-encodes the secret message into a new codeword and transmits it block by block, waiting for a new feedback. The process is iterated until either Bob decodes the message or a maximum number of codewords has been transmitted. We characterize the set of channels for which there exists a sequence of codes that ensure both vanishing error probability to Bob and vanishing rate of information leakage to Eve in the limit of infinitely long codewords. We also analyze the secrecy and decodability outage probabilities, providing closed form expressions for the case of additive white Gaussian noise channels with Rayleigh fading. The tradeoff between the number of blocks per codeword and the maximum number of codewords to be transmitted is also discussed.
Feature selection method with common vector and discriminative common vector approaches

The dimension of the feature vector is very important for real time face recognition applications. High dimensional feature vectors increase the computational complexity and execution time of the face recognition system. In this work, a new feature selection method is proposed related with CVA and DCVA to reduce the dimension of the face images. Experiments are executed on two different face databases, namely AR, FERET. Great dimension reduction is achieved with slight recognition rate loss.
Customizing Embedded Processors for Specific Applications

Complexity of embedded applications is growing rapidly. This growth is accompanied by severe implementation contraints on cost, size, performance as well as power. This has resulted in search for expanding the architectural design space for implementing such complex applications. The last decade has seen the growth of Application specific instruction processors(ASIP) as an alternative to general purpose processors on one hand and Application specific integrated circuits (ASIC) on the other. ASIPs are considerably more flexible than ASICs while being more performance and power efficient than general purpose processors. The key issue in designing the ASIPs relate to customization i.e. identify the critical application characteristics which need to be supported by special hardware to create an application specific processor. In this paper we address two specific research problems; storage customization of a RISC processor and design of clustered VLIW processor. A simple RISC processor is characterized by a single functional unit, pipelined instruction execution, a single fixed register file and unified cache and memory for data and instruction. We propose techniques for customizing the register file size, number of rgister windows used to store contexts, cache size and trading off cache with scratch pad memory. This is implemented in a single integrated framework and results in an application specific storage optimization. This approach has been validated by actual experiments on both ARM as well as LEON (a varient of SUN-SPARC) processors. VLIW processors are extremely effective in applications with a large fine grain parallelism. These are preferred over superscalar in embedded systems because the task of identifying instruction level parallelism is handled at compile time rather than at runtime to save on power and chip area. The number of functional units in a VLIW is constrained by the number of ports in the register file as in each clock, operands need to be supplied to all the FUs simultaneously. The register file delay as well as power consumption increases as a square of the number of ports and due to this, researchers are considering clustered VLIW processors as an alternative. These have clusters of FUs (homogeneous or heterogeneous) connected to each register file. Now the data transfer time between these clusters depends on the interconnetivity and thus the design space is considerably enlarged. Further, operation-operator binding is now much more closely coupled to the value-register binding as the operand not being in the the associated register file can have considerable impact on performance. In this paper we define a range of clustered VLIW architectures followed by techniques for performance evaluation of these processors. Results show that the normally used RF-RF transfers perform very poorly. 262 Anshul Kumar et al.
Adaptive kernel for triangular meshes smoothing

In this paper we propose a new anisotropic smoothing method that mimic the statistical noise distribution. First, we estimate the probability density function (pdf) of the noise data, then we incorporate the estimated pdf into a convolution formulate that, when expressed on mesh gives arise to an updating formulae that allows to reduce iteratively the noise. To preserve the edges and corners during the smoothing operation, we identify the covariance matrix of the pdf to the structure tensor, which allows to perform anisotropic smoothing. Experiments on noisy object with artificial noise and acquisition noise show that such this smoothing method allows to achieve a good smoothing results in comparison with existing standard smoothing techniques. The proposed method is stable, fast and easy to implement.
New quality estimations in random testing

By reformulating the issue of random testing into an equivalent problem we are able to introduce a new kind of quality estimations based on Monte Carlo integration and the central limit theorem. This method also provides a limited but working "success theory" in the case of no detected failures. In an empirical evaluation using hundreds of billions of simulated tests we furthermore find a very good match between the quality estimations presented in this article and the true failure frequencies. Both simple modulus defects as well as seeded defects in two extensively employed numerical routines were subject to investigation in the empirical work.
Improving effectiveness of testing using reusability factor

An important aspect of software development and engineering is software testing. Despite the indispensable role of testing, developers find the process as tiring and repetitive. Testing has been known to take more than half of system development time and effort. However, the concept of software reuse reduces the boredom of repeating the same activity by generating reusable codes that can be used to test other systems. This paper discusses the possible areas where reuse can be done in software testing, the economic effect of reusability in testing and the effect of reusability in testing effort. Reusability can be said to reduce testing effort and increase the economic value (profit) of software testers without compromising the quality of the software.
Cryptanalysis of hardware-oriented ciphers the Knapsack generator, and SHA-1

Symmetric key cryptographic algorithms provide confidentiality, integrity, and authentication in modern communication systems. Our confidence in these algorithms is largely based on the fact that intense cryptanalysis has been carried out over several years without revealing any weakness. This thesis makes three independent contributions to the cryptanalysis of symmetric key primitives and hash functions. First, conditional differential cryptanalysis is proposed as a general framework for the analysis of a large class of hardware-oriented ciphers that build on non-linear feedback shift registers. As main applications, various improved distinguishing and key recovery attacks on reduced-round variants of the stream ciphers Grain v1, Grain-128, Grain-128a, and Trivium are obtained. Second, the security of the knapsack generator, a stream cipher construction proposed by Rueppel and Massey in 1985, is studied. A surprisingly effective guess-and-determine attack is shown that recovers large parts of the n + n secret key bits if only n bits are known. Quite different from standard techniques of symmetric cryptanalysis, our approach uses Babai’s closest vertex algorithm and lattice reduction. Finally, meet-in-the-middle preimage attacks on hash functions are revisited. A new differential cryptanalytic perspective is proposed which is very suitable for hash functions with linear message expansion. As an application, previous preimage attacks against reduced variants of SHA-1 are significantly improved.
Effects of training against elastic resistance on jab punch performance in elite junior athletes

Ability to perform rapid open-kinetic chain movements (e.g. kicking, throwing, hitting, or punching) is an important prerequisite for success in various sports. The aims of the present study were (1) to investigate the effect of elastic resistance training (ERT) on the performance of jab punch, (2) to explore the associated changes in movement kinematic and kinetic patterns, and (3) to assess possible differences among competitors of different specializations. The national level junior competitors in kick boxing, savate, and boxing practiced jab punch against elastic resistance for 15 minutes per day, 3 times a week for 6 weeks, while the control group participated only in their regular training (N=10+10+10+10; age 17.2±1.0 years; M±SD). The results revealed a marked increase in the maximum jab punch velocity in all experimental groups (6-11%; all p<.01), but not in the control group (p>.05). This finding was associated with an increase in both the maximum velocity and displacement of the ipsilateral elbow, shoulder, and, particularly, hip joint, while no change in the movement time was observed. The ERT-associated increase was also revealed in the agonist (7-11%, all p<.01), but not antagonist muscle strength. Therefore, we conclude that addition of a relatively small amount of ERT could be recommended for the purpose of improving punching performance and, possibly, other rapid limb movement even in top-level junior athletes. The observed performance improvement could be partly based on increased motion amplitudes particularly regarding the pelvis movement, as well as on increased strength of agonist muscles.
Guaranteed proofs using interval arithmetic

This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval splitting and Taylor's series expansions. Although the tools are designed for the proof assistant system PVS, expertise on PVS is not required. The ultimate goal of the tools is to provide guaranteed proofs of numerical properties with a minimal human-theorem prover interaction.
Developmental Self-Construction and -Configuration of Functional Neocortical Neuronal Networks

The prenatal development of neural circuits must provide sufficient configuration to support at least a set of core postnatal behaviors. Although knowledge of various genetic and cellular aspects of development is accumulating rapidly, there is less systematic understanding of how these various processes play together in order to construct such functional networks. Here we make some steps toward such understanding by demonstrating through detailed simulations how a competitive co-operative (‘winner-take-all’, WTA) network architecture can arise by development from a single precursor cell. This precursor is granted a simplified gene regulatory network that directs cell mitosis, differentiation, migration, neurite outgrowth and synaptogenesis. Once initial axonal connection patterns are established, their synaptic weights undergo homeostatic unsupervised learning that is shaped by wave-like input patterns. We demonstrate how this autonomous genetically directed developmental sequence can give rise to self-calibrated WTA networks, and compare our simulation results with biological data.