ppxscal/embedding_network huggingface dataset:
Efficient Online Aggregates in Dense-Region-Based Data Cube Representations
Authors: Kais Haddadin, Tobias Lauer
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

In-memory OLAP systems require a space-efficient representation of sparse data cubes in order to accommodate large data sets. On the other hand, most efficient online aggregation techniques, such as prefix sums, are built on dense array-based representations. These are often not applicable to real-world data due to the size of the arrays which usually cannot be compressed well, as most sparsity is removed during pre-processing. A possible solution is to identify dense regions in a sparse cube and only represent those using arrays, while storing sparse data separately, e.g. in a spatial index structure. Previous dense-region-based approaches have concentrated mainly on the effectiveness of the dense-region detection (i.e. on the space-efficiency of the result). However, especially in higher-dimensional cubes, data is usually more cluttered, resulting in a potentially large number of small dense regions, which negatively affects query performance on such a structure. In this paper, our focus is not only on space-efficiency but also on time-efficiency, both for the initial dense-region extraction and for queries carried out in the resulting hybrid data structure. We describe two methods to trade available memory for increased aggregate query performance. In addition, optimizations in our approach significantly reduce the time to build the initial data structure compared to former systems. Also, we present a straightforward adaptation of our approach to support multi-core or multi-processor architectures, which can further enhance query performance. Experiments with different real-world data sets show how various parameter settings can be used to adjust the efficiency and effectiveness of our algorithms.
Usage of Office Chair Adjustments and Controls by Workers Having Shared and Owned Work Spaces
Authors: Liesbeth Groenesteijn, Merle Blok, Margriet Formanoy, Elsbeth Korte, Peter Vink
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

In this study two seats were used by workers having shared and workers having owned work spaces. 51 subjects (22 female, 29 male) participated in a six week experiment in a naturalistic setting. The chairs were different with respect to adjustability options, design of controls and external design. Most of the subjects adjusted the office chairs the first time for seat height, arm rest height and back rest inclination. Adjustment times of seat height and armrest height were shorter for chair A. Back rest pressure adjustment takes much time and it is difficult to adjust this without instruction. The workers having shared desks adjust their chair more often and are faster in the adjustment of the backrest pressure compared with workers with an owned work space. The quality of adjustments of seat height, arm rest and back rest pressure was improved by an instruction for 32% of the subjects.
Efficient search for Inversion Transduction Grammar
Authors: Hao Zhang, Daniel Gildea
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

We develop admissible A* search heuristics for synchronous parsing with Inversion Transduction Grammar, and present results both for bitext alignment and for machine translation decoding. We also combine the dynamic programming hook trick with A* search for decoding. These techniques make it possible to find optimal alignments much more quickly, and make it possible to find optimal translations for the first time. Even in the presence of pruning, we are able to achieve higher BLEU scores with the same amount of computation.
Entity annotation based on inverse index operations
Authors: Ganesh Ramakrishnan, Sreeram Balakrishnan, Sachindra Joshi
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

Entity annotation involves attaching a label such as 'name' or 'organization' to a sequence of tokens in a document. All the current rule-based and machine learning-based approaches for this task operate at the document level. We present a new and generic approach to entity annotation which uses the inverse index typically created for rapid key-word based searching of a document collection. We define a set of operations on the inverse index that allows us to create annotations defined by cascading regular expressions. The entity annotations for an entire document corpus can be created purely of the index with no need to access the original documents. Experiments on two publicly available data sets show very significant performance improvements over the document-based annotators.
A spectral clustering algorithm for manufacturing cell formation
Authors: S. Oliveira, J. F. F. Ribeiro, S. C. Seok
Venue: Computers and Industrial Engineering (2009)

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature.
Proposition of a Query Planner for Semantic Web Services
Authors: Naser Nematbakhsh, Farhad Mardukhi, Hasan Mohammadkhani
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In this paper, a query planner is presented for semantic web services. Semantic web services represented in OWL-S format called OWL-S services. This planner converts OWL-S services to equivalent problem and domain descriptions that are specified in the planning domain description language PDDL. It invokes an efficient AI planner,Fast Diagonally Downward (FDD), to generate a sequence of OWL-S web services that satisfies a given goal. This planner will be called semantic web services-FDD (SWS-FDD). SWSFDD uses multi-valued state variables for PDDL-style planning and uses hierarchical task decompositions within a heuristic planning framework.
Evaluating SPLASH-2 Applications Using MapReduce
Authors: Shengkai Zhu, Zhiwei Xiao, Haibo Chen, Rong Chen, Weihua Zhang, Binyu Zang
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

MapReduce has been prevalent for running data-parallel applications. By hiding other non-functionality parts such as parallelism, fault tolerance and load balance from programmers, MapReduce significantly simplifies the programming of large clusters. Due to the mentioned features of MapReduce above, researchers have also explored the use of MapReduce on other application domains, such as machine learning, textual retrieval and statistical translation, among others.In this paper, we study the feasibility of running typical supercomputing applications using the MapReduce framework. We port two applications (Water Spatial and Radix Sort) from the Stanford SPLASH-2 suite to MapReduce. By completely evaluating them in Hadoop, an open-source MapReduce framework for clusters, we analyze the major performance bottleneck of them in the MapReduce framework. Based on this, we also provide several suggestions in enhancing the MapReduce framework to suite these applications.
E-mail in Semantic Task Management
Authors: Uwe V. Riss, Marlen Jurisch, Viktor Kaufman
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Email management applications are among themostly used tools for collaboration in enterprises. They areoften overused and simultaneously criticised for lacking meansto prevent cognitive overload of the users and off-target value ofthe deployed software. Apparently, their value proposition doesnot cover the user needs for the management of personal communication,information and collaboration appropriately. Recently,several approaches towards Semantic Email handling have beenproposed to ensure more efficient use of contextual information.Rather novel Semantic Task Management approaches have beenconsidered to support break down of the personal workload interms of information, communication and context management.In this paper, we propose to combine the strengths of semanticweb technologies, email technology and task management. Webase our research upon results obtained in the EU projectsNepomuk and Ecospace, and describe the synergies that resultfrom the introduced combination. To illustrate the idea ofintegrating task management and email by means of semantictechnologies, we refer to a prototype that we have developedwithin the framework of the Nepomuk project.We also conductedcase study interviews that underline the expected benefits ofcombining the three technologies.
On Chebyshev-type integral quasi-interpolation operators
Authors: M. A. Fortes, M. J. Ibáñez, M. L. Rodríguez
Venue: Mathematics and Computers in Simulation (2009)

Spline quasi-interpolants on the real line are approximating splines to given functions with optimal approximation orders. They are called integral quasi-interpolants if the coefficients in the spline series are linear combinations of weighted mean values of the function to be approximated. This paper is devoted to the construction of new integral quasi-interpolants with compactly supported piecewise polynomial weights. The basic idea consists of minimizing an expression appearing in an estimate for the quasi-interpolation error. It depends on how well the quasi-interpolation operator approximates the first non-reproduced monomial. Explicit solutions as well as some numerical tests in the B-spline case are given.
A Data Parallel Algorithm for XML DOM Parsing
Authors: Bhavik Shah, Praveen R. Rao, Bongki Moon, Mohan Rajagopalan
Venue: Proceedings of the 6th International XML Database Symposium on Database and XML Technologies (2009)

The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation performed on an XML document for it to be accessed and manipulated. This operation is known to cause performance bottlenecks in applications and systems that process large volumes of XML data. We believe that parallelism is a natural way to boost performance. Leveraging multicore processors can offer a cost-effective solution, because future multicore processors will support hundreds of cores, and will offer a high degree of parallelism in hardware. We propose a data parallel algorithm called ParDOM for XML DOM parsing, that builds an in-memory tree structure for an XML document. ParDOM has two phases. In the first phase, an XML document is partitioned into chunks and parsed in parallel. In the second phase, partial DOM node tree structures created during the first phase, are linked together (in parallel) to build a complete DOM node tree. ParDOM offers fine-grained parallelism by adopting a flexible chunking scheme --- each chunk can contain an arbitrary number of start and end XML tags that are not necessarily matched. ParDOM can be conveniently implemented using a data parallel programming model that supports map and sort operations. Through empirical evaluation, we show that ParDOM yields better scalability than PXP [23] --- a recently proposed parallel DOM parsing algorithm --- on commodity multicore processors. Furthermore, ParDOM can process a wide-variety of XML datasets with complex structures which PXP fails to parse.
Understanding the Relationship between Requirements and Context Elements in Mobile Collaboration
Authors: Sergio Ochoa, Rosa Alarcon, Luis Guerrero
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

The development of mobile collaborative applications involves several challenges, and one of the most important is to deal with the always changing work context. This paper describes the relationship between these applications requirements and the typically context elements that are present in mobile collaborative work. This article presents a house of quality which illustrates this relationship and shows the trade-off involved in several design decisions.
The Design and Development of Outline Fonts of the Dai Characters Based on OpenType
Authors: Jing-ying Zhao, Hai Guo, Nan Jiang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

According to the features of Dai Characters and the status quo of Dai Information processing, this paper puts forward a making method of common outline fonts of the Dai characters. Based on the analysis on the types of outline fonts, outline extraction method of Dai font is designed and realized in Linux. Dai outline font as basis for Dai information processing provides strong support for promoting the information handling in minority areas.
ASP: The Future Is Bright
Authors: Marina Vos
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

In the twenty years since the creation of the stable model semantics[4] for logic programs and inclusion of both classical and negation as failure, answer set programming (ASP)[1] has grown from a small fledgeling field within logic programming to a maturing field of its own. In this extended abstract we discuss some future application areas for ASP and theoretic and implementational problems that need to be addressed in order to make them feasible. With the increase in efficiency of the answer set solvers and a better understanding of the formalism, its advantages and disadvantages, more applications areas for ASP are found. While traditional application domains were mainly in the knowledge representation and reasoning area, we now also see more and more applications in areas were competitors like SAT or CSP were considered better alternatives. We believe, these current applications are just the tip of the iceberg. In years to come, we will see more and more successful applications plus further expansion and improvements on existing applications.
Reasoning about action in polynomial time
Authors: Thomas Drakengren, Marcus Bjareland
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this paper are the following: a temporal logic with a restriction for which deciding satisfiability is tractable, a tractable extension for reasoning about action, and NP-completeness results for the unrestricted problems. Many interesting reasoning problems can be modelled, involving nondeterminism, concurrency and memory of actions. The reasoning process is proved to be sound and complete.
Study on Resident Behaviors of Selecting Saving Bank
Authors: Xu Shoukun, Ma Zhenghua, Xue Guoxing
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The location of a bank has a direct effect on saving behavior of residents. Study on the relations between the allocation of the deposit and the locations of the banks have an urgent meaning. To this end, fuzzy mathematics is used. The allocation of resident savings in each bank is expressed as a fuzzy subset, and each bank is given a attractor, which denotes the capability of capturing deposit within surrounding areas, and based on the attractor, fuzzy membership grade for each fuzzy subset are calculated. Then the results are normalized to ensure that every deposit is not done in two different banks. A real case has been checked with above model and it showed a good performance, and this model could be used as guidance for optimal site selection of bank.
Modified Energy-Aware AODV Routing for Ad hoc Networks
Authors: Zhang Zhaoxiao, Pei Tingrui, Zeng Wenli
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

Routing in Ad Hoc Networks has received significant attention with a number of different routing protocols proposed in recent years. DSR, DSDV and AODV are the shortest path protocols for Ad Hoc networks. According to energy, the shortest path may be not the best path. A new mechanism of energy-aware named EAODV for Ad Hoc is proposed in this paper, which is based on the classical AODV (the routing protocol on demand). And backup routing mechanism is adopted. In EAODV, the route which spends less energy and owns larger capacity is selected by synthetic analysis. Use software simulating and analyze performance of it. The simulations indicate that this protocol is better than AODV in packet delivery ratio, average end to end delay and normalized routing overhead.
Context-dependent regression testing for natural language processing
Authors: Elaine Farrow, Myroslava O. Dzikovska
Venue: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2009)

Regression testing of natural language systems is problematic for two main reasons: component input and output is complex, and system behaviour is context-dependent. We have developed a generic approach which solves both of these issues. We describe our regression tool, Contest, which supports context-dependent testing of dialogue system components, and discuss the regression test sets we developed, designed to effectively isolate components from changes and problems earlier in the pipeline. We believe that the same approach can be used in regression testing for other dialogue systems, as well as in testing any complex NLP system containing multiple components.
Definition and Evaluation of Local Path Recovery Mechanisms in Wireless Sensor and Actuator Networks
Authors: Pieter De Mil, Eli De Poorter, Benoît Latre, Ingrid Moerman, Piet Demeester
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

In Wireless Sensor and Actuator Networks nodes can fail and the link quality can fluctuate rapidly over time. With the start of the pervasive revolution, issues like scalability and mobility must be tackled in these low-power and lossy networks. We propose and evaluate two mechanisms,Path Resumption and Cost Based Multipath Routing, which can help existing or new local path recovery techniques to achieve a higher success rate. With Path Resumption we turn the network into several virtual mountain landscapes.This will help the search for new paths if necessary. Cost Based Multipath Routing enables the nodes to balance the load over a configured number of paths. The main objective is keeping suboptimal paths alive while keeping the maintenance overhead low. This way local recovery will achieve a higher success rate. The protocols are implemented in and simulated with ns-2 and evaluated by using WiNVis, anew wireless network visualisator. We have defined a new set of failure and mobility scenarios and we have compared the performance of both the protocols. Path Resumption has a lower complexity and is less suitable for mobile scenarios whereas Cost Based Multipath Routing offers more adjustable parameters and a better mobility support.
Discovery of Quantified Hierarchical Censored Production Rules (QHCPR) from Large Data Set
Authors: Tamanna Siddiqui, M. Afshar Alam
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

In this paper a Fusion algorithm is suggested in between two knowledge bases for discovery of QHCPR. HCPR system is capable of handling trade-off between the precision of an inference and its computational efficiency leading to trade-off between the certainty of a conclusion and its specificity. It is an attempt to use Dempster-Shafer interpretation of the HCPRs for the quantification to discover HCPR in the formDecision If Unless Generality Specificity, [alpha, beta, gamma, delta]. The discovered Quantified HCPRs would facilitate quantitative reasoning and Learning. Examples are given to demonstrate the performance of proposed approach.
Gradient Approximation on Uniform Meshes by Finite Differences and Cubic Spline Interpolation
Authors: P. Sablonnière
Venue: Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII (2009)

For the approximation of gradients from data values at vertices of a uniform grid, we compare two methods based on cubic spline interpolation with a classical method based on finite differences. For univariate cubic splines, we use the so-called de Boor's Not a Knot property and a new method giving pretty good slopes. Then these methods are used on parallels to the axes for estimating gradients on bivariate grids. They are illustrated by several numerical examples.
Energy-Efficient Multiple Query Optimization for Wireless Sensor Networks
Authors: Yu Won Lee, Ki Yong Lee, Myoung Ho Kim
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

A wireless sensor network is a collection of sensor nodes distributed over a geographic area to monitor physical conditions,such as temperature, light, humidity, or pressure.Since a sensor node has limited energy supply,running multiple continuous monitoring queries may impose significant overhead on the sensor network.In this paper,we propose an energy-efficient multiple query optimization method to reduce the number of monitoring queries that are running in the sensor network.When a new monitoring query is submitted to the base station,the proposed method checks whether the new query can be evaluated using results of currently running queries. If so, the proposed method rewrites the new query using currently running queries and then evaluates the rewritten query at the base station without injecting it into the sensor network. Consequently, the amount of data transmitted from sensor nodes to the base station is reduced, resulting in lower energy consumption.Through experiments,we show the effectiveness of the proposed method.
Approximating an auction mechanism by multi-issue negotiation
Authors: Koen Hindriks, Dmytro Tykhonov, Mathijs de Weerdt
Venue: Proceedings of the 1st International Working Conference on Human Factors and Computational Models in Negotiation (2008)

The main question addressed in this paper is whether a theoretical outcome determined by an auction mechanism can be reasonably approximated by negotiation among agents in order to drop some of the unrealistic constraints or assumptions presupposed by the mechanism. In particular, we are interested in whether the assumption that a buyer publicly announces her preferences in order to guarantee perfect knowledge of these preferences can be dropped if a negotiating agent is used that can learn preferences. We show how to setup a multiplayer multi-issue negotiation process where preferences are learned, and we investigate how the results of this process relate to the theoretical result of holding an auction in the case of complete knowledge about the preferences of the buyer. Experiments show that the outcomes obtained by negotiating agents that learn opponent preferences approximate the outcome predicted by the mechanism. It thus follows that the assumption of perfect knowledge about buyer preferences can be removed when players are equipped with proper learning capabilities. We also investigate whether the procedure dictated by the mechanism can be further relaxed but in that case experiments indicate that more complex considerations about the market need to be taken into account.