ppxscal/embedding_network huggingface dataset:
Who Is It? Context Sensitive Named Entity and Instance Recognition by Means of Wikipedia
Authors: Ulli Waltinger, Alexander Mehler
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

This paper presents an approach for predicting context sensitive entities exemplified in the domain of person names. Our approach is based on building a weighted context but also a weighted people graph and predicting the context entity by extracting the best fitting sub graph using a spreading activation technique. The results of the experiments show a quite promising F-Measure of 0.99.
Controller design of a new active front steering system
Authors: Deling Chen, Chengling Yin, Jianwu Zhang
Venue: WSEAS TRANSACTIONS on SYSTEMS (2008)

An AFS (active front steering) on the basic of a C-EPS (column electric power steering) system was developed. Based on the mathematical model of essential components, the AFS controller was designed covering two units: an EPS actuator unit was used to reduce the steering torque requirement to the driver; an AFS actuator unit was used to compensate the steering angle for steering characteristics and vehicle stability. In contrast to the conventional stability control, both the sideslip angle and the yaw rate were fed back to this AFS controller and the stability performance has been optimized with LQR (linear quadratic regulator). In addition, tire stiffness uncertainties have been taken account in the LQR controller to provide the control robustness. Finally, HILS (Hardware-in-the-Loop Simulation) tests were conducted to demonstrate the performance of the designed AFS controller. Experiment indicates that the proposed AFS system can improve vehicle stability and compensate the steering reaction torque effectively.
A pay-as-you-go framework for query execution feedback
Authors: Surajit Chaudhuri, Vivek Narasayya, Ravi Ramamurthy
Venue: Proceedings of the VLDB Endowment (2008)

Past work has suggested that query execution feedback can be useful in improving the quality of plans by correcting cardinality estimation errors in the query optimizer. The state-of-the-art approach for obtaining execution feedback is "passive" monitoring which records the cardinality of each operator in the execution plan. We observe that there are many cases where even after repeated executions of the same query with use of feedback from passive monitoring, suboptimal choices in the execution plan cannot be corrected. We present a novel "pay-as-you-go" framework in which a query potentially incurs a small overhead on each execution but obtains cardinality information that is not available with passive monitoring alone. Such a framework can significantly extend the reach of query execution feedback in obtaining better plans. We have implemented our techniques in Microsoft SQL Server, and our evaluation on real world and synthetic queries suggests that plan quality can improve significantly compared to passive monitoring even at low overheads.
Image management in a virtualized data center
Authors: Tingxi Tan, Rob Simmonds, Bradley Arlt, Martin Arlitt, Bruce Walker
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

Industrial research firms such as Gartner and IDC are predicting an explosion in the number of online services in the coming years. Virtualization technologies could play an important role in such a world, as they create an opportunity to provide services in a cost-effective manner. However, to achieve ideal savings, more dynamic environments must be created, with Virtual Machines (VMs) being provisioned and altered on-the-fly. Management issues arise when using these elastic resources at scale. In this study, we provide an initial investigation of performance and scalability issues for image management in a virtualized data center. Results provided show that the choice of storage solution and access protocol matters. For example, our tests show the time to start a VM from a local hard drive under I/O intensive workload increases by a factor of 15 and for certain shared storage options, this factor increases to 30 times.
Similarity solutions to nonlinear heat conduction and Burgers/Korteweg-deVries fractional equations
Authors: Vladan D. Djordjevic, Teodor M. Atanackovic
Venue: Journal of Computational and Applied Mathematics (2008)

We analyze self-similar solutions to a nonlinear fractional diffusion equation and fractional Burgers/Korteweg-deVries equation in one spatial variable. By using Lie-group scaling transformation, we determined the similarity solutions. After the introduction of the similarity variables, both problems are reduced to ordinary nonlinear fractional differential equations. In two special cases exact solutions to the ordinary fractional differential equation, which is derived from the diffusion equation, are presented. In several other cases the ordinary fractional differential equations are solved numerically, for several values of governing parameters. In formulating the numerical procedure, we use special representation of a fractional derivative that is recently obtained.
An autonomous GP-based system for regression and classification problems
Authors: Mihai Oltean, Laura Dioşan
Venue: Applied Soft Computing (2009)

The aim of this research is to develop an autonomous system for solving data analysis problems. The system, called Genetic Programming-Autonomous Solver (GP-AS) contains most of the features required by an autonomous software: it decides if it knows or not how to solve a particular problem, it can construct solutions for new problems, it can store the created solutions for later use, it can improve the existing solutions in the idle-time it can efficiently manage the computer resources for fast running speed and it can detect and handle failure cases. The generator of solutions for new problems is based on an adaptive variant of Genetic Programming. We have tested this part by solving some well-known problems in the field of symbolic regression and classification. Numerical experiments show that the GP-AS system is able to perform very well on the considered test problems being able to successfully compete with standard GP having manually set parameters.
The (Similarity) Matrix Reloaded
Authors: Avigdor Gal
Venue: Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS (2008)

Schema matching provides correspondences between concepts describing the meaning of data in various heterogeneous, distributed data sources. Schemamatching is a basic operation of data and schema integration and thus has a great impact on its outcome. The outcome of the matching process can serve in tasks of targeted content delivery, view integration, database integration, query rewriting over heterogeneous sources, duplicate data elimination, and automatic streamlining ofworkflowactivities that involve heterogeneous data sources.As such, schema matching has impact on numerous modern applications from various application areas. It impacts business, where company data sources continuously realign due to changing markets. It also impacts the way business and other information consumers seek information over theWeb. Finally, it impacts life sciences, where scientific workflows cross system boundaries more often than not.
Aerial tracking of elongated objects in rural environments
Authors: B. Majidi, A. Bab-Hadiashar
Venue: Machine Vision and Applications (2008)

In this paper, a new approach to finding and tracking various land cover boundaries such as rivers, agricultural fields, channels and roads for use in visual navigation system of an unmanned aerial vehicle is presented. We use a combination of statistical estimation and optimization techniques for extraction of dominant boundaries in noisy aerial images. A set of perceptual grouping restrictions is used to connect the acquired piecewise boundaries and to find the heading direction of the main boundary. The results are further refined by applying a set of texture and colour cues and eliminating any false hypothesis. To reduce the computation requirements, another approach based on sampled colour values of different land covers is also investigated. Colour characteristics of a set of manually selected windows are compared to select the best attributes needed for discrimination between different land covers in various (natural) lighting conditions. Each frame is then partially scanned and desired environmental features are extracted and classified. The results show that the proposed technique meets the minimum speed and accuracy requirement of aforementioned application and outperforms single-feature object tracking algorithms.
A cross-layer support for TCP enhancement in QoS-aware mobile ad hoc networks
Authors: Consolee Mbarushimana, Ali Shahrabi, Tom Buggy
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

In Mobile Ad-hoc Networks (MANETs), the majority of protocols developed to date provide QoS mechanisms by assigning high priority to delay-sensitive applications. While today's Internet traffic is still dominated by TCP based applications, the negative effects of the IEEE 802.11e service differentiation scheme on TCP performance in the presence of high priority traffic have not been widely reported in the literature. This paper presents the results of simulation based experiments designed to investigate these issues and how they can be addressed. In this paper we first evaluate the performance of TCP in 802.11e MANETs when competing with high priority VoIP traffic. We then propose a novel TCP-friendly scheme, called IEDCA, to improve IEEE 802.11e EDCA mechanism by assigning the highest priority to TCP acknowledgement packets. Our results show that the proposed scheme improves TCP performance significantly while having very negligible effects on voice traffic.
An integrated approach for automating validation of extracted ion chromatographic peaks
Authors: William D. Nelson, Kert Viele, Bert C. Lynn
Venue: Bioinformatics (2008)

Summary: Accurate determination of extracted ion chromatographic peak areas in isotope-labeled quantitative proteomics is difficult to automate. Manual validation of identified peaks is typically required. We have integrated a peak confidence scoring algorithm into existing tools which are compatible with analysis pipelines based on the standards from the Institute for Systems Biology. This algorithm automatically excludes incorrectly identified peaks, improving the accuracy of the final protein expression ratio calculation. Contact: wnels2@uky.edu Source and Supplementary Information: http://www.chem.uky.edu/research/lynn/Nelson.pdf
An effective multimedia item shell design for individualized education: the crome project
Authors: Irene Cheng, Anup Basu
Venue: Advances in Multimedia (2008)

There are several advantages to creating multimedia item types and applying computer-based adaptive testing in education. First is the capability to motivate learning by making the learners feel more engaged and in an interactive environment. Second is a better concept representation, which is not possible in conventional multiple-choice tests. Third is the advantage of individualized curriculum design, rather than a curriculum designed for an average student. Fourth is a good choice of the next question, associated with the appropriate difficulty level based on a student's response to the current question. However, many issues need to be addressed when achieving these goals, including: (a) the large number of item types required to represent the current multiple-choice questions in multimedia formats, (b) the criterion used to determine the difficulty level of a multimedia question item, and (c) the methodology applied to the question selection process for individual students. In this paper, we propose a multimedia item shell design that not only reduces the number of item types required, but also computes difficulty level of an item automatically. The concept of question seed is introduced to make content creation more cost-effective. The proposed item shell framework facilitates efficient communication between user responses at the client, and the scoring agents integrated with a student ability assessor at the server. We also describe approaches for automatically estimating difficulty level of questions, and discuss preliminary evaluation of multimedia item types by students.
Generalized convolution as a tool for the multi-dimensional filtering tasks
Authors: Przemysław Korohoda, Adam Dabrowski
Venue: Multidimensional Systems and Signal Processing (2008)

In this paper the so-called generalized convolution, being in fact an adequate adaptation of the well known circular convolution concept to any invertible block-transform, is proposed, developed, and analysed. First the proposed idea is summarized for a one-dimensional case. Then it is extended to multidimensional problems. The presented generalized convolution concept is based on the earlier A-convolution. This idea is recalled at the beginning and a set of techniques for studying the dependence of the respective coefficients on the arbitrary transform, is suggested. The generalized convolution matrix, being an extension of that for the circular convolution, is introduced and adapted to an arbitrary invertible transform. The filtering problem is then defined and presented in the transform domain. The multidimensional analysis starts with two-dimensional problems, then it is continued with formulas for multidimensional filtering tasks. The paper is illustrated with examples computed for twenty carefully selected transforms. Among them are Haar, Hadamard, Hartley, Karhunen-Loeve and a family of 16 discrete trigonometric transforms.
Phylocom
Authors: Campbell O. Webb, David D. Ackerly, Steven W. Kembel
Venue: Bioinformatics (2008)

Motivation: The increasing availability of phylogenetic and trait data for communities of co-occurring species has created a need for software that integrates ecological and evolutionary analyses. Capabilities: Phylocom calculates numerous metrics of phylogenetic community structure and trait similarity within communities. Hypothesis testing is implemented using several null models. Within the same framework, it measures phylogenetic signal and correlated evolution for species traits. A range of utility functions allow community and phylogenetic data manipulation, tree and trait generation, and integration into scientific workflows. Availability: Open source at: http://phylodiversity.net/phylocom/ Contact: cwebb@oeb.harvard.edu
"My tv is the family oven/toaster/grill": personalizing tv for the indian audience
Authors: Nimmi Rangaswamy, Sumitra Nair, Kentaro Toyama
Venue: Proceeding of the 1st international conference on Designing interactive user experiences for TV and video (2008)

Interactive TV is a new, exciting entry into the drawing rooms of Indian families. By examining current and nascent interactive TV services we trace ways in which they are deployed, received and consumed in the Indian home. From ethnographic probes we offer observations from Indian domestic contexts in the threshold of adopting interactivity as part of everyday TV viewing. We foreground India as a new and primary emerging site adopting interactive TV and to expand attention from the predominance of designing for Western cultural contexts. We develop a specific focus on personalizing TV, a dominant media attribute of interactive TV, conflicting with conventional viewing patterns in the Indian home. We note emergent challenges for interactive TV adoption patterns, particularly for personalization, in the Indian home. Here, TV is viewed as a) Comfort media b) Shared media c) Media for family bonding and raise concerns for viewer preferences around personalizing TV
Kind Bigraphs
Authors: Shane Ó Conchúir
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We present a refinement, suggested by Jensen and Milner under the term kind, of pure bigraphs. We name the result kind bigraphs. This refinement generalises the notion of atomic and non-atomic controls, allowing a control to contain a subset of the set of controls. We show that this variation has relative pushouts and classify its idem pushouts. A canonical labelled transition system can be derived from this classification and we use known results to reason about bisimilarity on this transition system. We show how kind bigraphs can be used to describe Milner's homomorphic sortings and finally discuss the extra expressivity that parametric kind reaction rules allow.
Generating XML structure using examples and constraints
Authors: Sara Cohen
Venue: Proceedings of the VLDB Endowment (2008)

This paper presents a framework for automatically generating structural XML documents. The user provides a target DTD and an example of an XML document, called a Generate-XML-By-Example Document, or a GxBE document, for short. GxBE documents use a natural declarative syntax, which includes XPath expressions and the function count. Using GxBE documents, users can express important global and local characteristics for the desired target documents, and can require satisfaction of XPath expressions from a given workload. This paper explores the problem of efficiently generating a document that satisfies a given DTD and GxBE document.
Performance comparison of HARQ and ARQ mechanisms in IEEE 802.16 networks
Authors: Alexander Sayenko, Henrik Martikainen, Alexander Puchko
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

The IEEE 802.16 technology defines several link level mechanisms to retransmit erroneous data. In this paper we compare the performance of the ARQ and HARQ mechanisms in the IEEE 802.16 networks. Our simulations results show that in general HARQ provides a better performance. However, ARQ can compete successfully with it due to a smaller signaling overhead. Furthermore, since ARQ does not require a dedicated uplink signaling channel for the acknowledgments messages, it results in better resources utilization in the uplink direction.
A Normative Model for Behavioral Differentiation
Authors: Benoit Lacroix, Philippe Mathieu, Andras Kemeny
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02 (2008)

In multi-agent systems simulations, reproducing realistic behaviors is a crucial issue. Their variety and consistency are important factors, usually not specifically considered. In this paper, we propose a behavioral differentiation model designed (1) to generate various and consistent behaviors, and (2) to control the determinism of this generation. Based on a normative system and a nondeterministic generation engine, it allows users adapting it easily to their various needs. Finally, we show its application to the traffic simulation software developed and used at Renault, SCANeR(c) II.
Evaluating Computational Performance of Backpropagation Learning on Graphics Hardware
Authors: Hiroyuki Takizawa, Tatsuya Chida, Hiroaki Kobayashi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Although volunteer computing with a huge number of high-performance game consoles connected to the Internet is promising to achieve large-scale data mining, the programming models of such game consoles for data mining tasks are restricted. As the game consoles have high-performance graphics hardware for state-of-the-art video games, a key to exploit their computation power for data mining is how effectively the data mining is mapped to the hardware as graphics processes. In this paper, therefore, a popular data mining tool called the backpropagation learning neural network is implemented as an application running on graphics hardware. Since the recent graphics hardware has many vector processing units and high memory bandwidth, it is promising to accelerate the backpropagation learning task involving a lot of data-parallel computations. The evaluation results have demonstrated the great potential of our prototype implementation for massive backpropagation learning tasks. The graphics hardware can efficiently work especially if the task is implemented so as to use data-parallel instructions supported by the hardware.
Heterogeneity and increasing returns may drive socio-economic transitions
Authors: Gérard Weisbuch, Vincent Buskens, Luat Vuong
Venue: Computational Mathematical Organization Theory (2008)

There are clear benefits associated with a particular consumer choice for many current markets. For example, as we consider here, some products might carry environmental or `green' benefits. Some consumers might value these benefits while others do not. However, as evidenced by myriad failed attempts of environmental products to maintain even a niche market, such benefits do not necessarily outweigh the extra purchasing cost. The question we pose is, how can such an initially economically-disadvantaged green product evolve to hold the greater share of the market? We present a simple mathematical model for the dynamics of product competition in a heterogeneous consumer population. Our model preassigns a hierarchy to the products, which designates the consumer choice when prices are comparable, while prices are dynamically rescaled to reflect increasing returns to scale. Our approach allows us to model many scenarios of technology substitution and provides a method for generalizing market forces. With this model, we begin to forecast irreversible trends associated with consumer dynamics as well as policies that could be made to influence transitions.
The case against a positivist philosophy of requirements engineering
Authors: Chris Hinds
Venue: Requirements Engineering (2008)

Requirements engineering is a field with a heavy practical emphasis and for the most part is quite rightly unconcerned with philosophical reflection. However, there have been exceptions. Philosophical arguments are important because they can be used to powerful effect, facilitating explicit debate on views that may previously have been implicit, and shaping the direction of thought and research within the field. Several cases from both requirements engineering and software engineering have given prominence to the philosophy of positivism. This paper will outline arguments against such a view.
Achieving 100% throughput in reconfigurable optical networks
Authors: Andrew Brzezinski, Eytan Modiano
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We study the maximum throughput properties of dynamically reconfigurable optical network architectures having wavelength and port constraints. Using stability as the throughput performance metric, we outline the single-hop and multi-hop stability regions of the network. Our analysis of the stability regions is a generalization of the BvN decomposition technique that has been so effective at expressing any stabilizable rate matrix for input-queued switches as a convex combination of service configurations. We consider generalized decompositions for physical topologies with wavelength and port constraints. For the case of a single wavelength per optical fiber, we link the decomposition problem to a corresponding Routing and Wavelength Assignment (RWA) problem. We characterize the stability region of the reconfigurable network, employing both single-hop and multi-hop routing, in terms of the RWA problem applied to the same physical topology. We derive expressions for two geometric properties of the stability region: maximum stabilizable uniform arrival rate and maximum scaled doubly substochastic region. These geometric properties provide a measure of the performance gap between a network having a single wavelength per optical fiber and its wavelength-unconstrained version. They also provide a measure of the performance gap between algorithms employing single-hop versus multi-hop electronic routing in coordination with WDM reconfiguration.