Miracle-dz/UniFAR-FTUs huggingface dataset:
A Query-sensitive Cost Model for Similarity Queries with M-tree

We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity queries as a function of each single query. This model is said to be query-sensitive, since it takes into account, by relying on the novel notion of “witness”, the “position” of the query point inside the metric space indexed by the M-tree. We describe the basic concepts underlying the model along with different methods which can be used for its implementation; finally, we experimentally validate the model over both real and synthetic datasets.
Study on Genetic Variance of miR-541 in Type 1 Diabetes

Genetic susceptibility plays a key role in type 1 diabetes development. Because miR-541 gene was located within the associated chromosome loci and its target genes include the diabetes-associated gene neurogenin3, this study aimed to investigate whether miR-541 had type 1 diabetes-associated genetic variations. Type 1 diabetes children and healthy volunteers were recruited; direct sequencing was performed in initial 69 patients and 46 volunteers. We identified 1 reported SNP (rs12893725) and 3 novel genetic variations, for the candidate -404 G→T variation, restriction fragment length polymorphism (RFLP) was performed in total 247 diabetes children and 212 healthy volunteers, a different distribution trait of allele frequencies was found between the two groups, and further clinical analysis found no significant correlation between clinical parameter and genotypes among patients. In addition, by luciferase reporter assay, -404 was found to be within putative promoter region of pre-miR-541; although mutation of G→T has no effect on promoter activity, a significant secondary structure alteration may possibly influence its processing and transcription. In conclusion, we identified 3 novel genetic variations in putative promoter of miR-541 in type 1 diabetes patients; -404 G→T of miR-541 is a potential T1D-associated genetic variation.
Development of matter concept on submicroscopic level across ages

This study is conducted to understand the development of the matter concept on the submicroscopic level among students of various age groups (16-17 and 24-25 years). A qualitative study with descriptive design was implemented across the ages. A total of ten open-ended questions from Ujian Kefahaman Konsep Jirim Pada Aras Submikroskopik (SUKKJPAS) were used to collect the data. 604 secondary students and training institute teachers were chosen using random sampling for this study. The data then were analysed using descriptive study and content analysis. The finding shows that the development of the matter concept on the submicroscopic level among the students is moderate from the scientific explanation aspect and poor from the scientific drawing aspect. Majority of the students has a basic knowledge about scientific explanation and scientific drawing, in fact, the matter concept also has becomes better across the ages from scientific explanation. Hence, this study recommends the teachers to emphasize on generating a drawing during in giving explanation about chemical phenomenon or situation so that the students will have a better understanding and at the same time familiarize the students with the scientific drawing. Students on the other hands should be encouraged to adapt this concept in giving explanation about chemical phenomenon or situation.
The Economy of British Central Africa

No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in deadline time. Reading will encourage your mind and thoughts. Of course, reading will greatly develop your experiences about everything. Reading economy of british central africa is also a way as one of the collective books that gives many advantages. The advantages are not only for you, but for the other peoples with those meaningful benefits.
Mechanical Fluctuations of the Membrane–Skeleton Are Dependent on F-Actin ATPase in Human Erythrocytes

Cell membrane fluctuations (CMF) of human erythrocytes, measured by point dark field microscopy, were shown to depend, to a large extent, on intracellular MgATP (Levin, S.V., and R. Korenstein. 1991. Biophys. J. 60:733–737). The present study extends that investigation and associates CMF with F-actin's ATPase activity. MgATP was found to reconstitute CMF in red blood cell (RBC) ghosts and RBC skeletons to their levels in intact RBCs, with an apparent K d of 0.29 mM. However, neither non-hydrolyzable ATP analogues (AMP-PNP, ATPγS) nor hydrolyzable ones (ITP, GTP), were able to elevate CMF levels. The inhibition of ATPase activity associated with the RBC's skeleton, carried out either by the omission of the MgATP substrate or by the use of several inhibitors (vanadate, phalloidin, and DNase I), resulted in a strong decrease of CMF. We suggest that the actin's ATPase, located at the pointed end of the short actin filament, is responsible for the MgATP stimulation of CMF in RBCs.
TRAVELING SALESMAN PROBLEMS WITH PROFITS: AN OVERVIEW

Traveling Salesman Problems with Profits (TSPs with Profits) are a generalization of the Traveling Salesman Problem (TSP) where it is not necessary to visit all vertices. With each vertex is associated a profit. The objective is to find a route with a satisfying collected profit (maximized) and travel cost (minimized). Applications of these problems arise in contexts such as traveling salesman problems, job scheduling or carrier transportation. In this paper, the existing literature about TSPs with Profits is surveyed.
A Noble Indirect Trust based Link State Routing Scheme using a Robust Route Trust Method for Wireless Sensor Networks

Integration of trust in routing mechanisms already prevalent in Wireless Sensor Networks (WSN) has become an interesting research area of late. Several methods exist for the assignment of trust to the nodes present in a WSN. However the real challenge lies in proper integration of this trust to an existing routing protocol for the synthesis of a trust-aware routing algorithm. In this paper we try to take the help of Geometrical Mean based indirect trust evaluation mechanism for calculation of trust of individual nodes and thereby use the calculated trusts for determination of the different route trusts (RTs). We present a link state routing protocol based only on these indirect trusts which forms the routes and finds the best trustworthy route among them by comparing the values of all the calculated route trusts as for each route present in the network. We have developed three algorithms related to this and have shown their merits. Finally, we compare our work with similar trust integrated routing protocols and show its advantages over them. KeywordsWireless Sensor Network (WSN); Geometric Mean (GM); Direct Trust; Indirect Trust;Route Trust (RT); Base Station (BS); Homogeneous Nodes; Packet Latency; Packet Transmission Rate.
A SURVEY OF TIME SERIES DATA PREDICTION ON SHOPPING MALL

Tremendous amount of data streams are often generated by dynamic environments such as stock’s and bond’s price indices, telecommunications data, audio and video data, Network traffic and data related to various Shopping malls. Mining regular patterns is one of the most important task in data mining. A time series database consists of various sequences of values that are obtained over a stipulated period of time. The values are typically measured at equal time stamps (eg., hourly, daily, weekly) which are sequence of ordered events, with or without concrete notations of time. The function is to mine all the transactional data which describes the behavior of various transactions. In an online business or in a shopping mall, the customers can purchase more than one item at a time. Frequent patterns are those that appear most often in a data set as a collection of various item sets or its subsequences. The algorithms like Apriori and FP Growth are used to mine the frequent patterns of a item set. The Apriori algorithm generates candidate set during its each iteration. It reduces the dataset by removing all the irregular itemsets which does not meet the minimum threshold values from the candidate sets. The most expensive phase of FP Growth algorithm is to generate a candidate set and to mine the database [1] .
High Order Finite Difference Methods with Subcell Resolution for Stiff Multispecies Discontinuity Capturing

In this paper, we extend the high order finite-difference method with sub- cell resolution (SR) in (34) for two-species stiff one-reaction models to multispecies and multireaction inviscid chemical reactive flows, which are significantly more difficult because of the multiple scales generated by different reactions. For reaction problems, when the reaction time scale is very small, the reaction zone scale is also small and the governing equations become very stiff. Wrong propagation speed of discontinu- ity may occur due to the underresolved numerical solution in both space and time. The present SR method for reactive Euler system is a fractional step method. In the convection step, any high order shock-capturing method can be used. In the reaction step, an ODE solver is applied but with certain computed flow variables in the shock region modified by the Harten subcell resolution idea. Several numerical examples of multispecies and multireaction reactive flows are performed in both one and two dimensions. Studies demonstrate that the SR method can capture the correct propaga- tion speed of discontinuities in very coarse meshes. AMS subject classifications: 65M06, 76V05, 80A32
Ergodic theory on moduli spaces

Let M be a compact surface with x(M) < 0 and let G be a compact Lie group whose Levi factor is a product of groups locally isomorphic to SU(2) (for example SU(2) itself). Then the mapping class group rM of M acts on the moduli space X(M) of flat G-bundles over M (possibly twisted by a fixed central element of G). When M is closed, then FM preserves a symplectic structure on X(M) which has finite total volume on M. More generally, the subspace of X(M) corresponding to flat bundles with fixed behavior over AM carries a rM-invariant symplectic structure. The main result is that rM acts ergodically on X(M) with respect to the measure induced by the symplectic structure.
Robust Adaptive Control of Discrete-time Systems with Arbitrary Rate of Variations

In this paper an indirect adaptive regulator is constructed for single-input single-output linear time-varying discrete-time systems. The plant parameters are modeled as a linear combination of known bounded functions which may be fast varying with unknown slowly-varying coeecients that are connned to a convex region. The unknown coeecients are estimated using a gradient type estimator with a projection operation. It is assumed that the system is uniformly N-step reachable, where N is an integer greater than or equal to the system dimension. It is then shown that the resulting closed-loop system is globally stable if the rate of unknown parameter variations and the normalized model errors are suuciently small.
Multiple power-gating domain (multi-VGND) architecture for improved leakage power reduction

Row-based power-gating has recently emerged as a meet-in-the-middle sleep transistor insertion paradigm between cell-level and block-level granularity, in which each layout row defines the unit of gating, and different rows can be clustered and share the same sleep transistor. Previous works, however, assume the availability of a single virtual ground voltage, thus making the decision of whether to gate or not a given cluster a binary choice: a cluster is either gated or not. In this work, we consider a limited set of virtual ground voltages, which allows us to assign to a cluster the virtual ground voltage that offers the best leakage-performance tradeoff for that cluster. We propose two algorithms for solving two power-gating variants: one in which the entire design is gated (given an allowable delay degradation), and another one in which only a subset of the rows is gated (given an allowable delay degradation and sleep transistor area). Our algorithm automatically finds the set of clusters with optimal virtual ground voltages so as to minimize leakage while respecting timing and area constraints. The number of power-gating domains can be user-bounded, in accordance with power grid or library characterization limitations. Results show that multiple virtual ground allow to improve by more than 34% over existing solutions that gate the entire design, and provide sizable savings also for the case of partial power-gating.
Business Rule Verbalization

Business rules should first be specified at the conceptual level, using concepts and languages easily understood by the business domain experts who are best qualified to validate the rules. This paper focuses on the verbalization of static business rules (i.e. constraints and derivation rules that apply to individual states of the business), ignoring dynamic rules relating to state transitions and/or workflows. We propose desirable language criteria for rule verbalization, and orthogonal dimensions by which rule verbalizations may be classified, and illustrate these general qualities with a wide variety of business rule examples, using model fragments depicted graphically in Entity-Relationship, Object-Role Modeling and Unified Modeling Language notations.
Graph-Theoretic Generation of Assembly Plans Part I: Correct Generation of Precedence Graphs

Automatic generation and selection of assembly plans is a problem of great practical importance with many significant cost implications. In this paper, we focus on the constraint satisfaction aspects of this problem which involve the determination of a correct assembly precedence graph from an arbitrarily complex set of design constraints, physical restrictions and pre-established design conditions. We prove that this constraint satisfaction problem (CSP) is NP-complete and provide a graph-theoretic scheme for the generation of assembly plans. Our scheme involves decomposing the CSP into polynomially solvable subproblems, mapping the subproblems onto a “decision graph,” then partitioning the decision graph to obtain correct assembly plans. We then describe a procedure that systematically generates all assembly sequences. In this paper, we focus on key theoretical properties of the proposed framework including its correctness, completeness and inherent computational complexity. To illustrate main elements of the framework we include a simple example in bicycle assembly. In a subsequent (Part II) paper , we discuss computational issues related to decomposition as well as the generation of optimalassembly plans, where optimality is defined in terms of sequencing and scheduling objectives, line balancing metrics, or other graph computable measures. 1. Motivations Assembly is the process of joining separate components and subassemblies together to form a single final assembled unit (e.g. mechanism, device, building etc.). A single assembly task involves joining two or more components or subassemblies together. In many cases, the order in which these tasks are performed is an important consideration. Firstly, many such orders may not be feasible because of physical constraints such as accessibility and
Finite Sample Complexity of Rare Pattern Anomaly Detection

Anomaly detection is a fundamental problem for which a wide variety of algorithms have been developed. However, compared to supervised learning, there has been very little work aimed at understanding the sample complexity of anomaly detection. In this paper, we take a step in this direction by introducing a Probably Approximately Correct (PAC) framework for anomaly detection based on the identification of rare patterns. In analogy with the PAC framework for supervised learning, we develop sample complexity results that relate the complexity of the pattern space to the data requirements needed for PAC guarantees. We instantiate the general result for a number of pattern spaces, some of which are implicit in current state-of-the-art anomaly detectors. Finally, we design a new simple anomaly detection algorithm motivated by our analysis and show experimentally on several benchmark problems that it is competitive with a state-of-the-art detector using the same pattern space.
MEMS Tunable Dual-Wavelength Laser with Large Tuning Range

This paper presents a MEMS tunable dual-wave length laser, which simultaneously achieves wide tuning range and two-longitudinal-mode emission. The construction of this laser is based on Littman external cavity configuration. The key point is to use two micro-mirrors to select two different wavelengths at their independent diffraction modes, and the emission of both wavelengths will be collected through the 0th order of the grating. Meanwhile, wavelength tuning is achieved by rotating one of the mirrors. As a result, a tunable spectral separation of dual-wave length output is obtained. The MEMS device is fabricated by DRIE on SOI wafer, with the size of 3 mm times 3 mm.
Polygonal approximation of uncertain height fields for outdoor navigation

Exploring unstructured and unknown environments is one of the most important tasks of mobile robotics. Usually, in outdoor navigation, exploring unstructured environments is based on or is functional to map-making procedures. This paper deals with the problem of representing and updating maps from height field measurements. A technique for dynamic updating maps, in the presence of bounded uncertainties on the height field is presented. The technique is based on the set membership estimation theory, and allows for adaptive refinement of the environment description.
Agent virtuel et internaute: quelles perceptions et quelles caractéristiques anthropomorphiques attendues?

L’objet de cette etude exploratoire est de mettre a jour les perceptions que les internautes ont des agents virtuels ainsi que leurs attentes en matiere de caracteristiques anthropomorphiques. A la lumiere de 32 entretiens semi-directifs realises aupres d’une population d’internautes, nous nous proposons de recenser les composantes des agents les plus a meme de generer des reponses favorables de la part du visiteur et de favoriser la creation d’un sentiment de presence sociale sur le site.
Prescription drug advertising and consumer stigma about depression: The moderating role of skepticism toward advertising

Abstract The current study was designed to explore how consumers’ exposure to direct-to-consumer advertising (DTCA) of antidepressants would relate to the extent of stigma they hold toward clinical depression, and how such an association would be moderated by the level of skeptical attitudes toward the advertising category. The results showed that when skepticism was low, exposure to DTCA of antidepressants was positively associated with the extent of stigma toward depression. A negative relationship between DTCA exposure and endorsement of stigma was observed only when the level of skepticism was extremely high. In an exploratory analysis, the study further found that among individuals with personal and interpersonal experiences of depression, DTCA exposure might strengthen depression stigma, while such a relationship was not observed among those with a lower level of depression-related life experiences. This study concluded by discussing the implications of the findings for health professionals as well as the practice and social responsibility of DTCA.
Microlensing of Large Sources

We prove an approximate gravitational lensing theorem: the magnification of a source of uniform brightness by a foreground spherical lens is μ = 1 + π(2R - R)/A, where A is the area of the source and RE and RL are the Einstein radius and size of the lens projected into the source plane; this provides an accurate approximation to the exact magnification for R, R ≪ A. Remarkably, this result is independent of the shape of the source or position of the lens (except near the edges). We show that this formula can be generalized to include limb darkening of a circular source by simply inserting the surface brightness at the position of the foreground object (divided by the average surface brightness of the star). We also show that similar formulae apply for a point-mass lens contained in a shear field and mass sheet and for an ensemble of point masses, as long as the Einstein radii are much smaller than the source size. This theorem can be used to compute transit or microlensing light curves for which the foreground star or planet has a size and Einstein radius much smaller than the background star.
Proactive tobacco treatment offering free nicotine replacement therapy and telephone counselling for socioeconomically disadvantaged smokers: a randomised clinical trial

Background Evidenced-based tobacco cessation treatments are underused, especially by socioeconomically disadvantaged smokers. This contributes to widening socioeconomic disparities in tobacco-related morbidity and mortality. Methods The Offering Proactive Treatment Intervention trial tested the effects of a proactive outreach tobacco treatment intervention on population-level smoking abstinence and tobacco treatment use among a population-based sample of socioeconomically disadvantaged smokers. Current smokers (n=2406), regardless of interest in quitting, who were enrolled in the Minnesota Health Care Programs, the state's publicly funded healthcare programmes for low-income populations, were randomly assigned to proactive outreach or usual care. The intervention comprised proactive outreach (tailored mailings and telephone calls) and free cessation treatment (nicotine replacement therapy and intensive, telephone counselling). Usual care comprised access to a primary care physician, insurance coverage of Food and Drug Administration-approved smoking cessation medications, and the state's telephone quitline. The primary outcome was self-reported 6-month prolonged smoking abstinence at 1 year and was assessed by follow-up survey. Findings The proactive intervention group had a higher prolonged abstinence rate at 1 year than usual care (16.5% vs 12.1%, OR 1.47, 95% CI 1.12 to 1.93). The effect of the proactive intervention on prolonged abstinence persisted in selection models accounting for non-response. In analysis of secondary outcomes, use of evidence-based tobacco cessation treatments were significantly greater among proactive outreach participants compared with usual care, particularly combination counselling and medications (17.4% vs 3.6%, OR 5.69, 95% CI 3.85 to 8.40). Interpretation Population-based proactive tobacco treatment increases engagement in evidence-based treatment and is effective in long-term smoking cessation among socioeconomically disadvantaged smokers. Findings suggest that dissemination of population-based proactive treatment approaches is an effective strategy to reduce the prevalence of smoking and socioeconomic disparities in tobacco use. Trial registration number NCT01123967.