ppxscal/embedding_network huggingface dataset:
Web article extraction for web printing: a DOM+visual based approach
Authors: Ping Luo, Jian Fan, Sam Liu, Fen Lin, Yuhong Xiong, Jerry Liu
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

This work studies the problem of extracting articles from Web pages for better printing. Different from existing approaches of article extraction, Web printing poses several unique requirements: 1) Identifying just the boundary surrounding the text-body is not the ideal solution for article extraction. It is highly desirable to filter out some uninformative links and advertisements within this boundary. 2) It is necessary to identify paragraphs, which may not be readily separated as DOM nodes, for the purpose of better layout of the article. 3) Its performance should be independent of content domains, written languages, and Web page templates. Toward these goals we propose a novel method of article extraction using both DOM (Document Object Model) and visual features. The main components of our method include: 1) a text segment/paragraph identification algorithm based on line-breaking features, 2) a global optimization method, Maximum Scoring Subsequence, based on text segments for identifying the boundary of the article body, 3) an outlier elimination step based on left or right alignment of text segments with the article body. Our experiments showed the proposed method is effective in terms of precision and recall at the level of text segments.
Random and Raster: Display Technologies and the Development of Videogames
Authors: Nick Montfort, Ian Bogost
Venue: IEEE Annals of the History of Computing (2009)

Videogame developers have utilized many types of display technology, from oscilloscopes to Teletypes to high-definition LCD displays. Two significant early display technologies, raster scan and random scan CRTs, played a significant part in the history and evolution of videogames. A study of these technologies shows how the choice of one or the other, and the need to port games between the two, influenced game design and prompted developers to innovate.
Understanding complex natural language explanations in tutorial applications
Authors: Pamela W. Jordan, Maxim Makatchev, Umarani Pappuswamy
Venue: Proceedings of the Third Workshop on Scalable Natural Language Understanding (2006)

We describe the Why2-Atlas intelligent tutoring system for qualitative physics that interacts with students via natural language dialogue. We focus on the issue of analyzing and responding to multi-sentential explanations. We explore an approach that combines a statistical classifier, multiple semantic parsers and a formal reasoner for achieving a deeper understanding of these explanations in order to provide appropriate feedback on them.
Simulated Distribution and Sensitivity of Vegetation Types in China in the Past 100 Years and Future
Authors: Chen Xu, Zhang Yaping
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

What is the relationship between vegetation patterns and climate changes in China? The geographic distribution of vegetation types in China in the past 100 years and future was simulated based on climatology using a small set of plant functional types (PFTs) embedded in the biogeochemistry biogeography model BIOME4. Results show that as time goes by, vegetation sensitivity to climate change is a increasing trend with kappa coefficient and crucial changes occur in last 20 years. In the future climate scenario, the change of vegetation increases significantly, and increased CO2 concentration would potentially lead to big changes in China vegetation systems. But the vegetation sensitivity to climate change has heterogeneity because of the complex topography in China.
Data-driven MCMC for learning and inference in switching linear dynamic systems
Authors: Sang Min Oh, James M. Rehg, Tucker Balch, Frank Dellaert
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Switching Linear Dynamic System (SLDS) models are a popular technique for modeling complex nonlinear dynamic systems. An SLDS has significantly more descriptive power than an HMM, but inference in SLDS models is computationally intractable. This paper describes a novel inference algorithm for SLDS models based on the Data-Driven MCMC paradigm. We describe a new proposal distribution which substantially increases the convergence speed. Comparisons to standard deterministic approximation methods demonstrate the improved accuracy of our new approach. We apply our approach to the problem of learning an SLDS model of the bee dance. Honeybees communicate the location and distance to food sources through a dance that takes place within the hive. We learn SLDS model parameters from tracking data which is automatically extracted from video. We then demonstrate the ability to successfully segment novel bee dances into their constituent parts, effectively decoding the dance of the bees.
An Integration of Cloud Transform and Rough Set Theory to Induction of Decision Trees
Authors: Jing Song, Tianrui Li, Da Ruan
Venue: Fundamenta Informaticae (2009)

Decision trees are one of the most popular data-mining techniques for knowledge discovery. Many approaches for induction of decision trees often deal with the continuous data and missing values in information systems. However, they do not perform well in real situations. This paper presents a new algorithm, decision tree construction based on the Cloud transform and Rough set theory under the characteristic relation (CR), for mining classification knowledge from a given data set. The continuous data is transformed into discrete qualitative concepts via the cloud transformation and then the attribute with the smallest weighted mean roughness under the characteristic relation is selected as the current splitting node. Experimental evaluation shows the decision trees constructed by the CR algorithm tend to have a simpler structure, much higher classification accuracy and more understandable rules than those by C5.0 in most cases.
Automatic Generation of Mashups for Personalized Commerce in Digital TV by Semantic Reasoning
Authors: Yolanda Blanco-Fernández, Martín López-Nores, José J. Pazos-Arias, Manuela I. Martín-Vicente
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

The evolution of information technologies is consolidating recommender systems as essential tools in e-commerce. To date, these systems have focused on discovering the items that best match the preferences, interests and needs of individual users, to end up listing those items by decreasing relevance in some menus. In this paper, we propose extending the current scope of recommender systems to better support trading activities, by automatically generating interactive applications that provide the users with personalized commercial functionalities related to the selected items. We explore this idea in the context of Digital TV advertising, with a system that brings together semantic reasoning techniques and new architectural solutions for web services and mashups.
Asynchronous Congestion Games
Authors: Michal Penn, Maria Polukarov, Moshe Tennenholtz
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each resource executes its assigned tasks in a random order. Each player's aim is to minimize his expected cost which is the sum of two terms --- the sum of the fixed costs over the set of his utilized resources and the expected cost of his task execution. The cost of a player's task execution is determined by the earliest time his task is completed, and thus it might be beneficial for him to assign his task to several resources. We show the existence of pure strategy Nash equilibria in ACGs. Moreover, we present a polynomial time algorithm for finding such an equilibrium in a given ACG.
Sensor Fault Reconstruction for Satellite Gyroscope Using Eigenstructure Assignment
Authors: Luan Jia-hui, Tao Lai Fa, Lu Chen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

This paper presents an observer based robust sensor fault reconstruction scheme designed by assigning right eigenvectors. It was found that if the observer had a certain eigenstructure, it could null the effect of nonlinearities and disturbances on the fault reconstruction. The design method not only can detect the fault as fast, but also can estimate magnitude of the fault. The validity and practicability was proved by using it in gyroscope fault of satellite attitude control system.
Research on DSS-Based MIMO Radar's Detection Performance
Authors: Jun Yan, Gong Zhang, Ling Cheng
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

The application of multi-input multi-output (MIMO) radar concept to DSS (Distributed Small Satellite) is considered to make best use of the cooperative mode of DSS and the spatial diversity of MIMO radar. The DSS-based MIMO radar system is introduced in this paper. Using the receiving signal’s eigenvalue of covariance matrix, it analyses detection performance of MIMO radar, which can’t form a full-diversity path. The detection performance of MIMO radar based on moving platform are discussed. We show the influence of DSS platform’s movement on radar’s detection performance, and discussed the feasibility of DSS-based MIMO radar system.
A Tale of Six Countries: eParticipation Research from an Administration and Political Perspective
Authors: Anna Carola Freschi, Rony Medaglia, Jacob Nørbjerg
Venue: Proceedings of the 1st International Conference on Electronic Participation (2009)

This paper presents a cross-national analysis of eParticipation research in the administrative and political domain. It covers eParticipation research in six European countries (Austria, Denmark, France, Germany, Italy, and Sweden) focusing on several aspects of eParticipation research, including research questions, methods, disciplinary approaches, units of analysis, research findings. The paper also provides an overview of national research, and outlines overall research findings and future directions in eParticipation research.
Inter-program Properties
Authors: Andrei Voronkov, Iman Narasamdya
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

We develop foundations for proving properties relating two programs. Our formalization is based on a suitably adapted notion of program invariant for a single program. First, we give an abstract formulation of the theory of program invariants based on the notion of assertion function: a function that assigns assertions to program points. Then, we develop this abstract notion further so that it can be used to prove properties between two programs. We describe an application of the theory to proving program properties in translation validation.
We're Wiser Together
Authors: Susan Craw
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

Case-Based Reasoning solves new problems by reusing solutions from individual experiences stored in the case base. This paper explores beyond the explicit knowledge captured as individual experiences for problem-solving. Instead, the collective knowledge of the case base provides additional implicit knowledge that may be exploited to improve traditional case-based reasoning systems through additional knowledge containers and to provide a new form of self-adaptive case-based reasoning. This paper presents a view that individual experiences are more fully utilised through the wisdom of collective memory.
On local Hermitian and skew-Hermitian splitting iteration methods for generalized saddle point problems
Authors: Mei-Qun Jiang, Yang Cao
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we first present a local Hermitian and skew-Hermitian splitting (LHSS) iteration method for solving a class of generalized saddle point problems. The new method converges to the solution under suitable restrictions on the preconditioning matrix. Then we give a modified LHSS (MLHSS) iteration method, and further extend it to the generalized saddle point problems, obtaining the so-called generalized MLHSS (GMLHSS) iteration method. Numerical experiments for a model Navier-Stokes problem are given, and the results show that the new methods outperform the classical Uzawa method and the inexact parameterized Uzawa method.
Spotting overgeneration suspects
Authors: Claire Gardent, Eric Kow
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

We present a method for quickly spotting overgeneration suspects (i.e., likely cause of overgeneration) in hand-coded grammars. The method is applied to a medium size Tree Adjoining Grammar (TAG) for French and is shown to help reduce the number of outputs by 70% almost all of it being overgeneration.
Fault tolerant mechanism to improve yield in NoCs using a reconfigurable router
Authors: Caroline Concatto, Debora Matos, Luigi Carro, Fernanda Kastensmidt, Altamiro Susin, Erika Cota, Marcio Kreutz
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

As the complexity of designs increase and technologies scale down, devices are subject to new types of malfunctions and failures. Network-on-chip routers are responsible to ensure the proper communication of on-chip cores, and the buffers present in the router channels are crucial to ensure the communication performance. However, faults can affect the routers services, thus compromising the communication integrity and the whole operation of the system. This work proposes the simultaneous use of Reconfiguration, Hamming Code and Triple Modular Redundancy (TMR) to ensure fault tolerance in the FIFOs and links of the network-on-chips (NoCs). The proposed router can dynamically stop using faulty buffers and, to sustain performance, borrow other buffer units from its neighbor channels whenever necessary. The Hamming Code protects the data in the links against a fault in a wire, while TMR is used to protect the control of the FIFO. The new router increases the reliability in 63% and shows low latency and power when compared to the original router. The HW overhead is 77% more gates, used to improve the yield and the system lifetime in comparison to the usage of the reconfigurable router just for performance increase in the NoC.
Efficient extraction of oracle-best translations from hypergraphs
Authors: Zhifei Li, Sanjeev Khudanpur
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

Hypergraphs are used in several syntax-inspired methods of machine translation to compactly encode exponentially many translation hypotheses. The hypotheses closest to given reference translations therefore cannot be found via brute force, particularly for popular measures of closeness such as BLEU. We develop a dynamic program for extracting the so called oracle-best hypothesis from a hypergraph by viewing it as the problem of finding the most likely hypothesis under an n-gram language model trained from only the reference translations. We further identify and remove massive redundancies in the dynamic program state due to the sparsity of n-grams present in the reference translations, resulting in a very efficient program. We present runtime statistics for this program, and demonstrate successful application of the hypotheses thus found as the targets for discriminative training of translation system components.
The Impact of Congestion Control Mechanisms on Network Performance after Failure in Flow-Aware Networks
Authors: Jerzy Domżał, Robert Wójcik, Andrzej Jajszczyk
Venue: Traffic Management and Traffic Engineering for the Future Internet: First Euro-NF Workshop, FITraMEn 2008, Porto, Portugal, December 11-12, Revised Selected Papers (2009)

This paper presents the impact of congestion control mechanisms proposed for Flow-Aware Networks on packet transmission in the overloaded network after a link failure. The results of simulation based analysis show how to set the values of the congestion control parameters in order to decrease the acceptance time of the interrupted streaming flows in the backup link. The research was performed for three congestion control mechanisms, the Enhanced Flushing Mechanism (EFM), the Remove Active Elastic Flows (RAEF), and Remove and Block Active Elastic Flows (RBAEF) in two different cross-protect router architectures, with the PFQ (Priority Fair Queuing) and with the PDRR (Priority Deficit Round Robin) scheduling algorithms. Moreover, the advantages and weaknesses of using the proposed solutions in FAN, considering the effects of a network element failure, are described and analyzed.
Activity Recognition for Everyday Life on Mobile Phones
Authors: Gerald Bieber, Jörg Voskamp, Bodo Urban
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

Mobile applications for activity monitoring are regarded as a high potential field for efficient improvement of health care solutions. The measurement of physical activity within every-day conditions should be as easy as using an automatic weighing machine. Up to now physical activity monitoring required special sensor devices and are not suitable for an every day usage. Movement pattern recognition based on acceleration data enables the usage of standard mobile phones for measurement of physical activity. Now, just by carrying a standard phone in a pocket, the device provides information about the type, intensity and duration of the performed activity. Within the project DiaTrace, we developed the method and algorithm to detect activities like walking, jumping, running, cycling or car driving. Based on activity measurement, this application also calculates the consumed calories over the day, shares activity progress with friends or family and might deliver details about different kinds of transportation during a business trip. The DiaTrace application can easily used today by standard phones which are already equipped with the required sensors.
An ironing-based approach to adaptive online mechanism design in single-valued domains
Authors: David C. Parkes, Quang Duong
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Online mechanism design considers the problem of sequential decision making in a multi-agent system with self-interested agents. The agent population is dynamic and each agent has private information about its value for a sequence of decisions. We introduce a method ("ironing") to transform an algorithm for online stochastic optimization into one that is incentive-compatible. Ironing achieves this by canceling decisions that violate a form of monotonicity. The approach is applied to the CONSENSUS algorithm and experimental results in a resource allocation domain show that not many decisions need to be canceled and that the overhead of ironing is manageable.
Efficiency of visual time-sharing behavior: the effects of menu structure on POI search tasks while driving
Authors: Tuomo Kujala
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

In this paper, the effects of two user interface menu structures on a mobile device display, list and grid, are compared in a driving simulation with the measures of visual time-sharing efficiency, visual load, driving performance and secondary task performance. Eighteen participants conducted a set of eight Point-of-Interest (POI) search tasks with the grid- or list-style menus on navigation software during simulated driving. Between-subject analysis revealed that the list-style menu structure supports more efficient and systematic, and thus, safer interaction while driving than the grid-style menu, in terms of time-sharing and total glance time. However, significant effects of the menu structures were not found in secondary task performance, driving performance measured as lane excursions, or in the measures of average duration of, or total number of glances at the display. The results also suggest that the fewer items in a view, the more efficient and safer the interaction in terms of time-sharing. The sensitivity of the time-sharing metrics for revealing tactical level driver distraction in driving simulation can be argued as being at a higher level than the sensitivity of metrics related to lane maintenance, visual load or secondary task performance.
Distribution algorithm in finite difference method and its application to a 2D simulation of temperature inversion
Authors: H. Koshigoe, T. Shiraishi, M. Ehara
Venue: Journal of Computational and Applied Mathematics (2009)

In this article we present a numerical algorithm in a finite difference method coupled with the Schwartz distribution on a surface and its application to 2D simulation of a temperature inversion in meteorology. This phenomenon has been observed in Kyoto in Japan frequently and one of the reasons why the inversion occurs is the radiative cooling on the ground. In order to describe it in a mathematical model, we introduce transmission conditions on the ground and show its distribution formula. The characteristics of our numerical method are based on the direct method and the finite difference approximation of the Schwartz distribution defined on the ground. Through our discussion, a numerical experiment for the inversion of the temperature gradient is presented.
New Utility Models for the Garnata Information Retrieval System at INEX'08
Authors: Luis M. Campos, Juan M. Fernández-Luna, Juan F. Huete, Carlos Martín-Dancausa, Alfonso E. Romero
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

In this work we propose new utility models for the structured information retrieval system Garnata, and expose the results of our participation at INEX'08 in the AdHoc track using this system.
Best-first search for treewidth
Authors: P. Alex Dow, Richard E. Korf
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found by searching over the space of vertex elimination orders. This search space differs from those where best-first search is typically applied, because a solution path is evaluated by its maximum edge cost instead of the sum of its edge costs. We show how to make best-first search admissible on max-cost problem spaces. We also employ breadth-first heuristic search to reduce the memory requirement while still eliminating all duplicate nodes in the search space. Our empirical results show that our algorithms find the exact treewidth an order of magnitude faster than the previous state-of-the-art algorithm on hard benchmark graphs.
Information structure and pauses in a corpus of spoken Danish
Authors: Patrizia Paggio
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

This paper describes a study in which a corpus of spoken Danish annotated with focus and topic tags was used to investigate the relation between information structure and pauses. The results show that intra-clausal pauses in the focus domain, tend to precede those words that express the property or semantic type whereby the object in focus is distinguished from other ones in the domain.