ppxscal/embedding_network huggingface dataset:
Query Expansion and Query Reduction in Document Retrieval
Authors: Ingrid Zukerman, Bhavani Raskutti, Yingying Wen
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

We investigate two seemingly incompatible approaches for improving document retrieval performance in the context of question answering: query expansion and query reduction.Queries are expanded by generating lexical paraphrases. Syntactic, semantic and corpus-based frequency information is used in this process. Queries are reduced by removing words that may detract from retrieval performance. Features that identify these words were obtained from decision graphs. These approaches were evaluated using a subset of queries from TREC8, 9 and 10. Our evaluation shows that each approach in isolation improves retrieval performance, and both approaches together yield substantial improvements. Specifically, query expansion followed by reduction improved the average number of correctdocuments retrieved by 21.7% and the average number of queries that can be answered by 15%.
What do the experts say?: teaching introductory design from an expert's perspective
Authors: Tracy L. Lewis, Mary Beth Rosson, Manuel A. Pérez-Quiñones
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This study examined ways to improve students' chances of success learning design concepts through the use of Object-Oriented Programming and Design (OOP&D) patterns by examining potentially effective ways to teach such patterns to novice programmers. Using hierarchical tree, complete-linkage analysis to survey a group of design experts, the study developed an order in which those experts believed thirty fundamental OOP&D patterns should be taught to optimize effective student learning. Once that basic order was identified, it became possible to divide the patterns into six sequential phases of patterns instruction to allow both maximal teaching and learning. Although the study did not present a conclusively effective approach for OOP&D teaching, it did provide information essential for future sequential phase patterns research.
Locally Thin Set Families
Authors: Noga Alon, Emanuela Fachini, János Körner
Venue: Combinatorics, Probability and Computing (2000)

A family of subsets of an n-set is k-locally thin if, for every k of its member sets, the ground set has at least one element contained in exactly 1 of them. We derive new asymptotic upper bounds for the maximum cardinality of locally thin set families for every even k. This improves on previous results of two of the authors with Monti.
Edge detection in multispectral images using the self-organizing map
Authors: P. J. Toivanen, J. Ansamäki, J. P. S. Parkkinen, J. Mielikäinen
Venue: Pattern Recognition Letters (2003)

In this paper, two new methods for edge detection in multispectral images are presented. They are based on the use of the self-organizing map (SOM) and a grayscale edge detector. With the 2-dimensional SOM the ordering of pixel vectors is obtained by applying the Peano scan, whereas this can be omitted using the 1-dimensional SOM. It is shown that using the R-ordering based methods some parts of the edges may be missed. However, they can be found using the proposed methods. Using them it is also possible to find edges in images which consist of metameric colors. Finally, it is shown that the proposed methods find the edges properly from real multispectral airplane images The size of the SOM determines the amount of found edges. If the SOM is taught using a large color vector database, the same SOM can be utilized for numerous images.
An Interview with Thomas Kalil: Where politics, policy, technology and science converge
Authors: Ubiquity staff
Venue: Ubiquity (2004)

From the White House to Berkeley, Thomas Kalil has worked on shaping the national agenda for science and technology research initiatives. Kalil, President Clinton's former science and technology advisor, now holds a similar post at the University of California, Berkeley, where he helps develop new research initiatives and increase UC Berkeley's role in shaping the national agenda.
One-level phonology: autosegmental representations and rules as finite automata
Authors: Steven Bird, T. Mark Ellison
Venue: Computational Linguistics (1994)

When phonological rules are regarded as declarative descriptions, it is possible to construct a model of phonology in which rules and representations are no longer distinguished and such procedural devices as rule-ordering are absent. In this paper we present a finite-state model of phonology in which automata are the descriptions and tapes (or strings) are the objects being described. This provides the formal semantics for an autosegmental phonology without structure-changing rules. Logical operations on the phonological domain---such as conjunction, disjunction, and negation---make sense since the phonological domain consists of descriptions rather than objects. These operations as applied to automata are the straightforward operations of intersection, union, and complement. If the arrow in a rewrite rule is viewed as logical implication, then a phonological rule can also be represented as an automaton, albeit a less restrictive automaton than would be required for a lexical representaton. The model is then compared with the transducer models for autosegmental phonology of Kay (1987), Kornai (1991), and Wiebe (1992). We conclude that the declarative approach to phonology presents an attractive way of extending finite-state techniques to autosegmental phonology while remaining within the confines of regular grammar.
Implicit extension of Taylor series method for initial value problems
Authors: G. Molnárka
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The Taylor series method is one of the earliest analytic-numeric algorithms for approximate solution of initial value problems for ordinary differential equations. The main idea of the rehabilitation of these algorithms is based on the approximate calculation of higher derivatives using well-known technique for the partial differential equations. The approximate solution is given as a piecewise polynomial function defined on the subintervals of the whole interval. This property offers different facility for adaptive error control. This paper describes several explicit Taylor series with implicit extension algorithms and examines its consistency and stability properties. The implicit extension based on a collocation term added to the explicit truncated Taylor series. This idea is different from the general collocation method construction, which led to the implicit R-K algorithms [13] It demonstrates some numerical test results for stiff systems herewith we attempt to prove the efficiency of these new-old algorithms.
Error-Tolerant Sign Retrieval Using Visual Features and Maximum A Posteriori Estimation
Authors: Chung-Hsien Wu, Yu-Hsien Chiu, Kung-Wei Cheng
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--This paper proposes an efficient error-tolerant approach to retrieving sign words from a Taiwanese Sign Language (TSL) database. This database is tagged with visual gesture features and organized as a multilist code tree. These features are defined in terms of the visual characteristics of sign gestures by which they are indexed for sign retrieval and displayed using an anthropomorphic interface. The maximum a posteriori estimation is exploited to retrieve the most likely sign word given the input feature sequence. An error-tolerant mechanism based on mutual information criterion is proposed to retrieve a sign word of interest efficiently and robustly. A user-friendly anthropomorphic interface is also developed to assist learning TSL. Several experiments were performed in an educational environment to investigate the system's retrieval accuracy. Our proposed approach outperformed a dynamic programming algorithm in its task and shows tolerance to user input errors.
Hiding Biometric Data
Authors: Anil K. Jain, Umut Uludag
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

With the wide spread utilization of biometric identification systems, establishing the authenticity of biometric data itself has emerged as an important research issue. The fact that biometric data is not replaceable and is not secret, combined with the existence of several types of attacks that are possible in a biometric system, make the issue of security/integrity of biometric data extremely critical. We introduce two applications of an amplitude modulation-based watermarking method, in which we hide a user's biometric data in a variety of images. This method has the ability to increase the security of both the hidden biometric data (e.g., eigen-face coefficients) and host images (e.g., fingerprints). Image adaptive data embedding methods used in our scheme lead to low visibility of the embedded signal. Feature analysis of host images guarantees high verification accuracy on watermarked (e.g., fingerprint) images.
Interview with Roy E. Disney
Authors: Roy E. Disney
Venue: Computers in Entertainment (CIE) (2003)

The legendary Alan Kay and Roy E. Disney have graciously appeared on camera for interviews and joined the ACM Computers in Entertainment magazine's editorial board. Alan and Roy are two of the nicest people to talk to and work with. Alan talked about soft fun versus hard fun, and his research on Squeak for enhancing and amplifying learning in children's education. Roy told us about educators versus entertainers, and his views on traditional and CGI animations. The video clips of the interviews are available at http://www.acm.org/pubs/cie/oct2003/index.html Roy E. Disney is Vice Chairman of the Board of Directors of The Walt Disney Company and chairman of Walt Disney Animation. He began his entertainment industry career in 1953, working as an assistant film editor on the "Dragnet" TV series. He joined The Walt Disney Company in 1954 and served as assistant film editor on motion pictures, including "The Living Desert" and "The Vanishing Prairie" both Academy Award winners. As a writer and production associate, Roy received an Academy Award nomination his work on the short subject "Mysteries of the Deep" in 1959. More information is available at http://psc.disney.go.com/corporate/communications/bios/Disney.html 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
Online Price Competition within and between Heterogeneous Retailer Groups
Authors: Cenk Kocas
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This study presents a model of price competition in a market for a homogenous good with many asymmetrically positioned retailers, a typical example of which could be the online markets for books, music, movies or software. These markets are highly competitive oligopolies served by hundreds of active retailers and that have been affected by Information Technologies such as price comparison engines and shopping bots. In these markets, firms can only identify broad group memberships to clusters of firms, and compete within and across clusters based on this information, due to the incompleteness of information on the characteristics of firms. The characteristics of the firms that shape their competitive behavior are their established loyal segment sizes and potential comparison shopper segment sizes. To analyze such markets, we develop and solve a static game of price competition in an asymmetric oligopoly with numerous clusters of firms. In our analysis we see that the firms with the smallest loyal segment sizes and the largest switcher segment sizes engage in a fierce price competition while the members of all other groups prefer to price at their reservation price points. We also test and provide empirical support for our model predictions using pricing data on three categories. Our data set contains prices on 112 printers from 20 retailers, 95 cameras from 53 retailers and 1388 books from 15 retailers.
Modeling the mirror: grasp learning and action recognition
Authors: Michael A. Arbib
Venue:  (2002)

Mirror neurons within a monkey's premotor area F5 fire not only when the monkey performs a certain class of actions but also when the monkey observes another monkey (or the experimenter) perform a similar action. This dissertation presents computational models of the mechanisms involved in learning-to-grasp and action recognition (mirror neurons) in the primate. The hypothesis behind the Mirror Neuron System (MNS) is that it learns to recognize actions of others by self-observation. The Learning to Grasp Model (LGM) complements MNS model by providing the mechanism to learn grasping behavior starting from an elemental set of behaviors. From a computational point of view, LGM is a neural agent that interacts with objects to acquire feasible sets of grasp plans, which are represented as input dependent probability distributions. LGM is adapted using reinforcement learning based on the grasp success. MNS is made up of Core Mirror Circuit and supportive visual and motor schemas. The Visual Analysis schema is implemented as a computer vision system, the Reach and Grasp Simulator schema is implemented as a 3D kinematics arm/hand, and the Core Mirror Circuit schema is implemented as a neural network, which is adapted using supervised learning. Both models replicate a large body of existing experimental data and offer explanations to the operational principles underlying their function. Moreover, through simulation experiments, explicit predictions are derived, which can be verified experimentally. To be specific, MNS model predicts temporal activity of mirror neurons during the conditions of ambiguous grasp, spatial perturbation and altered kinematics. The analyses further yields insights into the temporal effects of explicit affordance coding, and the compatibility of the hand configuration and movement to object affordance. LGM simulations show that infants can shape their reaching movements into voluntary grasping via goal directed trial and error learning. Furthermore, the model predicts that the task constraints faced during learning are influential in shaping the grasp repertoire of infants and can mediate the learning of precision grasping in early infancy.
Late Bidding, Bidder Categories and Network Externality Effects: A Preliminary Examination of Online Auctions
Authors: Rong-An Shang, Ming-Kuan Ling
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Auctions are emerging as an important Internet application for price discovery and trading. The Internet also enables new types of auction formats and creates a venue to observe and study new auction models. In this study we hypothesize that the pattern of online bidding isimpacted by network externalities, relative price level, and auction duration. We also hypothesized the context of the auctions and the types of the bidders will affect the impact of these incentives on bidders' behavior. Real transaction records of a special on sales section on a popular auction site in Hong Kong were collected to test these hypotheses. Preliminary results from our study suggest that the impact of network effects, relative price, and time period will be affected by the context of the auctions and types of bidders.
Explicit Constructions of R&ouml;dl's Asymptotically Good Packings and Coverings
Authors: N. N. Kuzjurin
Venue: Combinatorics, Probability and Computing (2000)

For any fixed l < k we present families of asymptotically good packings and coverings of the l-subsets of an n-element set by k-subsets, and an algorithm that, given a natural number i, finds the ith k-subset of the family in time and space polynomial in log n.
Designing tip windows
Authors: Hugh Fisher
Venue: Linux Journal (2004)

Use effective tips to teach users your application without annoyingthem. 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
Migration of legacy web applications to enterprise JavaTM environments net.data&#x00AE; to JSPTM transformation
Authors: Yu Ping, Jianguo Lu, Terence C. Lau, Kostas Kontogiannis, Tack Tong, Bo Yi
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

As Web technologies advance, the porting and adaptation of existing Web applications to take advantage of the advancement has become an issue of increasing importance. Examples of such technology advancement include extensible architectural designs, more efficient caching protocols, and provision for customizable dynamic content delivery. This paper presents an experience report on the migration of legacy IBM® Net.Data® based applications to new enterprise JavaTM environments. In this respect, a Net.Data application is refactored into JavaBeansTM (Model), JavaServer PagesTM (View), and Java ServletTM (Controller). To evaluate the effectiveness of the migration methodology, a tool has been developed to support the automatic translation of Net.Data to JavaServer Pages. Using such a tool, a case study is presented to deal with IBM WebSphere® Commerce applications.
Stress analysis and failure mechanisms of composite materials with debonded interfaces
Authors: E. E. Gdoutos, A. A. Giannakopoulou, D. A. Zacharopoulos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Ceramics are reinforced with high-strength continuous fibers to increase their ultimate tensile strain and damage tolerance, as opposed to polymers and metals whose reinforcement with fibers increases strength and stiffness. The basic characteristics of this class of composites are that constituents are elastic, the stiffness of matrix is comparable to that of fiber and the interface between the constituents may be imperfect. In such materials the failure stress or strain of the matrix is lower than that of the fibers and prefailure damage under longitudinal tension usually initiates with multiple matrix cracking. This damage mechanism requires the fibers to have sufficient strength to remain intact when they are surrounded by matrix cracking aad interracial bonding between fibers and matrix to be weak. Under such circumstances matrix cracking reaches a saturation stage and it is followed by partial debonding at the fiber-matrix interface. Final failure of the composites takes place by fiber fractures. The sequence and interaction of failure mechanisms in the composite depend on the properties, of the matrix, fiber aad interface as well as on the processing residual stresses.
Automatic Detection and Diagnosis of Faults in Generated Code for Procedure Calls
Authors: Mark W. Bailey, Jack W. Davidson
Venue: IEEE Transactions on Software Engineering (2003)

In this paper, we present a compiler testing technique that closes the gap between existing compiler implementations and correct compilers. Using formal specifications of procedure-calling conventions, we have built a target-sensitive test suite generator that builds test cases for a specific aspect of compiler code generators: the procedure-calling sequence generator. By exercising compilers with these specification-derived target-specific test suites, our automated testing tool has exposed bugs in every compiler tested on the MIPS and one compiler on the SPARC. These compilers include some that have been in heavy use for many years. Once a fault has been detected, the system can often suggest the nature of the problem. The testing system is an invaluable tool for detecting, isolating, and correcting faults in today's compilers.
Simulation in education and training
Authors: J. Peter Kincaid, Roger Hamilton, Ronald W. Tarr, Harshal Sangani
Venue: Applied system simulation: methodologies and applications (2003)

Simulation is gaining recognition as an academic discipline with a core body of knowledge being developed. It is being taught to students from high school through graduate school. Simulation is also increasingly being used for education and training in many applications, e.g., medicine and the military. The use of simulation games is increasing for students of all ages and educational levels. This chapter describes the emerging academic field of modeling and simulation (M&S) including the need for simulation specialists, professional recognition of simulation professionals, academic programs in M&S, the economics of simulation, and the use of simulation-based games for education.
Electronic mail in the public workplace: issues of privacy and public disclosure
Authors: Charles L. Prysby, Nicole D. Prysby
Venue: Public information technology: policy and management issues (2003)

The increasing use of electronic mail in the workplace has generated important legal questions for public organizations. The legal questions concerning e-mail in public institutions and agencies fall into two basic categories: (a) issues of employee privacy regarding e-mail messages; and (b) public access to e-mail under applicable freedom of information legislation. While the employer has broad legal grounds for reading workplace e-mail, at least if there is some legitimate business reason for doing so, employees frequently feel that such monitoring is an excessive invasion of their privacy, and the result sometimes is organizational conflict over these privacy issues. These privacy concerns have generated demands for greater protection of employee privacy in this area, and some states have responded with legislation that covers e-mail in the workplace. Government organizations also must treat at least some of their e-mail as part of the public record, making it open to public access, but this also can lead to conflict between public administrators, who may feel that much of their e-mail represents thoughts that were not intended for public disclosure, and external groups, such as the press, who feel that all such information belongs in the public domain. State laws vary considerably in terms of how they define the types of e-mail messages that are part of the public record, some being far more inclusive than others. Given the uncertainty and confusion that frequently exist regarding these legal questions, it is essential that public organizations develop and publicize an e-mail policy that both clarifies what privacy expectations employees should have regarding their e-mail and specifies what recording keeping requirements for e-mail should be followed to appropriately retain public records.
Fractal Proteins
Authors: Peter J. Bentley
Venue: Genetic Programming and Evolvable Machines (2004)

The fractal protein is a new concept intended to improve evolvability, scalability, exploitability and provide a rich medium for evolutionary computation. Here the idea of fractal proteins and fractal proteins with concentration levels are introduced, and a series of experiments showing how evolution can design and exploit them within gene regulatory networks is described.