Miracle-dz/UniFAR-FTUs huggingface dataset:
Differential calculi and linear connections

A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a one‐to‐one correspondence, between the module structure of the 1‐forms and the metric torsion‐free connections on it. In the commutative limit the connection remains as a shadow of the algebraic structure of the 1‐forms.
Virtual OBDA over Expressive Ontologies: Rewritings and Approximations

In this paper we extend virtual OBDA to more expressive ontology languages than that of DL-LiteR, which is the logic underpinning the W3C ontology language OWL 2. We achieve this by relying on two well-known mechanisms, namely conservative rewriting and approximation, and compiling some of the domain semantics into OBDA mappings.
A doubling construction for self-orthogonal codes

A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal quaternary linear $[28,20,6]$ dual containing code is found that yields a new optimal $[[28,12,6]]$ quantum code.
Two Variations of Inductive Inference of Languages from Positive Data

The present paper deals with the learnability of indexed families of uniformly recursive languages by single inductive inference machines (abbr. IIM) and teams of IIMs from positive and both positive and negative data. We study the learning power of single IIMs in dependence on the hypothesis space and the number of allowed anomalies the synthesized language may have. Our results are fourfold. First, we show that allowing anomalies does not increase the learning power as long as inference from positive and negative data is considered. Second, we establish an in nite hierarchy in the number of allowed anomalies for learning from positive data. Third, we prove that every learnable indexed family L may be even inferred with respect to the hypothesis space L itself. Fourth, we characterize learning with anomalies from positive data. Finally, we investigate the error correcting power of team learners, and relate the inference capabilities of teams in dependence on their size to one another. Again, an in nite hierarchy is established and the learnability is characterized in terms of recursively generable families of nite and non-empty sets.
Static caching of Web servers

With the increasing popularity of the World Wide Web, the amount of information available and the use of Web servers are growing exponentially. As a consequence, the number of requests to popular Web servers increases exponentially as well. In order to reduce the overhead induced by frequent requests to the same documents, server caching, also referred to as main memory caching, has been proposed and implemented. In this work, we propose a static caching mechanism which consists of updating the contents of the cache periodically and, at the update time, brings into the cache only the most requested documents in the previous time interval. This caching policy has lower management overhead than others. Under some statistical assumptions we show that static caching has the highest hit rate. We also provide empirical comparison results obtained by trace-driven simulations. It turns out that static caching is more efficient in terms of hit rate than those analyzed in the literature.
Sleep/wake patterns derived from activity monitoring and maternal report for healthy 1- to 5-year-old children.

STUDY OBJECTIVES To describe behavioral sleep/wake patterns of young children from actigraphy and mothers' reports, assess age-group and sex differences, describe daytime napping, and investigate the impact of family demographic variables on sleep-wake measures. DESIGN Cross-sectional sample of children wore actigraphs for 1 week; mothers kept concurrent diaries. SETTING Children studied in their homes. PARTICIPANTS 169 normal healthy children in 7 age groups (12, 18, 24, 30, 36, 48, and 60 months old); 84 boys and 85 girls. INTERVENTIONS N/A. MEASUREMENTS AND RESULTS Nocturnal sleep/wake measures estimated from activity recordings using a validated algorithm; mothers' reports of nocturnal sleep/wake patterns and daytime naps obtained from concurrent diaries. Bedtimes and sleep start times were earliest and time in bed and sleep period times were longest for 12-month-old children. Rise time, sleep end time, and nocturnal sleep minutes did not differ across age groups. Actigraphic estimates indicated that children aged 1 to 5 years slept an average of 8.7 hours at night. Actigraph-based nocturnal wake minutes and wake bouts were higher than maternal diary reports for all age groups. Daytime naps decreased monotonically across age groups and accounted for most of the difference in 24-hour total sleep over age groups. Children in families with lower socioeconomic status had later rise times, longer time in bed, more nocturnal wake minutes and bouts, and more night-to-night variability in bedtime and sleep period time. Children with longer naps slept less at night. CONCLUSIONS Individual differences in sleep/wake measures reflect characteristics of children, parents, or parent-child interactions.
Proactive Distance-Vector Multipath Routing for Wireless Ad Hoc Networks

Routing in wireless ad hoc networks of mobile nodes is complicated by the fact that the transmission ranges and the communication bandwidth is limited, and that the network topology is highly dynamic due to continuously moving nodes. In this paper, a new approach is presented to equip proactive distance-vector routing algrithms with the capability of using multiple paths to each target. The basic idea of our multipath routing proposal is to split up a path between a source and a target node into two paths at every forwarding node. In contrast to other multipath approaches, our solution uses already available topology information and thus does not require any additional routing messages to be sent. The benefits of our approach with respect to load distribution, bottleneck avoidance, fairness and communication breakdowns are demonstrated via simulations.
PECULIAR ASPECTS OF QUALIFIED WRESTLERS’ SPECIAL WORKABILITY AND SUPREME NERVOUS SYSTEM FUNCTIONING AT SPECIAL TRAINING STAGE OF PREPARATORY PERIOD

Purpose: to determine peculiar aspects of qualified wrestlers’ special workability and supreme nervous system functioning in special training stage of preparatory period. Material: 18 qualified wrestlers if 17-20 yrs age were tested. We used testing of special workability and psycho-physiological testing. Results: it was found that sportsmen’s special workability was at rather high level. Though, recreation coefficient witnesses about some accumulation of fatigue. Besides, we registered reduction of central nervous system’s functional potentials. It is proved by latent periods of simple and complex visual reactions (at low and below average levels). We found correlations between sportsmen’s special endurance, level of complex visual-motor reaction and nervous processes’ functional mobility. Besides, sportsmen with stronger nervous processes recreate quicker after standard loads. Conclusions: it was found that alongside with high special workability sportsmen accumulate fatigue and have absence of recreation. It is proved by weakening of central nervous system’s functional potentials. We supplemented the data about correlation between special workability and sportsmen’s psycho-physiological condition. It was assumed that persistent influence on supreme nervous system will permit to sustain special workability at high level and prevent from over-training.
Project number IST-006413 ACS Algorithms for Complex Shapes with Certified Numerics and Topology Arrangements of Geodesic Arcs on the Sphere Efi

In this report we concentrate on exact construction and maintenance of arrangements induced by arcs of great circles embedded on the sphere, also known as geodesic arcs, and exact computation of Voronoi diagrams on the sphere, the bisectors of which are geodesic arcs. This class of Voronoi diagrams includes the subclass of Voronoi diagrams of points and its generalization, power diagrams, also known as Laguerre Voronoi diagrams. The resulting diagrams are represented as arrangements, and can be passed as input to consecutive operations supported by the Arrangement 2 package of cgal and its derivatives. The implementation handles well degenerate input and produces exact results. Some of the implementation details and concepts referred to in this report are described and illustrated in [9, 8]. An example that uses real world data is included. Additional material is available at http://www.cs. tau.ac. il/~efif/VOS.
Memory , Recall Dynamics

How do we search our memories to recall information that occurred in a given temporal context? In the laboratory, this basic question concerning human memory is addressed by asking people to study a sequence of individually presented items (typically words) and then to try to recall all of the items they can remember in any order. This task, first introduced by E.A. Kirkpatrick in 1894, is termed free recall. By analyzing the order in which participants freely recall list items, one can gain considerable insight into the nature of the recall process. The analysis of recall dynamics in free recall reveals several striking regularities. This entry first reviews five major phenomena that govern the way people search their memories: the effects of recency, primacy, contiguity, forward asymmetry, and semantic proximity. Subsequent sections discuss how these phenomena occur both in the patterns of correct recalls and recall errors, as well as in the latencies measured between successively recalled items. This entry closes with a brief discussion of the theoretical implications of these phenomena.
Independence of SST skewness from thermocline feedback in the eastern equatorial Indian Ocean

The observed sea surface height (SSH)‐sea surface temperature (SST) in east equatorial Indian Ocean (EEIO) shows a significant asymmetric relation between the positive and negative SSH anomalies during boreal autumn. Whether or not the thermocline‐ SST feedback is responsible for the negative SST skewness in the EEIO is explored by diagnosing various air‐sea feedback processes and a mixed layer heat budget. Our analysis based on observations suggests that the SSH‐subsurface temperature relation is approximately symmetric between the positive and negative episode, which is significantly different from the asymmetric SSH‐SST relation. This implies that the observed SSH‐SST asymmetry is not attributed to the ocean thermocline feedback. A further analysis of the SST‐precipitation, precipitation‐wind stress and wind stress‐SSH relations demonstrates that the asymmetry arises from asymmetric atmospheric heating/wind responses to the SST anomaly. A mixed layer heat budget analysis reveals that the ratio of the mixed‐layer temperature tendency between the positive and negative events keeps approximately unchanged with and without vertical temperature advection, suggesting that the thermocline‐feedback is not crucial for generating the negative SST skewness in the EEIO.
Molecular modelling of ( A 4 T 4 NN ) n and ( T 4 A 4 NN ) n : sequence elements responsible for curvature

The molecular modelling program JUMNA has been used to investigate the origins of the strikingly different curvature of the two sequences, (A 4T4NN)n and (T4A4NN)n . Gel electrophoresis and cyclisation studies have shown that only the former of these two sequences is significantly curved. By developing novel superhelical symmetry constraints we were able to study the energetic and structural aspects of polymeric DNA having a controlled curvature. The results obtained (which do not take into account specific hydration effects) correlate well with the experimental data and offer a molecular level explanation of curvature. Although curvature is found to be initiated by specific dinucleotide junctions, deformations spread to surrounding dinucleotide steps and, moreover, sequence effects beyond the dinucleotide level are observed.
Who were you talking to - Mining interpersonal relationships from cellphone network data

People play different roles in various social networks. Even in a single network, people may interact with others based on different roles, and there are various relationships among them. However, current research usually treats all relationships homogeneously (i.e. friendship). In this paper, we try to identify different types of relationship (family, colleague, and social) within social networks. By analyzing a large-scale cellphone network, we gain insights about human mobility patterns. We design three metrics to capture colocation behaviors for cellphone users, taking spatial-temporal factors into consideration. These metrics show that users with different relationships demonstrate significantly different co-locating patterns. With these metrics as features, we adopt supervised approach to classify cellphone user pairs into different relationship categories. Comparing to using network and communication features, co-location metrics demonstrate better performance to fulfill the task of relationship identification.
Pathophysiology of GvHD and Other HSCT-Related Major Complications

For over 60 years, hematopoietic stem cell transplantation has been the major curative therapy for several hematological and genetic disorders, but its efficacy is limited by the secondary disease called graft versus host disease (GvHD). Huge advances have been made in successful transplantation in order to improve patient quality of life, and yet, complete success is hard to achieve. This review assimilates recent updates on pathophysiology of GvHD, prophylaxis and treatment of GvHD-related complications, and advances in the potential treatment of GvHD.
Antidepressants in treatment of eating disorders

The study has shown a meintenance in anthropometric variables as well as improvement of psychopathological variables in a group of patients with eating disorders on special inpatient program and antidepressant treatment. Individuals with eating disorders, especially anorexia nervosa, are inherently difficult to treat, even in an inpatient setting. This retrospective study confirmed a benefit from a comprehensive spproach to the treatment of patients with eating disorders.
A Novel Approach to Design a Scalable Air Quality Monitoring System

The research presents a novel approach to carbon dioxide (CO2) emissions monitoring and access to local air quality data. The approach applies the advanced Internet of things technology to design a mobile telemetry system for CO2 data collection and processing in order to be presented as a value-added application to mobile users. Based on requirements analysis, functional architecture for mobile telemetry system is proposed. The design aspects of mobile telemetry application layer protocol are studied. An approach to formal verification of protocol behavior is suggested. An information model that captures the basic concepts related to CO2 monitoring is proposed. Examples of ubiquitous access to CO2 measurements are described.
Depth-based image mosaicing for both static and dynamic scenes

Traditional image-based mosaicing deals with the problem of parallax by imposing constraints of a parallax-free camera configuration or requiring a dense sampling of the scene. These solutions are often impractical or fail to address the needs of the application. Instead, taking advantage of depth cues and a criterion of smooth transitions, we achieve significantly improved mosaicing results for static scenes, coping effectively with non-trivial parallax in the input. Furthermore, by incorporating a criterion of consistent motion perception, we demonstrate progress on mosaicing of dynamic scenes without introducing artifacts. Although further additions are required to cope with unconstrained object motion, our algorithm can synthesize perceptually convincing dynamic mosaics, conveying the same appearance of object motion as seen in the original sequences.
Duality-based subsequence matching in time-series databases

The authors propose a subsequence matching method, Dual Match, which exploits duality in constructing windows and significantly improves performance. Dual Match divides data sequences into disjoint windows and the query sequence into sliding windows, and thus, is a dual approach of the one by C. Faloutsos et al. (1994), which divides data sequences into sliding windows and the query sequence into disjoint windows. We formally prove that our dual approach is correct, i.e., it incurs no false dismissal. We also prove that, given the minimum query length, there is a maximum bound of the window size to guarantee correctness of Dual Match and discuss the effect of the window size on performance. FRM causes a lot of false alarms by storing minimum bounding rectangles rather than individual points representing windows to avoid excessive storage space required for the index. Dual Match solves this problem by directly storing points, but without incurring excessive storage overhead. Experimental results show that, in most cases, Dual Match provides large improvement in both false alarms and performance over FRM, given the same amount of storage space. In particular, for low selectivities (less than 10/sup -4/), Dual Match significantly improves performance up to 430-fold. On the other hand, for high selectivities(more than 10/sup -2/), it shows a very minor degradation (less than 29%). For selectivities in between (10/sup -4//spl sim/10/sup -2/), Dual Match shows performance slightly better than that of FRM. Dual Match is also 4.10/spl sim/25.6 times faster than FRM in building indexes of approximately the same size. Overall, these results indicate that our approach provides a new paradigm in subsequence matching that improves performance significantly in large database applications.
Unsupervised extraction of template structure in web search queries

Web search queries are an encoding of the user's search intent and extracting structured information from them can facilitate central search engine operations like improving the ranking of search results and advertisements. Not surprisingly, this area has attracted a lot of attention in the research community in the last few years. The problem is, however, made challenging by the fact that search queries tend to be extremely succinct; a condensation of user search needs to the bare-minimum set of keywords. In this paper we consider the problem of extracting, with no manual intervention, the hidden structure behind the observed search queries in a domain: the origins of the constituent keywords as well as the manner the individual keywords are assembled together. We formalize important properties of the problem and then give a principled solution based on generative models that satisfies these properties. Using manually labeled data we show that the query templates extracted by our solution are superior to those discovered by strong baseline methods. The query templates extracted by our approach have potential uses in many search engine tasks; query answering, advertisement matching and targeting, to name a few. In this paper we study one such task, estimating Query-Advertisability, and empirically demonstrate that using extracted template information can improve performance over and above the current state-of-the-art.
Browsing in hypertext: a cognitive study

Several dimensions of browsing are examined to find out: what browsing is and what cognitive processes are associated with it; whether there is a browsing strategy and, if so, whether there are any differences between how subject-area experts and novices browse; and how this knowledge can be applied to improve the design of hypertext systems. Two groups of students, subject-area experts and novices, were studied while browsing a Macintosh HyperCard application. Three browsing strategies were identified: (1) search-oriented browse: scanning and reviewing information relevant to a fixed task; (2) review-browse: scanning and reviewing interesting information in the presence of transient browse goals that represent changing tasks; and (3) scan-browse: scanning for interesting information without review. Most subjects used review-browse interspersed with search-oriented browse. Within this strategy, comparisons showed that experts browsed in more depth, and viewed information differently than did novices. Based on these findings, suggestions are made to hypertext developers. >
Bisphosphonate risedronate reduces metastatic human breast cancer burden in bone in nude mice.

Human breast cancer frequently metastasizes to the skeleton to cause osteolysis and subsequent pain, pathological fracture, and hypercalcemia. Because bone continuously releases growth factors stored in bone matrix by bone resorption during physiological remodeling and, thus, possibly provides a favorable microenvironment for metastatic breast cancer cells to proliferate, inhibitors of bone resorption used either prophylactically or in patients with established disease, therefore, would seem likely to be useful adjuvant therapy in patients with breast cancer. However, the parameters for monitoring progressive osteolytic bone disease in humans are imprecise. We examined the effects of the third generation bisphosphonate, risedronate, which is a specific inhibitor of osteoclastic bone resorption, in a bone metastasis model in nude mice in which intracardiac injection of the human breast cancer cell line MDA-231 leads to osteolytic bone metastases. Risedronate (4 micrograms/animal/day) was given s.c. to animals (a) after radiologically small but defined osteolytic metastases were observed; (b) simultaneously with MDA-231 cell inoculation through the entire experimental period; or (c) by short-term prophylactic administration before inoculation of MDA-231 cells. In all experiments, risedronate either slowed progression or inhibited the development of bone metastases assessed radiographically. Furthermore, mice treated continuously with risedronate showed significantly longer survival than did control mice. Histomorphometrical analysis revealed that osteoclast numbers were diminished at metastatic tumor sites. Unexpectedly, there was also a marked decrease in tumor burden in bone in risedronate-treated animals. In contrast, the growth of metastatic breast cancer in soft tissues surrounding bones was not affected by risedronate. Moreover, risedronate had no effects on the local growth of s.c. implanted MDA-231 breast cancers in nude mice or on MDA-231 cell proliferation in culture. These data demonstrate that risedronate decreases metastatic MDA-231 breast cancer burden selectively in bone, as well as suppresses progression of established osteolytic lesions and prevents the development of new osteolytic lesions; thus, the data suggest that inhibition of osteoclastic bone resorption may be a useful adjunctive therapy for the treatment of cancers that have colonized in bone.
USE OF DATA MINING TO DERIVE CRM STRATEGIES OF AN AUTOMOBILE REPAIR SERVICE CENTER IN KOREA

Problems of a Korean automobile repair service center stem from the fact that a large portion of customers stop visiting the center for unknown reasons. So, we collected and analyzed the customer-related data in order to resolve those problems. We first defined customer class based on the R-F-M variables. Then, we built a customer classification model (i.e., a decision tree). Finally, we extracted characteristics (i.e., sequential patterns of services) of each customer class for each kind of automobile. What we learned is that the results of the analysis can be used together in order to provide better services so that total revenue of the center can be increased.