Miracle-dz/UniFAR-FTUs huggingface dataset:
Building Subject Hierarchies for User Modeling

Dynamic text classi cation according to users' subjects of interest has become a key task for any agents assisting users in the Web. We present in this work a technique to incrementally build user pro les by capturing subjects of interest and organizing them in a topic hierarchy. This kind of representation of users' interests allows agents to provide a personalized and e ective assistance on information related task. The range of applications of this technique, named TIC (Tree of Interesting Cases), goes from browsing assistance, Web pages recommendation and email organizations to recommendation of items in general. As an example of application of TIC we developed an interface agent, named PersonalSearcher, that assists users to nd relevant documents in the WWW. We describe the basic functionality of this agent and some experimental results of its use in order to validate our technique of user pro ling.
The HardyWeinberg Package version 1 . 4

This guide gives some instructions on how to perform graphical significance tests for HardyWeinberg equilibrium (HWE) by depicting the acceptance region for HWE in a ternary plot with routines from the package HardyWeinberg. The outline of this guide is as follows. Section 2 describes how the R package HardyWeinberg can be installed. Section 3 shows how to perform some of the classical tests for Hardy-Weinberg equilibrium with routines from the package. Finally, Section 4 shows how to contruct ternary plots with the HW acceptance region and how to perform graphical tests for HWE. We refer to Graffelman & Morales (2008) for the theoretical foundation of the graphical tests. If you appreciate this software then please cite the following paper in your work:
QoS Oriented Flexible Distributed Objects for Multimedia Applications

The system change is modeled to be the change of not only types of service but also quality of service (QoS) supported by the objects. An object supports methods only by which the object is manipulated. A method changes not only the state of the object but also QoS of the state. We discuss new equivalent and compatible relations among methods with respect to QoS. By using the relations, we newly discuss a QoS-based compensating way to recover the object from the less quali ed
A Random Walk Modelling Approach for Passive Metabolic Pathways in Gram-Negative Bacteria

Random environment of the cell demands for a stochastic tool to analyze its behavior and bring the aspects of the bio-process that has been shadowed by the kinetic rate law based approach. In this work we present a novel random walk approach to detect the dynamics of passive diffusion of a metabolite in the gram-negative bacteria through phosphoenolpyruvate phospho-transfer system (pts pathway). We adopt a cell abstract model from the literature and build a triphase enzyme limited diffusion process on that. To explain the numerical results, we used the E.coli cell in our analysis to show the model precision. Our approach very finely manipulates the flux and flux responses coefficient with respect to enzyme variations in the cell. Also we have shown that current model would match the experimental in-vivo result better than kinetic rate base equivalent. Furthermore computational complexity of our approach is very light and could run in linear time
Research on the Design of the Ontology-Based Automatic Question Answering System

Automatic question answering system is a hot issue in the field of natural language processing, and is playing an increasingly important role in the long-distance teaching through networks. This paper proposes an ontology-based automatic question answering system model, at first, build restricted area ontology, then take advantage of the accurate description of concept as well as the definition of the relationship of the concepts, to expand keywords and improve the accuracy and recall rates.
Smart robot perception through Internet data mining

This paper presents a high-level framework for smart robot perception to learn semantic concepts from videos that crawled from known Internet video sites (e.g. youtube, video-google). Smart perception is one of the most challenging problems for industrial robots. The key barrier for smart robot perception such as object detection and/or category classification is lack of annotated training data. Internet is a potential repository to provide a reliable source for semantic concept learning. In this paper, we will propose a novel Internet video-mining approach to bridge the gap between the demand of large-scale semantic concepts and the shortage of of annotated data. An automated video source discovery method will be addressed in concepts detection from the massive Internet videos. Illustrative experimental results with Tera-bytes level videos will be discussed to prove that the addressed method is effective and efficient in smart robot perception.
Delays in GABAergic interneuron development and behavioral inhibition after prenatal stress

Prenatal stress is associated with altered behavioral, cognitive, and psychiatric outcomes in offspring. Due to the importance of GABAergic systems in normal development and in psychiatric disorders, prenatal stress effects on these neurons have been investigated in animal models. Prenatal stress delays GABAergic progenitor migration, but the significance of these early developmental disruptions for the continued development of GABAergic cells in the juvenile brain is unclear. Here, we examined effects of prenatal stress on populations of GABAergic neurons in juvenile and adult medial frontal cortex (mFC) and hippocampus through stereological counting, gene expression, and relevant anxiety‐like and social behaviors. Postnatally, the total GABAergic cell number that peaks in adolescence showed altered trajectories in mFC and hippocampus. Parvalbumin neuron proportion in juvenile brain was altered by prenatal stress, but parvalbumin gene expression showed no differences. In adult brain, parvalbumin neuron proportions were altered by prenatal stress with opposite gene expression changes. Adult prenatally stressed offspring showed a lack of social preference on a three‐chambered task, increased anxiety‐like behavior on the elevated plus maze, and reduced center time in an open field. Despite a lack of significant group differences in adult total GABAergic cell populations, performance of these tasks was correlated with GABAergic populations in mFC and hippocampus. In conclusion, prenatal stress resulted in a delay in GABAergic cell number and maturation of the parvalbumin subtype. Influences of prenatal stress on GABAergic populations during developmentally dynamic periods and during adulthood may be relevant to the anxiety‐like behaviors that occur after prenatal stress. © 2015 Wiley Periodicals, Inc. Develop Neurobiol 76: 1078–1091, 2016
Positioning mobile base station to prolong wireless sensor network lifetime

Energy efficiency is a critical issue in designing sensor networks, as the nodes have limited battery power. In this paper we propose to move the BS so as to prolong the network lifetime. We present three strategies for moving the BS: (1) minimizing the average transmission energy; (2) minimizing the maximum transmission energy; and (3) minimizing the maximum relative consumed energy for every active sensor. We examined the case, when the BS is on the optimal location in each round using the three strategies.
Context-Based Algorithm for Face Detection

Face detection has been a research area for more than ten years. It is a complex problem due to the high variability in faces and amongst faces; therefore it is not possible to extract a general pattern to be used for detection. This is what makes the face detection problem a challenge.This thesis gives the reader a background to the face detection problem, where the two main approaches of the problem are described. A face detection algorithm is implemented using a context-based method in combination with an evolving neural network. The algorithm consists of two majors steps: detect possible face areas and within these areas detect faces. This method makes it possible to reduce the search space.The performance of the algorithm is evaluated and analysed. There are several parameters that affect the performance; the feature extraction method, the classifier and the images used.This work resulted in a face detection algorithm and the performance of the algorithm is evaluated and analysed. The analysis of the problems that occurred has provided a deeper understanding for the complexity of the face detection problem.
Using Statistical Room Acoustics for Computing the Spatially Averaged Performance of the Multichannel Wiener Filter Based Noise Reduction

The theoretical performance of the multi-channel Wiener filter (MWF), which is often used for noise reduction in speech enhancement applications, depends on the noise field and on the acoustic transfer functions (ATFs) between the desired source and the microphones. To compute this theoretical performance, either time-consuming measurements of the ATFs and the noise field or simulation of the ATFs, e.g. using the image model, need to be performed. Recently, an analytical expression for the spatially averaged output SNR of the MWF has been proposed, requiring only the room properties and the source-microphone distances to be known. In this paper, we derive similar analytical expressions for other performance measures, namely for the spatially averaged mean square error (MSE), and speech distortion at the reference microphone.
M5-branes, Special Lagrangian Submanifolds and cr-models

We study M-theory fivebranes wrapped on Special Lagrangian submanifolds (En) in Calabi-Yau threeand fourfolds. When the M5 wraps a four-cycle, the resulting theory is a twodimensional domain wall embedded in three-dimensional bulk with four supercharges. The theory on the wall is specified in terms of the geometry of the CY manifold and the cycle E4. It is chiral and anomalous, however the presence of a threedimensional gravitational Chern-Simons term with a coefficient that jumps when crossing the wall allows to cancel the anomaly by inflow. Kahler manifolds of special type, where the potential depends only on the real part of the complex coordinate, are shown to emerge as the target spaces of two-dimensional cr-models when the M5 is wrapped on £3 x S', thus providing e-print archive: http://xxx.lanl. gov/hep-th/9906190 378 R. MINASIAN AND D. TSIMPIS a physical realization of some recent symplectic construction by Hitchin.
Constraint-based Test Generation for Pointer-based Data Structures

In this paper, we propose an approach for automated test case generation based on techniques from Constraint Programming. We show how an imperative language can be extended with constraint variables and its operational semantics with constraints. By running a program in this extended language, we obtain constraints on the initial environment and heap. Solving these constrains, we obtain concrete test cases for the program. Our technique can handle primitive data such as integers, as well as arbitrary pointer-based data structures allocated on the heap. Standard CP search strategies can be used to express preferences on the generated test cases and to obtain the desired degree of coverage.
Investigating Hologram‐Based Route Planning

It is often assumed that three‐dimensional topographic maps provide more effective route planning, navigation, orientation, and way‐finding results than traditional two‐dimensional representations. The research reported here investigates whether three‐dimensional spatial mappings provide better support for route planning than two‐dimensional representations. In a set of experiments performed as part of this research, human subjects were randomly shown either a two‐ or three‐dimensional hologram of San Francisco and were asked to plan a bicycling route between an origin and a destination point. In a second task, participants used these holograms to identify the highest elevation point in the displayed area. The eye‐movements of the participants, throughout the process of looking at the geospatial holograms and executing the tasks, were recorded. The eye‐tracking metrics analysis indicates with a high statistical level of confidence that three‐dimensional holographic maps enable more efficient route planning. In addition, the research group is developing a new algorithm to analyze the differences between participant‐selected routes and a set of “good routes. ” The algorithm employs techniques used to represent the boundary of objects and methods for assessing the difference between objects in modern digital image recognition, image registration, and image alignment applications. The overall goal is to create a theoretical framework for investigating and quantifying route planning effectiveness.
How robust is the value-at-risk of credit risk portfolios?

In this paper, we assess the magnitude of model uncertainty of credit risk portfolio models, that is, what is the maximum and minimum value-at-risk (VaR) of a portfolio of risky loans that can be justified given a certain amount of available information. Puccetti and Rüschendorf [2012a. “Computation of Sharp Bounds on the Distribution of a Function of Dependent Risks”. Journal of Computational and Applied Maths 236, 1833–1840] and Embrechts, Puccetti, and Rüschendorf [2013. “Model Uncertainty and VaR Aggregation”. Journal of Banking and Finance 37, 2750–2764] propose the rearrangement algorithm (RA) as a general method to approximate VaR bounds when the loss distributions of the different loans are known but not their interdependence (unconstrained bounds). Their numerical results show that the gap between worst-case and best-case VaR is typically very high, a feature that can only be explained by lack of using dependence information. We propose a modification of the RA that makes it possible to approximate sharp VaR bounds when besides the marginal distributions also higher order moments of the aggregate portfolio such as variance and skewness are available as sources of dependence information. A numerical study shows that the use of moment information makes it possible to significantly improve the (unconstrained) VaR bounds. However, VaR assessments of credit portfolios that are performed at high confidence levels (as it is the case in Solvency II and Basel III) remain subject to significant model uncertainty and are not robust.
Time-Course Analysis on the Differentiation of Bone Marrow-Derived Progenitor Cells Into Smooth Muscle Cells During Neointima Formation

Objective—Bone marrow-derived progenitor cells have been implicated to contribute to neointima formation, but the time course and extent of their accumulation and differentiation into vascular cells and, most importantly, the long-term contribution of bone marrow-derived progenitor cells to the vascular lesion remain undefined. Methods and Results—Wire-induced injury of the femoral artery was performed on chimeric C57BL/6 mice transplanted with bone marrow from transgenic mice expressing enhanced green fluorescence protein, and vessels were harvested at 3 days, 1, 2, 3, 4, 6, and 16 weeks after dilatation (n=8 animals per time point). Using high-resolution microscopy, we unexpectedly found that the expression of smooth muscle cell or endothelial cell markers in enhanced green fluorescence protein positive cells was a very rare event. Indeed, most of the enhanced green fluorescence protein positive cells that accumulated during the acute inflammatory response were identified as monocytes/macrophages, and their number declined at later time points. In contrast, a substantial fraction of highly proliferative stem cell antigen-1 and CD34+ but enhanced green fluorescence protein negative and thus locally derived cells were detected in the adventitia. Conclusion—These data provide evidence that the differentiation of bone marrow-derived progenitor cells into smooth muscle cell or endothelial cell lineages seems to be an exceedingly rare event. Moreover, the contribution of bone marrow-derived cells to the cellular compartment of the neointima is limited to a transient period of the inflammatory response.
Leveraging OmpSs to Exploit Hardware Accelerators

CUDA and OpenCL are the most widely used programming models to exploit hardware accelerators. Both programming models provide a C-based programming language to write accelerator kernels and a host API used to glue the host and kernel parts. Although this model is a clear improvement over a low-level and ad-hoc programming model for each hardware accelerator, it is still too complex and cumbersome for general adoption. For large and complex applications using several accelerators, the main problem becomes the explicit coordination and management of resources required between the host and the hardware accelerators that introduce a new family of issues (scheduling, data transfers, synchronization, ) that the programmer must take into account. In this paper, we propose a simple extension to OmpSs -- a data-flow programming model -- that dramatically simplifies the integration of accelerated code, in the form of CUDA or OpenCL kernels, into any C, C++ or Fortran application. Our proposal fully replaces the CUDA and OpenCL host APIs with a few pragmas, so we can leverage any kernel written in CUDA C or OpenCL C without any performance impact. Our compiler generates all the boilerplat code while our runtime system takes care of kernels scheduling, data transfers between host and accelerators and synchronizations between host and kernels parts. To evaluate our approach, we have ported several native CUDA and OpenCL applications to OmpSs by replacing all the CUDA or OpenCL API calls by a few number of pragmas. The OmpSs versions of these applications have competitive performance and scalability but with a significantly lower complexity than the original ones.
Proteomic Analysis of the Peri-Infarct Area after Human Umbilical Cord Mesenchymal Stem Cell Transplantation in Experimental Stroke

Among various therapeutic approaches for stroke, treatment with human umbilical cord mesenchymal stem cells (hUC-MSCs) has acquired some promising results. However, the underlying mechanisms remain unclear. We analyzed the protein expression spectrum of the cortical peri-infarction region after ischemic stroke followed by treatment with hUC-MSCs, and found 16 proteins expressed differentially between groups treated with or without hUC-MSCs. These proteins were further determined by Gene Ontology term analysis and network with CD200-CD200R1, CCL21-CXCR3 and transcription factors. Three of them: Abca13, Grb2 and Ptgds were verified by qPCR and ELISA. We found the protein level of Abca13 and the mRNA level of Grb2 consistent with results from the proteomic analysis. Finally, the function of these proteins was described and the potential proteins that deserve to be further studied was also highlighted. Our data may provide possible underlying mechanisms for the treatment of stroke using hUC-MSCs.
Intraseasonal “monsoon jets” in the equatorial Indian Ocean

The zonal wind in the equatorial Indian Ocean (EqIO) is westerly almost throughout the year. It has a strong semiannual cycle and drives the spring and fall Wyrtki jets. In addition, high resolution daily satellite winds show “westerly wind bursts” lasting 10–40 days, associated with atmospheric convection in the eastern EqIO. These bursts have the potential to produce intraseasonal eastward equatorial jets in the ocean. Using an ocean model driven by QuikSCAT scatterometer winds, we show that strong westerly bursts associated with summer monsoon intraseasonal oscillations can drive “monsoon jets” in the eastern EqIO, which have been observed recently. Although there are distinct equatorial wind bursts associated with Madden‐Julian oscillations in January–March, they do not produce equatorial jets in the ocean. The role of ocean dynamics in producing the selective response of the ocean is discussed.
An evaluation framework for pre-distribution strategies of certificates in VANETs

Security and privacy in vehicular communication are expected to be ensured by the pervasive use of pseudonymous certificates and signed messages. The design and establishment of necessary public key infrastructure and hierarchies of cer- tificate authorities is ongoing in industry consortia, such as the Car-to-Car Communication Consortium. The privacy pre- serving dissemination of pseudonymous certificates is however still expected to be limited to single-hop exchanges between vehicles. This limitation to one-hop strategies might not be ideal, especially considering the importance of ensuring trustworthy stateless information exchange upon reception of the very first communication packets. We propose to investigate multi-hop pre- distribution strategies for certificates to significantly reduce this first encounter problem.
Efficient processing of SPARQL joins in memory by dynamically restricting triple patterns

Since there are a lot of similar or common properties between RDF and relational databases and between SPARQL and SQL, many efforts focus on leveraging the research results of optimizing relational query languages for optimizing SPARQL queries. However, SPARQL has its own characteristics different from SQL, which are not fully exploited by existing work. Therefore, there is still much space for research on optimizing SPARQL queries. Based on the triple nature of RDF data, we create 7 indices to retrieve RDF data quickly; based on the SPARQL-specific properties and the 7 indices, we develop a new, efficient approach to computing join by dynamically restricting triple patterns. Our experimental results show the efficiency of our approach.
MPRGQ: Multi-path routing algorithm to guarantee to achieve the required QoS of wireless sensor networks

Considering the necessity of reliability providing and lifetime prolonging in wireless sensor networks as Quality of Service requirements, it is necessary to present a new routing algorithm that can best provide these requirements in network layer. For this purpose, we propose MPRGQ which is a new multi path routing algorithm which guarantees achieve to required QoS of wireless sensor networks. Simulation Result shows that the performance of MPRGQ is optimizing compared to the previous protocol.
Commutative Algebra in the Cohomology of Groups

Commutative algebra is used extensively in the cohomology of groups. In this series of lectures, I concentrate on finite groups, but I also discuss the cohomology of finite group schemes, compact Lie groups, p-compact groups, infinite discrete groups and profinite groups. I describe the role of various concepts from commutative algebra, including finite generation, Krull dimension, depth, associated primes, the Cohen–Macaulay and Gorenstein conditions, local cohomology, Grothendieck’s local duality, and Castelnuovo–Mumford regularity.