Miracle-dz/UniFAR-FTUs huggingface dataset:
Optimal Self Correcting Fault Free Error Coding Technique in Memory Operation

As with the increase in data density the probability of error happening in data transfer has increased the need for error free coding technique is in greater demand. In this paper an optimal approach for the processing of self correcting logic in faulty condition during coding and decoding operation is developed. The process of digital designing and its evaluation for realization is presented. The implementation of proposed design on Xilinx-FPGA device is presented.
Expression and distribution of the class III ubiquitin-conjugating enzymes in the retina

Purpose Mounting evidence implicates chronic oxidative stress as a significant pathogenic factor in the development and progression of retinopathies, including age-related macular degeneration (AMD). The age-dependent toxic accumulation of oxidatively damaged proteins, lipids, and DNA in susceptible cells of the retina arises, at least in part, from a decreased capacity to eliminate these damaged biomolecules. The goal of this study was to determine the expression patterns and function of class III ubiquitin-conjugating enzymes (UbcM3, UBE2E2, and UbcM2) in the retina. These enzymes have been implicated in the ubiquitin-dependent degradation of oxidatively damaged and misfolded proteins. Methods Complementary western blotting and immunohistochemistry was performed with specific antibodies to determine the retinal cell expression pattern of each enzyme. Additional analyses using antibodies raised against UbcM2 were performed to determine the relative levels of the enzyme in lysates derived from various mouse organs as compared to the retina. An established light-damage model of oxidative stress-induced retinal degeneration was used to determine alterations in the susceptibility of mice harboring a single intact allele of UbcM2. Ubiquitin charging and auto-ubiquitylation assays were done to assess the catalytic state of UbcM2 following photo-oxidative stress. Results Expression of the class III ubiquitin-conjugating enzymes in the retina, from highest to lowest, is UbcM2>UbcM3>UBE2E2. In addition to being the most robustly expressed, UbcM2 is further distinguished by its expression in photoreceptors and retinal pigment epithelial cells. UbcM2 is expressed in most mouse tissues analyzed and is most abundant in the retina. Studies using a bright-light-damage model of acute oxidative stress in mice harboring a single disrupted allele of UbcM2 revealed that a 58% reduction in enzyme levels did not increase the susceptibility of photoreceptors to acute photo-oxidative toxicity. This result may be explained by the observation that UbcM2 retained an intact and functional active site following exposure to acute bright light. Conclusions The class III ubiquitin-conjugating enzymes, and in particular UbcM2, are expressed in the retina and may function to counter the accumulation of oxidatively damaged and misfolded proteins. A 58% reduction in UbcM2 does not increase the susceptibility of photoreceptors to an acute photo-oxidative stress, suggesting the existence of compensating enzymes and/or that the remaining UbcM2 activity is sufficient to target oxidatively damaged proteins for destruction.
Attitudes toward older people among nursing students and registered nurses in Sweden.

Geriatric nursing is generally not considered to be a popular branch of nursing among Swedish nursing students and registered nurses. It is, therefore, important for nurse educators and others with responsibilities for the development of nursing to pay attention to trends of importance for the care of the elderly. Attitudes - conceptualized as feelings, knowledge, and readiness to act - may be one important factor. It has been reported that feelings toward older people may change with experience, age and gender. The aim of this study was to measure feelings toward older people among nursing students and registered nurses. A convenience sample of 151 undergraduate nursing students and 41 registered nurses in Sweden participated in the study. Data were collected through Kogan's Old People scale. The results confirmed earlier findings and showed that limited previous experience of care of older people, age <25 years, and male gender were significant factors for showing less favourable feelings towards the aged. In the education of nurses, goal-directed experience of elderly care is recommended in order to create positive feelings towards and interest in older people among students. It is also suggested that special considerations should be given to very young students and male students.
Perforated small intestine in a patient with T-cell lymphoma; a rare cause of peritonitis

The nontraumatic perforations of the small intestine are pathological entities with particular aspects in respect to diagnosis and treatment. These peculiarities derive from the nonspecific clinical expression of the peritonitis syndrome, and from the multitude of causes that might be the primary sources of the perforation: foreign bodies, inflammatory diseases, tumors, infectious diseases, etc. Accordingly, in most cases intestinal perforation is discovered only by laparotomy and the definitive diagnosis is available only after histopathologic examination. Small bowel malignancies are rare; among them, lymphomas rank third in frequency, being mostly B-cell non Hodgkin lymphomas. Only 10% of non-Hodgkin lymphomas are with T-cell. We report the case of a 57 years’ old woman with intestinal T-cell lymphoma, whose first clinical symptomatology was related to a complication represented by perforation of the small intestine. Laparotomy performed in emergency identified an ulcerative lesion with perforation in the jejunum, which required segmental enterectomy with anastomosis. The nonspecific clinical manifestations of intestinal lymphomas make from diagnosis a difficult procedure. Due to the fact that surgery does not have a definite place in the treatment of the small intestinal lymphomas (for cases complicated with perforation), and beyond the morbidity associated with the surgery performed in emergency conditions, prognosis of these patients is finally given by the possibility to control the systemic disease through adjuvant therapy.
Approximate distance oracles with improved preprocessing time

Given an undirected graph G with m edges, n vertices, and non-negative edge weights, and given an integer k ≥ 1, we show that for some universal constant c, a (2k − 1)-approximate distance oracle for G of size O(kn1+1/k) can be constructed in [EQUATION] time and can answer queries in O(k) time. We also give an oracle which is faster for smaller k. Our results break the quadratic preprocessing time bound of Baswana and Kavitha for all k ≥ 6 and improve the O(kmn1/k) time bound of Thorup and Zwick except for very sparse graphs and small k. When m = [EQUATION] and k = O(1), our oracle is optimal w.r. t. both stretch, size, preprocessing time, and query time, assuming a widely believed girth conjecture by Erdos.
On the Implementation of an Algebra of Lightweight Ontologies

This paper1 first argues that ontology design may benefit from treating ontologies as theories and from the definition of a set of operations that map ontologies into ontologies, especially their constraints. The paper then defines the class of ontologies used and proposes four operations to manipulate them. It proceeds to discuss how the operations may help design new ontologies. The core of the paper describes an implementation of the operations as a Protégé plug-in, called OntologyManagerTab, and includes use case examples to validate the discussion.
Performance Evaluation of Wireless Sensor Networks for Mobile Sensor Nodes Considering Goodput and Depletion Metrics

Sensor networks are a sensing, computing and communication infrastructure that are able to observe and respond to phenomena in the natural environment and in our physical and cyber infrastructure. In this paper, we propose a sensor network with mobile and static sensor nodes set-up for performing tasks like sensing a phenomenon or monitoring a region. We investigate how the sensor network performs in the case when the sensor nodes move. We compare the simulation results for two cases: the sensor network with stationary sensor nodes and multi mobile sensor nodes. The simulation results have shown that for the multi mobile sensors, the good put is unstable. The good put of stationary sensors is better than multi mobile sensors, but the consumed energy of multi mobile sensors is better than stationary sensors.
Transcriptional Profile of the Arabidopsis Root Quiescent Centerw⃞

The self-renewal characteristics of stem cells render them vital engines of development. To better understand the molecular mechanisms that determine the properties of stem cells, transcript profiling was conducted on quiescent center (QC) cells from the Arabidopsis thaliana root meristem. The AGAMOUS-LIKE 42 (AGL42) gene, which encodes a MADS box transcription factor whose expression is enriched in the QC, was used to mark these cells. RNA was isolated from sorted cells, labeled, and hybridized to Affymetrix microarrays. Comparisons with digital in situ expression profiles of surrounding tissues identified a set of genes enriched in the QC. Promoter regions from a subset of transcription factors identified as enriched in the QC conferred expression in the QC. These studies demonstrated that it is possible to successfully isolate and profile a rare cell type in the plant. Mutations in all enriched transcription factor genes including AGL42 exhibited no detectable root phenotype, raising the possibility of a high degree of functional redundancy in the QC.
A Framework for Resource-Constrained Rate-Optimal Software Pipelining

The rapid advances in high-performance computer architecture and compilation techniques provide both challenges and opportunities to exploit the rich solution space of software pipelined loop schedules. In this paper, we develop a framework to construct a software pipelined loop schedule which runs on the given architecture (with a fixed number of processor resources) at the maximum possible iteration rate (a la rate-optimal) while minimizing the number of buffers-a close approximation to minimizing the number of registers. The main contributions of this paper are: First, we demonstrate that such problem can be described by a simple mathematical formulation with precise optimization objectives under a periodic linear scheduling framework. The mathematical formulation provides a clear picture which permits one to visualize the overall solution space (for rate-optimal schedules) under different sets of constraints. Secondly, we show that a precise mathematical formulation and its solution does make a significant performance difference. We evaluated the performance of our method against three leading contemporary heuristic methods. Experimental results show that the method described in this paper performed significantly better than these methods. The techniques proposed in this paper are useful in two different ways: 1) As a compiler option which can be used in generating faster schedules for performance-critical loops (if the interested users are willing to trade the cost of longer compile time with faster runtime). 2) As a framework for compiler writers to evaluate and improve other heuristics-based approaches by providing quantitative information as to where and how much their heuristic methods could be further improved.
Relational Learning via Propositional Algorithms: An Information Extraction Case Study

This paper develops a new paradigm for relational learning which allows for the representation and learning of relational information using propositional means. This paradigm suggests different tradeoffs than those in the traditional approach to this problem - the ILP approach - and as a result it enjoys several significant advantages over it. In particular, the new paradigm is more flexible and allows the use of any propositional algorithm, including probabilistic algorithms, within it. We evaluate the new approach on an important and relation-intensive task - Information Extraction - and show that it outperforms existing methods while being orders of magnitude more efficient.
The staircasing effect in neighborhood filters and its solution

Many classical image denoising methods are based on a local averaging of the color, which increases the signal/noise ratio. One of the most used algorithms is the neighborhood filter by Yaroslavsky or sigma filter by Lee, also called in a variant "SUSAN" by Smith and Brady or "Bilateral filter" by Tomasi and Manduchi. These filters replace the actual value of the color at a point by an average of all values of points which are simultaneously close in space and in color. Unfortunately, these filters show a "staircase effect," that is, the creation in the image of flat regions separated by artifact boundaries. In this paper, we first explain the staircase effect by finding the subjacent partial differential equation (PDE) of the filter. We show that this ill-posed PDE is a variant of another famous image processing model, the Perona-Malik equation, which suffers the same artifacts. As we prove, a simple variant of the neighborhood filter solves the problem. We find the subjacent stable PDE of this variant. Finally, we apply the same correction to the recently introduced NL-means algorithm which had the same staircase effect, for the same reason.
BTW: a web server for Boltzmann time warping of gene expression time series

Dynamic time warping (DTW) is a well-known quadratic time algorithm to determine the smallest distance and optimal alignment between two numerical sequences, possibly of different length. Originally developed for speech recognition, this method has been used in data mining, medicine and bioinformatics. For gene expression time series data, time warping distance is arguably a more flexible tool to determine genes having similar temporal expression, hence possibly related biological function, than either Euclidean distance or correlation coefficient—especially since time warping accommodates sequences of different length. The BTW web server allows a user to upload two tab-separated text files A,B of gene expression data, each possibly having a different number of time intervals of different durations. BTW then computes time warping distance between each gene of A with each gene of B, using a recently developed symmetric algorithm which additionally computes the Boltzmann partition function and outputs Boltzmann pair probabilities. The Boltzmann pair probabilities, not available with any other existent software, suggest possible biological significance of certain positions in an optimal time warping alignment. Availability: .
A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes

A forward stack decoding (FSD) algorithm for rateless spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal code into several layers, and then searches the decoding paths in each single layer. Compared with the bubble decoder, which was initially designed for spinal codes, the proposed FSD algorithm can decrease the complexity significantly without sacrificing the rate performance. We also illustrate that the complexity of the FSD algorithm decreases with the increase of the signal-to-noise ratio (SNR). Simulation shows that the complexity of the FSD algorithm is only 15.37% of that of the bubble decoder when SNR is 20 dB.
Representation and reasoning with disjunctive temporal constraints

We show the expressiveness provided by a labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to manage disjunctive assertions, conjunctive and hypothetical queries, and one-to-many constraints. Additionally, it becomes an adequate support for reasoning on costs associated to constraints.
Neuronal Expression of the Glutamate Transporter GLT-1 in Hippocampal Microcultures

To address the question of the relative contributions of glial and neuronal glutamate transport in the vertebrate CNS, we studied the distribution of forebrain glutamate transporters in rat hippocampal microcultures, a preparation in which physiological functions of glutamate transporters have been well characterized. Two of the three transporters, GLAST (EAAT1) and EAAC1 (EAAT3), are localized to microculture glia and neurons, respectively, as expected. However, we find strong immunoreactivity for the third glutamate transporter GLT-1 (EAAT2), a putatively glial transporter, in microculture neurons and in a small subset of microculture glia. Indistinguishable immunohistochemical staining patterns for GLT-1 were obtained with antibodies directed against both the N terminal and C terminal of the GLT-1 protein. Double-labeling experiments suggest that neuronal GLT-1 protein is primarily localized to the dendrites of excitatory neurons. Neuronal electrogenic transport currents in response tod-aspartate applications were occluded by the selective GLT-1 inhibitor dihydrokainate. In contrast, glia exhibited a larger transporter current density than did neurons, and the glial transport current was less sensitive to dihydrokainate. Neuronal transport currents were potentiated less than were glial currents when the chaotropic anion thiocyanate was substituted for gluconate in the whole-cell recording pipette, consistent with the previously reported lower anion permeability of EAAC1 and GLT-1 compared with that of GLAST. After microculture glia were rendered nonviable, excitatory autaptic currents (EACs) were prolonged in the presence of dihydrokainate, suggesting that neuronal GLT-1 is capable of participating in the clearance of synaptically released glutamate. Our results suggest that the initially proposed characterization of GLT-1 as a purely glial transporter is too simplistic and that under certain conditions functional GLT-1 protein can be expressed in brain neurons. The study suggests that changes in GLT-1 levels that occur with pathology or experimental manipulations cannot be assumed to be glial.
Energy-Efficient Wi-Fi Sensing Policy Under Generalized Mobility Patterns With Aging

An essential condition precedent to the success of mobile applications based on Wi-Fi (e.g., iCloud) is an energy-efficient Wi-Fi sensing. Clearly, a good Wi-Fi sensing policy should factor in both inter-access point (AP) arrival time (IAT) and contact duration time (CDT) distributions of each individual. However, prior work focuses on limited cases of those two distributions (e.g., exponential) or proposes heuristic approaches such as Additive Increase (AI). In this paper, we first formulate a generalized functional optimization problem on Wi-Fi sensing under general inter-AP and contact duration distributions and investigate how each individual should sense Wi-Fi APs to strike a good balance between energy efficiency and performance, which is in turn intricately linked with users mobility patterns. We then derive a generic optimal condition that sheds insights into the aging property, underpinning energy-aware Wi-Fi sensing polices. In harnessing our analytical findings and the implications thereof, we develop a new sensing algorithm, called Wi-Fi Sensing with AGing (WiSAG), and demonstrate that WiSAG outperforms the existing sensing algorithms up to 37% through extensive trace-driven simulations for which real mobility traces gathered from hundreds of smartphones is used.
Occupation and Bladder Cancer: A Population-Based, Case–Control Study in Iowa

While considerable efforts have been made to investigate the role of occupation and industry in the risk of bladder cancer, many reported associations have not been consistent, and strong evidence of increased risk is apparent for few occupational groups. To further examine the issue, a large, population-based, case–control study was conducted in the state of Iowa among both men and women. A total of 1452 incident bladder cancer cases and 2434 controls were included in the study. Occupational history was collected from respondents for each job held for 5 years or longer since age 16. Among men, excess risk was observed for industries including plumbing, heating, and air conditioning (odds ratio [OR], = 2.2; 95% confidence interval [CI], 1.0 to 5.0); rubber and plastic products (OR = 3.1; 95% CI, 1.2 to 8.5), motor vehicle parts and supplies (OR = 4.5; 95% CI, 1.2 to 16.5), and occupations including supervisors for transportation and material moving (OR = 6.5; 95% CI, 1.4 to 29.9), material-moving-equipment operators (OR = 1.9; 95% CI, 1.0 to 3.6), automobile mechanics (OR = 1.6; 95% CI, 1.0 to 2.6), painters (OR = 2.7; 95% CI, 1.0 to 7.7), and metal- and plastic-working machine operators (OR = 2.0; 95% CI, 1.1 to 3.4). Among women, significant excess risk was observed for secondary school teachers and record clerks. Housekeepers and butlers and workers in laundering and dry cleaning were also at increased risk. In conclusion, these results suggest that occupational exposures may play a significant role in the risk of bladder cancer.
Cloning and sequence analysis of the complementary DNA for feline preproparathyroid hormone.

OBJECTIVES To clone and sequence the cDNA for feline preproparathyroid hormone (preproPTH) and to compare that sequence with other known parathyroid hormone (PTH) sequences. SAMPLE POPULATION Parathyroid glands from 1 healthy cat. PROCEDURES A cDNA library was constructed in lambda phage from feline parathyroid gland mRNA and screened with a radiolabeled canine PTH probe. Positive clones were sequenced, and nucleic acid and deduced amino acid sequences were analyzed and compared with known preproPTH and PTH sequences. RESULTS Screening of approximately 2 X 10(5) recombinant plaques revealed 3 that hybridized with the canine PTH probe; 2 clones comprised the complete sequence for feline preproPTH. Feline preproPTH cDNA consisted of a 63-base pair (bp) 5'-untranslated region (UTR), a 348-bp coding region, and a 326-bp 3'-UTR. The coding region encoded a 115-amino acid peptide. Mature feline PTH consisted of 84 amino acids. Amino acid sequence analysis revealed that feline PTH was > 83% identical to canine, bovine, swine, equine, human, and macaque PTH and 69, 71, and 44% identical to mouse, rat, and chicken PTH, respectively. Within the region responsible for hormonal activity (amino acids 1 to 34), feline PTH was > 79% identical to other mammalian PTH sequences and 64% identical to the chicken sequence. CONCLUSIONS AND CLINICAL RELEVANCE The amino acid sequence of PTH is conserved among mammalian species. Knowledge of the cDNA sequence for feline PTH may be useful to investigate disturbances of calcium metabolism and alterations in PTH expression in cats.