ppxscal/embedding_network huggingface dataset:
Blind ZF equalization with controlled delay robust to order over estimation
Authors: Houcem Gazzah, Karim Abed-Meraim
Venue: Signal Processing (2003)

Blind channel identification and equalization aim at suppressing the need for training sequences and hence respond to the growing demand on bandwidth of modern and future communication systems. Techniques based on second order statistics show good performance but require accurate (but improbable) estimation of the channel order. An algorithm recently proposed by Gazzah et al. corrects this drawback while providing with only those zero-forcing (ZF) equalizers with minimum and maximum delays. However, in the presence of noise, these are not known to have the best performances. Inspired by this approach that processes shifted correlation matrices, we propose a new algorithm that computes ZF equalizers with any desired delay (as well as estimates of the channel response) while, at the same time, can handle over estimated values of the channel order, as justified theoretically and through simulations.
An Operational Semantics for Probabilistic Concurrent Constraint Programming
Authors: Herbert Wiklicky, Alessandra Di Pierro
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called ``randomised algorithms'' within the CCP framework. Differently from common approaches in (imperative) high-level programming languages, which rely on some kind of `random()' function, we introduce randomness in the very definition of the language by means of a probabilistic choice construct. This allows a program to make stochastic moves during its execution. We call the resulting language Probabilistic Concurrent Constraint Programming (PCCP). We present an operational semantics for PCCP by means of a probabilistic transition system such that the execution of a PCCP program may be seen as a stochastic process, i.e. as a random walk on the transition graph. The transition probabilities are given explicitly. This semantics captures a notion of observables which combines results of computations and the probability of those results being computed. This embedding of randomness within the semantics of a well structured programming paradigm, like CCP, also aims at providing a sound framework for formalising and reasoning about randomised algorithms and programs. Additionally, we give some examples of PCCP programs and we show how well-known randomised algorithms can be implemented very naturally in the new language.
Note on geometric graphs
Authors: Toth Geza
Venue:  (1999)

A geometric graph is a graph drawn in the plane so that the vertices are represented by points in general position, the edges are represented by straight line segments connecting the corresponding points. We show that a geometric graph of $n$ vertices with no $k+1$ pairwise disjoint edges has at most $2^9k^2n$ edges.
Connectionist Models and Linguistic Theory: Investigations of Stress Systems in Languages
Authors: Prahlad Gupta, David S. Touretzky
Venue:  (1993)

We question the widespread assumption that linguistic theory should guide the formulation of mechanistic accounts of human language processing. We develop a pseudo-linguistic theory for the domain of linguistic stress, based on observation of the learning behavior of a perceptron exposed to a variety of stress patterns. There are significant similarities between our analysis of perceptron stress learning and metrical phonology, the linguistic theory of human stress. Both approaches attempt to identify salient characteristics of the stress systems under examination without reference to the workings of the underlying processor. Our theory and computer simulations exhibit some strikingly suggestive correspondences with metrical theory. We show, however, that our high-level pseudo-linguistic account bears no causal relation to processing in the perceptron, and provides little insight into the nature of this processing. Because of the persuasive similarities between the nature of our theory and linguistic theorizing, we suggest that linguistic theory may be in much the same position. Contrary to the usual assumption, it may not provide useful guidance in attempts to identify processing mechanisms underlying human language.
Scalable Mechanisms for Requirements Interaction Management
Authors: Martin S. Feather, Steven L. Cornford, Mark Gibbel
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

Capturing requirements, and managing tradeoffs among them, are critical yet complex activities. Well-designed computerized tools can effectively support these activities. A key challenge in construction of these support tools is how to scale them to handle a large volume of information. Particularly crucial are the ways in which large numbers of requirements and their interrelationships are presented to users. They need to be able to zoom in and out through the space of information to be able to see the big picture, and to locate and focus on specific details when needed. This paper describes a harmonious combination of techniques that support such scalability. The techniques have been embodied in a NASA tool, DDP, for defect detection and prevention. They have been exercised in uses of this tool for requirements/risk tradeoffs, and population of this tool to capture institutional knowledge bases of information.
Implementation Notes on bdes(1)
Authors: Matt Bishop
Venue:  (1991)

This note describes the implementation of bdes, the file encryption program being distributed in the 4.4 release of the Berkeley Software Distribution. It implements all modes of the Data Encryption Standard program. 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
Polymorphic Type Assignment and CPS Conversion
Authors: Robert Harper, Mark Lillibridge
Venue:  (1992)

Meyer and Wand established that the type of a term in the simply typed lambda-calculus may be related in a straightforward manner to the type of its call-by-value CPS transform. This typing property may be extended to Scheme-like continuation-passing primitives, from which the soundness of these extensions follows. We study the extension of these results to the Damas-Milner polymorphic type assignment system under both the call-by-value and call-by-name interpretations. We obtain CPS transforms for the call-by-value interpretation, provided that the polymorphic "let" is restricted to values, and for the call-by-name interpretation with no restrictions. We prove that there is no call-by-value CPS transform for the full Damas-Milner language that validates the Meyer-Wand typing property and is equivalent to the standard call-by-value transform up to (Beta)(Eta)-conversion.
Effective Information Provision for Relieving Traffic Congestion
Authors: Takayuki Shiose, Toshiyuki Onitsuka, Toshiharu Taura
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

An indirect control method is a useful tool for guiding group dynamics to the desired one without ignoring each individual's decision and information provision is one such indirect control method.However, there are few discussions regarding systematic ways to provide such information.The main purpose of this paper is to investigate effective ways to provide information for relieving traffic congestion.An agent-based simulation for representing complex traffic phenomena is introduced and some ways to provide information arediscussed.The results of this study are then summarized.
Removing the Genetics from the Standard Genetic Algorithm
Authors: Shumeet Baluja, Rich Caruana
Venue:  (1995)

We present an abstraction of the genetic algorithm (GA), termed population-based incremental learning (PBIL), that explicitly maintains the statistics contained in a GA''s population, but which abstracts away the crossover operator and redefines the role of the population. This results in PBIL being simpler, both computationally and theoretically, than the GA. Empirical results reported elsewhere show that PBIL is faster and more effective than the GA on a large set of commonly used benchmark problems. Here we present results on a problem custom designed to benefit both from the GA''s crossover operator and from its use of a population. The results show that PBIL performs as well as, or better than, GAs carefully tuned to do well on this problem. This suggests that even on problems custom designed for GAs, much of the power of the GA may derive from the statistics maintained implicitly in its population, and not from the population itself nor from the crossover operator.
On the Automatic Calculation of Solutions Different from Those Previously Obtained of Nonlinear Systems of Equations
Authors: Kenneth M. Brown, W. B. Gearhart, H. A. Hall
Venue:  (1969)

Given a system of N nonlinear (algebraic or transcendental) real equations in N real unknowns, there exist a variety of numerical methods which obtain solutions of those equations. This paper presents two methods which are used to find further simple solutions in addition to those already known a priori or from an earlier calculation. These methods have the advantage of keeping away from solutions previously calculated, saving the computer user the wasted effort entailed in converging to already known, perhaps uninteresting solutions points. The technique can also be used in avoiding previously found extreme points in function minimization. Many problems have ``magnetic zeros'''', zeros which are converged to almost regardless of the starting guesses used. These magnetic zeros often mask out the zeros of real interest. The methods discussed are particularly effective in avoiding convergence to such magnetic zeros. Results of computer experiments ar presented.
Unsupervised Texture Segmentation Applied to Natural Images Containing Man-Made Objects
Authors: Xiaoyan Dai, Jun Maeda
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper presents a region-based unsupervised segmentation for natural images containing man-made objects.We propose a texture feature extraction to obtain more discriminating features.Statistical Geometrical Features (SGF) are use as texture features.The SGF of the original image and the smoothed Image obtained from an anisotropy edge-preserving diffusion are combed for segmentation use.We also propose a modified segmentation algorithm which performs segmentation in fours stages;hierarchic al splitting, local agglomerative merging, global agglomerative merging and combines segments locally, which will greatly reduce the time cost.We make some experiments to demonstrate the effectiveness of the proposed technique in the segmentation of natural images containing man-made objects.The reduction of computation time is also provided.
Pause & Effect: The Art of Interactive Narrative
Authors: Mark Stephen Meadows
Venue:  (2002)

:Narrative surrounds us. We see it in television, movies, newspapers, video games, web sites, and books. These art forms are evolving and merging in new, exciting ways. With its roots in film and theater, the art of interactive narrative is visual, it includes character perspective and it follows dramatic patterns. It diverges from these roots, however, because it allows readers to change the plot. This book examines the intersection of storytelling, visual art, and interactivity. It proposes working methods, theories, interviews, and examples for authors of this art form. This means that the roles of the authors and readers are merging. It not only changes the ways we read and write, it changes the way we see.
A new model for the cognitive process
Authors: R. Keene
Venue: Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95) (1995)

A theory is presented: that a subsumptive neural system coupled with a semi-randomly connected, teachable, neural net will result in cognitive behavior similar to what appears to happen in biological brains. The paper discusses a new theory of what cognition is, and an algorithm for the simulation of cognition. The topics of what the brain appears to do, why the brain provides the functions it does, and how this could be simulated are discussed. The intent is to arrive at a single unified algorithm that covers all functions of the brain.
Further considerations of a general d' in multidimensional space
Authors: Robin D. Thomas
Venue: Journal of Mathematical Psychology (2003)

Thomas (Psychonom. Bull. Rev. 6 (1999) 224) proposed a generalization of d', d'g for multidimensional distributions and demonstrated that it is not equivalent to Euclidean distance as had been assumed in some previous studies. In this note, it is further shown not to be a metric in the general sense as it fails the triangle inequality. Also, a rigorous proof is offered of the claim (found in Thomas, Psychonom. Bull. Rev. 6 (1999) 224) that in order for the definition of d'g to correspond to the quantity that is estimated from data in the traditional way (using hits and false alarms) one must assume a distance classifier (proved in the case of equal covariance matrices). If one assumes optimal responding instead, then the estimated d' corresponds to (the square root of) Mahalanobis distance. This latter observation clears up an apparent paradox between the fact that d'g is not a metric and Ashby and Perrin's (Psychol. Rev. 95 (1988) 124) statement relating the weighted Euclidean scaling model and a signal detection model of similarity that would yield a distance classifier.
Style-Based Reuse for Software Architectures
Authors: Robert T. Monroe, David Garlan
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Although numerous mechanisms for promoting software reuse have been proposed and implemented over the years, most have focused on the reuse of implementation code. There is much conjecture and some empirical evidence, however, that the most effective forms of reuse are generally found at more abstract levels of software design. In this paper we discuss software reuse at the architectural level of design. Specifically, we argue that the concept of "architectural style" is useful for supporting the classification, storage, and retrieval of reusable architectural design elements. We briefly describe the Aesop system's Software Shelf, a tool that assists designers in selecting appropriate design elements and patterns based on stylistic information and design constraints.
Programming PIC Microcontrollers with PICBASIC
Authors: Chuck Hellebuyck
Venue:  (2002)

:The PICBASIC programming language makes it possible to create powerful software for the PIC microcontroller in days instead of the weeks required when using assembly language. This comprehensive tutorial assumes no prior experience with PICBASIC. It opens with an introduction to such basic concepts as variables, statements, operators, and structures. This is followed by discussion of the two most commonly used PICBASIC compilers. The author then discusses programming the most common version of the PIC microcontroller, the 15F84. The remainder of the book examines several real-world examples of programming PICs with PICBASIC. In keeping with the integrated nature of embedded technology, both hardware and software are discussed in these examples; circuit details are given so that readers may replicate the designs for themselves or use them as the starting points for their development efforts. 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
Benefit-Cost Analysis: Financial and Economic Appraisal Using Spreadsheets
Authors: Richard Brown, Harry Campbell
Venue:  (2003)

:The text is suitable for people with a basic understanding of elementary economics who wish to learn how to conduct a social benefit-cost analysis.
Automatic component protocol adaptation with the CoConut/J tool suite
Authors: Ralf H. Reussner
Venue: Future Generation Computer Systems (2003)

While industrial middleware platforms such as CORBA, EJB, or .NET facilitate the development of distributed applications by providing certain infra-structural services required in many distributed systems (such as name services, remote method calls, parameter marshalling, etc.), these industrial platforms fail to support the development of distributed systems with independent components. In particular, their component models do not provide sufficient information for component interoperability checks or automated component adaptation. Especially when considering the personal and institutional separation between component developer and component vendor as one of the prerequisites of an independent component market, finding automatically as many component interoperability errors as possible is crucial. Hence, it is of practical concern that component interfaces not only model the correct way of calling the single methods but also the valid sequences of method calls. Likewise, practice clearly shows that component reuse usually requires component adaptation. This directly shows that only detecting incompatibilities is of limited use, but advocates for techniques of automated component adaptation.In this paper we describe algorithms and tools for specifying and analysing component interfaces in order to check interoperability and to generate adapted component interfaces automatically. Therefore, we introduce the concept of parameterised contracts and a new component interface model.
Application of AI Planning Techniques to Automated Code Synthesis and Testing
Authors: I-Ling Yen, Farokh B. Bastani, Fiaz Mohamed, Hui Ma, John Linn
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

The rapid growth in the demand of embedded systems and the increased complexity of embedded software pose an urgent need for advanced embedded software development techniques. One attractive approach is to enable semi-automated code generation and integration of systems from components. However, the implementation and validation of these systems requires a steep learning curve due to the large number, variety, and complexity ofsoftware components.In this paper, we discuss the potential application of AI planning techniques in assisting with the synthesis of the glue code for assembling a system from existing components as well as automated testing of the system. The approach works by transforming component specifications into rules that operate on a domain-specific state space. Each rule captures the semantics of a method in a class. The code assembly and testing requirements are described by identifying conditions (goals) that should be achieved. An automated planning system computes a sequence of rules and their instantiations that will achieve the goal state. This sequence is then used to synthesize the code or to generate test cases. The approach is illustrated using an example.
Requirements Recovery from Legacy Systems by Analyzing and Modelling Behavior
Authors: Kecheng Liu, Albert Alderson, Zubair Qureshi
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

For any re-engineering of the legacy system such as alteration, modification or complete rebuild, to understand the original requirements can be important and sometimes critical. However, experience in industry shows one should never assume the availability of the system documents; even if they are available, the documents may be out-of-date.The semiotic approach we present in this paper, aims at recovering requirements by studying the legacy system's behaviour. Using this approach, the requirements recovery consists of investigation activities at three major stages with a set of techniques for analysis and representation. The approach guides the analysis to be conducted from a number of angles at certain levels of detail using various software engineering and semiotic techniques. These techniques enable one, for derivation of the requirements, to study a legacy system from perspectives of different stakeholders, from its interaction with the users in the business context, and from information contents and processes of system operations. A case study applying this approach to recover requirements for a university's multi-site library is presented.
Dual-Bounded Hypergraphs: Generating Partial and Multiple Transversals
Authors: Boros Edre, Gurvich Vladimir, Khachiyan Leonid, Makino Kazuhise
Venue:  (1999)

We consider two natural generalizations of the notion of transversal to a finite hypergraph, so called {\em multiple} and {\em partial} transversals. We show that the hypergraphs of all multiple and all partial transversals are dual-bounded in the sense that in both cases, the size of the dual hypergraph is bounded by a polynomial in the cardinality and the length of description of the input hypergraph. Our bounds are based on new inequalities of extremal set theory and threshold Boolean logic, which may be of independent interest. We also show that the problems of generating all multiple and all partial transversals for a given hypergraph are polynomial-time reducible to the generation of all ordinary transversals for another hypergraph, i.e., to the well-known dualization problem for hypergraphs. As a corollary, we obtain incremental quasi-polynomial-time algorithms for both of the above problems, as well as for the generation of all the minimal Boolean solutions for an arbitrary monotone system of linear inequalities.
Finite element superconvergence on Shishkin mesh for 2-D convection-diffusion problems
Authors: Zhimin Zhang
Venue: Mathematics of Computation (2003)

In this work, the bilinear finite element method on a Shishkin mesh for convection-diffusion problems is analyzed in the two-dimensional setting. A superconvergence rate O(N-2 ln2 N + εN-1.5lnN) in a discrete ε-weighted energy norm is established under certain regularity assumptions. This convergence rate is uniformly valid with respect to the singular perturbation parameter ε. Numerical tests indicate that the rate O(N-2ln2 N) is sharp for the boundary layer terms. As a by-product, an ε-uniform convergence of the same order is obtained for the L2-norm. Furthermore, under the same regularity assumption, an ε-uniform convergence of order N-3/2ln5/2N + εN-1ln1/2N in the L∞ norm is proved for some mesh points in the boundary layer region.
Type Inference For Recursive Definitions
Authors: Assaf Kfoury, Santiago M. Pericas-Geertsen
Venue:  (2000)

Abstract We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant''s notion of rank. To motivate our work, we present several examples showing how our systems can be used to type programs encountered in practice. We show that type inference in the rank-k system is decidable for k = 3. (Similar results based on different techniques are known to hold for System F, without recursive types and object types.) Our undecidability result is obtained by a reduction from a particular adaptation (which we call ``regular'''') of the semi-unification problem and whose undecidability is, interestingly, obtained by methods totally different from those used in the case of standard (or finite) semi-unification.