Miracle-dz/UniFAR-FTUs huggingface dataset:
Link prediction in Sina Microblog using comprehensive features and improved SVM algorithm

Sina Microblog has become one of the most popular social networks in recent years. As a result, many interdisciplinary research directions of traditional social network have been conducted to it. But the link prediction problem in Sina Microblog has not drawn much attention till now. In this paper, we conduct a research of link prediction in Sina Microblog. According to the characteristics of Sina Microblog, we propose an effective and comprehensive feature set for link prediction in Sina Microblog. Then we apply fast classification algorithm for polynomial kernel support vector machines (FCPKSVM) to train our classifier and by transferring most of calculation from prediction phase to training phase, time complexity in prediction phase is greatly reduced. We show that a machine learning classifier trained using the proposed feature set can obtain comparable and good prediction performance for link prediction in Sina Microblog, and by introducing FCPKSVM, our method achieves far less time complexity in prediction phase compared with other classical classifiers.
Text Based Similarity Metrics and Delta for Semantic Web Graphs

Recognizing that two Semantic Web documents or graphs are similar and characterizing their differences is useful in many tasks, including retrieval, updating, version control and knowledge base editing. We describe several text-based similarity metrics that characterize the relation between Semantic Web graphs and evaluate these metrics for three specific cases of similarity: similarity in classes and properties, similarity disregarding differences in base-URIs, and versioning relationship. We apply these techniques for a specific use case - generating a delta between versions of a Semantic Web graph. We have evaluated our system on several tasks using a collection of graphs from the archive of the Swoogle Semantic Web search engine.
Towards dynamic backward slicing of model transformations

Model transformations are frequently used means for automating software development in various domains to improve quality and reduce production costs. Debugging of model transformations often necessitates identifying parts of the transformation program and the transformed models that have causal dependence on a selected statement. In traditional programming environments, program slicing techniques are widely used to calculate control and data dependencies between the statements of the program. Here we introduce program slicing for model transformations where the main challenge is to simultaneously assess data and control dependencies over the transformation program and the underlying models of the transformation. In this paper, we present a dynamic backward slicing approach for both model transformation programs and their transformed models based on automatically generated execution trace models of transformations.
Distribution and synaptic localization of immunocytochemically identified NMDA receptor subunit proteins in sensory-motor and visual cortices of monkey and human

NMDA receptors are composed of multiple receptor subunit proteins, of which NMDAR1 appears to be a critical component for normal receptor function (Nakanishi, 1992). In this study, quantitative immunocytochemical methods were used at the light and electron microscopic levels to localize NMDAR1 subunits in the primary motor (M1) and somatic sensory (S1) cortex of monkeys, and in the primary visual cortices (V1) of monkey and human. Three principal features of NMDAR1 subunit organization were examined in detail in the monkey cortex: (1) the laminar and cellular distribution patterns, relying in part on double-labeling paradigms with the calcium-binding proteins parvalbumin (PV) and calretinin (CR) as markers for discrete subpopulations of GABAergic interneurons; (2) the codistribution of NMDAR1 subunits with non-NMDA ionotropic receptor subunits; (3) a quantitative assessment of the percentages of asymmetrical synapses in layers II/III, IV, and V/VI that were NMDAR1 immunoreactive. In monkey M1, S1, and V1, NMDAR 1 immunoreactivity was present in all layers, localized primarily to large numbers of pyramidal cell somata and proximal apical dendrites, to presumptive spiny stellate cells in layer IV of V1, and to the vast majority (approximately 80–90%) of PV- immunoreactive cells. By contrast, NMDAR1 immunoreactivity was present in only a very small percentage of the CR-immunoreactive cells (approximately 6–9%). Colocalization with non-NMDA receptor subunits showed that all cells (100%) that contained GluR2/3 subunits were also NMDAR1 immunoreactive. In addition, the complete codistribution of GluR5/6/7 subunits with GluR2/3 subunits suggests, indirectly, that all GluR5/6/7-immunoreactive cells are also NMDAR1 immunoreactive. The laminar and cellular distribution patterns of immunostaining in human V1 were very similar to those in monkey V1. Electron microscopy of monkey sections confirmed an extensive dendritic and synaptic localization of NMDAR1 subunits. Labeling of synapses was present on asymmetrical postsynaptic densities associated with both dendritic shafts and spines. In supragranular layers of V1, a greater percentage of asymmetrical synapses were NMDAR1 immunopositive (44%) in comparison to layer IVC beta (34%) or deep layers (19%). In contrast, in area 3b of S1, the percentage of labeled synapses was greatest in layer IV (45%) in comparison to superficial (26%) and deep (37%) layers, while in M1, the percentages of labeled synapses were similar between superficial (46%) and deep (40%) layers. Taken together, these data indicate that NMDAR1-immunoreactive cells in neocortex represent a morphologically, functionally, and neurochemically heterogeneous population. (ABSTRACT TRUNCATED AT 400 WORDS)
Controlled Language Applications Workshop ( CLAW ) Workshop Programme 14 : 00 – 14 : 15

The texts of legislation and regulation must be structured and augmented in order to allow for semantic web services (querying, linking, and inference). However, it is difficult to accurately parse and semantically represent such texts due to conventional practices of the legal community, the length and complexity of legal language, and the textual ground of the law. Controlled natural languages have been proposed as an approach to adjust to the difficulties, where the source text is rewritten in some standard form. However, such an approach has not suited legal language due to its requirements and complexities, so standardization has been difficult to achieve. To navigate between the requirements and complexities of legal language, standardization, and a fully controlled natural language, we take a position to propose and exemplify an approach to a high-level controlled language, which is adapted to the legal domain, correlates with the source text, and also facilitates analysis for semantic web applications. The approach can make use of some available NLP processing tools.
Lower bounds for non-commutative computation

JVe consider algebraic computations which are not allowed to rely on the commut,at,ivity of multiplication. We obtain various lower bounds for algebraic formula size in this model: (1) Computing the determinant is as hard as computing the permanent and tight exponential upper and lower bounds are given. (2) Computation cannot be parallelized, as opposed to in the commutative case – this solves in the negative an open problem of hliller et al [8]. (3) The question of the power of negation in this model is shown to be closely related to a well known open problem relating communication complexity and rank. We then take modest steps towards extending our results to general, commutative algebraic computation, and prove exponential lower bounds for monotone algebraic circuit size, as well as for the size of certain types of constant depth algebraic circuits.
Multiple-locus variable-number tandem repeat analysis of Salmonella Enteritidis isolates from human and non-human sources using a single multiplex PCR

Simplified multiple-locus variable-number tandem repeat analysis (MLVA) was developed using one-shot multiplex PCR for seven variable-number tandem repeats (VNTR) markers with high diversity capacity. MLVA, phage typing, and PFGE methods were applied on 34 diverse Salmonella Enteritidis isolates from human and non-human sources. MLVA detected allelic variations that helped to classify the S. Enteritidis isolates into more evenly distributed subtypes than other methods. MLVA-based S. Enteritidis clonal groups were largely associated with sources of the isolates. Nei's diversity indices for polymorphism ranged from 0.25 to 0.70 for seven VNTR loci markers. Based on Simpson's and Shannon's diversity indices, MLVA had a higher discriminatory power than pulsed field gel electrophoresis (PFGE), phage typing, or multilocus enzyme electrophoresis. Therefore, MLVA may be used along with PFGE to enhance the effectiveness of the molecular epidemiologic investigation of S. Enteritidis infections.
A Combretastatin-Mediated Decrease in Neutrophil Concentration in Peripheral Blood and the Impact on the Anti-Tumor Activity of This Drug in Two Different Murine Tumor Models

The vascular disrupting agent combretastatin A-4 disodium phosphate (CA4P) induces fluctuations in peripheral blood neutrophil concentration. Because neutrophils have the potential to induce both vascular damage and angiogenesis we analyzed neutrophil involvement in the anti-tumoral effects of CA4P in C3H mammary carcinomas in CDF1 mice and in SCCVII squamous cell carcinomas in C3H/HeN mice. Flow cytometry analyses of peripheral blood before and up to 144 h after CA4P administration (25 and 250 mg/kg) revealed a decrease 1 h after treatment, followed by an early (3–6 h) and a late (>72 h) increase in the granulocyte concentration. We suggest that the early increase (3–6 h) in granulocyte concentration was caused by the initial decrease at 1 h and found that the late increase was associated with tumor size, and hence independent of CA4P. No alterations in neutrophil infiltration into the C3H tumor after CA4P treatment (25 and 250 mg/kg) were found. Correspondingly, neutrophil depletion in vivo, using an anti-neutrophil antibody, followed by CA4P treatment (25 mg/kg) did not increase the necrotic fraction in C3H tumors significantly. However, by increasing the CA4P dose to 250 mg/kg we found a significant increase of 359% in necrotic fraction when compared to neutrophil-depleted mice; in mice with no neutrophil depletion CA4P induced an 89% change indicating that the presence of neutrophils reduced the effect of CA4P. In contrast, neither CA4P nor 1A8 affected the necrotic fraction in the SCCVII tumors significantly. Hence, we suggest that the initial decrease in granulocyte concentration was caused by non-tumor-specific recruitment of neutrophils and that neutrophils may attenuate CA4P-mediated anti-tumor effect in some tumor models.
Statistical Learning AlgorithmsBased on Bregman DistancesJohn

| We present a class of statistical learning algorithms formulated in terms of minimizing Breg-man distances, a family of generalized entropy measures associated with convex functions. The inductive learning scheme is akin to growing a decision tree, with the Bregman distance lling the role of the impurity function in tree-based classiiers. Our approach is based on two components. In the feature selection step, each linear constraint in a pool of candidate features is evaluated by the reduction in Bregman distance that would result from adding it to the model. In the constraint satisfaction step, all of the parameters are adjusted to minimize the Bregman distance subject to the chosen constraints. We introduce a new iterative estimation algorithm for carrying out both the feature selection and constraint satisfaction steps, and outline a proof of the convergence of these algorithms.
Program Comprehension For Reverse Engineering

INTRODUCTION: REVERSE ENGINEERING This paper motivates and describes a research program in the area of reverse engineering being conducted at the Georgia Institute of Technology. Reverse engineering is an emerging interest area within the software engineering eld. Software engineering itself is concerned with improving the productivity of the software development process and the quality of the systems it produces. However, as currently practiced, the majority of the software development eeort is spent on maintaining existing systems rather than developing new ones. Estimates of the proportion of resources and time devoted to maintenance range from 50% to 80%. Boehm, 1981] The greatest part of the software maintenance process is devoted to understanding the system being maintained. Fjeldstad and Hamlen report that 47% and 62% of time spent on actual enhancement and correction tasks, respectively, are devoted to comprehension activities. These involve reading the documentation , scanning the source code, and understanding the changes to be made. Fjeldstad and Hamlen, 1979] The implications are that if we want to improve software development, we should look at maintenance, and if we want to improve maintenance, we should facilitate the process of comprehending existing programs. Reverse engineering provides a direct attack on the program comprehension problem. Deenition The process of understanding a program involves reverse engineering the source code. Chikofsky and Cross Chikofsky and Cross II, 1990] give the following dee-nition. \Reverse enginering is the process of analyzing a subject system to identify the system's components and their interrelationships and create representations of the system in another form or at a higher level of abstraction. " The purpose of reverse engineering is to understand a software system in order to facilitate enhancement, correction, documentation, redesign, or reprogramming in a diierent programming language. Diiculties Reverse engineering is diicult. It is diicult because it must bridge diierent worlds. Of particular importance are bridges over the following ve gaps. The gap between a problem from some application domain and a solution in some programming language. The gap between the concrete world of physical machines and computer programs and the abstract world of high level descriptions. The gap between the desired coherent and highly structured description of the system and the actual system whose structure may have disintegrated over time. The gap between the hierarchical world of programs and the associational nature of human cognition. The gap between the bottom-up analysis of the source code and the top-down synthesis …
SLAC: A Formal Service-Level-Agreement Language for Cloud Computing

The need of mechanisms to automate and regulate the interaction amongst the parties involved in the offered cloud services is exacerbated by the increasing number of providers and solutions that enable the cloud paradigm. This regulation needs to be defined through a contract, the so-called Service Level Agreement (SLA). We argue that the current solutions for SLA specification cannot cope with the distinctive characteristics of clouds. Therefore, in this paper we define a language, named SLAC, devised for specifying SLA for the cloud computing domain. The main differences with respect to the existing specification languages are: SLAC is domain specific, its semantics are formally defined in order to avoid ambiguity, it supports the main cloud deployment models, and it enables the specification of multi-party agreements. Moreover, SLAC supports the business aspects of the domain, such as pricing schemes, business actions and metrics. Furthermore, SLAC comes with an open-source software framework which enables the specification, evaluation and enforcement of SLAs for clouds. We illustrate potentialities and effectiveness of the SLAC language and its management framework by experimenting with an Open Nebula cloud system.
Design of an Orifice and Weir Outlet for Poorly Drained Forested Watersheds

Orifice-weir structures are being used to reduce peak drainage rates and to store water during the growing season in poorly drained pine plantations. Earlier studies have demonstrated their effectiveness in reducing drainage outflows while conserving water during the growing season. This study reports on criteria and preliminary guidelines for designing such structures. The guidelines were developed using both observed data and results of DRAINMOD simulations for multiple combinations of outlet sizes and poorly drained mineral and organic soils. The main objective functions were reducing flow rates higher than 5 mm/day, minimizing wet days e.g. water table depths within 30 cm depth from the surface, and maintaining water table within 45 to 120 cm depth. Results show that the size and the depths of the orifice and the weir primarily depend upon the main objective function chosen followed by the soil type and the watershed area. Wet days increased with smaller orifice sizes and shallower weir depths. For example, for a watershed of 25 ha, a 7.5cm or a 10 cm diameter orifice in a flat weir with the crest 25 cm below the surface would result in the same % time having peak drainage rates for both the organic and the mineral soils. However, the number of wet days was 3 times higher in the organic soil than in the mineral soil. Although an orifice placed above ditch bottom yielded higher frequency of water table depth between 45 cm and 120 cm depth as desired compared to the one near ditch bottom, this must be weighted against two other objectives. This indicates two things: 1) for the same drainage density and area, a larger orifice size may be required in the organic soil to achieve the same reduction in wet days as in the mineral soil; 2) the orifice size and its location depends upon the primary objective function chosen.
Recognizing chromospheric objects via Markov chain Monte Carlo

The solar chromosphere consists of three classes which contribute differentially to ultraviolet radiation reaching the Earth. We describe a data set of solar images, means of segmenting the images into the constituent classes, and a novel high-level representation for compact objects based on a triangulated spatial 'membership function. ' Such representations are fitted in a variable-dimension Markov chain Monte Carlo scheme.
Dynamic simulation of the tripod sliding universal joint based on virtual prototype

A virtual prototype was established in ADAMS software environment in terms of the geometrical model of the tripod sliding universal joint set up with CAD software of Pro/Engineer. Dynamic properties thereof were then observed and the load curves of the main elements were obtained under practical operating conditions. The gained results are important reference data for the structure design and optimization thereof.
A Double Helix Metaphor for Use and Usefulness in Informing Systems

Following the theme of this monograph, this paper discusses a dialectic we perceive to subsist between meaningful use and reflection upon use. This dialectic between experiencing use and reflecting upon experiencing use (or thinking, and thinking about thinking) may be considered in the following way. Each of these elements is subject to change. As reflection triggers change in use, and such change triggers further reflection, a spiral comes about. Lived human experience, and reflection upon that experience, seems to shape a double helix. In this paper, the authors suggest a need for a hermeneutically-informed, phenomenological approach when considering the complexities of informing systems, viewed as human activity systems. It is suggested that human actors, as users of informing systems, must own and control any inquiry into use in relation to design for themselves, and that individual sensemaking processes are the key to successful interaction within the double helix metaphor. (Less)
Crawling at High Speeds: Steady Level Locomotion in the Spider Cupiennius salei—Global Kinematics and Implications for Centre of Mass Dynamics

Spiders are an old yet very successful predatory group of arthropods. Their locomotor system differs from those of most other arthropods by the lack of extensor muscles in two major leg joints. Though specific functional characteristics can be expected regarding the locomotion dynamics of spiders, this aspect of movement physiology has been only scarcely examined so far. This study presents extensive analyses of a large dataset concerning global kinematics and the implications for dynamics of adult female specimens of the large Central American spider Cupiennius salei (Keyserling). The experiments covered the entire speed-range of straight runs at constant speeds. The analyses revealed specific characteristics of velocity dependent changes in the movements of the individual legs, as well as in the translational and rotational degrees of freedom of both the centre of mass and the body. In contrast to many other fast moving arthropods, C. salei avoid vertical fluctuations of their centre of mass during fast locomotion. Accordingly, aerial phases were not observed here. This behaviour is most likely a consequence of optimising energy expenditure with regard to the specific requirements of spiders' leg anatomy. A strong synchronisation of two alternating sets of legs appears to play only a minor role in the locomotion of large spiders. Reduced frequency and low centre of mass amplitudes as well as low angular changes of the body axes, in turn, seems to be the result of relatively low leg coordination.
Adaptive controller design for generic quadrotor aircraft platform subject to slung load

This paper presents an adaptive control design method for quadrotor systems carrying slung load. The existence of the slung load will exert swing effect on the quadrotor systems, and it degrades the performance of the quadrotor even affects the stability of the closed-loop systems. Addressing this task, the slung load is treated as a pendulum mass from a single point in this paper. By analyzing the dynamics of the slung load, the analytical expression of the external force and torque acting on the quadrotor systems are discussed, and the adaptive control schemes for the altitude and attitude control are designed correspondingly. Using the designed adaptive laws and the controllers, the simulation results demonstrate that the proposed control method is capable of keeping the quadrotor system performance and yielding the unstable swing caused by the slung load effectively.
Lecture 20

Quantum error correction Classical error correction Modern computers: failure rate is below one error in 1017 operations Data transmission and storage (file transfers, cell phones, DVD, CD, etc.): noise problems Solution: use error-correcting codes to protect against the effect of noise. Key idea: encode the message with redundant information. Redundancy in the encoded message allows to recover the information in the original message. Classical error correction: repetition code Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p. Binary symmetric channel: