ppxscal/embedding_network huggingface dataset:
Monadic encapsulation of effects: a revised approach (extended version)
Authors: E. Moggi, Amr Sabry
Venue: Journal of Functional Programming (2001)

Launchbury and Peyton Jones came up with an ingenious idea for embedding regions of imperative programming in a pure functional language like Haskell. The key idea was based on a simple modification of Hindley-Milner's type system. Our first contribution is to propose a more natural encapsulation construct exploiting higher-order kinds, which achieves the same encapsulation effect, but avoids the ad hoc type parameter of the original proposal. The second contribution is a type safety result for encapsulation of strict state using both the original encapsulation construct and the newly introduced one. We establish this result in a more expressive context than the original proposal, namely in the context of the higher-order lambda-calculus. The third contribution is a type safety result for encapsulation of lazy state in the higher-order lambda-calculus. This result resolves an outstanding open problem on which previous proof attempts failed. In all cases, we formalize the intended implementations as simple big-step operational semantics on untyped terms, which capture interesting implementation details not captured by the reduction semantics proposed previously.
Graph Imperfection with a Co-Site Constraint
Authors: Stefanie Gerke, Colin McDiarmid
Venue: SIAM Journal on Discrete Mathematics (2004)

We are interested in a version of graph coloring where there is a "co-site" constraint value k. Given a graph G with a nonnegative integral demand xv at each node v, we must assign xv positive integers (colors) to each node v such that the same integer is never assigned to adjacent nodes, and two distinct integers assigned to a single node differ by at least k. The aim is to minimize the span, that is, the largest integer assigned to a node. This problem is motivated by radio channel assignment where one has to assign frequencies to transmitters so as to avoid interference. We compare the span with a clique-based lower bound when some of the demands are large. We introduce the relevant graph invariant, the k-imperfection ratio, give equivalent definitions, and investigate some of its properties. The k-imperfection ratio is always at least 1: we call a graph k-perfect when it equals 1. Then 1-perfect is the same as perfect, and we see that for many classes of perfect graphs, each graph in the class is k-perfect for all k. These classes include bipartite graphs and more generally comparability graphs, co-comparability graphs, and line-graphs of bipartite graphs.
Test-Per-Clock Logic BIST with Semi-Deterministic Test Patterns and Zero-Aliasing Compactor
Authors: O. Novák, Z. Plíva, J. Nosek, A. Hlawiczka, T. Garbolino, K. Gucwa
Venue: Journal of Electronic Testing: Theory and Applications (2004)

We present a test-per-clock BIST scheme using memory for storing test patterns that reduces the number of clock cycle necessary for testing. Thus, the test application time is shorter and energy consumption is lower than those in other solutions. The test hardware consists of a space compactor and a MISR, which provides zero error aliasing for modeled faults. The test pattern generator (TPG) scheme is based on a T-type flip-flop feedback shift register. The generator can be seeded similarly to a D-type flip-flop shift register. It generates test patterns in a test-per-clock mode. The TPG pattern sequence is modified at regular intervals by adding a modulo-2 bit from a modification sequence, which is stored in a memory. The memory can be either a ROM on the chip or a memory in the tester. The test patterns have both random and deterministic properties, which are advantageous for the final quality of the resulting test sequence. The number of bits stored in the memory, number of clock cycles, hardware overhead and the parameters of the resulting zero aliasing space compactor and MISR are given for the ISCAS benchmark circuits. The experiments demonstrate that the BIST scheme provides shorter test sequences than other methods while the hardware overhead and memory requirements are kept low.
General MC: Estimating Boundary of Positive Class from Small Positive Data
Authors: Hwanjo Yu
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Single-Class Classification (SCC) seeks to distinguishone class of data from the universal set of multiple classes.We propose a SCC method called General MC that estimatesan accurate classification boundary of positive classfrom small positive data using the distribution of unlabeleddata. Our theoretical and empirical analyses show that,as long as the distribution of unlabeled data is not highlyskewed in the feature space, General MC significantly outperformsother recent SCC methods when the positive dataset is highly under-sampled.
Algorithms for testing that sets of DNA words concatenate without secondary structure
Authors: Mirela Andronescu, Danielle Dees, Laura Slaybaugh, Yinglei Zhao, Anne Condon, Barry Cohen, Steven Skiena
Venue: Natural Computing: an international journal (2003)

We present an efficient algorithm for determining whether all molecules in a combinatorial set of DNA or RNA strands are structure free, and thus available for bonding to their Watson-Crick complements. This work is motivated by the goal of testing whether strands used in DNA computations or as molecular bar-codes are structure free, where the strands are concatenations of short words. We also present an algorithm for determining whether all words in S*, for some finite set S of equi-length words, are structure free.
Reducing code size for heterogeneous-connectivity-based VLIW DSPs through synthesis of instruction set extensions
Authors: Partha Biswas, Nikil Dutt
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

VLIW DSP architectures exhibit heterogeneous connections between functional units and register files for speeding up special tasks. Such architectural characteristics can be effectively exploited through the use of complex instruction set extensions (ISEs). Although VLIWs are increasingly being used for DSP applications to achieve very high performance, such architectures are known to suffer from increased code size. This paper addresses how to generate ISEs that can result in significant code size reduction in VLIW DSPs without degrading performance. Unfortunately, contemporary techniques for instruction set synthesis fail to extract legal ISEs for heterogeneous-connectivity-based architectures. We propose a Heuristic-based algorithm to synthesize ISEs for a generalized heterogeneous-connectivity-based VLIW DSP architecture. We achieve an average code size reduction of 25% on the MiBench suite with no penalty in performance by applying our ISE generation algorithm on the TI TMS320C6xx, a representative VLIW DSP.
Bayesian models for medical image biology using Monte Carlo Markov chains techniques
Authors: S. Zimeras, F. Georgiakodis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The use of Bayesian methods in medical biology and modeling is an approach, which seeks to provide a unified framework within many different image processes. In this work, bayesian models would be presented to illustrate biological phenomena using the Gibbs sampler technique. Finally methods for the estimation of model parameters would be proposed based on the likelihood ration tests.In recent years stochastic models and statistical methods have been successfully applied in medical biology using image analysis techniques. Of particular interest are Bayesian methods based on local characteristics. Key components of any statistical analysis, using such methods, are the choice of an appropriate model as the prior and the estimation of the prior model parameters.
Implementing theorem provers in a purely functional style
Authors: Keith Hanna
Venue: Journal of Functional Programming (1999)

This paper discusses the principles of implementing an LCF-style proof assistant using a purely functional metalanguage. Two approaches are described; in both, signatures are treated as ordinary values, rather than as mutable components within an abstract datatype. The first approach treats the object logic as a partial algebra and represents it as a partial datatype, that is, a datatype in which the domains of the constructors are restricted by predicate functions. This results in a compact, executable specification of the logic. The second approach uses an abstract type to allow an efficient representation of the logic, whilst keeping the same interface. A case study describes how these principles were put into practice in implementing a fairly complex dependently-sorted logic.
Business processes in UML
Authors: Peter Rittgen
Venue: UML and the unified process (2003)

Today, modeling business processes and modeling software is done using different notations that are designed to fit the special needs of the respective tasks. However, this fact results in a painful methodological gap between business models and software models, which is hard to bridge. This problem becomes even more painful if we try to build software to support certain business models because a smooth transition between the employed notations is usually not supported, or due to methodological problems, impossible. In order to allow for a smoother transition, we propose using Business Process Diagrams (BPDs), which are based on the UML activity diagrams (in both business and software worlds). We show how to derive BPDs from the well-known business process language of Event-driven Process Chains (EPCs) using Petri nets as a common process meta-model.
Coherence and Interactivity in Text-Based Group Discussions around Web Documents
Authors: Kerstin Severinson Eklundh, Henrry Rodriguez
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

This paper reports on a study of text-based communication in a Web-based groupware system, DHS. The system supports annotation of a set of shared documents, where the annotations are gathered in a common dialogue space for each document. Since the system does not support threading of messages, it is of interest to explore how participants use the referential space to connect to each other's contributions. The analysis reveals that the evolving dialogues are characterized by a dual discourse context of documents and comments. The modes of linking are conversational and often implicit, which may lead to coherence problems. We present a visualization tool designed to explore interactivity and referencing strategies in these document-centered dialogues, and discuss implications of our findings for the design of computer-mediated communication systems.
On Some Singularities in Parameter Estimation Problems
Authors: S. Amari, M. V. Burnashev
Venue: Problems of Information Transmission (2003)

Assume that there are two identical remote objects and we want to estimate the distance to the closest of them and the distance between objects. For that purpose, some device (like a radar) is used, and the observed signal is the sum of signals reflected by each object. Moreover, the observed signal is corrupted by white Gaussian noise. Singularity (i.e., very poor estimation accuracy) occurs in this problem if objects are very close to each other. Our aim is to demonstrate this inevitable singularity by the example of the maximum likelihood estimate and also to show that it takes place for any other estimate.
Toward RoboCup without color labeling
Authors: Robert Hanek, Thorsten Schmitt, Sebastian Buck, Michael Beetz
Venue: AI Magazine (2003)

Object recognition and localization methods in RoboCup work on color-segmented camera images. Unfortunately, color labeling can be applied to object-recognition tasks only in very restricted environments, where different kinds of objects have different colors. To overcome these limitations, we propose an algorithm, called the CONTRACTING CURVE DENSITY (CCD) algorithm, for fitting parametric curves to image data. The method neither assumes object-specific color distributions or specific edge profiles, nor does it need threshold parameters. Hence, no training phase is needed. To separate adjacent regions, we use local criteria that are based on local image statistics. We apply the method to the problem of localizing the ball and show that the CCD algorithm reliably localizes the ball even in the presence of heavily changing illumination, strong clutter, specularity, partial occlusion, and texture.
Prototype for the Mechanical Engraver of Aluminum Plates Assisted by Computer
Authors: Apolonio Ata Pérez, Francisco Javier Amaro Sánchez
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The development of a prototype for a mechanical etcherof aluminium plates is presented. These systems are usedin different industries to engrave, in pieces of diversematerials, serial numbers, letters, codes or other symbols.The prototype consists of a xyz coordinates table,controlled by a computer, its movements are generatedwith stepped motors, on the z axis a high velocity drilleris mounted, it uses to engrave a little milling device.The desired drawing to be etched, is first edited using aprogram with a graphics editor and capable ofgenerating output files with HPGL format, HPGL (Hewlett Packard Graphics Language), the control program takes the file, interprets the commands andconverts tem in control pulses for the motors that movesthe milling of the engraver device, the one that moves andreproduces the edited drawing.At the end of this project, a system capable of engravingdrawings in aluminium plates of area 21 x 28 cm2 wasobtained, actually this prototype is used to etchcommemorative plaques.
POESIA: An ontological workflow approach for composing Web services in agriculture
Authors: Renato Fileto, Ling Liu, Calton Pu, Eduardo Delgado Assad, Claudia Bauzer Medeiros
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

This paper describes the POESIA approach to systematic composition of Web services. This pragmatic approach is strongly centered in the use of domain-specific multidimensional ontologies. Inspired by applications needs and founded on ontologies, workflows, and activity models, POESIA provides well-defined operations (aggregation, specialization, and instantiation) to support the composition of Web services. POESIA complements current proposals for Web services definition and composition by providing a higher degree of abstraction with verifiable consistency properties. We illustrate the POESIA approach using a concrete application scenario in agroenvironmental planning.
Managing Capacity and Inventory Jointly in Manufacturing Systems
Authors: James R. Bradley, Peter W. Glynn
Venue: Management Science (2002)

In this paper, we develop approximations that yield insight into the joint optimization of capacity and inventory,and how the optimal inventory policy varies with capacity investment in a single-product, single-station, make-to-stock manufacturing system in which inventory is managed through a base-stock policy. We allow for a correlated demand stream as we analyze our models in an asymptotic regime,in which the penalty and holding costs are small relative to the cost of capacity. Although our approximations are asymptotically correct,our Brownian approximation is accurate even under moderate traffic intensity.
Objective and Subjective Algorithms for Grouping Association Rules
Authors: Aijun An, Shakil Khan, Xiangji Huang
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We propose two algorithms for grouping and summarizingassociation rules. The first algorithm recursively groupsrules according to the structure of the rules and generatesa tree of clusters as a result. The second algorithm groupsthe rules according to the semantic distance between therules by making use of an autometically tagged semantictree-structured network of items. We provide a case study inwhich the proposed algorithms are evaluated. The resultsshow that our grouping methods are effective and producegood grouping results.
RE-tree: an efficient index structure for regular expressions
Authors: Chee-Yong Chan, Minos Garofalakis, Rajeev Rastogi
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.Due to their expressive power, regular expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of these applications have to manage huge databases of RE specifications and need to provide an effective matching mechanism that, given an input string, quickly identifies the REs in the database that match it. In this paper, we propose the RE-tree, a novel index structure for large databases of RE specifications. Given an input query string, the RE-tree speeds up the retrieval of matching REs by focusing the search and comparing the input string with only a small fraction of REs in the database. Even though the RE-tree is similar in spirit to other tree-based structures that have been proposed for indexing multidimensional data, RE indexing is significantly more challenging since REs typically represent infinite sets of strings with no well-defined notion of spatial locality. To address these new challenges, our RE-tree index structure relies on novel measures for comparing the relative sizes of infinite regular languages. We also propose innovative solutions for the various RE-tree operations including the effective splitting of RE-tree nodes and computing a "tight" bounding RE for a collection of REs. Finally, we demonstrate how sampling-based approximation algorithms can be used to significantly speed up the performance of RE-tree operations. Preliminary experimental results with moderately large synthetic data sets indicate that the RE-tree is effective in pruning the search space and easily outperforms naive sequential search approaches.
Testing Decomposition of Component Specifications Based on a Rule for Formal Verification
Authors: Mass Soldal Lund
Venue: Proceedings of the Third International Conference on Quality Software (2003)

This paper proposes a general technique for testing decompositionof component specifications based on rulesfor formal verification. Component specifications are expressedas pairs of two models: a context assumption anda component guarantee. Thereby they capture the contract-likenature between the component to be developed and thecontext in which it is supposed to work. The paper providesempirical evidence that A/G rules developed for formalmethods are highly relevant as patterns for testing decompositionof component specifications. More explicitly,that testing the validity of decomposition based on A/G rulesis valid, and moreover, that testing based on A/G rules ismore efficient that a conventional approach for the samekind of test-quality.
Evolution of Local Government E-Services: The Applicability of E-Business Maturity Models
Authors: Peter Shackleton, Julie Fisher, Linda Dawson
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Governments around the world are increasingly interested in the potential for delivering government services on the World Wide Web. Examples of substantial transition to electronic service delivery can be found in some sectors in some countries, however most government services have failed to evolve from enhanced information-based web pages. The failure to move from web based information to e-service provision is most notable in the local government sector in Australia (particularly Victoria where this research took place) despite numerous policies and hopeful deadlines imposed by governments at all levels. This paper presents research, which examined the current status of Australian local government electronic service delivery, exploring the appropriateness of current e-Business maturity models for evaluating the progress local governments are making towards electronic service delivery. The research involved an evaluation of local government websites and a detailed case study of one local council. The results indicate that apart from Web based information provision, little progress has been made in the transition to electronic service delivery in most areas of local government. In an effort to promote and enhance the use of web sites, local governments have started to make non-integrated moves toward e-Democracy and e-Governance suggesting that conventional linear e-Business and e-Government maturity models may not be appropriate for this sector.
On the Privacy Preserving Properties of Random Data Perturbation Techniques
Authors: Hillol Kargupta, Souptik Datta, Qi Wang, Krishnamoorthy Sivakumar
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Privacy is becoming an increasingly important issue inmany data mining applications. This has triggered the developmentof many privacy-preserving data mining techniques.A large fraction of them use randomized data distortiontechniques to mask the data for preserving the privacyof sensitive data. This methodology attempts to hidethe sensitive data by randomly modifying the data values oftenusing additive noise. This paper questions the utility ofthe random value distortion technique in privacy preservation.The paper notes that random objects (particularly randommatrices) have "predictable" structures in the spectraldomain and it develops a random matrix-based spectral filteringtechnique to retrieve original data from the datasetdistorted by adding random values. The paper presents thetheoretical foundation of this filtering method and extensiveexperimental results to demonstrate that in many cases randomdata distortion preserve very little data privacy. Thepaper also points out possible avenues for the developmentof new privacy-preserving data mining techniques like exploitingmultiplicative and colored noise for preserving privacyin data mining applications.
A Range-Compaction Heuristic for Graph Coloring
Authors: Andrea Di Blas, Arun Jagota, Richard Hughey
Venue: Journal of Heuristics (2003)

This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a &ldquo;pressure&rdquo; component and an annealing schedule for it. The value of this component is empirically quantified. This algorithm is evaluated on a wide range of DIMACS benchmark graphs, and found to be competitive with state-of-the-art algorithms in terms of solution quality and run time.
Learning Refinements on Curve-Strokes
Authors: Saul Simhon, Gregory Dudek
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

We present a system to beautify curves: i.e. to take curves that roughly depict some property of interest and make them look more like what experts would draw. The focus of our work is in applications for artistic drawings, but our system can also be applied to various other domainswhere curves and trajectories play a dominant role such as robot path planning, animation or edge-deblurring. Our approach consists of learning properties from a database of ideal example, which could be comic sketches or robot trajectories, and transform a coarse input curve to make it look like those in the database. The key scientific issue is: in what sense are these curves 'like' one another? In our work, this likeness is expressed statistically. Using Hidden Markov Models in combination with multi-scale methods and mixture models, we synthesize a new curve as a statistically consistent mixture of the training set that best describes the input. Additionally, our approach also allows us to easily include predefined application specific models that can further bias the system.