ppxscal/embedding_network huggingface dataset:
Porting natural language interfaces between domains: an experimental user study with the ORAKEL system
Authors: Philipp Cimiano, Peter Haase, Jörg Heizmann
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

We present a user-centered model for porting natural language interfaces (NLIs) between domains efficiently. The model assumes that domain experts without any background knowledge about computational linguistics will perform the customization of the NLI to a specific domain. In fact, it merely requires familiarity with the underlying knowledge base as well as with a few basic subcategorization types. Our model is iterative in the sense that the adaption of the NLI is performed in several cycles on the basis of the questions which the NLI failed to answer, thus iteratively increasing the coverage of the system. We provide experimental evidence in form of a user study as well as a case study involving a real-world application corroborating that our model is indeed a feasible way of customizing the interface to a certain domain.
Evolutionary learning of document categories
Authors: J. I. Serrano, M. D. Castillo
Venue: Information Retrieval (2007)

This paper deals with a supervised learning method devoted to producing categorization models of text documents. The goal of the method is to use a suitable numerical measurement of example similarity to find centroids describing different categories of examples. The centroids are not abstract or statistical models, but rather consist of bits of examples. The centroid-learning method is based on a Genetic Algorithm for Texts (GAT). The categorization system using this genetic algorithm infers a model by applying the genetic algorithm to each set of preclassified documents belonging to a category. The models thus obtained are the category centroids that are used to predict the category of a test document. The experimental results validate the utility of this approach for classifying incoming documents.
Bridge layer for content distribution
Authors: Kilho Shin, Koji Takeda, Masahiro Taguchi, Hiroshi Yasuda, Terumasa Aoki
Venue: Systems and Computers in Japan (2007)

In this paper, the authors propose a bridge layer as a framework for the safe and free association of existing content architectures (CA) and payment and rights-management services (CHS: Clearinghouse Services). The unauthorized use of content through the circumvention of payment and rights-management is a serious threat. To eliminate this threat, the CHS must associate with the inherent content protection function provided by the CA closely. However, ad hoc association has problems relating to development and maintenance costs, motivation for association, and security, which become impediments to content distribution. A bridge layer provides a protocol for the association of a CA with the CHS, as well as the security functions called for by association. Because the CA and CHS comply with the bridge layer protocol, association is automatically implemented and the unauthorized use of content through circumvention is prevented. In this paper, the required technical elements of the bridge layer are clarified and an actual system satisfying these requirements is proposed. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(2): 46&ndash; 56, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20659
An investigation of real-time dynamic data driven transportation simulation
Authors: Michael P. Hunter, Richard M. Fujimoto, Wonho Suh, Hoe Kyoung Kim
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Widespread deployment of sensors in roadways and vehicles is creating new challenges in effectively exploiting the wealth of real-time transportation system data. However, the precision of the real-time data varies depending on the level of data aggregation. For example, minute-by-minute data are more precise than hourly average data. This paper explores the ability to create an accurate estimate of the evolving state of transportation systems using real-time roadway data aggregated at various update intervals. It is found that simulation based on inflow data aggregated over a short time interval is capable of providing a superior representation of the real world over longer aggregate intervals. However, the perceived improvements are minimal under congested conditions and most pronounced under un-congested conditions. In addition, outflow constraints should be considered during congested flow periods, otherwise significant deviation from the real world performance may arise.
Binary Self-Organizing Map with Modified Updating Rule and Its Application to Reproduction of Genetic Algorithm
Authors: Ryosuke Kubota, Keiichi Horio, Takeshi Yamakawa
Venue: IEICE - Transactions on Information and Systems (2007)

In this paper, we propose a modified reproduction strategy of a Genetic Algorithm (GA) utilizing a Self-Organizing Map (SOM) with a novel updating rule of binary weight vectors based on a significance of elements of inputs. In this rule, an updating order of elements is decided by considering fitness values of individuals in a population. The SOM with the proposed updating rule can realize an effective reproduction.
Adjoint pairs of differential-algebraic equations and Hamiltonian systems
Authors: Katalin Balla, Vu Hoang Linh
Venue: Applied Numerical Mathematics (2005)

We consider linear homogeneous differential-algebraic equations A(Dx)' + Bx = 0 and their adjoints -D*(A*x)'+B*x = 0 with well-matched leading coefficients in parallel. Assuming that the equations are tractable with index less than or equal to 2, we give a criterion ensuring the inherent ordinary differential equations of the pair to be adjoint each to other. We describe the basis pairs in the invariant subspaces that yield adjoint pairs of essentially underlying ordinary differential equations. For a class of formally self-adjoint equations, we characterize the boundary conditions that lead to self-adjoint boundary value problems for the essentially underlying Hamiltonian systems.
The random trip model: stability, stationary regime, and perfect simulation
Authors: Jean-Yves Le Boudec, Milan Vojnovic
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

We define "random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or nonconvex domains, random walk on torus, billiards, city section, space graph, intercity and other models. We show that, for this model, a necessary and sufficient condition for a time-stationary regime to exist is that the mean trip duration (sampled at trip endpoints) is finite. When this holds, we show that the distribution of node mobility state converges to the time-stationary distribution, starting from the origin of an arbitrary trip. For the special case of random waypoint, we provide for the first time a proof and a sufficient and necessary condition of the existence of a stationary regime, thus closing a long standing issue. We show that random walk on torus and billiards belong to the random trip class of models, and establish that the time-limit distribution of node location for these two models is uniform, for any initial distribution, even in cases where the speed vector does not have circular symmetry. Using Palm calculus, we establish properties of the time-stationary regime, when the condition for its existence holds. We provide an algorithm to sample the simulation state from a time-stationary distribution at time 0 ("perfect simulation"), without computing geometric constants. For random waypoint on the sphere, random walk on torus and billiards, we show that, in the time-stationary regime, the node location is uniform. Our perfect sampling algorithm is implemented to use with ns-2, and is available to download from http://ica1www.epfl.ch/RandomTrip.
Markov random fields for catadioptric image processing
Authors: Cédric Demonceaux, Pascal Vasseur
Venue: Pattern Recognition Letters (2006)

Images obtained with catadioptric sensors contain significant deformations which prevent the direct use of classical image treatments. Thus, Markov random fields (MRF) whose usefulness is now obvious for projective image processing, cannot be used directly on catadioptric images because of the inadequacy of the neighborhood. In this paper, we propose to define a new neighborhood for MRF by using the equivalence theorem developed for central catadioptric sensors. We show the importance of this adaptation for segmentation, image restoration and motion detection.
An accurate, scalable communication effects server for the FCS system of systems simulation environment
Authors: Rajive Bagrodia, Ken Tang, Steve Goldman, Dilip Kumar
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The Future Combat Systems (FCS) program is developing the FCS System of Systems Simulation Environment (FSE) to provide the "real world wraparound" to the FCS System of Systems Simulation Framework (S2F). A primary component of the FCS is the Communication Effects Server (CES) whose objective is to develop a flexible, scalable, and high-performance, packet-level, discrete-event simulator that will accurately portray the behavior of the FCS communications architecture to eventually support the live, constructive, and virtual simulations envisaged in the FSE. In particular, the CES is required to compute, in real-time, accurate end-end latency for every communication message sent over a wireless network in a FSE experiment.This paper provides an overview of the CES that has been developed using the QualNet network simulator. It presents results on the performance of the CES for the simulation of large on-the-move communication networks in real-time.
Some generalizations of theorems on vertex coloring
Authors: S. L. Berlov, V. L. Dol'nikov
Venue: Journal of Combinatorial Theory Series A (2006)

This paper extends two classical theorems on a vertex coloring: König's theorem on bipartite graphs and the Szekeres-Wilf theorem.
Sharepoint 2007: The Definitive Guide
Authors: Robert Tidrow, Christopher Buechler, Bob Fox, Murray Gordon, Jason Medero, Nilesh Mehta, Joris Poelmans, Piotr Prussak, Christopher Regan
Venue:  (2007)

For any organization that wants to use Windows SharePoint Services to share and collaborate on Microsoft Office documents, this book shows administrators of all levels how to get up and running with this powerful and popular set of collaboration tools. Microsoft Windows SharePoint Services technology in Office 2007 is an integrated set of services designed to connect people, information, processes, and systems both within and beyond the organizational firewall. SharePoint 2007: The Definitive Guide provides a detailed discussion of all Sharepoint features, applications and extensions. You learn how to build Sharepoint sites and site collections, along with ways to administrate, secure, and extend Sharepoint. This book teaches you how to: Get up to speed on SharePoint, including ways to create lists, libraries, discussions and surveysIntegrate email, use web parts, track changes with RSS, and use database reporting servicesCustomize your personal site, create sites and areas, and organize site collectionsIntegrate with Office applications, including Excel, Word, Outlook, Picture Manager, and InfoPathInstall, deploy, maintain and secure SharePointBrand a portal, using your corporate style sheet, designing templates, and building site definitionsExtend SitePoint, such as creating client side and server side web parts, using the SharePoint class library and SharePoint web services Each chapter starts with a "guide" that lets you know what it covers before you dive in. The book also features a detailed reference section that includes information on compatibility, command line utilities, services, and CSS styles. Why wait? Get a hold of SharePoint 2007: The Definitive Guide today!
Using anecdotal information to model the availability of an existing dynamometer system
Authors: Valerie G. Caryer Cook
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Low-volume, custom-built or specialty equipment, by nature, has little statistically significant data to predict system availability over the equipment life. Their unique constructions are often costly to purchase and install, and are equally costly to maintain. This paper presents a practical method to estimate the availability of custom-built equipment, using a custom 4wd NVH dynamometer system as an example. The proposed method models the availability of an existing custom-built system using anecdotal component information based on interviews with field service personnel. The interview data is used to create estimated probability density functions for the major components of the system. Component probability density functions are assembled into a system model based on a derived system reliability function. This technique provides a low-cost, quick, model of system availability over time which can be used to assess the risk and cost effectiveness of system maintenance strategies.
Firmware engineering and microprogramming at Colorade State University
Authors: Gearold R. Johnson, Robert A. Mueller, Michael Andrews
Venue: ACM SIGMICRO Newsletter (1982)

Colorado State University is in the process of building a research emphasis in the area of firmware engineering and microprogramming through the Department of Computer Science and the Center for Computer-Assisted Engineering. The primary participants are Dr. Gearold Johnson, Dr. Robert Mueller, Dr. Michael Andrews, several full-time graduate research assistants (including two doctoral candidates), and a part-time graduate student from the Hewlett Packard Desktop Computer Division.
The worst-case time complexity for generating all maximal cliques and computational experiments
Authors: Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
Venue: Theoretical Computer Science (2006)

We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm. All the maximal cliques generated are output in a tree-like form. Subsequently, we prove that its worst-case time complexity is O(3n/3) for an n-vertex graph. This is optimal as a function of n, since there exist up to 3n/3 maximal cliques in an n-vertex graph. The algorithm is also demonstrated to run very fast in practice by computational experiments.
Dynamic Media: Music, Video, Animation, and the Web in Adobe PDF
Authors: Bob Connolly
Venue:  (2006)

Flash animation, music and videos, virtual reality 3D, and more-in a PDF? Yes! Acrobat documents “converged” with audio, video, and interactive content- it's the wave of the future and it's called rich media. Do you want to get your video and audio content out into the world in a more convenient way than on the Web? Are you looking for a way to share rich-media content with the broadest possible range of readers? Print publishers, advertisers, educators, and anyone else who's ready to leverage the power of PDF and Adobe Reader can benefit from learning about the possibilities of this new convergence technology. In the first book of its kind, rich-media PDF pioneer Bob Connolly presents an eye-opening overview of the world of PDFs that contain video, audio, and interactive elements. Dozens of case studies illustrate the nearly limitless potential of rich media. And the best part about the book is that it practices what it preaches, with a fully interactive rich-media version of the book on the accompanying CDROM. Readers can experience first-hand the power of rich-media PDFs through interactive animation, videos, and audio. Walk through the process of constructing rich-media PDFs on the fly using a Web server Learn which applications work together for building rich-media PDFs-and which don't See how some of the world's most forward-thinking artists and designers are pushing the boundaries with rich-media PDFs Learn why PDF documents are more compelling than Web sites for reaching your target audience Understand how best to translate print material into online PDF documents 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
Breast cancer diagnosis using genetic programming generated feature
Authors: Hong Guo, Asoke K. Nandi
Venue: Pattern Recognition (2006)

This paper proposes a novel method for breast cancer diagnosis using the feature generated by genetic programming (GP). We developed a new feature extraction measure (modified Fisher linear discriminant analysis (MFLDA)) to overcome the limitation of Fisher criterion. GP as an evolutionary mechanism provides a training structure to generate features. A modified Fisher criterion is developed to help GP optimize features that allow pattern vectors belonging to different categories to distribute compactly and disjoint regions. First, the MFLDA is experimentally compared with some classical feature extraction methods (principal component analysis, Fisher linear discriminant analysis, alternative Fisher linear discriminant analysis). Second, the feature generated by GP based on the modified Fisher criterion is compared with the features generated by GP using Fisher criterion and an alternative Fisher criterion in terms of the classification performance. The classification is carried out by a simple classifier (minimum distance classifier). Finally, the same feature generated by GP is compared with a original feature set as the inputs to multi-layer perceptrons and support vector machine. Results demonstrate the capability of this method to transform information from high-dimensional feature space into one-dimensional space and automatically discover the relationship among data, to improve classification accuracy.
New Construction for Balanced Boolean Functions with Very High Nonlinearity*Parts of this paper was presented at the Australasian Conference on Information Security and Privacy 2003.
Authors: Khoongming Khoo, Guang Gong
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2007)

In the past twenty years, there were only a few constructions for Boolean functions with nonlinearity exceeding the quadratic bound 2n-1 - 2(n-1)/2 when n is odd (we shall call them Boolean functions with very high nonlinearity). The first basic construction was by Patterson and Wiedemann in 1983, which produced unbalanced function with very high nonlinearity. But for cryptographic applications, we need balanced Boolean functions. Therefore in 1993, Seberry, Zhang and Zheng proposed a secondary construction for balanced functions with very high nonlinearity by taking the direct sum of a modified bent function with the Patterson-Wiedemann function. Later in 2000, Sarkar and Maitra constructed such functions by taking the direct sum of a bent function with a modified Patterson-Wiedemann function. In this paper, we propose a new secondary construction for balanced Boolean functions with very high nonlinearity by recursively composing balanced functions with very high nonlinearity with quadratic functions. This is the first construction for balanced function with very high nonlinearity not based on the direct sum approach. Our construction also have other desirable properties like high algebraic degree and large linear span.
Adobe InDesign CS2 Official JavaScript Reference
Venue:  (2005)

Do you spend too much time doing repetitive production tasks such as placing and replacing images, correcting errors in text, cutting and pasting, and preparing files for printing, instead of being creative? Do you use Adobe InDesign CS2 and have a strong working knowledge of JavaScript? Then you're in luck. Since Adobe Creative Suite 2 was created with built-in support for scripting, virtually every repetitive or time-consuming task that creative professionals have to do in InDesign can be streamlined or automated with the help of a script. This book describes how to use JavaScript to manipulate and extend Adobe InDesign within Adobe Creative Suite 2, and provides reference information for the JavaScript objects, properties, and functions defined by Adobe's applications, as well as the various utilities and tools that are part of ExtendScript, Adobe 's own implementation of JavaScript. This scripting reference provides the information you need to create custom scripts for InDesign, whether you're looking to automate your company's page layout process, convert large batches of InDesign files to XML, need an easy way to run a find-and-replace sequence within a large document, or want to create a script that instantly adds pre-built design elements to your InDesign page layouts. These are just a few of the ways that scripting can save you from hours of time-consuming tasks.ï¾ 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
Achieving I/O improvements in a mass spectral database
Authors: Eric Puryear, Jennifer Van Puymbrouck, David Sigfredo Angulo, Kevin Drew, Lee Ann Hollenbeck, Dominic Battre, Alex Schilling, David Jabon, Gregor von Laszewski
Venue: Crossroads (2006)

Research in proteomics has created two significant needs: the need for an accurate public database of empirically derived mass spectrum information and the need for managing the I/O and organization of mass spectrometry data in the form of files and structures. Lack of an empirically derived database limits the ability of proteomic researchers to identify and study proteins. Managing the I/O and organization of mass spectrometry data is often time-consuming due to the many fields that need to be set and retrieved. As a result, incompatibilities and inefficiencies are created by each programmer handling this in his or her own way. Until recently, storage space and computing power has been the limiting factor in developing tools to handle the vast amount of mass spectrometry information. Now the resources are available to store, organize, and analyze mass spectrometry information.The Illinois Bio-Grid Mass Spectrometry Database is a database of empirically derived tandem mass spectra of peptides created to provide researchers with an organized and searchable database of curated spectrum information to allow more accurate protein identification. The Mass Spectrometry I/O Project creates a framework that handles mass spectrometry data I/O and data organization, allowing researchers to concentrate on data analysis rather than I/O. In addition, the Mass Spectrometry I/O Project leverages several cross-platform and portability-enhancing technologies, allowing it to be utilized on a variety of hardware and operating systems.