Miracle-dz/UniFAR-FTUs huggingface dataset:
Impact of Selective Evidence Presentation on Judgments of Health Inequality Trends: An Experimental Study

Reducing health inequalities is a key objective for many governments and public health organizations. Whether inequalities are measured on the absolute (difference) or relative (ratio) scale can have a significant impact on judgments about whether health inequalities are increasing or decreasing, but both of these measures are not often presented in empirical studies. In this study we investigated the impact of selective presentation of health inequality measures on judgments of health inequality trends among 40 university undergraduates. We randomized participants to see either a difference or ratio measure of health inequality alongside raw mortality rates in 5 different scenarios. At baseline there were no differences between treatment groups in assessments of inequality trends, but selective exposure to the same raw data augmented with ratio versus difference inequality graphs altered participants’ assessments of inequality change. When absolute inequality decreased and relative inequality increased, exposure to ratio measures increased the probability of concluding that inequality had increased from 32.5% to 70%, but exposure to difference measures did not (35% vs. 25%). Selective exposure to ratio versus difference inequality graphs thus increased the difference between groups in concluding that inequality had increased from 2.5% (95% CI −9.5% to 14.5%) to 45% (95% CI 29.4 to 60.6). A similar pattern was evident for other scenarios where absolute and relative inequality trends gave conflicting results. In cases where measures of absolute and relative inequality both increased or both decreased, we did not find any evidence that assignment to ratio vs. difference graphs had an impact on assessments of inequality change. Selective reporting of measures of health inequality has the potential to create biased judgments of progress in ameliorating health inequalities.
Incremental shared nearest neighbor density-based clustering

Shared Nearest Neighbor Density-based clustering (SNN-DBSCAN) is a robust graph-based clustering algorithm and has wide applications from climate data analysis to network intrusion detection. We propose an incremental extension to this algorithm IncSNN-DBSCAN, capable of finding clusters on a dataset to which frequent inserts are made. For each data point, the algorithm maintains four properties: nearest neighbor list, strengths of shared links, total connection strength and topic property. Algorithm only targets points that undergo change to their properties. We prove that, to obtain the exact clustering it is sufficient to re-compute properties for only the targeted points, followed by possible cluster mergers on newly formed links and cluster splits on the deleted links. Experiments on KDD Cup 1999 and Mopsi search engine 2012 datasets respectively demonstrate 75% and 99% reduction in the size of the set of points involved in property re-computations. By avoiding most of the redundant property computations, algorithm generates speedup up to 250 and 1000 times respectively on those datasets, while generating the exact same clustering as the non-incremental algorithm. We experimentally verify our claim for up to 2500 inserts on both datasets. However, speedup comes at the cost of up to 48 times more memory usage.
Additivity versus attenuation : the role of culture in the resolution of information incongruity

Past research on dual process models of persuasion has documented that, when faced with information incongruity, individuals tend to form product evaluations by attenuating the less diagnostic information, relying solely on the more diagnostic information. The current research suggests that this way of resolving incongruity may be culture specific. Consistent with recent research in cultural psychology, this study shows that individuals in a North American culture tend to follow the attenuation strategy, whereas individuals in an East Asian culture tend to follow an additive strategy in which both pieces of information are combined to jointly influence evaluations (Experiment 1). Experiments 2 and 3 provide further support for the proposed psychological mechanism underlying these findings and also identify boundary conditions for these findings. Implications for understanding choice mind-sets, the moderating role of justification on evaluations, and cultural limitations in incongruity resolution are discussed.
Video sharing on OSNs using a distributed algorithm

Online Social Networks (OSNs) have become one of the most popular sites for sharing contents on the web recently. These online social networks are one of the most popular sites on the web. It provides an efficient way for sharing and finding contents like videos, photos etc on the net. But its development is highly affected by the client and server architecture used in the current online social network systems, which are really very expensive in case of the storage and also in terms of the servers bandwidth. It is also not very compatible with the increasing number of users and content shared on an online social network. The main aim of the work is to reduce the server load and manage the buffer in an efficient manner. The server load is reduced by implementing a distributed algorithm for the efficient P2P video sharing, a peak algorithm for splitting the video into chunks in an effective manner, for quick delivery of contents to the users, a chunk delivery and scheduling algorithm. The video sharing technique used can provide users a better video viewing experience and the system scalability over the present video sharing techniques and is also used for a better video viewing performance.
Ongoing Speciation in the Tibetan Plateau Gymnocypris Species Complex

Local adaptation towards divergent ecological conditions often results in genetic differentiation and adaptive phenotypic divergence. To illuminate the ecological distinctiveness of the schizothoracine fish, we studied a Gymnocypris species complex consisting of three morphs distributed across four bodies of water (the Yellow River, Lake Qinghai, the Ganzi River and Lake Keluke) in the Northeast Tibetan Plateau. We used a combination of mitochondrial (16S rRNA and Cyt b) and nuclear (RAG-2) genetic sequences to investigate the phylogeography of these morphs based on a sample of 277 specimens. Analysis of gill rakers allowed for mapping of phenotypic trajectories along the phylogeny. The phylogenetic and morphological analyses showed that the three sparsely rakered morphs were present at two extremes of the phylogenetic tree: the Yellow River morphs were located at the basal phylogenetic split, and the Lake Keluke and Ganzi River morphs at the peak, with the densely rakered Lake Qinghai morphs located between these two extremes. Age estimation further indicated that the sparsely rakered morphs constituted the oldest and youngest lineages, whereas the densely rakered morph was assigned to an intermediate-age lineage. These results are most compatible with the process of evolutionary convergence or reversal. Disruptive natural selection due to divergent habitats and dietary preferences is likely the driving force behind the formation of new morphs, and the similarities between their phenotypes may be attributable to the similarities between their forms of niche tracking associated with food acquisition. This study provides the first genetic evidence for the occurrence of convergence or reversal in the schizothoracine fish of the Tibetan Plateau at small temporal scales.
A remote sleep-monitoring medical alarm system

Monitoring sleep state and sending out alarm signal according to the state and the acute disease belong to the area of sleep basic research and prediction of outbreaks of diseases. The system includes: monitoring and analyzing the sleeper pulse's physiological parameters, the embedded computer judge whether or not the sleeper suffers acute disease(heart disease, cerebral haemorrhage, etc). If so, the wrist pulse monitoring device sends the wireless alarm signal. When the bedside wireless receiver receives the alarm, it can send sound or telephone alarm. The sound alarm can explicitly tell nearby accompanists, the telephone sound alarm can give an alarm according to the telephone number set in advance, and inform relevant personnel, may also inform the 120 emergency center. At the same time, the bedside wireless remote devices open the door to wait for the arrival of emergency personnel. When acute diseases suddenly break at night, the system can effectively solve the patients emergency treatment, and creates the condition for the patient's prompt treatment.
Learning Based Combining Different Features for Medical Image Retrieval

In this paper, authors propose a new learning based method for medical image retrieval which is based on fusing different features by linearly combining different similarities. Considering the abundant classes of medical images, this paper avoid to train a classifier for each class by using large amount training data. Instead, by using optimization method to combine different features’ similarity, new method can get good performance while has no much training computation. Experimental results show that the algorithm has potential practical values for clinical routine application.
\have Your Data and Index It, Too" Eecient Storage and Indexing for Data Warehouses

Two possible strategies may be utilized to enhance the eeciency of processing OLAP queries: (a) precomputation strategies (e.g., view materialization, realizing data cubes), and (b) ad-hoc strategies. While a signiicant amount of work has been done in developing precomputation strategies, it is generally recognized that it is diicult to materialize the answers to all possible queries. Thus, ad-hoc querying must be supported in data warehouses. This realization has sparked an interest in exploring indexing strategies suitable for OLAP queries. There appears to have been relatively little work done in ad-hoc query support for data warehouses 45, 46, 55, 39]. In this paper we propose DataIndexes as a new paradigm for storing the base data. An attractive feature of DataIndexes is that they serve as indexes as well as the store of base data. Thus, DataIndexes actually deene a physical design strategy for a data warehouse where the indexing, for all intents and purposes, comes for \free". We also present two eecient algorithms for performing star-joins with DataIndexes. In addition, we present a mathematical analysis of all the indexes presented by O'Neil and Quass as well as our DataIndexes and present analytical expressions categorizing the cost of query evaluation using these structures for range selections and star-joins, two common classes of queries in OLAP. These aid in performing an analysis yielding precise \break-even" points for comparing these indexing alternatives. Overall, it turns out that DataIndexes are very attractive in a wide variety of cases in terms of enhancing the performance of range and star-join queries in data warehouses.
Exploiting Need of Data Mining Services in Mobile Computing Environments

Data mining services play an important role in the field of Communication industry. In this paper, we discuss and analyze the consumptive behavior based on data mining technology. We discuss and analyze different aspects of data mining techniques and their behavior in mobile devices. We also analyze the better method or rule of data mining services which is more suitable for mobile devices. The method this paper mentioned has benefit to analyze large numbers of data in consumptive behaviors and provides some instructions to improve better marketing in concerned fields. It also prompts that using data mining can clean up current pricing packages market to create more practical packages to consumers. In this paper we use J2ME components like CLDC (Connected Limited Device Configuration) and MIDP (Mobile Information Device Profile) with data mining services (DMS) that provide local storage, a user interface, and networking capabilities that runs on mobile computing devices. We also discuss the need of data mining services in mobile devices to enhance the capability of mobile devices.
Measuring context relevance for adaptive semantics visualizations

Semantics visualizations enable the acquisition of information to amplify the acquisition of knowledge. The dramatic increase of semantics in form of Linked Data and Linked-Open Data yield search databases that allow to visualize the entire context of search results. The visualization of this semantic context enables one to gather more information at once, but the complex structures may as well confuse and frustrate users. To overcome the problems, adaptive visualizations already provide some useful methods to adapt the visualization on users' demands and skills. Although these methods are very promising, these systems do not investigate the relevance of semantic neighboring entities that commonly build most information value. We introduce two new measurements for the relevance of neighboring entities: The Inverse Instance Frequency allows weighting the relevance of semantic concepts based on the number of their instances. The Direct Relation Frequency inverse Relations Frequency measures the relevance of neighboring instances by the type of semantic relations. Both measurements provide a weighting of neighboring entities of a selected semantic instance, and enable an adaptation of retinal variables for the visualized graph. The algorithms can easily be integrated into adaptive visualizations and enhance them with the relevance measurement of neighboring semantic entities. We give a detailed description of the algorithms to enable a replication for the adaptive and semantics visualization community. With our method, one can now easily derive the relevance of neighboring semantic entities of selected instances, and thus gain more information at once, without confusing and frustrating users.
Discriminating Intercalative Effects of Threading Intercalator Nogalamycin, from Classical Intercalator Daunomycin, Using Single Molecule Atomic Force Spectroscopy

DNA threading intercalators are a unique class of intercalating agents, albeit little biophysical information is available on their intercalative actions. Herein, the intercalative effects of nogalamycin, which is a naturally-occurring DNA threading intercalator, have been investigated by high-resolution atomic force microscopy (AFM) and spectroscopy (AFS). The results have been compared with those of the well-known chemotherapeutic drug daunomycin, which is a non-threading classical intercalator bearing structural similarity to nogalamycin. A comparative AFM assessment revealed a greater increase in DNA contour length over the entire incubation period of 48 h for nogalamycin treatment, whereas the contour length increase manifested faster in case of daunomycin. The elastic response of single DNA molecules to an externally applied force was investigated by the single molecule AFS approach. Characteristic mechanical fingerprints in the overstretching behaviour clearly distinguished the nogalamycin/daunomycin-treated dsDNA from untreated dsDNA—the former appearing less elastic than the latter, and the nogalamycin-treated DNA distinguished from the daunomycin-treated DNA—the classically intercalated dsDNA appearing the least elastic. A single molecule AFS-based discrimination of threading intercalation from the classical type is being reported for the first time.
Towards a Theory of Multiparty Information Complexity

Communication complexity seeks to characterize the complexity of computation by measuring the amount of communication that must be used by players computing the output of some function f , each of whom have only partial information about the inputs to f . The past thirty years have seen the development of a number of lower-bound techniques in communication complexity, which fall roughly into two categories: rectangle-based techniques, which rely on combinatorial properties of the lookup table for f , and information-based techniques, which rely on bounds on the entropy in a communication protocol. Recently, [JK, BW12, KLL+12] have drawn a close-to-complete picture of the relationships among the various lower-bound techniques in the two-party communication model, concluding that information-based techniques are at least as good as almost all known rectangle-based techniques. Meanwhile, in the multiparty model, where, thus far, information bounds have not been used, it seems that new methods are required to prove nontrivial lower bounds when the number of players is large (logarithmic in the input size). Such bounds are important for one of the key applications of communication complexity— circuit lower bounds. Furthermore, it is conjectured that current techniques are insufficient to tightly characterize the complexity of some functions important both within communication complexity and for various applications, in particular the set disjointness function. In this thesis, we will investigate the possibility of extending information-based techniques to the case of more than two players. We prove the first nontrivial lower bounds on the information in a k-player protocol for k > 2, introducing a new sensitivity-based method to lower-bound information. We discuss progress towards extending our technique to randomized multiparty communication models.
Intraguild Predation Dynamics in a Lake Ecosystem Based on a Coupled Hydrodynamic-Ecological Model: The Example of Lake Kinneret (Israel)

The food web of Lake Kinneret contains intraguild predation (IGP). Predatory invertebrates and planktivorous fish both feed on herbivorous zooplankton, while the planktivorous fish also feed on the predatory invertebrates. In this study, a complex mechanistic hydrodynamic-ecological model, coupled to a bioenergetics-based fish population model (DYCD-FISH), was employed with the aim of revealing IGP dynamics. The results indicate that the predation pressure of predatory zooplankton on herbivorous zooplankton varies widely, depending on the season. At the time of its annual peak, it is 10–20 times higher than the fish predation pressure. When the number of fish was significantly higher, as occurs in the lake after atypical meteorological years, the effect was a shift from a bottom-up controlled ecosystem, to the top-down control of planktivorous fish and a significant reduction of predatory and herbivorous zooplankton biomass. Yet, seasonally, the decrease in predatory-zooplankton biomass was followed by a decrease in their predation pressure on herbivorous zooplankton, leading to an increase of herbivorous zooplankton biomass to an extent similar to the base level. The analysis demonstrates the emergence of non-equilibrium IGP dynamics due to intra-annual and inter-annual changes in the physico-chemical characteristics of the lake, and suggests that IGP dynamics should be considered in food web models in order to more accurately capture mass transfer and trophic interactions.
How Manual Object Exploration is Associated with 7- to 8-Month-Old Infants’ Visual Prediction Abilities in Spatial Object Processing

The present experiment examined whether infants’ visual prediction performance of the appearance of objects moving in space is related to their manual object exploration ability. Fifty-five 7- to 8-month-old infants were tested. A visual object prediction paradigm was developed during which a three-dimensional object was presented in a live eye-tracking setting. During familiarization, the object rotated back and forth along the vertical axis. While the object was moving, two target parts of it were briefly occluded from view and uncovered again as the object changed its direction of motion. In the test phase, the entire object was rotated around 90° and now rotated along the horizontal axis. We recorded infants’ eye movements directed at the target locations and analyzed the prediction rates. All of the infants also participated in a manual object exploration task, in which they freely explored five toy blocks. Infants with a higher level of object exploration skill had higher prediction rates during test trials as compared to infants with less proficient object exploratory actions. The results support the interpretation that advanced manual object exploration experience is associated with infants’ advanced visual prediction ability of the appearance of objects moving in space.
Research on the Model of the Inverted Pendulum and Its Control Based on Biped Robot

Many researchers have been encouraged to investigate the design, posture and stability of biped robots in order to replicate the anthropoid gait. In this paper we develop a simple model of biped robot, which is based on the humanpsilas walking course and the humanpsilas physical structure. Then we have the research on the gait planning of biped robot, and we achieve the comparability between the biped walking and the double inverted pendulum. So we may simulate the biped walking using the balancing of the double inverted pendulum.
Comparative Review of e-service Maturity Models: 6I Model

This paper examines what are known as the ‘maturity models’ or the ‘stage-ladder models’ which all share stages of growth or maturity with one common point; the implication of the evolution of eservices in series of stages moving upward to embody the notion of a continual process improvement. However, this paper suggests a new model called the six dimension model (6I) that provides a framework for a detailed description of what each stage involves in terms of e-service characterization. It attempts to provide a common/standard characterization of the features of each stage and thereby enhances previous models
Source Prefix Filtering in ROFL Technical Report CUCS-033-09

Traditional firewalls have the ability to allow or block traffic based on source address as well as destination address and port number. Our original ROFL scheme implements firewalling by layering it on top of routing; however, the original proposal focused just on destination address and port number. Doing route selection based in part on source addresses is a form of policy routing, which has started to receive increased amounts of attention. In this paper, we extend the original ROFL (ROuting as the Firewall Layer) scheme by including source prefix constraints in route announcement. We present algorithms for route propagation and packet forwarding, and demonstrate the correctness of these algorithms using rigorous proofs. The new scheme not only accomplishes the complete set of filtering functionality provided by traditional firewalls, but also introduces a new direction for policy routing.
VMKit: a substrate for managed runtime environments

Managed Runtime Environments (MREs), such as the JVM and the CLI, form an attractive environment for program execution, by providing portability and safety, via the use of a bytecode language and automatic memory management, as well as good performance, via just-in-time (JIT) compilation. Nevertheless, developing a fully featured MRE, including e.g. a garbage collector and JIT compiler, is a herculean task. As a result, new languages cannot easily take advantage of the benefits of MREs, and it is difficult to experiment with extensions of existing MRE based languages. This paper describes and evaluates VMKit, a first attempt to build a common substrate that eases the development of high-level MREs. We have successfully used VMKit to build two MREs: a Java Virtual Machine and a Common Language Runtime. We provide an extensive study of the lessons learned in developing this infrastructure, and assess the ease of implementing new MREs or MRE extensions and the resulting performance. In particular, it took one of the authors only one month to develop a Common Language Runtime using VMKit. VMKit furthermore has performance comparableto the well established open source MREs Cacao, Apache Harmony and Mono, and is 1.2 to 3 times slower than JikesRVM on most of the Dacapo benchmarks.