ppxscal/embedding_network huggingface dataset:
Structural Complexity of AvgBPP
Authors: Dmitry Itsykson
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

We study the class AvgBPP that consists of distributional problems which can be solved in average polynomial time (in terms of Levin's average-case complexity) by randomized algorithms with bounded error. We prove that there exists a distributional problem that is complete for AvgBPP under polynomial-time samplable distributions. Since we use deterministic reductions, the existence of a deterministic algorithm with average polynomial running time for our problem would imply AvgP = AvgBPP. Note that, while it is easy to construct a promise problem that is complete for $\bf promise\mbox{-}BPP$ [Mil01], it is unknown whether BPP contains complete languages. We also prove a time hierarchy theorem for AvgBPP (there are no known time hierarchy theorems for BPP). We compare average-case classes with their classical (worst-case) counterparts and show that the inclusions are proper.
Defeasible specifications in action theories
Authors: Chitta Baral, Jorge Lobo
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Recent research in formalizing effects of actions on a world in the presence of constraints have mostly concentrated on non-defeasible specifications, where the effect of actions and constraints are strictly specified. In this paper we show how to incorporate defeasibility into the specifications. In our approach we consider extensions of the high level language A of Gelfond and Lifschitz and introduce defeasible constraints and effect propositions. While direct semantics of A does not need a logical language, our semantics is defined using extended logic programming. This is due to the defeasibility of the specification.
Specification of a Drawing Facility for Diagram Editors
Authors: Sonja Maier, Mark Minas
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The purpose of this paper is to give an overview of a drawing approach for the visualization of diagrams. The approach is tailored to editors for visual languages, which support structured editing as well as free-hand editing. In this approach, the editor developer visually specifies layout behavior. From this specification a drawing facility is generated. With the generated editor, the user may perform incremental diagram drawing at any time. When visualizing components, taking into account geometric dependencies between different components for layout computation is a challenging task. Therefore, we choose the visual languages Petri nets and GUI forms as running examples. Based on these examples, we show the applicability of our approach to graph-based and hierarchical visual languages.
Operational Decision Making in Aluminium Smelters
Authors: Yashuang Gao, Mark P. Taylor, John J. Chen, Michael J. Hautus
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Many computer systems incorporating artificial intelligence have been introduced for use in industry to assist in making decisions and controlling processes. However, decision making in a complex industrial plant, such as an aluminium smelter, involves psychologically related factors such as intuitive reasonings, operator response characteristics, perception of risk, and implication of rewards. While a significant body of work does exist on decision science, research concerning human interaction with process control systems is still at the development stage. The work reported here aims to meet the needs of the process industry by incorporating human factors and decision making strategies into computer programs such as a supervisory control system for aluminium smelters. A case study on the control of the level of the liquid electrolyte was carried out to firstly facilitate an understanding of the variables, including human factors, on process control. It was found that the availability of crushed solidified electrolyte material had a significant impact on the level of the liquid electrolyte, while the implementation of a supervisory control system had a certain impact, management and leadership styles also had a significant influence.
An application of one-sided Jacobi polynomials for spectral modeling of vector fields in polar coordinates
Authors: T. Sakai, L. G. Redekopp
Venue: Journal of Computational Physics (2009)

A spectral tau-method is proposed for solving vector field equations defined in polar coordinates. The method employs one-sided Jacobi polynomials as radial expansion functions and Fourier exponentials as azimuthal expansion functions. All the regularity requirements of the vector field at the origin and the physical boundary conditions at a circumferential boundary are exactly satisfied by adjusting the additional tau-coefficients of the radial expansion polynomials of the highest order. The proposed method is applied to linear and nonlinear-dispersive time evolution equations of hyperbolic-type describing internal Kelvin and Poincare waves in a shallow, stratified lake on a rotating plane.
Gemini NI: An Integration of Two Network Interfaces
Authors: Kai Wang, Xiaomin Li, Xuejun An, Ninghui Sun
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

According to the development of the TOP500, the performance of the high performance computers (HPCs) is increasing rapidly. The incredible performance increment of the HPCs should be largely attributed to the development of their communication systems, because the HPCs cannot extend to such a large scale without their excellent communication systems. As an important member of the communication system, the network interface (NI) always plays a significant role. Since the network interface locates on the critical path of the communication system, it can easily become a bottleneck if it cannot provide low latency and high bandwidth for communication. The Gemini NI presented in this paper has a good performance potential in both latency and bandwidth. It has a remote load/store (RLS) mechanism which can provide ultra low latency. Furthermore, it has two HyperTransport (HT) interfaces connected to double processors or symmetric multi-processors (SMP), and it has four proprietary switch interfaces connected to the switches. This approach largely in-creases the throughput of the Gemini NI. Inside the Gemini NI, almost all the components of a network interface are duplicated. The resource sharing within the Gemini NI can provide great flexibility for scheduling. A FPGA prototype of the Gemini NI has been implemented, and the preliminary results prove the validity of our design.
Expression of Emotions Using Wrinkles, Blushing, Sweating and Tears
Authors: Celso M. Melo, Jonathan Gratch
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Wrinkles, blushing, sweating and tears are physiological manifestations of emotions in humans. Therefore, the simulation of these phenomena is important for the goal of building believable virtual humans which interact naturally and effectively with humans. This paper describes a real-time model for the simulation of wrinkles, blushing, sweating and tears. A study is also conducted to assess the influence of the model on the perception of surprise, sadness, anger, shame, pride and fear. The study follows a repeated-measures design where subjects compare how well is each emotion expressed by virtual humans with or without these phenomena. The results reveal a significant positive effect on the perception of surprise, sadness, anger, shame and fear. The relevance of these results is discussed for the fields of virtual humans and expression of emotions.
The Influence of Intersection Transition Signal to Traffic Safety
Authors: Hong-bo Qian, Sheng Dong
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Transition signal is one of the main factors contributing to the safety of intersection, scientific transition signal setting can greatly improve the traffic safety and efficiency. By analyzing the present situation of transition signal setting in our country, It is pointed that there is something ambiguously defined and non-operating, and even some logical error in the law of road traffic safety. According to the vehicles’ dynamical characteristics and drivers’ psychology at the onset of amber signal, this paper brings forward a new calculation formula for amber signal and all-red signal. The research indicates that it is not wise to prohibit vehicles from entering the intersection during the amber interval or cancel amber signal. it is recommend to cancel the green signal count-down while reserve the red signal count-down, and adopt the automatic enforcement to reduce red-light running in the mean time.
Using paraphrases of deep semantic representions to support regression testing in spoken dialogue systems
Authors: Beth Ann Hockey, Manny Rayner
Venue: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2009)

Rule-based spoken dialogue systems require a good regression testing framework if they are to be maintainable. We argue that there is a tension between two extreme positions when constructing the database of test examples. On the one hand, if the examples consist of input/output tuples representing many levels of internal processing, they are fine-grained enough to catch most processing errors, but unstable under most system modifications. If the examples are pairs of user input and final system output, they are much more stable, but too coarse-grained to catch many errors. In either case, there are fairly severe difficulties in judging examples correctly. We claim that a good compromise can be reached by implementing a paraphrasing mechanism which maps internal semantic representations into surface forms, and carrying out regression testing using paraphrases of semantic forms rather than the semantic forms themselves. We describe an implementation of the idea using the Open Source Regulus toolkit, where paraphrases are produced using Regulus grammars compiled in generation mode. Paraphrases can also be used at run-time to produce confirmations. By compiling the paraphrase grammar a second time, as a recogniser, it is possible in a simple and natural way to guarantee that confirmations are always within system coverage.
A Parameterized Approach to Spam-Resilient Link Analysis of the Web
Authors: James Caverlee, Steve Webb, Ling Liu, William B. Rouse
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Link-based analysis of the Web provides the basis for many important applications—like Web search, Web-based data mining, and Web page categorization—that bring order to the massive amount of distributed Web content. Due to the overwhelming reliance on these important applications, there is a rise in efforts to manipulate (or spam) the link structure of the Web. In this manuscript, we present a parameterized framework for link analysis of the Web that promotes spam resilience through a source-centric view of the Web. We provide a rigorous study of the set of critical parameters that can impact source-centric link analysis and propose the novel notion of influence throttling for countering the influence of link-based manipulation. Through formal analysis and a large-scale experimental study, we show how different parameter settings may impact the time complexity, stability, and spam resilience of Web link analysis. Concretely, we find that the source-centric model supports more effective and robust rankings in comparison with existing Web algorithms such as PageRank.
Applying ASP to UML Model Validation
Authors: Mario Ornaghi, Camillo Fiorentini, Alberto Momigliano, Francesco Pagano
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We apply ASP to model validation in a CASE setting, where models are UML class diagrams and object diagrams are called "snapshots". We present the design and implementation of MSG, a snapshot generator for UML models that employs DLV-Complex as a generator engine, the answer sets representing the legal snapshots.
Non-complete Topological Analysis in Image-Based 3D Building Reconstruction
Authors: Yu Wang, Xin Zheng
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

3D reconstruction from single view is a very difficult problem in computer vision and computer graphics. Much different from method using presently, we proposed a feasible and efficient method of 3D building reconstruction method by using non-complete topological analysis in this paper, which rapidly achieves the process of recognizing architectures based one or two images. Firstly, the outline of visible parts of architectures is extracted from image and is analyzed to get the incomplete topology of architectures. Next, the resulted topology will be divided into different primitive geometries, and these geometries are used to match models in databases finally. Experiments show that our method has better effectiveness and feasibility.
The corpus and the lexicon: standardising deep lexical acquisition evaluation
Authors: Yi Zhang, Timothy Baldwin, Valia Kordoni
Venue: Proceedings of the Workshop on Deep Linguistic Processing (2007)

This paper is concerned with the standardisation of evaluation metrics for lexical acquisition over precision grammars, which are attuned to actual parser performance. Specifically, we investigate the impact that lexicons at varying levels of lexical item precision and recall have on the performance of pre-existing broad-coverage precision grammars in parsing, i.e., on their coverage and accuracy. The grammars used for the experiments reported here are the LinGO English Resource Grammar (ERG; Flickinger (2000)) and JaCY (Siegel and Bender, 2002), precision grammars of English and Japanese, respectively. Our results show convincingly that traditional F-score-based evaluation of lexical acquisition does not correlate with actual parsing performance. What we argue for, therefore, is a recall-heavy interpretation of F-score in designing and optimising automated lexical acquisition algorithms.
Evaluation of Fusion for Similarity Searching in Online Handwritten Documents
Authors: Sascha Schimke, Maik Schott, Claus Vielhauer, Jana Dittmann
Venue: Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects (2009)

With the spread of TabletPCs handwriting raises in its significance and importance in the digital domain. Also there exist other devices with pen-based inputs like PDAs, digitizer tablets and pads specially prepared with sensors. The advantage of handwritten input methods is their possibility of an ad hoc creation of technical sketches and drawings alongside with text and that keyboards may be in some cases and environments bothersome. Therefore the amount of handwritten documents is likely to increase. But a great problem is a proper full text search on such documents. This paper discusses the effects of multi-sample and multi-algorithm fusion approaches, known from biometrics to increase the performance. The tests are done by using three different devices (Logitech ioPen, Pegasus PC NotesMaker, ACE CAD DigiMemo Digital) and five different feature extraction methods (square grid, triangular grid, slope, curvature and slant of writing) and show that fusion can improve the retrieval performance in terms of precision and recall from 0.903 and 0.935 without fusion to 0.958 and 0.943 with fusion, respectively.
The formal system &lambda;&delta;
Authors: Ferruccio Guidi
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

The formal system &lambda;&delta; is a typed &lambda;-calculus that pursues the unification of terms, types, environments, and contexts as the main goal. &lambda;&delta; takes some features from the Automath-related &lambda;-calculi and some from the pure type systems, but differs from both in that it does not include the &Pi; construction while it provides for an abbreviation mechanism at the level of terms. &lambda;&delta; enjoys some important desirable properties such as the confluence of reduction, the correctness of types, the uniqueness of types up to conversion, the subject reduction of the type assignment, the strong normalization of the typed terms, and, as a corollary, the decidability of type inference problem.
Formalizing the Logic-Automaton Connection
Authors: Stefan Berghofer, Markus Reiter
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

This paper presents a formalization of a library for automata on bit strings in the theorem prover Isabelle/HOL. It forms the basis of a reflection-based decision procedure for Presburger arithmetic, which is efficiently executable thanks to Isabelle's code generator. With this work, we therefore provide a mechanized proof of the well-known connection between logic and automata theory.
The micro-structure of use of help
Authors: David G. Novick, Oscar D. Andrade, Nathaniel Bean
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

To see whether, from the user's standpoint, muddling through with trial-and-error exploration of the interface actually works as well as consulting help, we analyzed video recordings of 14 subjects using Microsoft Publisher. We segmented their attempts at accomplishing four tasks into episodes, lasting from a few seconds to a few minutes, using four problem-solving approaches: help, recall, and trial-and-error. The subjects' overall rates of success with trial-and-error were higher than with help. We present trends of use of the approaches across the four tasks, review the apparent causes of success and failure when using the approaches, and develop an affordance-knowledge model that helps to explain people's preference for muddling through over using help. We conclude by discussing the model's implications for developers of systems and writers of help.
Global Exponential Stability Analysis for Uncertain Neural Networks with Discrete and Distributed Time-Varying Delays
Authors: Wei Guan, Yiming Chen, Hongxia Sun, Zenghui Xu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

In this paper, the global exponential stability is investigated for a class of neural networks with both discrete and distributed delays and norm-bounded uncertainties. The discrete delay considered in this paper is interval-like time-varying delay. By using Lyapunov stable theory and linear matrix inequality, the derived criteria are not only dependent on distributed delay but also on the lower bound and upper bound of discrete time delay. And we don’t need the restriction that the derivative of discrete time-varying delay is less than one. A numerical example is given to illustrate the effectiveness and improvement over some existing results.
Application of Grey Relation Clustering and CGNN in Gas Concentration Prediction in Top Corner of Coal Mine
Authors: Qu Zhiming, Liang Xiaoying
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Using grey relation clustering and combined grey neural network (CGNN), the combined model is setup, which aims at solving the problems of predicting and comparing the gas concentration in top corner of coal mine. Through comparison and prediction, the results show that, in short-term prediction, grey relation clustering is an effective way and CGNN has perfect ability to study. CGNN has the dual properties of trend and fluctuation under the condition of combining with the time-dependent sequence prediction. It is concluded that great improvement comparing with any methods of trend prediction and simple factor in CGNN is stated and described in gas concentration in top corner of coal mine.
Model-Based Illumination Correction for Face Images in Uncontrolled Scenarios
Authors: Bas Boom, Luuk Spreeuwers, Raymond Veldhuis
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Face Recognition under uncontrolled illumination conditions is partly an unsolved problem. Several illumination correction methods have been proposed, but these are usually tested on illumination conditions created in a laboratory. Our focus is more on uncontrolled conditions. We use the Phong model which allows us to model ambient light in shadow areas. By estimating the face surface and illumination conditions, we are able to reconstruct a face image containing frontal illumination. The reconstructed face images give a large improvement in performance of face recognition in uncontrolled conditions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An FPGA-based Parallel Hardware Architecture for Real-Time Face Detection Using a Face Certainty Map
Authors: Seunghun Jin, Dongkyun Kim, Thuy Tuong Nguyen, Bongjin Jun, Daijin Kim, Jae Wook Jeon
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

This paper presents an FPGA-based parallel hardware architecture for real-time face detection. An image pyramid with twenty depth levels is generated using the input image. For these scaled-down images, a local binary pattern transform and feature evaluation are performed in parallel by using the proposed block RAM-based window processing architecture. By sharing the feature look-up tables between two corresponding scaled-down images, we can reduce the use of routing resources by half. For prototyping and evaluation purposes, the hardware architecture was integrated into a Virtex-5 FPGA. The experimental result shows around 300 frames per second speed performance for processing standard VGA (640×480×8) images. In addition, the throughput of the implementation can be adjusted in proportion to the frame rate of the camera, by synchronizing each individual module with the pixel sampling clock.
Breaking value symmetry
Authors: Toby Walsh
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. In a recent series of papers, we have studied methods to break value symmetries (Walsh 2006a; 2007). Our results identify computational limits on eliminating value symmetry. For instance, we prove that pruning all symmetric values is NP-hard in general. Nevertheless, experiments show that much value symmetry can be broken in practice. These results may be useful to researchers in planning, scheduling and other areas as value symmetry occurs in many different domains.
Affiliations, Emotion and the Mobile Phone
Authors: Jane Vincent
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

Over half of the world's population is expected to be using mobile phones by 2009 and many have become attached to and even dependent on this small electronic communications device. Drawing on seven years of research into the affective aspects of mobile phone usage this chapter will examine ways that people in the UK have incorporated mobile phones into their lives. It will explore what they use it for, their affiliations and their emotional attachment to the mobile phone and how it appears to have gained such an extraordinary role in maintaining close relationships with family and friends.