ppxscal/embedding_network huggingface dataset:
Tracking linear-threshold concepts with Winnow
Authors: Chris Mesterharm
Venue: The Journal of Machine Learning Research (2003)

In this paper, we give a mistake-bound for learning arbitrary linear-threshold concepts that are allowed to change over time in the on-line model of learning. We use a variation of the Winnow algorithm and show that the bounds for learning shifting linear-threshold functions have many of the same advantages that the traditional Winnow algorithm has on fixed concepts. These benefits include a weak dependence on the number of irrelevant attributes, inexpensive runtime, and robust behavior against noise. In fact, we show that the bound for tracking Winnow has even better performance with respect to irrelevant attributes. Let X&isin;[0,1]n be an instance of the learning problem. In the previous bounds, the number of mistakes depends on lnn. In this paper, the shifting concept bound depends on max ln(||X||1). We show that this behavior is a result of certain parameter choices in the tracking version of Winnow, and we show how to use related parameters to get a similar mistake bound for the traditional fixed concept version of Winnow.
Efficient algorithms for NMR quantum computers with small qubits
Authors: Noboru Kunihiro, Shigeru Yamashita
Venue: New Generation Computing (2003)

The security of the RSA cryptosystems is based on the difficulty of factoring a large composite integer. In 1994, Shor showed that factoring a large composite is executable in polynomial time if we use a quantum Turing machine. Since this algorithm is complicated, straightforward implementations seem impractical judging from current technologies. In this paper, we propose simple and efficient algorithms for factoring and discrete logarithm problem based on NMR quantum computers. Our algorithms are easier to implement if we consider NMR quantum computers with small qubits.
Data reduction in data warehouses
Authors: Alberto Mendelzon
Venue:  (2003)

Much research has been devoted to the efficient computation of relational aggregations. In this paper we consider the inverse problem, that of deriving (approximately) the original data from the aggregates. We motivate this problem in the context of two specific application areas, approximate query answering and data analysis. We propose a framework based on the notion of information entropy that enables us to estimate the original values in a data set, given only aggregated information about it. We then show how approximate queries on the data from which the aggregates were derived can be performed using our framework. We also describe an alternate use of the proposed framework that enables us to identify values that deviate from the underlying data distribution, suitable for data ruining purposes. We present a detailed performance study of the algorithms using both real and synthetic data, highlighting the benefits of our approach as well as the efficiency of the proposed solutions. Subsequently, we consider the above problem in a space constrained environment, where only a subset of the required aggregates can be stored. More specifically, we wish to select a set of aggregates of interest, subject to a constraint on the total space occupied by these aggregates. The objective is to maximize the total benefit, which is a function of the number and importance of the queries that we can estimate given the selected aggregates. For this problem, which as we show is NP-hard, there are no known polynomial approximation schemes, and we propose several algorithms for solving it. We explore the use of greedy and randomized techniques as well as clustering based approaches. The solutions presented herein are generic and can be applied to other problem domains as well. We explore the properties and special characteristics of the above techniques with an experimental evaluation. Our results illustrate the behavior of the algorithms under different settings, and highlight the benefits of each approach. Based on our analysis, we present worst case scenarios for the algorithms. This offers insight into the operation of the algorithms, and provides a practical guide for selecting among the proposed techniques.
Query rewriting using views in the presence of inclusion dependencies
Authors: Qingyuan Bai, Jun Hong, Michael F. McTear
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the MiniCon algorithm, have been proposed to address this issue. These algorithms can be divided into two categories: bucket-based algorithms and inverse rule-based algorithms. Some inverse rule-based algorithms have considered the problem of query rewriting in the presence of inclusion dependencies. However, there has been no bucket-base algorithm so far for the problem. All the previous bucket-based algorithms may miss query rewritings in the presence of inclusion dependencies. In this paper, we extend the MiniCon algorithm to the presence of inclusion dependencies. In the MiniCon algorithm, a view can be used in a non-redundant rewriting of a query only if at least one subgoal in the query is covered by a subgoal in the view. In the presence of inclusion dependencies, when no subgoal in a view directly covers the query subgoal we can apply the chase procedure and rule to the subgoals of the query or view that contains the chase reachable subgoals to get a revised query or view. The condition required by the MiniCon algorithm is then satisfied. We can therefore avoid the problem of missing rewritings with the previous bucket-based algorithms. We prove that our extended algorithm can find the maximally-contained rewriting of a conjunctive query using a set of conjunctive views in the presence of inclusion dependencies. Our extension of the MiniCon algorithm does not involve a significant increase in computational complexity and our new algorithm remains scalable.
Time-Autonomy and Time-Controllability of 2-D Behaviours that are Tempered in the Spatial Direction
Authors: Amol J. Sasane
Venue: Multidimensional Systems and Signal Processing (2004)

This paper studies the notions of time-autonomy and (exact) time-controllability of behaviours with respect to a certain mild space, which while being not too general, encompasses natural partial differential equation solutions and excludes certain pathological ones. We give an algebraic characterization of the property of time-autonomy and also give necessary and sufficient conditions for the time-controllability of behaviours with respect to the space of distributions on \open RR2 that are tempered in the spatial direction.
An integrated architecture for distributed applications
Authors: Michael A. Bauer, Neil Coburn, Doreen L. Erickson, Patrick J. Finnigan, James W. Hong, Per-Åke Larson, Jacob Slonim
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

The CORDS project addresses all phases in the life cycle of distributed applications: design, development, and management. Workers in each of these phases are faced with added difficulties due to support services that are lacking or too low-level. CORDS provides a set of higher-level tools and a service environment that simplifies the tasks of these workers. The realization of such an environment requires the integration and interaction of many distributed system components and the amalgamation of results from different areas in distributed computing.One of the primary goals of the project is to define an architecture for a distributed computing environment that incorporates the necessary tools and services. This paper introduces such an architecture: the CORDS Architecture. The focus of the architecture is to define the CORDS Service Environment, which consists of CORDS services and the CORDS Service Interface. In addition, we illustrate how the prototypes being developed within the CORDS project can be integrated into a system that realizes this architecture.
Towards a computer-aided process engineering environment
Authors: Tilmann F. W. Bruckhaus
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

This paper reports on issues in software process reuse and Computer-Aided Process Engineering (CAPE). The views described in this paper are a first outcome of the Process Reuse Study (PRS). PRS is an ongoing project involving four universities and one industrial partner that investigates opportunities of and approaches to process reuse.In this paper, is a framework for Computer Aided Process Engineering. Services that support efficient process engineering are defined. This definition is an outline of requirements for a CAPE environment. It is described how CAPE services can be used to practice process reuse. Subsequently, a scale is proposed to measure the explicitness of process and project context descriptions, and is followed by a scale to measure the conformance of process description and context description to the enacted process and actual context.The setting of PRS is briefly described. The current status of process and context descriptions is described by applying the scale of explicitness. The current conformance of descriptions to enacted process and actual context is described by applying the scale of conformance. The goal of PRS is formulated by phrasing it as an effort to move from one level of a scale to another.
AdaSlicer: an Ada program slicer
Authors: Ricky E. Sward, A.T. Chamillard
Venue: Proceedings of the 2003 annual ACM SIGAda international conference on Ada: the engineering of correct and reliable software for real-time & distributed systems using ada and related technologies (2003)

The ability to slice a program or parts of a program is useful in a variety of domains, including re-engineering, dependency analysis, test case generation, test coverage evaluation and debugging. Although a variety of static analysis tools are available to support these activities for Ada programs, none of these tools provide a program slicing capability. Fortuitously, the Ada Semantic Interface Specification (ASIS) provides access to the Ada program information required to slice the program. This paper describes our use of ASIS to implement an Ada program slicer, called AdaSlicer.
System Design and Implementation of a National Image Registry for Orthopaedic Oncology Image Management, Research and Teaching
Authors: James M. Blum, Albert Aboulafia
Venue: Information Systems Frontiers (2003)

Orthopaedic oncology is highly dependent on imaging studies to diagnose and treat patients. However, many types of bone tumors are rare creating a lack of teaching and research cases. We have developed a system to locally document and nationally register electronic images for teaching and research on bone tumors. The system minimizes storage requirements and maintains confidentiality using a unique approach. This paper demonstrates the system design and current implementation.
Coding for general penalties
Authors: Thomas M. Cover
Venue:  (2003)

Huffman coding finds a prefix-free code that minimizes the expected codeword length for a probability mass function. However, there are many practical situations in which the constraints and goals may be different from the linear penalty of minimizing expected length. For example, we may wish to avoid long codewords in some situations, since these may cause an excessive wait for transmission of unlikely events. Therefore, we may desire a nonlinear penalty in the codeword lengths. Such penalties arise naturally in group testing for diagnostic systems, queueing, remote exploration, and military intelligence. We examine families of coding problems with nonlinear penalties. These include generalizations of Huffman coding suitable for communication and analysis, extending instances of source coding found in the literature. Alternative penalty measures previously considered include exponential average and maximal pointwise redundancy. We find a novel framework encompassing these two penalties, as well as the linear and other natural penalties, resulting in properties and algorithms suitable for all of them. We next turn to generalized quasilinear convex penalties; these are penalties that can be formulated as &Sigma;i f ( li, pi), where li denotes the length of the ith codeword, pi denotes the corresponding probability, and f is convex and increasing in li. This class of penalties includes several previously proposed penalties, among them a general convex problem proposed by Campbell. We give an efficient algorithm that, for Campbell's problem, performs the optimization in quadratic time and linear space; we also present penalty bounds for this solution. Finally, we consider coding for infinite alphabets, a problem not fully understood even for the linear penalty.
A noughts and crosses Java applet to teach programming to primary school children
Authors: J. Paul Gibson
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

We report on a continuing study into teaching programming to pre-teens school-children, with some as young as seven years old. As part of the study we aim to test childrens' algorithmic understanding through their ability to solve puzzles and play games; and to turn this understanding into working code. We review a project in which children have programmed (in Java) AI players for the game of Noughts and Crosses. This code is then incorporated into a 'programmable' Java Applet for use as an educational tool in primary (junior) schools.
Obsessional experiments for linear logic proof-nets
Authors: Lorenzo Tortora De Falco
Venue: Mathematical Structures in Computer Science (2003)

We address the question of injectivity of coherent semantics of linear logic proof-nets. Starting from Girard's definition of experiment, we introduce the key-notion of &lsquo;injective obsessional experiment&rsquo;, which allows us to give a positive answer to our question for certain fragments of linear logic, and to build counter-examples to the injectivity of coherent semantics in the general case.
A Preliminary Checklist for Software Cost Management
Authors: Magne Jrgensen, Kjetil Molkken
Venue: Proceedings of the Third International Conference on Quality Software (2003)

This paper presents a process framework and a preliminarychecklist for software cost management. While mosttextbooks and research papers on cost estimation lookmainly at the "Estimation" phase, our framework andchecklist includes the phases relevant to estimation:"Preparation", "Estimation", "Application", and"Learning". We believe that cost estimation processes andchecklists should support these phases to enable highestimation accuracy. The checklist we suggest is based onchecklists from a number of sources, e.g., a handbook inforecasting and checklists present in several Norwegiansoftware companies. It needs, however, to be extendedthrough feedback from other researchers and softwarepractitioners. There is also a need for a provision ofconditions for meaningful use of the checklist issues anddescriptions of the strength and sources of evidence infavor of the checklist issues. The present version of thechecklist should therefore be seen as preliminary and wewant to get feedback from the conference participants andother readers of this paper for further improvements.
Vibration of a rectangular plate undergoing forces moving along a circular path
Authors: Jia-Jang Wu
Venue: Finite Elements in Analysis and Design (2003)

A rectangular plate subjected to the curvilinear moving loads is a practical engineering problem. Nevertheless, the literature concerning the dynamic characteristics of a flat plate undergoing forces moving along a circular path is not found so far. For this reason, the title problem is studied. In general, in order to tackle a problem with the finite element method (FEM), all the external loads on a structural system must be replaced by the equivalent forces (and moments) applied at the associated nodes first and then the equation of motion for the entire system with the last equivalent nodal forces (and moments) as the excitation mechanism was solved. Therefore, the formulations for calculating the instantaneous positions of the moving loads and the expressions for transforming the external loads into the equivalent nodal forces (and moments) on the structure are presented, and the dynamic responses of a rectangular plate subjected to multiple forces moving along a circular path were determined. The key point of this paper is to investigate the influence of the following parameters on the dynamic responses of the rectangular plate: supporting conditions of the plate, rotating speed of the moving loads, radius of the circular path and total number of the moving loads. It is hoped that the presented formulations will be significant for solving the title problem and the presented results will be helpful for looking into the associated phenomena or designing the similar systems.
Named entity translation: a statistical approach
Authors: Kevin Knight
Venue:  (2002)

New words and phrases are being introduced in news stories on a daily basis in the form of personal names, organizations, locations, temporal phrases, etc. Such phrases are referred to as named-entity phrases in the literature. While named-entity phrases can often be identified automatically in running text, they are some of the most difficult phrases to translate, because new phrases can appear from nowhere, and because many are domain specific, not to be found in bilingual dictionaries. This is evident by the fact that a state-of-the-art commercial system translates named entities incorrectly 50% of the time. For example, commercial systems often produce translations such as Koln Baol (instead of Colin Powell) or O'Neill's urine (instead of Paul O'Neill). We present a novel, statistical translation algorithm that combines easy-to-obtain bilingual and monolingual resources. We successfully applied this algorithm to translating Arabic named-entity phrases to English. The algorithm does not require any hard-to-obtain linguistic resources and should be portable to other language pairs fairly easily. We report on the translation accuracy on a development and blind test sets. Our translation algorithm outperforms commercial systems and rivals and in some cases (e.g., on person names) outperforms human translators performance. We present a comparison of the translation accuracy based on two different evaluation metrics (exact-matching and human-subjective evaluation) of our system, human translators, a state-of-the-art commercial system, and a research-based Statistical Machine Translation system. A full analysis of translation errors is also presented. Because named-entity phrases are very frequent in newspaper text, a system that is able to identify and translate them is an important tool for many Natural Language Processing (NLP) applications such as Machine Translation (MT), Information Retrieval (IR), Question Answering (QA), Message Understanding (MU), and Summarization. We conclude this dissertation with an emphasis on the main contributions of this work and some insights on future work.
Feature Selection for Support Vector Machines by Means of Genetic Algorithms
Authors: Holger Fröhlich, Olivier Chapelle, Bernhard Schölkopf
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

The problem of feature selection is a difficult combinatorial task in Machine Learning and of high practical relevance, e.g. in bioinformatics. Genetic Algorithms (GAs) offer a natural way to solve this problem. In this paper we present a special Genetic Algorithm, which especially takes into account the existing bounds on the generalization error for Support Vector Machines (SVMs). This new approach is compared to the traditional method of performing cross-validation and to other existing algorithms for feature selection.
Calendar
Venue: Queue (2004)

ETech (O’Reilly Emerging Technology Conference) February 9-12, 2004 San Diego, California http://conferences.oreillynet.com/etech/
On the complexity of graph tree partition problems
Authors: Roberto Cordone, Francesco Maffioli
Venue: Discrete Applied Mathematics (2004)

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider different objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunication network design, but it can be useful in other fields. We achieve a complete characterization of its computational complexity, previously studied only for special cases: a polynomial algorithm based on a new matroid solves the easy cases; the others are strongly NP-hard by direct reduction from SAT. Finally, we give results on special graphs.
Thermal conductivity of ultra low-k dielectrics
Authors: A. Delan, M. Rennau, S. E. Schulz, T. Gessner
Venue: Microelectronic Engineering (2003)

The so-called 3ω measurement technique (transient hot wire method) was established to determine the thermal conductivity of thin films. Measurements of standard substrates and films validate the found thermal conductivity values and agree with published, commonly accepted values. The method was successfully applied to determine the thermal conductivity of porous low-k dielectric materials using special test structure fabrication. The thermal conductivity of the porous low-k dielectrics thus measured is only between 7 and 13% of the thermal conductivity of thermally grown silicon dioxide.
A Commutative Encrypted Protocol for the Privacy Protection of Watermarks in Digital Contents
Authors: Shing-chi Cheung, Ho-fung Leung, Changjie Wang
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Analysis by Forrester research revealed that 18% of global exports will flow online in 2004 and that the volume of e-commerce will surpass $400 billion. Digital rights protection is a major issue in the e-commerce of multimedia contents. Watermarking technology has been proposed as a promising enabling technology for the rights protection of multimedia digital contents. A unique watermark is embedded in each piece of multimedia contents before it is distributed to a customer. When unauthorized copies of a piece of contents are found, the customer who owns the contents can be readily identified by means of the embedded watermark. However, the unauthorized copies may also come from the content provider itself. It is therefore a challenging problem to determine whether an unauthorized copy is distributed by an unethical customer or by an unethical content provider.In this paper, we propose a watermarking protocol to address the problem using cryptographic technologies. Our protocol employs a commutative encryption algorithm to protect the privacy of watermarks. Information is doubly locked by two encryption keys keptseparately by a customer and a content provider. In the protocol, a customer only gets a piece of watermarked multimedia contents in a transaction and the content provider has no ideahow the watermark is formed. This facilitates the authority to determine the unethical partyin case of unauthorized distribution of digital contents. We also discuss a couple of common attacks and show that our protocol can defend successfully against them.