Miracle-dz/UniFAR-FTUs huggingface dataset:
Predicting community evolution in social networks

Nowadays, sustained development of different social media can be observed worldwide. One of the relevant research domains intensively explored recently is analysis of social communities existing in social media as well as prediction of their future evolution taking into account collected historical evolution chains. These evolution chains proposed in the paper contain group states in the previous time frames and its historical transitions that were identified using Group Evolution Discovery (GED) method. Based on the observed evolution chains of various length, structural network features are extracted, validated and selected as well as used to learn classification models. The experimental studies were performed on three real datasets with different profile: DBLP, Facebook and Polish blogosphere. The process of group prediction was analysed with respect to different classifiers as well as various descriptive feature sets extracted from evolution chains of different length. The results revealed that, in general, the longer evolution chains the better predictive abilities of the classification models. However, chains of length 3 to 7 enabled the GED-based method to almost reach its maximum possible prediction quality.
OptiqueVQS: Ontology-Based Visual Querying

Visual methods for query formulation undertake the challenge of making querying independent of users’ technical skills and the knowledge of the underlying textual query language and the structure of data. In this paper, we demonstrate an ontology-based visual query system, namely OptiqueVQS, which we have been developing for end users within a large industrial project.
The membrane current of single rod outer segments

1. Outer segments of individual rods in the retina of the toad, Bufo marinus, were drawn into a glass pipette to record the membrane current. 2. Light flashes evoked transient outward currents. The peak response amplitude was related to flash intensity by a Michaelis equation with half‐saturating intensity about 1 photon mum‐2. 3. The saturating response amplitude ranged up to 27 pA and corresponded closely to complete suppression of the steady inward current present in darkness. 4. For a given cell the saturating response amplitude varied linearly with the length of outer segment within the pipette. This is consistent with a uniform density of light‐sensitive channels and negligible gradient of membrane potential along the outer segment. 5. Responses to bright flashes never showed the relaxation from an initial peak seen previously in intracellular voltage recordings, suggesting that the conductance change responsible for the relaxation does not occur in the outer segment. 6. Responses to local illumination of only the recorded outer segment were very similar to those obtained with diffuse light at the same intensity, indicating that peripheral rods made little contribution to the responses. 7. The spectral sensitivity of 'red' rods was consistent with a retinal1‐based pigment with lambda max = 498 +/‐ 2 nm. 8. The kinetics of the response were consistent with four stages of delay affecting action of the internal transmitter. Responses were faster at the basal end of the outer segment than at the distal tip. 9. Background light reduced the sensitivity to a superposed dim test flash and shortened the time course of the response, indicating that adapting light modifies the kinetics and gain of the transduction mechanism within the outer segment. 10. Responses to dim lights exhibited pronounced fluctuations which are attributed in the succeeding paper (Baylor, Lamb & Yau, 1979) to the quantal nature of light.
Local Computation of PageRank Contributions

Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex υ in G, and a parameter δ ∈ (0, 1), compute the set of all vertices that contribute to υ at least a δ-fraction of υ's PageRank. We call this set the δ-contributing set of υ. To this end, we define the contribution vector of υ to be the vector whose entries measure the contributions of every vertex to the PageRank of υ. A local algorithm is one that produces a solution by adaptively examining only a small portion of the input graph near a specified vertex. We give an efficient local algorithm that computes an ε-approximation of the contribution vector for a given vertex by adaptively examining O(1/ε) vertices. Using this algorithm, we give a local approximation algorithm for the primitive defined above. Specifically, we give an algorithm that returns a set containing the δ-contributing set of υ and at most O(1/δ) vertices from the δ/2-contributing set of υ, and that does so by examining at most O(1/δ) vertices. We also give a local algorithm for solving the following problem: If there exist k vertices that contribute a ρ-fraction to the PageRank of υ, find a set of k vertices that contribute at least a (ρ−ε)-fraction to the PageRank of υ. In this case, we prove that our algorithm examines at most O(k/ε) vertices.
Modelling of land cover changes inth CLUE-S in Bac Kan province, Vietnam

This report describes simulations of near-future land use changes with the CLUE-S (Conversion of land use changes and its Effects at Small regional extent) modelling framework for Bac Kan province in Vietnam. CLUE-S consists of a spatial and non-spatial component in which spatial relations between land use and its driving factors as well as scenarios representing developments and policies are included. In this study the CLUE-S model is applied for three different scenarios based on the provincial policies of Bac Kan, Vietnam. Hot-spot maps where compiled to indicate area in which land cover changes will occur in the future. The results of this study are useful for policy makers and land use planners. The provided scientific information can be used as a basis to formulate so-called focus policies on the hot spots and to evaluate alternative policies. CLUE-S is successfully implemented for the heterogeneous landscape of Bac Kan province. Three different scenarios reflecting the policies of the province; rice sufficiency, livestock development and an increase and protection of the forest area, where compiled. The first two scenarios represent different combinations of these policies while the third scenario provides a picture of future land use configurations without these land use policies. These scenarios result in very different spatial patterns of land use change that can help the communication of the possible effect and impact of the policies for different parts of the province.
An adult image recognizing algorithm based on naked body detection

The nude image is an important part in adult images spreading on the Internet. A new recognizing algorithm of nude image based on the navel and body feature is proposed in this paper. The algorithm considers the naked body which is composed by trunk, limb and face as the object to be recognized. Body is taken as a combination of predefined key rectangles. The intersection of the key rectangles is the navel. Firstly, the algorithm recognizes the location of navel in an image. Then it constructs the feature vector of key rectangles. Finally, it classifies the features by Forward Propagation neural network to determine whether there is a naked body in the image or not. Experiments show that the algorithm can recognize nude images accurately, and the recognizing speed can satisfy the requirement of practical systems.
Persistence of activity in noisy motor-filament assemblies

Long, elastic laments cross-linked and deformed by active molecular motors occur in various natural settings. The overall macroscopic mechanical response of such a composite network depends on the coupling between the active and the passive properties of the underlying constituents and nonlocal interactions between dierent parts of the composite. In a simple one dimensional system, using a mean eld model, it has been shown that the combination of motor activity and nite lament extensibility yields a persistence length scale over which strain decays. Here we study a similar system, in the complementary limit of strong noise and moderate extensibility, using Brownian multi-particle collision dynamics-based numerical simulations that includes the coupling between motor kinetics and local lament extensibility. While the numerical model shows deviations from the mean eld predictions due to the presence of strong active noise caused by the variations in individual motor activity, several qualitative features are still retained. Specically, for xed motor attachment and detachment rates, the decay is length is set by the ratio of the passive elasticity to the active shear resistance generated by attached motors. Our study generalizes the notion of persistence in passive thermal systems to actively driven systems with testable predictions. Submitted XXXX, and accepted for publication XXXX
Are we making the most of the Stanford Health Assessment Questionnaire?

For many years, the Stanford Health Assessment Questionnaire (HAQ) has provided an effective measure of disability. Recently, some debate has emerged about whether or not the HAQ is an "ordinal' or "interval' scale. The opportunity to test its level of measurement arose when the scale was applied in a community survey which undertook a two-stage random sample using postal questionnaires to ascertain the health care needs of those with arthritis. The HAQ data are fitted to the Rasch model which tests for the presence of certain desirable characteristics of measurement, e.g. unidimensionality. The fit of the data to the model for those self-reporting rheumatoid arthritis (RA) was adequate. The transformed HAQ score, derived from the Rasch analysis, is compared with the ordinary HAQ (raw) score. This shows that, for those with RA, incremental units of the raw score at the margins of the scale reflect an increasing level of (dis)ability compared to similar units in the centre of the scale. Thus, the traditional HAQ score (range 0-3) is an ordinal score. The findings also indicate that scoring all 20 items may lead to greater sensitivity. Questions are also raised about the construct validity for those with other types of arthritis. For osteoarthrosis, the grip item does not appear to belong to the same underlying construct as the other items.
A Heuristic Estimator for Means-Ends Analysis in Planning

Means-ends analysis is a seemingly well understood search technique, which can be described, using planning terminology, as: keep adding actions that are feasible and achieve pieces of the goal. Unfortunately, it is often the case that no action is both feasible and relevant in this sense. The traditional answer is to make subgoals out of the preconditions of relevant but infeasible actions. These subgoals become part of the search state. An alternative, surprisingly good, idea is to recompute the entire subgoal hierarchy after every action. This hierarchy is represented by a greedy regression-match graph. The actions near the leaves of this graph are feasible and relevant to a sub.subgoals of the original goal. Furthermore, each subgoal is assigned an estimate of the number of actions required to achieve it. This number can be shown in practice to be a useful heuristic estimator for domains that are otherwise intractable.
Feature-Based Partially Occluded Object Recognition

We propose a framework to combine geometry, color and texture information among pairwise feature points into a graph and find the correct assignments from all candidates using graph matching techniques. Because of our informative similarity matrix, objects can be still recognized under severe occlusion and the matching errors can be greatly reduced when images are taken from very different view angles and partial occluded.
ConfluxDB: Multi-Master Replication for Partitioned Snapshot Isolation Databases

Lazy replication with snapshot isolation (SI) has emerged as a popular choice for distributed databases. However, lazy replication often requires execution of update transactions at one (master) site so that it is relatively easy for a total SI order to be determined for consistent installation of updates in the lazily replicated system. We propose a set of techniques that support update transaction execution over multiple partitioned sites, thereby allowing the master to scale. Our techniques determine a total SI order for update transactions over multiple master sites without requiring global coordination in the distributed system, and ensure that updates are installed in this order at all sites to provide consistent and scalable replication with SI. We present ConfluxDB, a PostgreSQL-based implementation of our techniques, and demonstrate its effectiveness through experimental evaluation.
A provable time and space efficient implementation of NESL

In this paper we prove time and space bounds for the implementation of the programming language NESL on various parallel machine models. NESL is a sugared typed &lambda;-calculus with a set of array primitives and an explicit parallel map over arrays. Our results extend previous work on provable implementation bounds for functional languages by considering space and by including arrays. For modeling the cost of NESL we augment a standard call-by-value operational semantics to return two cost measures: a DAG representing the sequential dependence in the computation, and a measure of the space taken by a sequential implementation. We show that a NESL program with w work (nodes in the DAG), d depth (levels in the DAG), and s sequential space can be implemented on a p processor butterfly network, hypercube, or CRCW PRAM using O(w/p + d log p) time and O(s + dp log p) reachable space.1 For programs with sufficient parallelism these bounds are optimal in that they give linear speedup and use space within a constant factor of the sequential space.
Constraints and AI planning

Tackling real-world planning problems often requires considering various types of constraints, which can range from simple numerical comparators to complex resources. This article provides an overview of techniques to deal with such constraints by expressing planning within general constraint-solving frameworks. Our goal here is to explore the interplay of constraints and planning, highlighting the differences between propositional satisfiability (SAT), integer programming (IP), and constraint programming (CP), and discuss their potential in expressing and solving AI planning problems.
Apoptotic Molecular Advances in Breast Cancer Management

Breast cancer is the most common cancer type amongst women, accounting for most fe‐ male cancer deaths second to cervical cancer worldwide. It is, therefore, highly crucial to understand the molecular biology and explore other pathways involved in carcinogenesis in order to select appropriate treatment not only for breast cancer but for other cancers as well. Cancer progression is favoured by DNA damage and in most cases a consequent disruption of the apoptotic pathway, thus leading to uncontrolled cell proliferation. Therefore, current therapeutic strategies aim at targeting the apoptotic pathways in order to combat cancer. In this manuscript, we discuss the ways in which evasion of apoptosis during carcinogenesis occurs and the types of current therapeutic strategies as well as promising future approaches against breast cancer.
Solution to the hierarchy problem with an infinitely large extra dimension and moduli stabilization

We construct a class of solutions to Einstein's equations for dimensions greater than or equal to 6. These solutions are characterized by a non-trivial warp factor and possess a non-compact extra dimension. We study in detail a simple model in six dimensions containing two four-branes. One of each brane's four spatial directions is compactified. The hierarchy problem is resolved by the enormous difference between the warp factors at the positions of the two-branes, with the standard model fields residing on the brane with a small warp factor. Both branes can have positive tensions. Their positions, and the size of the compact dimension, are determined in terms of the fundamental parameters of the theory by a combination of two independent and comparable effects -- an anisotropic contribution to the stress tensor of each brane from quantum fields residing on it and a contribution to the stress tensor from a bulk scalar field. One overall fine-tuning of the parameters of the theory is required -- that for the cosmological constant.
Pulmonary fibrosis: tissue characterization using late-enhanced MRI compared with unenhanced anatomic high-resolution CT.

PURPOSE We aimed to prospectively evaluate anatomic chest computed tomography (CT) with tissue characterization late gadolinium-enhanced magnetic resonance imaging (MRI) in the evaluation of pulmonary fibrosis (PF). METHODS Twenty patients with idiopathic pulmonary fibrosis (IPF) and twelve control patients underwent late-enhanced MRI and high-resolution CT. Tissue characterization of PF was depicted using a segmented inversion-recovery turbo low-angle shot MRI sequence. Pulmonary arterial blood pool nulling was achieved by nulling main pulmonary artery signal. Images were read in random order by a blinded reader for presence and extent of overall PF (reticulation and honeycombing) at five anatomic levels. Overall extent of IPF was estimated to the nearest 5% as well as an evaluation of the ratios of IPF made up of reticulation and honeycombing. Overall grade of severity was dependent on the extent of reticulation and honeycombing. RESULTS No control patient exhibited contrast enhancement on lung late-enhanced MRI. All IPF patients were identified with late-enhanced MRI. Mean signal intensity of the late-enhanced fibrotic lung was 31.8±10.6 vs. 10.5±1.6 for normal lung regions, P < 0.001, resulting in a percent elevation in signal intensity from PF of 204.8%±90.6 compared with the signal intensity of normal lung. The mean contrast-to-noise ratio was 22.8±10.7. Late-enhanced MRI correlated significantly with chest CT for the extent of PF (R=0.78, P = 0.001) but not for reticulation, honeycombing, or coarseness of reticulation or honeycombing. CONCLUSION Tissue characterization of IPF is possible using inversion recovery sequence thoracic MRI.
Predicting power-optimal kinematics of avian wings

A theoretical model of avian flight is developed which simulates wing motion through a class of methods known as predictive simulation. This approach uses numerical optimization to predict power-optimal kinematics of avian wings in hover, cruise, climb and descent. The wing dynamics capture both aerodynamic and inertial loads. The model is used to simulate the flight of the pigeon, Columba livia, and the results are compared with previous experimental measurements. In cruise, the model unearths a vast range of kinematic modes that are capable of generating the required forces for flight. The most efficient mode uses a near-vertical stroke–plane and a flexed-wing upstroke, similar to kinematics recorded experimentally. In hover, the model predicts that the power-optimal mode uses an extended-wing upstroke, similar to hummingbirds. In flexing their wings, pigeons are predicted to consume 20% more power than if they kept their wings full extended, implying that the typical kinematics used by pigeons in hover are suboptimal. Predictions of climbing flight suggest that the most energy-efficient way to reach a given altitude is to climb as steeply as possible, subjected to the availability of power.
Gadolinium-enhanced MR imaging of thyroid and parathyroid masses.

PURPOSE To evaluate spin-echo and contrast material-enhanced dynamic magnetic resonance (MR) imaging in characterization of thyroid and parathyroid masses. MATERIALS AND METHODS Conventional T1- and T2-weighted, gadolinium-enhanced dynamic, and gadolinium-enhanced T1-weighted spin-echo imaging sequences were performed in 85 patients with thyroid and parathyroid tumors. Findings from spin-echo imaging and dynamic curve patterns from mean signal intensity ratios were evaluated for each histologic tumor type. RESULTS T1- and T2-weighted imaging did not enable differentiation of benign from malignant tumors. Primary thyroid lymphoma enhanced less than other solid thyroid tumors, and parathyroid adenoma also enhanced less than other tumors (P < . 05 compared with papillary carcinoma. CONCLUSION Gadolinium-enhanced MR imaging cannot enable prediction of histologic type in thyroid and parathyroid tumors. However, in cases of multiple tumors, the technique may improve the contrast between the different histologic types and sometimes suggest the diagnosis of primary thyroid lymphoma or parathyroid adenoma.
An optimization approach for extracting and encoding consistent maps in a shape collection

We introduce a novel approach for computing high quality point-to-point maps among a collection of related shapes. The proposed approach takes as input a sparse set of imperfect initial maps between pairs of shapes and builds a compact data structure which implicitly encodes an improved set of maps between all pairs of shapes. These maps align well with point correspondences selected from initial maps; they map neighboring points to neighboring points; and they provide cycle-consistency, so that map compositions along cycles approximate the identity map. The proposed approach is motivated by the fact that a complete set of maps between all pairs of shapes that admits nearly perfect cycle-consistency are highly redundant and can be represented by compositions of maps through a single base shape. In general, multiple base shapes are needed to adequately cover a diverse collection. Our algorithm sequentially extracts such a small collection of base shapes and creates correspondences from each of these base shapes to all other shapes. These correspondences are found by global optimization on candidate correspondences obtained by diffusing initial maps. These are then used to create a compact graphical data structure from which globally optimal cycle-consistent maps can be extracted using simple graph algorithms. Experimental results on benchmark datasets show that the proposed approach yields significantly better results than state-of-the-art data-driven shape matching methods.
De Novo Transcriptome Sequencing Analysis of cDNA Library and Large-Scale Unigene Assembly in Japanese Red Pine (Pinus densiflora)

Japanese red pine (Pinus densiflora) is extensively cultivated in Japan, Korea, China, and Russia and is harvested for timber, pulpwood, garden, and paper markets. However, genetic information and molecular markers were very scarce for this species. In this study, over 51 million sequencing clean reads from P. densiflora mRNA were produced using Illumina paired-end sequencing technology. It yielded 83,913 unigenes with a mean length of 751 bp, of which 54,530 (64.98%) unigenes showed similarity to sequences in the NCBI database. Among which the best matches in the NCBI Nr database were Picea sitchensis (41.60%), Amborella trichopoda (9.83%), and Pinus taeda (4.15%). A total of 1953 putative microsatellites were identified in 1784 unigenes using MISA (MicroSAtellite) software, of which the tri-nucleotide repeats were most abundant (50.18%) and 629 EST-SSR (expressed sequence tag- simple sequence repeats) primer pairs were successfully designed. Among 20 EST-SSR primer pairs randomly chosen, 17 markers yielded amplification products of the expected size in P. densiflora. Our results will provide a valuable resource for gene-function analysis, germplasm identification, molecular marker-assisted breeding and resistance-related gene(s) mapping for pine for P. densiflora.