Miracle-dz/UniFAR-FTUs huggingface dataset:
Hyper Graph Deviation Comparison & Cluster Relation In Categorical Data

Outlier detection is one of the most important issues in recent years. Outlier detection is the process of detecting errors in data. The recent methods are mostly based on Numerical data, but these methods are not suitable for real time data such as web pages, business transactions etc., which are known as Categorical data. It is difficult to find outliers in categorical data. In this paper, we propose an approach to find outliers those are Comparison of Deviations. In Comparison of deviation method, we use hyper graph to calculate the deviations of each object in the database, and we measure the similarity between attributes in database.
ASYMMETRIC LEAVES1 and auxin activities converge to repress BREVIPEDICELLUS expression and promote leaf development in Arabidopsis

Leaf development in higher plants requires the specification of leaf initials at the flanks of a pluripotent structure termed the shoot apical meristem. In Arabidopsis, this process is facilitated by negative interactions between class I KNOTTED1-like homeobox (KNOX) and ASYMMETRIC LEAVES1 (AS1) transcription factors, such that KNOX proteins are confined to the meristem and AS1 to leaf initials. Sites of leaf inception are also defined by local accumulation of the hormone auxin; however, it is unknown how auxin and AS1 activities are integrated to control leaf development. Here, we show that auxin and AS1 pathways converge to repress expression of the KNOX gene BREVIPEDICELLUS (BP) and thus promote leaf fate. We also demonstrate that regulated auxin gradients control leaf shape in a KNOX-independent fashion and that inappropriate KNOX activity in leaves perturbs these gradients, hence altering leaf shape. We propose that regulatory interactions between auxin, AS1 and KNOX activities may both direct leaf initiation and sculpt leaf form.
TESLA Certificates : An Authentication Tool for Networks of Compute-Constrained Devices

In the near future wireless networks will consist of lowpowered, compute-constrained devices. These devices will have limited ability to perform the expensive computational operations associated with public key cryptography. This will limit the usefulness of conventional authentication mechanisms based on public key certificates in these domains. In this paper we introduce an alternative to conventional public key certificates that is based upon symmetric key cryptography and the principles of delayed key disclosure. The work formalizes concepts presented in earlier work on a broadcast authentication protocol, known as TESLA. TESLA certificates rely upon a tradeoff between computation and authentication delay in order to achieve a certificate infrastructure that reduces computational complexity associated with certificate verification when compared with traditional public key infrastructure certificates. Further, we introduce a modification to the TESLA protocol that provides partial authentication of multicast data, which allows for partial authentication in our TESLA certificate framework. As an application, we apply TESLA certificates to the problem of maintaining authentication during handoff in a generic mobile network.
Robust visualization of navigation experiments with mobile robots over the Internet

Visualization is an important precondition for successful teleoperation of instructable mobile robots. Data connections with varying and limited bandwidth such as the Internet, however prohibit the continuous transmission of video signals. In this paper we propose a predictive simulation technique which is designed to permit the reliable visualization of the robot's actions over the Internet. It differs from previous approaches in that it includes an odometry and sensor simulation. This simulation of the robot allows the integration of a complete robot control system to reliably predict complex actions of the robot even if large transmission gaps of several seconds occur. We describe an application of the predictive simulation technique to navigation experiments with mobile robots. We present different experiments carried out with a real robot illustrating that the predictive simulation technique provides accurate visualizations of the robot's actions even if transmission gaps of more than ten seconds occur.
Surface terms as counterterms in the AdS-CFT correspondence

We examine the recently proposed technique of adding boundary counterterms to the gravitational action for spacetimes which are locally asymptotic to anti\char21{}de Sitter spacetimes. In particular, we explicitly identify higher order counterterms, which allow us to consider spacetimes of dimensions $dl~7. $ As the counterterms eliminate the need of ``background subtraction'' in calculating the action, we apply this technique to study examples where the appropriate background was ambiguous or unknown: topological black holes, Taub-NUT-AdS and Taub-Bolt-AdS. We also identify certain cases where the covariant counterterms fail to render the action finite, and we comment on the dual field theory interpretation of this result. In some examples, the case of a vanishing cosmological constant may be recovered in a limit, which allows us to check results and resolve ambiguities in certain asymptotically flat spacetime computations in the literature.
SEMIPARAMETRIC ESTIMATION OF A TWO-COMPONENT MIXTURE MODEL

Suppose that univariate data are drawn from a mixture of two distributions that are equal up to a shift parameter. Such a model is known to be nonidentifiable from a nonparametric viewpoint. However, if we assume that the unknown mixed distribution is symmetric, we obtain the identifiability of this model, which is then defined by four unknown parameters: the mixing proportion, two location parameters and the cumulative distribution function of the symmetric mixed distribution. We propose estimators for these four parameters when no training data is available. Our estimators are shown to be strongly consistent under mild regularity assumptions and their convergence rates are studied. Their finite-sample properties are illustrated by a Monte Carlo study and our method is applied to real data.
Novel tools to streamline the conference review process: experiences from SIGKDD'09

The SIGKDD'09 Research Track received 537 paper submissions, which were reviewed by a Program Committee of 199 members, and a Senior Program Committee of 22 members. We used techniques from artificial intelligence and data mining to streamline and support this complicated process at three crucial stages: bidding by PC members on papers, assigning papers to reviewers, and calibrating scores obtained from the reviews. In this paper we report on the approaches taken, evaluate how well they worked, and describe some further work done after the conference.
Limit cycles and stiffness control with variable stiffness actuators

Variable stiffness actuators realize highly dynamic systems, whose inherent mechanical compliance can be properly exploited to obtain a robust and energy-efficient behavior. The paper presents a control strategy for variable stiffness actuators with the primarily goal of tracking a limit cycle trajectory and a desired stiffness, which is a function of the output position of the actuator. The proposed controller guarantees that the load, attached at the output of the actuation system, asymptotically tracks the desired cyclic motion and the desired stiffness even in presence of external disturbances. Experimental tests on the rotational variable stiffness actuator vsaUT-II validate the control strategy.
Computational Complexity of Reasoning about Plans

The artiicial intelligence (AI) planning problem is known to be very hard in the general case. Propositional planning is PSPACE-complete and rst-order planning is undecidable. Many planning researchers claim that all this expres-siveness is needed to solve real problems and some of them have abandoned theory-based planning methods in favour of seemingly more eecient methods. These methods usually lack a theoretical foundation so not much is known about the correctness and the computational complexity of these. There are, however, many applications where both provable correctness and eeciency are of major concern, for instance, within automatic control. We suggest in this thesis that it might be possible to stay within a well-founded theoretical framework and still solve many interesting problems tract-ably. This should be done by identifying restrictions on the planning problem that improve the complexity gure while still allowing for interesting problems to be modelled. Finding such restrictions may be a non-trivial task, though. As a rst attempt at nding such restrictions we present a variant of the traditional STRIPS formalism, the SAS + formalism. The SAS + formalism has made it possible to identify certain restrictions which deene a computationally tractable planning problem, the SAS +-PUS problem, and which would not have been easily identiied using the traditional STRIPS formalism. We also present a polynomial-time, sound and complete algorithm for the SAS +-PUS problem. We further prove that the SAS + formalism in its unrestricted form is equally expressive as some other well-known formalisms for propositional planning. Hence, it is possible to compare the SAS + formalism with these other formalisms and the complexity results carry over in both directions. Furthermore, we analyse the computational complexity of various subprob-lems lying between unrestricted SAS + planning and the SAS +-PUS problem. We nd that most planning problems (not only in the SAS + formalism) allow instances having exponentially-sized minimal solutions and we argue that such instances are not realistic in practice. We conclude the thesis with a brief investigation into the relationship between the temporal projection problem and the planning and plan validation problems. i ii Preface I have a plan|a plan that cannot possibly fail. Inspector Clousseau When writing a thesis on some subject one is supposed to be an expert in that subject. This thesis addresses the research into the computational complexity of planning. Hence, I am perhaps expected to be both an expert in complexity theory and …
Impact of Micellar Vehicles on in situ Intestinal Absorption Properties of Beta-Lapachone in Rats

The aim of the present study was to examine the effect of micellar systems on the absorption of beta-lapachone (b-lap) through different intestinal segments using a single-pass rat intestinal perfusion technique. B-lap was solubilized in mixed micelles composed of phosphatidylcholine and sodium deoxycholate, and in sodium lauryl sulfate (SLS)-based conventional micelles. Both mixed micelles and SLS micelles improved the in situ permeability of b-lap in all intestinal segments tested although the mixed micellar formulation was more effective in increasing the intestinal absorption of b-lap. The permeability of b-lap was greatest in the large intestinal segments. Compared with SLS micelles, the effective permeability coefficient values measured with mixed micelles were 5- to 23-fold higher depending on the intestinal segment. Our data suggest that b-lap should be delivered to the large intestine using a mixed micellar system for improved absorption.
A Hyperheuristic Approach for Constraint Solving

In this work we propose a Choice Function for guiding Constraint Programming in the resolution of Constraint Satisfaction Problems. We exploit some search process features to select on the fly the Enumeration Strategy (Variable + Value Selection Heuristics) in order to more efficiently solve the problem at hand. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies.
A Parallel Version of the Unsymmetric Lanczos Algorithm and its Application to QMR

A new version of the unsymmetric Lanczos algorithm without l ok-ahead is described combining elements of numerical stability and pa rallel algorithm design. Firstly, stability is obtained by a coupled two-term p rocedure that generates Lanczos vectors scaled to unit length. Secondly, the algori thm is derived by making all inner products of a single iteration step independen t such that global synchronization on parallel distributed memory computers is r educed. Among the algorithms using the Lanczos process as a major component, t h quasi-minimal residual (QMR) method for the solution of systems of linear e quations is illustrated by an elegant derivation. The resulting QMR algorith m maintains the favorable properties of the Lanczos algorithm while not incre asing computational costs as compared with its corresponding original version.
Planning While Learning Operators

This paper describes issues that arise when integrating a planner with a system that learns planning operators incrementally, and our approaches to address these issues. During learning, domain knowledge can be incomplete and incorrect in different ways; therefore the planner must be able to use incomplete domain knowledge. This presents the following challenges for planning: How should the planner effectively generate plans using incomplete and incorrect domain knowledge? How should the planner repair plans upon execution failures? How should planning, learning, and execution be integrated? This paper describes how we address these challenges in the framework of an integrated system, called OBSERVER, that learns planning operators automatically and incrementally. In OBSERVER, operators are learned by observing expert agents and by practicing in a learning-by-doing paradigm. We present empirical results to demonstrate the validity of our approach in a process planning domain. These results show that practicing using our algorithms for planning with incomplete information and plan repair contributes significantly to the learning process.
Dash in mobile networks and services

This paper provides an overview on the challenges of mobile video streaming focusing on overload situations, variable bandwidth and power consumption issues. Dynamic Adaptive Streaming over HTTP (DASH) is introduced as an enabler to address a significant portion of these challenges. The applicability of the formats to 3G and 4G unicast distribution is provided. Also the applicability of DASH formats for multicast distribution in MBMS is shown. Finally, the usage of DASH in hybrid unicast/multicast is introduced to provide a flexible extension to support different business and delivery models. An outlook to ongoing and future work is provided.
Using Bit-Efficient XML to Optimize Data Transfer of XForms-Based Mobile Services

We consider here the case of XForms applications on small mobile devices. The aim is to find out whether a schema-aware binary XML format is better suited to this area than generic compression applied to regular XML. We begin by limiting the potential areas of improvement through considering the features of the binary format, and then proceed to measure effects in the identified areas to determine whether a binary format would be effective.
High-Resolution Phenotypic Profiling Defines Genes Essential for Mycobacterial Growth and Cholesterol Catabolism

The pathways that comprise cellular metabolism are highly interconnected, and alterations in individual enzymes can have far-reaching effects. As a result, global profiling methods that measure gene expression are of limited value in predicting how the loss of an individual function will affect the cell. In this work, we employed a new method of global phenotypic profiling to directly define the genes required for the growth of Mycobacterium tuberculosis. A combination of high-density mutagenesis and deep-sequencing was used to characterize the composition of complex mutant libraries exposed to different conditions. This allowed the unambiguous identification of the genes that are essential for Mtb to grow in vitro, and proved to be a significant improvement over previous approaches. To further explore functions that are required for persistence in the host, we defined the pathways necessary for the utilization of cholesterol, a critical carbon source during infection. Few of the genes we identified had previously been implicated in this adaptation by transcriptional profiling, and only a fraction were encoded in the chromosomal region known to encode sterol catabolic functions. These genes comprise an unexpectedly large percentage of those previously shown to be required for bacterial growth in mouse tissue. Thus, this single nutritional change accounts for a significant fraction of the adaption to the host. This work provides the most comprehensive genetic characterization of a sterol catabolic pathway to date, suggests putative roles for uncharacterized virulence genes, and precisely maps genes encoding potential drug targets.
Intergenerational Studies of Parenting and the Transfer of Risk From Parent to Child

This review describes a recent approach to studying the intergenerational processes that place families and children at risk for a broad variety of social, behavioral, and health problems. Intergenerational studies typically involve two (or more) generations of participants, observed over time. These projects are utilized to study the origins and early determinants of parenting behavior and of other environmental, health, and social conditions that place young offspring at risk for continuing behavioral, cognitive, and health problems. Convergent findings, across a broad range of research populations in several countries, suggest that problematic parenting develops in part through learning the behavior modeled by one's own parents. In addition, problematic parenting seems to be an extension of an individual's early style of aggressive and problematic social behavior. Parents with a history of childhood aggression, in particular, tend to have continuing social, behavioral, and health difficulties, as do their offspring. Conversely, parental involvement, cognitive stimulation, warmth, and nurturance appear to have important protective effects for offspring. Finally, educational achievement appears to be a powerful buffer against problematic parenting and a wide variety of difficult family circumstances, protecting families against the transfer of risk between generations.
Skills use in the workplace and its effects on wages and on job satisfaction

Purpose The purpose of this paper is to analyze the effects of labor mismatches on wages and on job satisfaction for the Spanish case, with a distinction been made between educational and skills-related measures of mismatch. Design/methodology/approach The focus is placed on the usage that the individuals do of their skills in the workplace and different measures of skills use are considered to check the robustness of the results. Findings Using data from PIAAC, the results suggest that whereas educational mismatch shows greater effects on wages, the effects of labor mismatch on job satisfaction are better explained by the relative use of individual skills in the workplace. Research limitations/implications Both educational and skills mismatches are relevant for understanding the economic effects of labor mismatch. Nevertheless, it should be taken into account that educational mismatch is not an accurate proxy for skills mismatch, mainly when the non-monetary effects of labor mismatch are addressed. Practical implications There is room to increase workers’ skills utilization in the workplace, which, in turn, would contribute to enhance individual job satisfaction and, consequently, workers productivity. Social implications A process of upgrading in the Spanish labor market would allow to take full advantage of recent investments in education and skills formation done in the country in the last decades. Originality/value This study contributes to the literature on labor mismatch by explicitly considering that educational and skills mismatch might reflect different phenomena and by analyzing the effects of both types of mismatches on different labor market outcomes.
DIT: Summarisation and Semantic Expansion in Evaluating Semantic Similarity

This paper describes an approach to implementing a tool for evaluating semantic similarity. We investigated the potential benefits of (1) using text summarisation to narrow down the comparison to the most important concepts in both texts, and (2) leveraging WordNet information to increase usefulness of cosine comparisons of short texts. In our experiments, text summarisation using a graph-based algorithm did not prove to be helpful. Semantic and lexical expansion based upon word relationships defined in WordNet increased the agreement of cosine similarity values with human similarity judgements.
Heat Map Scope Technique for Stacked Time-series Data Visualization

Multidimensional time-series data is common in many fields of study, and to visualize it in a compact space while retaining dimensional context as much as possible is one of the conventional and still challenging issues for information visualization. In this paper, we propose a small technique for visualizing the detailed pattern of multidimensional time-series data without losing the sight of the whole trend. In our system, two well-known techniques of Streamgraph and Heat Map visual representations are integrated along the lines of the ``focus plus context'' philosophy. We demonstrate that interactive and spatial switchover between both representations enables us to traverse the data from microscopic to macroscopic view smoothly.
Sketch-to-photo matching: a feature-based approach

This paper presents a local feature-based method for matching facial sketch images to face photographs, which is the first known feature-based method for performing such matching. Starting with a training set of sketch to photo correspondences (i.e. a set of sketch and photo images of the same subjects), we demonstrate the ability to match sketches to photos: (1) directly using SIFT feature descriptors, (2) in a "common representation" that measures the similarity between a sketch and photo by their distance from the training set of sketch/photo pairs, and (3) by fusing the previous two methods. For both matching methods, the first step is to sample SIFT feature descriptors uniformly across all the sketch and photo images. In direct matching, we simply measure the distance of the SIFT descriptors between sketches and photos. In common representation matching, the distance between the descriptor vectors of the probe sketches and gallery photos at each local sample point is measured. This results in a vector of distances across the sketch or photo image to each member of the training basis. Further recognition improvements are shown by score level fusion of the two sketch matchers. Compared with published sketch to photo matching algorithms, experimental results demonstrate improved matching performances using the presented feature-based methods.