Miracle-dz/UniFAR-FTUs huggingface dataset:
- 1-Spatial Precipitation Modeling for the Tyrol Region

Aim of the study was to create a precipitation map of Tyrol and adjacent zones by interpolating existing point data to a continuous surface. Rain gauge data was obtained from the responsible organizations. Among the 563 stations, only few were situated at high altitudes. For this reason, precipitation at the ELA of Austrian and Italian glaciers was calculated using the temperature-precipitation relationship introduced by Ohmura et al. (1998). The point data (station and glacier) were interpolated to a 1 x 1 km lattice. For this purpose, we developed the so called GRADGRID interpolation algorithm, which is connecting features of different older algorithms. Elevation is taken into account by regression. The calculated precipitation patterns were well corresponding to the results of existing comparable studies.
Tissue and isoform-selective activation of protein kinase C in insulin-resistant obese Zucker rats - effects of feeding.

The mechanisms of insulin resistance in the obese Zucker rat have not been clearly established but increased diacylglycerol-protein kinase C (DAG-PKC) signalling has been associated with decreased glucose utilisation in states of insulin resistance and non-insulin-dependent diabetes mellitus. The purpose of this study was to characterise tissue- and isoform-selective differences in DAG-PKC signalling in insulin-sensitive tissues from obese Zucker rats, and to assess the effects of feeding on DAG-PKC pathways. Groups of male obese (fa/fa, n=24) and lean (fa/-, n=24) Zucker rats were studied after baseline measurements of fasting serum glucose, triglycerides, insulin and oral glucose tolerance tests. Liver, epididymal fat and soleus muscle samples were obtained from fed and overnight-fasted rats for measurements of DAG, PKC activity and individual PKC isoforms in cytosol and membrane fractions. Obese rats were heavier (488+/-7 vs 315+/-9 g) with fasting hyperglycaemia (10.5+/-0.8 vs 7.7+/-0.1 mM) and hyperinsulinaemia (7167+/-363 vs 251+/-62 pM) relative to lean controls. In fasted rats, PKC activity in the membrane fraction of liver was significantly higher in the obese group (174+/-16 vs 108+/-12 pmol/min/mg protein, P<0.05) but there were no differences in muscle and fat. The fed state was associated with increased DAG levels and threefold higher PKC activity in muscle tissue of obese rats, and increased expression of the major muscle isoforms, PKC-theta and PKC-epsilon: e.g. PKC activity in the membrane fraction of muscle from obese animals was 283+/-42 (fed) vs 107+/-20 pmol/min/mg protein (fasting) compared with 197+/-27 (fed) and 154+/-21 pmol/min/mg protein (fasting) in lean rats. In conclusion, hepatic PKC activity is higher in obese rats under basal fasting conditions and feeding-induced activation of DAG-PKC signalling occurs selectively in muscle of obese (fa/fa) rats due to increased DAG-mediated activation and/or synthesis of PKC-theta and PKC-epsilon. These changes in PKC are likely to exacerbate the hyperglycaemia and hypertriglyceridaemia associated with obesity-induced diabetes.
Robust intensity-based 3D-2D registration of ct and X-ray images for precise estimation of cup alignment after total hip arthroplasty

The widely used procedure of evaluation of cup orientation following THA using single standard anteroposterior radiograph is known inaccurate, largely due to the wide variability in individual pelvic position relative to X-ray plate. 3D-2D image registration methods have been introduced to estimate the transformation between a CT volume and the radiograph for an accurate estimation of the cup orientation relative to an anatomical reference extracted from the CT data. However, the robustness of these methods is questionable. This paper presents a robust image similarity measure which is derived from a variational approximation to mutual information and allows for incorporation of spatial information via energy minimization. Experimental results on estimating cup alignment from single X-ray radiograph with gonadal shielding demonstrate the robustness and the accuracy of the present approach.
Conceptual Vectors - A Complementary Tool to Lexical Networks

There is currently much research in natural language processing focusing on lexical networks. Most of them, in particular the most famous, WordNet, lack syntagmatic information and especially thematic information (”Tennis Problem”). This article describes conceptual vectors that allows the representation of ideas in any textual segment and offers a continuous vision of related thematics, based on the distances between these thematics. We show the characteristics of conceptual vectors and explain how they complement lexico-semantic networks. We illustrate this purpose by adding conceptual vectors to WordNet by emergence. Originally resulting from Ross Quillian’s work on psycholinguistics [1], lexical networks are today object of many researches in Natural Language Processing. They are employed in many tasks (lexical disambiguation [2]) or field applications (machine translation with multilingual networks like Papillon [3] or [4], information retrieval or text classification [5]). Most of these networks and specifically the most famous, WordNet [6], miss syntagmatic information and, in particular, information concerning the domain usage of terms or at least thematicaly related terms. There is thus no direct relation between terms like ↪teacher↩-↪student↩ or ↪boat↩-↪port↩. This phenomenon is called the ”tennis problem” [[6], p. 10] because it has been noticed that it was necessary to seek ↪ball↩, ↪racket↩ and, ↪court↩ at various places of the hierarchy. For several years, TAL team (Natural Language Processing team) from LIRMM (Montpellier Laboratory of Computer Science, Robotics, and Microelectronics) works on a formalization of the projection of the linguistic concept of semantic field in a vector space, the conceptual vectors. They allow to represent ideas contained in an unspecified textual segment and allow to obtain a continuous vision of thematic used thanks to the calculable distances between them. In this article, we present the conceptual vectors and especially the version built by emergence. We show their characteristics and why they are complementary to lexicosemantic networks. We illustrate our purpose by an experiment done at UTMK (ComputerAided Translation Unit), Universiti Sains Malaysia, Penang which consisted in enriching the WordNet data by conceptual vectors built by emergence. 1 Lexico-semantic Networks : Example of WordNet
Skull Stripping Magnetic Resonance Images Brain Images : Region Growing versus Mathematical Morphology

Skull stripping is a major phase in MRI brain imaging applications and it refers to the removal of the brain’s non-cerebral tissues. The main problem in skull-stripping is the segmentation of the non-cerebral and the intracranial tissues due to their homogeneity intensities. Numerous techniques were applied in the studies of skull stripping, most common are region growing and mathematical morphology. This paper investigated the strength and weaknesses of these two methods on three types of MRI brain images. Unlike previous researches which normally tested on one type of MRI images only, this paper experimented on ninety samples of T1-weighted, T2-weighted and FLAIR MRI brain images. Qualitative evaluations showed that skull stripping using mathematical morphology outperformed region growing at an acceptance rate of 95.5%, whereas quantitative evaluation using Area Overlap, False Positive Rate and False Negative Rate produced of 96.2%, 2.2% and 1.6% respectively.
Testing Stereo Data – Not the Matching Algorithms

Current research in stereo image analysis focuses on improving matching algorithms in terms of accuracy, computational costs, and robustness towards real-time applicability for complex image data and 3D scenes. Interestingly, performance testing takes place for a huge number of algorithms, but, typically, on very small sets of image data only. Even worse, there is little reasoning whether data as commonly applied is actually suitable to prove robustness or even correctness of a particular algorithm. We argue for the need of testing stereo algorithms on a much broader variety of image data then done so far by proposing a simple measure for putting image stereo data of different quality into relation to each other. Potential applications include purpose-directed decisions for the selection of image stereo data for testing the applicability of matching techniques under particular situations, or for realtime estimation of stereo performance (without any need for providing ground truth) in cases where techniques should be selected depending on the given situation.
Novel Approaches in Unsupervised Clustering

, In: 9th Symposium on Discrete Algorithms (1998) 658–667 2. Alevizos, P.: An algorithm for orthogonal range search in d > 3 dimensions, In: Proceedings of the 14th European Workshop on Computational Geometry, Barcelona (1998) 3. Chazelle, B. : Filtering search: A new approach to query-answering, SIAM Journal on Computing15 (1986) 703–724 4. Chazelle, B. , Guibas, L. : Fractional cascading II: Applications, Algorithmica1 (1986) 163– 191 5. Hartigan, J., Wong, M. : Ak-means clustering algorithm, Applied Statistics28 (1979) 100– 108 6. Linnaeus, C. :Clavis Classium in Systemate Phytologorum in Bibliotheca Botanica , Amsterdam, The Netherlands: Biblioteca Botanica (1736) 7. Megiddo, N. , Supowit, K. : On the complexity of some common geometric problems, SIAM Journal on Computing13 (1984) 182–196 8. Preparata, F. , Shamos, M. : Computational Geometry , Springer Verlag, New York, Berlin (1985) 9. Tryon, C. : Cluster Analysis , Ann Arbor, MI: Edward Brothers (1939) 10. Vrahatis, M.N. , Boutsinas, B. , Alevizos, P., Pavlides, G. : The new kindows algorithm for improving thek-means clustering algorithm, Journal of Complexity18 (2002) 375–391
A Collaborative Application Framework Based on the P2P Grid Model

There are many existed collaborative frameworks, e.g. Narada, Overcast, Can, which are used in various computer supported work. In this paper we deliver a collaborative application framework based on a specific P2P grid model. This framework is designed to solve the typical problems in the traditional collaborative applications, such as the bottleneck restriction of C/S architecture and the related potential security harassments. Therefore we build a hierarchical model of both grid and P2P networks which correspond to global network and local group respectively in the collaborative application framework. The experiments show that the simulated system using the framework is fast to achieve collaboration status and robust for the network exceptions, and also keeping the whole network load-balance. In conclusion this framework exploits the P2P Grid model to implement efficient, stable and secure collaborative applications.
Implementation aspects for interference alignment

Several interference alignment (IA) testbeds have been reported by research groups that validate the theoretical findings thus demonstrating the feasibility of IA. The design complexity of the IA testbed is significant since many simultaneous wireless links have to be established to observe the benefits of IA. Therefore, the already enormous efforts needed for the development of multiple-input multiple-output (MIMO) testbeds are folded multiple times in IA testbeds. In general, testbeds can be categorized into three groups depending on the hardware platform, generic, specific and the hybrid of two. Clearly, developing on generic, hybrid and application specific platforms in turn are the safe steps towards real life prototyping. There are many research groups that have been developing IA on generic platforms [1]-[17]. To the best of our knowledge, there is only one research group that has developed on a hybrid platform [18], and none on the application specific platform. In this paper, we review the experimental IA evaluations in the literature, include important aspects from well-known prototyping principles in the picture, and give comparative discussion with the state-of-art wireless communications testbeds.
Improved Clustered Routing Algorithm Based on Distance and Energy in Wireless Sensor Networks

Since the energy supply of a sensor node is limited, energy optimization should be considered as the key objective when studying the wireless sensor networks (WSN). Facing these challenges, clustering is one of the methods used to manage network energy consumption efficiently, and plays an important role in prolonging network lifetime and reducing energy consumption. The improved clustered routing algorithm based on distance and energy is proposed, which efficient improve the rate of data aggregation, thus greatly decrease the energy consumed. Experimental results show that the proposed routing algorithm has higher efficiency and can effectively prolong the lifetime in WSN
Semi-Automatic WordNet Based Emotion Dictionary Construction

This paper describes an algorithm for semi automatically creating an emotion dictionary using WordNet. The algorithm takes as input a set of seed words that have had emotion information assigned as well as WordNet sense information. From this list an initial dictionary is automatically created using the various relations found within WordNet. Then, various correction stages are performed where parts of the dictionary are shown to the user for verification and additional information in the form of emotion polarity and probability information are assigned. Using the proposed algorithm with a set of 549 seed words, an emotion dictionary containing over 13,000 WordNet senses was created in just under 7 person-hours of time. To evaluate the created dictionary its usefulness in improving the performance of affect and sentiment classification was examined. Classification was performed using support vector machines and a baseline non-machine learning dictionary based algorithm. The results showed that the error rate is reduced when using the dictionary over when not using the dictionary.
Design of a person tracking algorithm for the intelligent room

In order to build a room which can monitor the activities of its occupants and assist them naturally in the tasks they are performing, it is first necessary to be able to determine the locations and identities of its occupants. In this thesis, we analyze several algorithms proposed for visually tracking people interacting in such a computer-monitored "intelligent room". Through both experiments on real data and theoretical analysis of the algorithms, we will characterize the strengths and weaknesses of these algorithms. Given this analysis, we will discuss the implications for building a person tracking system using some combination these algorithms. We finish by proposing further experiments and an algorithm to solve the person tracking problem. This algorithm will form the basis for higher-level visual identification and gesture recognition for the Intelligent Room currently being built at the MIT Artificial Intelligence Laboratory. Thesis Supervisor: W. Eric L. Grimson Title: Professor of Computer Science
Continuous-time histories: Observables, probabilities, phase space structure and the classical limit

The continuous-time histories program stems from the consistent histories approach to quantum theory and aims to provide a fully covariant formalism for quantum mechanics. In this paper we examine some structural points of the formalism. We demonstrate a general construction of history Hilbert spaces and identify a large class of time-averaged observables. We pay particular attention to the construction of the decoherence functional (the object that encodes probability information) in the continuous-time limit and its relation to the temporal structure of the theory. Phase space observables are introduced, through the study of general representations of the history group, which is the analog of the canonical group in the formalism. We can also define a closed-time-path (CTP) generating functional for each observable, which encodes the information of its correlation functions. The phase space version of the CTP generating functional leads to the implementation of Wigner–Weyl transforms, that gives a descri.
A hybrid approach for word segmentation

Automatic word segmentation is the process of finding the most likely sequence of words from a sequence of characters without spaces. The central issues of the word segmentation process are the complexity and accuracy. This paper proposes a hybrid method for automatic word segmentation depending on a dictionary based approach, word-statistics and the length of the word. In comparison to the word segmentation using Maximum Length Descending Frequency and Entropy Rate method, the paper shows that the proposed method gives a better accuracy.
Compositionality and String Diagrams for Game Theory

We introduce string diagrams as a formal mathematical, graphical language to represent, compose, program and reason about games. The language is well established in quantum physics, quantum computing and quantum linguistic with the semantics given by category theory. We apply this language to the game theoretical setting and show examples how to use it for some economic games where we highlight the compositional nature of our higher-order game theory.
Partial waves and large NC resonance sum rules

Using 1/NC expansion and dispersion theory techniques, without relying on any explicit resonance lagrangian, we generalize the KSRF relation by including the scalar meson effects, at leading order of chiral expansion. Two sum rules for the low energy constants L2, L3 and a new relation between resonance couplings are also derived. A rather detailed examination to the new relation is also given. We also discussed the Nc properties of partial wave amplitudes and the broad σ resonance.
Automata based verification over linearly ordered data domains

In this paper we work over linearly ordered data domains equipped with finitely many unary predicates and constants. We consider nondeterministic automata processing words and storing finitely many variables ranging over the domain. During a transition, these automata can compare the data values of the current configuration with those of the previous configuration using the linear order, the unary predicates and the constants. We show that emptiness for such automata is decidable, both over finite and infinite words, under reasonable computability assumptions on the linear order. Finally, we show how our automata model can be used for verifying properties of workflow specifications in the presence of an underlying database.
NADPH Oxidase and ERK Signaling Regulates Hyperoxia-induced Nrf2-ARE Transcriptional Response in Pulmonary Epithelial Cells*

Oxidative stress plays a major role in hyperoxia-induced acute lung injury. We have shown previously that mice lacking the Nrf2 are more susceptible to hyperoxia than are wild-type mice. Nrf2 activates antioxidant response element (ARE)-mediated gene expression involved in cellular protection against toxic insults. The present study was designed to investigate the mechanisms that control the activation of Nrf2 by hyperoxia using a non-malignant murine alveolar epithelial cell line, C10. No significant alteration in the levels of Nrf2 mRNA and protein was found following exposure to hyperoxia. In contrast, hyperoxia caused the translocation of Nrf2 from the cytoplasm to the nucleus within 30–60 min of exposure. Consistent with these observations, gel shift and reporter analyses demonstrated a correlation between the hyperoxia-enhanced ARE DNA-binding activity of Nrf2 and an up-regulation of ARE-driven transcription. Inhibition of NADPH oxidase with diphenyleneiodonium (DPI) blocked both Nrf2 translocation and ARE-mediated transcription. Inhibition of the MEK/ERK pathway caused a similar effect. Consistent with this finding, hyperoxia stimulated ERK-1 and ERK-2 phosphorylation, whereas DPI or N-acetyl-l-cysteine blocked such activation. Hyperoxia stimulated the phosphorylation of endogenous Nrf2, but not in the presence of U0126, suggesting a critical role for ERK signaling in the activation of Nrf2. Consistent with this notion, hyperoxia did not stimulate the phosphorylation of Nrf2 in fibroblasts lacking the ERK-1. Collectively, our findings suggest that hyperoxia-induced, ARE-driven, Nrf2-dependent transcription is controlled by NADPH oxidase and ERK-1 signaling.
Chronic Myelogenous Leukemia-Progress at the M . D . Anderson Cancer Center over the Past Two Decades and Future Directions : First

The purpose of this study was to review the progress in clinical and translational research in chronic myelogenous leukemia (CML) over the past 20 years at M. D. Anderson Cancer Center. The CML database updating the clinical and basic research investigations was reviewed as the source of this report. Publications resulting from these investigations were summarized. The long-term results with intensive chemotherapy, IFN-a therapy alone or in combination, autologous stem cell transplantation, and new agents such as homoharnngtonine and decitabine showed encouraging resuIts. Biological studies related to the BCR-ABL molecular abnormality, other molecular events, and the detection of minimal residual disease were detailed. Future strategies with potential promise in CML were outlined. Significant progress in understanding CML biology and in treating patients afflicted with the disease has occurred. Several therapeutic and research tools are currently investigated, which should hopefully improve further the prognosis of patients with CML.
Identification of an inter-transcription factor regulatory network in human hepatoma cells by Matrix RNAi

Transcriptional regulation by transcriptional regulatory factors (TRFs) of their target TRF genes is central to the control of gene expression. To study a static multi-tiered inter-TRF regulatory network in the human hepatoma cells, we have applied a Matrix RNAi approach in which siRNA knockdown and quantitative RT-PCR are used in combination on the same set of TRFs to determine their interdependencies. This approach focusing on several liver-enriched TRF families, each of which consists of structurally homologous members, revealed many significant regulatory relationships. These include the cross-talks between hepatocyte nuclear factors (HNFs) and the other TRF groups such as CCAAT/enhancer-binding proteins (CEBPs), retinoic acid receptors (RARs), retinoid receptors (RXRs) and RAR-related orphan receptors (RORs), which play key regulatory functions in human hepatocytes and liver. In addition, various multi-component regulatory motifs, which make up the complex inter-TRF regulatory network, were identified. A large part of the regulatory edges identified by the Matrix RNAi approach could be confirmed by chromatin immunoprecipitation. The resultant significant edges enabled us to depict the inter-TRF TRN forming an apparent regulatory hierarchy of (FOXA1, RXRA) → TCF1 → (HNF4A, ONECUT1) → (RORC, CEBPA) as the main streamline.