ppxscal/embedding_network huggingface dataset:
Programming Language Pragmatics, Third Edition, 3rd edition
Authors: Michael L. Scott
Venue:  (2009)

As a textbook suitable for the classroom or self-study, Michael Scott's Programming Language Pragmatics provides a worthy tour of the theory and practice of how programming languages are run on today's computers. Clearly organized and filled with a wide-ranging perspective on over 40 different languages, this book will be appreciated for its depth and breadth of coverage on an essential topic in computer science. With references to dozens of programming languages, from Ada to Turing and everything in between (including C, C++, Java, and Perl), this book is a truly in-depth guide to how code is compiled (or interpreted) and executed on computer hardware. Early chapters tend to be slightly more theoretical (with coverage of regular expressions and context-free grammars) and will be most valuable to the computer science student, but much of this book is accessible to anyone seeking to widen their knowledge (especially since recent standards surrounding XML make use of some of the same vocabulary presented here). The book has a comprehensive discussion of compilation and linking, as well as how data types are implemented in memory. Sections on functional and logical programming (illustrated with Scheme and Prolog, which are often used in AI research) can expand your understanding of how programming languages work. Final sections on the advantages--and complexities--of concurrent processing, plus a nice treatment of code optimization techniques, round out the text here. Each chapter provides numerous exercises, so you can try out the ideas on your own. Students will benefit from the practical examples here, drawn from a wide range of languages. If you are a self-taught developer, the very approachable tutorial can give you perspective on the formal definitions of many computer languages, which can help you master new ones more effectively. --Richard Dragan Topics covered: A survey of today's programming languages, compilation vs. interpretation, the compilation process, regular expression and context-free grammars, scanners and parsers, names, scopes and bindings, scope rules, overloading, semantic analysis, introduction to computer architecture, representing data, instruction sets, 680x0 and MIPs architectures, control flow and expression evaluation, iteration and recursion, data types, type checking, records, arrays, strings, sets, pointers, lists, file I/O, subroutines, calling sequences and parameter passing, exception handling, coroutines, compile back-end processing, code generation, linking, object-oriented programming basics, encapsulation and inheritance, late binding, multiple inheritance, functional and logical languages, Scheme and Prolog, programming with concurrency, shared memory and message passing, and code optimization techniques. 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
TKB-UO: using sense clustering for WSD
Authors: Henry Anaya-Sánchez, Aurora Pons-Porrata, Rafael Berlanga-Llavori
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper describes the clustering-based approach to Word Sense Disambiguation that is followed by the TKB-UO system at SemEval-2007. The underlying disambiguation method only uses WordNet as external resource, and does not use training data. Results obtained in both Coarse-grained English all-words task (task 7) and English fine-grained all-words subtask (task 17) are presented.
Computer Analysis of Lighting in Realist Master Art: Current Methods and Future Challenges
Authors: David G. Stork
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

We review several computer based techniques for analyzing the lighting in images that have proven valuable when addressing questions in the history and interpretation of realist art. These techniques fall into two general classes: model independent (where one makes no assumption about the three-dimensional shape of the rendered objects) and model dependent (where one does make some assumptions about their three-dimensional shape). An additiona, statistical algorithm integrates the estimates of lighting position or direction produced by different such techniques. We conclude by discussing several outstanding problems and future directions in the analysis of lighting in realist art.
Nearly-automated metadata hierarchy creation
Authors: Emilia Stoica, Marti A. Hearst
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

Currently, information architects create metadata category hierarchies manually. We present a nearly-automated approach for deriving such hierarchies, by converting the lexical hierarchy WordNet into a format that reflects the contents of a target information collection. We use the term "nearly-automated" because an information architect should have to make only small adjustments to produce an acceptable metadata structure. We contrast the results with an algorithm that uses lexical co-occurrence statistics.
Reversing the Simon Effect with Prior Practice of Noncorresponding Location Words
Authors: Andrea Rottermann, Kim-Phuong L. Vu
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

A benefit for spatial correspondence, called the Simon effect, is typically obtained in choice-reaction time tasks when the stimulus location is irrelevant to the task. Reversal of the Simon effect to favor noncorresponding stimulus-response locations has been obtained for physical-location stimuli after minimal practice (84 trials) with an incompatible spatial mapping. After practice with location-word stimuli, the Simon effect for physical locations is not reduced. The present study evaluated whether practice with "incompatibly" mapped location words can reverse the Simon effect when the practice session emphasizes color-to-response mappings rather than spatial mappings. Two conditions were tested in which the proportion of noncorresponding to corresponding trials was manipulated in the practice session. A full reversal was evident when all trials in the practice session were noncorresponding. Implications for interface design are discussed.
Wavelet-Based Adaptive Solvers on Multi-core Architectures for the Simulation of Complex Systems
Authors: Diego Rossinelli, Michael Bergdorf, Babak Hejazialhosseini, Petros Koumoutsakos
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

We build wavelet-based adaptive numerical methods for the simulation of advection dominated flows that develop multiple spatial scales, with an emphasis on fluid mechanics problems. Wavelet based adaptivity is inherently sequential and in this work we demonstrate that these numerical methods can be implemented in software that is capable of harnessing the capabilities of multi-core architectures while maintaining their computational efficiency. Recent designs in frameworks for multi-core software development allow us to rethink parallelism as task-based, where parallel tasks are specified and automatically mapped into physical threads. This way of exposing parallelism enables the parallelization of algorithms that were considered inherently sequential, such as wavelet-based adaptive simulations. In this paper we present a framework that combines wavelet-based adaptivity with the task-based parallelism. We demonstrate good scaling performance obtained by simulating diverse physical systems on different multi-core and SMP architectures using up to 16 cores.
Assessing demand for intelligibility in context-aware applications
Authors: Brian Y. Lim, Anind K. Dey
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

Intelligibility can help expose the inner workings and inputs of context-aware applications that tend to be opaque to users due to their implicit sensing and actions. However, users may not be interested in all the information that the applications can produce. Using scenarios of four real-world applications that span the design space of context-aware computing, we conducted two experiments to discover what information users are interested in. In the first experiment, we elicit types of information demands that users have and under what moderating circumstances they have them. In the second experiment, we verify the findings by soliciting users about which types they would want to know and establish whether receiving such information would satisfy them. We discuss why users demand certain types of information, and provide design implications on how to provide different intelligibility types to make context-aware applications intelligible and acceptable to users.
A Purely Definitional Universal Domain
Authors: Brian Huffman
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

Existing theorem prover tools do not adequately support reasoning about general recursive datatypes. Better support for such datatypes would facilitate reasoning about a wide variety of real-world programs, including those written in continuation-passing style, that are beyond the scope of current tools.This paper introduces a new formalization of a universal domain that is suitable for modeling general recursive datatypes. The construction is purely definitional, introducing no new axioms. Defining recursive types in terms of this universal domain will allow a theorem prover to derive strong reasoning principles, with soundness ensured by construction. 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
Improvements to monolingual English word sense disambiguation
Authors: Weiwei Guo, Mona T. Diab
Venue: Proceedings of the Workshop on Semantic Evaluations: Recent Achievements and Future Directions (2009)

Word Sense Disambiguation remains one of the most complex problems facing computational linguists to date. In this paper we present modification to the graph based state of the art algorithm In-Degree. Our modifications entail augmenting the basic Lesk similarity measure with more relations based on the structure of WordNet, adding SemCor examples to the basic WordNet lexical resource and finally instead of using the LCH similarity measure for computing verb verb similarity in the In-Degree algorithm, we use JCN. We report results on three standard data sets using three different versions of WordNet. We report the highest performing monolingual unsupervised results to date on the Senseval 2 all words data set. Our system yields a performance of 62.7% using WordNet 1.7.1.
A Prüfer Based Approach to Process Top-k Queries in XML
Authors: Ling Li, Mong Li Lee, Wynne Hsu, Han Zhen
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Top-k queries in XML involves retrieving approximate matching XML documents. Existing techniques process top-k queries in XML by applying one or more relaxations on the twig query. In this work, we investigate how Prüfer sequence can be utilized to process top-k queries in XML. We design a method called XPRAM that incorporates the relaxations into the sequence matching process. Experiment results indicate that the proposed approach is efficient and scalable.
Using Object-Oriented Concepts to Develop a High-Level Information Privacy Risk Management Model
Authors: Kamil Reddy, H. S. Venter
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

In this paper we present a conceptual model for the management of information privacy risk in large organisations. The model is based on the similarities between the concepts of departments in large organisations and the object-oriented computer paradigm. It is a high-level model that takes a holistic view of information privacy risk management, and, as such, identifies risk in both manual and automated processes during the acquisition, processing, storage and dissemination of information. While conceptual in nature, the model is well suited to practical implementation due to the structure it derives from the object-oriented paradigm. The practical application of the model is demonstrated by way of an example scenario. This paper contributes by addressing the absence in the literature of freely available models for the holistic management information privacy risk in large organisations.
Mobile Interfaces Using Body Worn Projector and Camera
Authors: Nobuchika Sakata, Teppei Konishi, Shogo Nishida
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

Unlike most desktop computer and laptop, mobile interface are designed to facilitate user operating the information easily with various situations that is standing, walking, and moving. However, almost mobile devices such like cell phones have a small key pad and small display because those devices should keep compact and light weight for bringing and pocketing. Therefore, they impose a lot of burdens to users in terms of watching a small display and typing with a small keyboard. Such devices do not focus to provide implicit and awareness information. In this paper, we describe features of body worn projector, which has capability for projecting information to user's peripheral vision, and body worn camera, which has capability for recognizing user's posture and estimating user's behavior, is suitable interface for providing awareness, implicit, and even explicit information. Finally, we propose two mobile interfaces which are "Palm top display for glance information" and "Floor projection from Lumbar mounted projector".
Fuzzy ideals and semiprime fuzzy ideals in semigroups
Authors: O. Kazancı, S. Yamak
Venue: Information Sciences: an International Journal (2009)

In this paper, we investigate relationships between different definitions of fuzzy ideals of a fuzzy semigroup. The equivalence of different definitions of fuzzy ideals of a fuzzy semigroup is obtained. We show that the lattice of all @f-fuzzy ideals of a fuzzy semigroup X is a complete sublattice of the lattice of all fuzzy sets in X when @f is an infinitely @?-distributive weak pseudo-t-norm on L. A definition of @f-semiprime fuzzy ideal of a fuzzy semigroup is given. A description of all @f-semigroups, in which every @f-fuzzy ideal is @f-semiprime, is obtained.
Coalmine Safety Information System Based on MapGIS
Authors: Zhi-qiang Yu, Yi-mei Tian, Bo-yong Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

To manage coalmine maps and handle the safety production information, on the condition that the SCADA system has been completely built, the Coalmine Safety Information System for a southwest county in China is developed using Visual C++ 6.0 and Visual InterDev 6.0 based on MapGIS. To meet different requirement of different level users, the system adopts the mixed architecture with C/S and B/S. This can not only enlarge the dimension of information sharing but also reduce the total cost. Three modules are included in the system: coalmine map management and update module, real-time prewarning module and WebGIS module. Perfect prewarning mechanism is built. It proves that the system could run stably and practically.
Robotic Surgery: Past Results and Current Developments
Authors: Paolo Fiorini
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

In conclusion then, robotic surgery is the most promising application of telerobotic technologies to everyday life. Probably, surgical robots will open the way to new service robots in medicine, rehabilitation, assistance and personal care, and will foster, hopefully, the growth of new products and markets that will improve the quality of life of people across the world
MGLAIR agents in virtual and other graphical environments
Authors: Stuart C. Shapiro, Josephine Anstey, David E. Pape, Trupti Devdas Nayak, Michael Kandefer, Orkan Telhan
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

We are demonstrating several intelligent agents built according to the MGLAIR (Modal Grounded Layered Architecture with Integrated Reasoning) agent architecture. The top layer of MGLAIR is implemented in SNePS and its acting subsystem, SNeRE (the SNePS Rational Engine). The major demonstration will be act 3 of The Trial The Trail, an interactive drama running on an immersive Virtual Reality system, in which a human participant interacts with several MGLAIR actor-agents. We will also demonstrate several olher MGLAIR agents that operate in non-VR graphical environments. All these agents illustrate our approach to building agents with integrated first-person, on-line reasoning and acting.
A Distribution-Sensitive Dictionary with Low Space Overhead
Authors: Prosenjit Bose, John Howat, Pat Morin
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the actual time required. Distribution-sensitive data structures attempt to take advantage of underlying patterns in a sequence of operations in order to reduce time complexity, since access patterns are non-random in many applications. Unfortunately, many of the distribution-sensitive structures in the literature require a great deal of space overhead in the form of pointers. We present a dictionary data structure that makes use of both randomization and existing space-efficient data structures to yield very low space overhead while maintaining distribution sensitivity in the expected sense.
On the Complexity of Boolean Functions in Different Characteristics
Authors: Parikshit Gopalan, Shachar Lovett, Amir Shpilka
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Every Boolean function on $n$ variables can be expressed as a unique multivariate polynomial modulo $p$ for every prime $p$. In this work, we study how the degree of a function in one characteristic affects its complexity in other characteristics. We establish the following general principle: {\em functions with low degree modulo $p$ must have high complexity in every other characteristic $q$.} More precisely, we show the following results about Boolean functions $f:\zo^n \rightarrow \zo$ which depend on all $n$ variables, and distinct primes $p,q$: \begin{itemize} \item If $f$ has degree $o(\log n)$ modulo $p$, then it must have degree $\Omega(n^{1-o(1)})$ modulo $q$. Thus a Boolean function has degree $o(\log n)$ in only one characteristic. This result is essentially tight as there exist functions that have degree $\log n$ in every characteristic. \item If $f$ has degree $d = o(\log n)$ modulo $p$, it cannot be computed correctly on more than $ 1- p^{-O(d)}$ fraction of the hypercube by polynomials of degree $n^{\fr{2} - \eps}$ modulo $q$. \end{itemize} As a corollary of the above results it follows that if $f$ has degree $o(\log n)$ modulo $p$, then it requires super-polynomial size $\AC_0[q]$ circuits. This gives a lower bound for a broad and natural class of functions.
Poster abstract: Community sensor grids deployment and usage
Authors: Partha Dasgupta, Amiya Bhattacharya, Meddage S. Fernando
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Design and prototyping are underway for realization of a concept called community sensor grids. The idea is that individuals or small community agencies may deploy sensors to cover their own property, but also make them available for private as well as public monitoring through Internet connectivity, leveraging the mass deployment and use of sensors to the mainstream. Such transient sensor grids are to be composed of virtual sensor nodes contributed by more than one physical sensornets while offering a common processing view and sharing semantics, in spite of the inherent heterogeneity in ownership, hardware and operating systems for the hosting nodes.
Bridging the gap between useful and aesthetic maps in car navigation systems
Authors: Julia Schreiber
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Thanks to the development in the field of minicomputers high resolution photo realistic maps can be shown in real time on car navigation systems. These graphics are aesthetically pleasing to the viewer. However, they also have a high impact on the user's cognitive load so the effort for their usage rises. This paper describes an approach for the integration of complex maps in car navigation systems without harming its function. Referring to an empirical research, we can support the thesis that the function of a map and its aesthetic perception heavily depends on the user's situational cognitive load. This thesis is confirmed by the Cognitive load theory. In the following, we introduce a concept for the adaptation of a map's function and its design according to the changing situations in the automotive context.
Accelerating Boyer-Moore searches on binary texts
Authors: Shmuel T. Klein, Miri Kopel Ben-Nissan
Venue: Theoretical Computer Science (2009)

The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important applications, such as compressed matching. The paper shows how, by means of some pre-computed tables, one may implement the BM algorithm also for the binary case without referring to bits, and processing only entire blocks such as bytes or words, thereby significantly reducing the number of comparisons. Empirical comparisons show that the new variant performs better than regular binary BM and even than BDM.
Ubicomp4D: infrastructure and interaction for international development--the case of urban indian slums
Authors: Nithya Sambasivan, Nimmi Rangaswamy, Ed Cutrell, Bonnie Nardi
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

This paper attempts to re-imagine ubiquitous computing for populations in low-income and information-challenged environments. We examine information infrastructures in mid-sized urban slums of Mumbai and Bangalore in three ways--1) highlighting technologies supporting social networks, 2) examining underlying notions of trust and privacy in building information networks, and 3) discussing protocols and practices around shared access. We then discuss our thoughts on designing for low-income, low-literacy, and resource-challenged communities, presenting new ways to think about the design of ubiquitous technologies for international development. We argue for collaborative exchange between the established strengths of the Information and Communication Technologies for Development (ICT4D) and Ubicomp communities to generate new ways of shaping technologies towards poverty alleviation in previously neglected socio-economic contexts--Ubicomp4D.