ppxscal/embedding_network huggingface dataset:
Communication, consensus, and order.: Who wants to speak first?
Authors: Nicolas Houy, Lucie Ménager
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Parikh and Krasucki [1990] showed that if rational agents communicate the value of a function f according to a protocol upon which they have agreed beforehand, they will eventually reach a consensus about the value of f, provided a fairness condition on the protocol and a convexity condition on the function f hold. In this article, we address the issue of the influence of the protocol on the outcome of the communication process, in the case where agents communicate in order to learn information. We show that if it is common knowledge among a group of agents that some of them disagree about two protocols, then the consensus value of f must be the same according to the two protocols.
Variable Interactions in Query-Driven Visualization
Authors: Luke Gosink, John Anderson, Wes Bethel, Kenneth Joy
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Our ability to generate ever-larger, increasingly-complex data, has established the need for scalable methods that identify, and provide insight into, important variable trends and interactions. Query-driven methods are among the small subset of techniques that are able to address both large and highly complex datasets.This paper presents a new method that increases the utility of query-driven techniques by visually conveying statistical information about the trends that exist between variables in a query. In this method, correlation fields, created between pairs of variables, are used with the cumulative distribution functions of variables expressed in a user's query. This integrated use of cumulative distribution functions and correlation fields visually reveals, with respect to the solution space of the query, statistically important interactions between any three variables, and allows for trends between these variables to be readily identified. We demonstrate our method by analyzing interactions between variables in two flame-front simulations.
Optimal Release Time of Computer Software
Authors: H. S. Koch
Venue: IEEE Transactions on Software Engineering (1983)

A decision procedure to determine when computer software should be released is described. This procedure is based upon the cost-benefit for the entire company that has developed the software. This differs from the common practice of only minimizing the repair costs for the data processing division. Decision rules are given to determnine at what time the system should be released based upon the results of testing the software. Necessary and sufficient conditions are identified which determine when the system should be released (immediately, before the deadline, at the deadline, or after the deadline). No assumptions are made about the relationship between any of the model's parameters. The model can be used whether the software was developed by a first or second party. The case where future costs are discounted is also considered.
Application of a transparent interface methodology to image processing
Authors: Luigi Cinque, Sergio Sellers Cañizares, Steven Tanimoto
Venue: Journal of Visual Languages and Computing (2007)

Many software engineering projects involve a significant design component in which an algorithm must be formulated as a sequence of processing steps that meets a solution criterion. As the problems tackled become more complex, it becomes increasingly important to create and use tools that help designers understand and manage the design process. We demonstrate the use of design tool called T-STAR in the domain of image processing, in which a toolkit called the TRAnsparent Image Problem Solving Environment (TRAIPSE) is extended to solve face-recognition problems. Key features of TRAIPSE are its visual interface to the space of partial image processing algorithms and its support for automatic assistance in exploring the space. The specific application we present is the analysis of human face images.
Working in the Garden Environment for Conceptual Programming
Authors: S. P. Reiss
Venue: IEEE Software (1987)

Program designers use a variety of techniques when creating their systems. This automated design system conforms to the programmer.
A Common Medium for Programming Operations-Research Models
Authors: Suleyman Karabuk, F. Hank Grant
Venue: IEEE Software (2007)

Operations research is an interdisciplinary science that develops scientific methods for modeling and solving decision problems. Software tools are essential in practicing OR, because model formulations and solution techniques are complex and require the use of computers. So, there are well-established software frameworks and implementations to support OR methodologies. Python, a dynamically typed language, can implement these software frameworks for major OR methodologies (mathematical programming and simulation) in the same programming environment. By doing so, Python, in effect, glues software environments that have been independent, thus improving the software development cycle for sophisticated applications requiring different model types. This article is part of a special issue on dynamically typed languages.
Why Programming Environments Need Dynamic Data Types
Authors: J. W. Goodwin
Venue: IEEE Transactions on Software Engineering (1981)

Data abstraction is a powerful source of program structure and abstraction. There is nothing about it, or the reasons why it works, which restricts it to static applications. Programming environments (PE's) especially need to use data types dynamically, since it is their function to support the programmer in all phases of work with a program. Thus, the PE must proceed smoothly from definition to use to editing of a type.
Hierarchical Fault Compatibility Identification for Test Generation with a Small Number of Specified Bits
Authors: Stelios Neophytou, Maria K. Michael
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Identification of bits that do not necessarily have to be specified in a test set can be beneficial to a number of applications, including low power test, test set encoding and embedding, and test set enriching with n-detect or other fault types properties. This work presents a new method for generating tests containing only a small number of specified bits, while keeping the number of total tests small. The method relies on finding a large number of faults that can be detected by a single test (compatible faults) with a small number of specified bits. Both the total number of specified bits in the test set as well as the number of specified bits per test are minimized. The obtained experimental results show that the proposed methodology can generate compact test sets with an average of 60% of unspecified bits, outperforming existing methods that consider this problem.
Functional Level Primitives in Test Generation
Authors: M. A. Breuer
Venue: IEEE Transactions on Computers (1980)

This paper deals with the use and development of high-level (functional) primitive logic elements for use in a system which automatically generates tests for complex sequential circuits. The concept of solution sequences to test problems for primitive elements is introduced and a functional language used to describe solution sequences is presented. Functional test generation models for two basic elements, a shift register and a counter, are derived, including procedures for implication, D-drive and line justification. Primitive algorithms which generate single as well as multivector (sequences) solutions to D-drive and line justification problems are presented.
Green query optimization: taming query optimization overheads through plan recycling
Authors: Parag Sarda, Jayant R. Haritsa
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

PLASTIC [1] is a recently-proposed tool to help query optimizers significantly amortize optimization overheads through a technique of plan recycling. The tool groups similar queries into clusters and uses the optimizer-generated plan for the cluster representative to execute all future queries assigned to the cluster. An earlier demo [2] had presented a basic prototype implementation of PLASTIC. We have now significantly extended the scope, useability, and efficiency of PLASTIC, by incorporating a variety of new features, including an enhanced query feature vector, variable-sized clustering and a decision-tree-based query classifier. The demo of the upgraded PLASTIC tool is shown on commercial database platforms (IBM DB2 and Oracle 9i).
Web based linkage
Authors: Ergin Elmacioglu, Min-Yen Kan, Dongwon Lee, Yi Zhang
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

When a variety of names are used for the same real-world entity, the problem of detecting all such variants has been known as the (record) linkage or entity resolution problem. In this paper, toward this problem, we propose a novel approach that uses the Web as the collective knowledge source in addition to contents of entities. Our hypothesis is that if an entity e1 is a duplicate of another entity e2, and if e1 frequently appears together with information I on the Web, then e2 may appear frequently with I on the Web. By using search engines, we analyze the frequency, URLs, or contents of the returned web pages to capture the information I of an entity. Extensive experiments verify that our hypothesis holds in many real settings, and the idea of using the Web as the additional source for the linkage problem is promising. Our proposal shows 51% (on average) and 193% (at best) improvement in precision/recall compared to a baseline approach.
On TCP Performance in Flow-Based Mix Networks
Authors: Xinwen Fu, Shu Jiang, Wei Yu, Steve Graham, Yong Guan
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

Anonymity technologies such as mix networks have gained increasing attention as a way to provide communication privacy. Mix networks were developed for messagebased applications such as email, but researchers have adapted mix techniques to low-latency, flow-based applications such as anonymous web browsing. In this paper, we systematically address TCP performance issues of flow-based mix networks. We explain why a mix's batching and reordering schemes can dramatically reduce TCP throughput due to out-of-order packet delivery. We developed a theoretical model to analyze such impact and present closed formulae for TCP throughput in mix networks. To improve TCP performance, we examined the approach of increasing TCP's duplicate threshold parameter and derived closed formulae for the performance gains. Our simulation results matched our theoretical analysis well.
A State Assignment Technique for Sequential Machines Using J-K Flip-Flops
Authors: G. L. Tumbush
Venue: IEEE Transactions on Computers (1974)

Several techniques for choosing state assignments which tend to minimize the combinational input and output circuitry of sequential machines have been developed. One of these techniques is a heuristic scoring approach which was originally developed assuming delays as memory elements [1].
Reverse kNN search in arbitrary dimensionality
Authors: Yufei Tao, Dimitris Papadias, Xiang Lian
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such queries have at least one of the following deficiencies: (i) they do not support arbitrary values of k (ii) they cannot deal efficiently with database updates, (iii) they are applicable only to 2D data (but not to higher dimensionality), and (iv) they retrieve only approximate results. Motivated by these shortcomings, we develop algorithms for exact processing of RkNN with arbitrary values of k on dynamic multidimensional datasets. Our methods utilize a conventional data-partitioning index on the dataset and do not require any pre-computation. In addition to their flexibility, we experimentally verify that the proposed algorithms outperform the existing ones even in their restricted focus.
The Programmer's Lexicon, Volume I: The Verbs
Authors: Einar W. Host, Bjarte M. Ostvold
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Method names make or break abstractions: good ones communicate the intention of the method, whereas bad ones cause confusion and frustration. The task of naming is subject to the whims and idiosyncracies of the individual since programmers have little to guide them except their personal experience. By analysing method implementations taken from a corpus of Java applications, we establish the meaning of verbs in method names based on actual use. The result is an automatically generated, domain-neutral lexicon of verbs, similar to a natural language dictionary, that represents the common usages of many programmers.
Cross-Genre Feature Comparisons for Spoken Sentence Segmentation
Authors: Sebastien Cuendet, Dilek Hakkani-Tur, Elizabeth Shriberg, James Fung, Benoit Favre
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Automatic sentence segmentation of spoken language is an important precursor to downstream natural language processing. Previous studies combine lexical and prosodic features, but can impose significant computational challenges because of the large size of feature sets. Little is understood about which features most benefit performance, particularly for speech data from different speaking styles. We compare sentence segmentation for speech from broadcast news versus natural multi-party meetings, using identical lexical and prosodic feature sets across genres. Results based on boosting and forward selection for this task show that (1) features sets can be reduced with little or no loss in performance, and (2) the contribution of different feature types differs significantly by genre. We conclude that more efficient approaches to sentence segmentation and similar tasks can be achieved, especially if genre differences are taken into account.
Layout-Accurate Design and Implementation of a High-Throughput Interconnection Network for Single-Chip Parallel Processing
Authors: Aydin O. Balkan, Michael N. Horak, Gang Qu, Uzi Vishkin
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

A Mesh of Trees (MoT) on-chip interconnection network has been proposed recently to provide high throughput be- tween memory units and processors for single-chip paral- lel processing [5]. In this paper, we report our findings in bringing this concept to silicon. Specifically, we conduct cycle-accurate verilog simulations to verify the analytical results claimed in [5]. We synthesize and obtain the layout of the MoT interconnection networks of various sizes. To further improve throughput, we investigate different arbitra- tion primitives to handle load and store, the two most com- mon memory operations. We also study the use of pipeline registers in large networks when there are long wires. Sim- ulation based on full network layout demonstrates that sig- nificant throughput improvement can be achieved over the original proposed MoT interconnection network. The importance of this work lies in its validation of per- formance features of the MoT interconnection network, as they were previously shown to be competitive with tradi- tional network solutions. The MoT network is currently used in an eXplicitMulti-Threading (XMT) on-chip parallel processor, which is engineered to support parallel program- ming. In that context, a 32-terminal MoT network could support up to 512 on-chip XMT processors. Our 8-terminal network that could serve 8 processor clusters (or 128 total processors), was also accepted recently for fabrication.
An Application of Relaxation Labeling to Line and Curve Enhancement
Authors: S. W. Zucker
Venue: IEEE Transactions on Computers (1977)

A relaxation process is described and is applied to the detection of smooth lines and curves in noisy, real world images. There are nine labels associated with each image point, eight labels indicating line segments at various orientations and one indicating the no-line case. Attached to each label is a probability. In the relaxation process, interaction takes place among the probabilities at neighboring points. This permits line segments in compatible orientations to strengthen one another, and incompatible segments to weaken one another. Similarly, no-line labels are reinforced by neighboring no-line labels and weakened by appropriately oriented line labels. This process converges, in only a few iterations, to a condition in which points lying on long curves have achieved high line probabilities, while other points have high no-line probabilities, There is some tendency, under this process, for curves to thicken; however, a thinning procedure can be incorporated to counteract this. The process is effective even for curves of low contrast, and even when many curves lie close to one another.
Biometric valence and arousal recognition
Authors: Christian Martyn Jones, Tommy Troen
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

A real-time user-independent emotion detection system using physiological signals has been developed. The system has the ability to classify affective states into 2-dimensions using valence and arousal. Each dimension ranges from 1 to 5 giving a total of 25 possible affective regions. Physiological signals were measured using 3 biometric sensors for Blood Volume Pulse (BVP), Skin Conductance (SC) and Respiration (RESP). Two emotion inducing experiments were conducted to acquire physiological data from 13 subjects. The data from 10 of these subjects were used to train the system, while the remaining 3 datasets were used to test the performance of the system. A recognition rate of 62% for valence and 67% for arousal was achieved within +/- 1 units of the valence and arousal rating.
Fast Flip-Chip Pin-Out Designation Respin by Pin-Block Design and Floorplanning for Package-Board Codesign
Authors: Ren-Jie Lee, Ming-Fang Lai, Hung-Ming Chen
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Deep submicron effects drive the complication in designing chips, as well as in package designs and communications between package and board. As a result, the iterative interface design has been a time-consuming process. This paper proposes a novel and efficient approach to designating pinout for flip-chip BGA package when designing chipsets. The proposed approach can not only automate the assignment of more than 200 I/O pins on package, but also precisely evaluate package size which accommodates all pins with almost no void pin positions, as good as the one from manual design. Furthermore, the practical experience and techniques in designing such interface has been accounted for, including signal integrity, power delivery and routability. This efficient pin-out designation and package size estimation by pin-block design and floorplanning provides much faster turn around time, thus enormous improvement in meeting design schedule. The results on two real cases show that our methodology is effective in achieving almost the same dimensions in package size, compared with manual design in weeks, while simultaneously considering critical issues in package-board codesign. To the best of our knowledge, this is the first attempt in solving flip-chip pin-out placement problem in package-board codesign.
Physical Access Control for Captured RFID Data
Authors: Travis Kriplean, Evan Welbourne, Nodira Khoussainova, Vibhor Rastogi, Magdalena Balazinska, Gaetano Borriello, Tadayoshi Kohno, Dan Suciu
Venue: IEEE Pervasive Computing (2007)

RFID security is a vibrant research area, and many protection mechanisms against unauthorized RFID cloning and reading attacks are emerging. However, little work has yet addressed the complementary issue of privacy for RFID data after it has been captured and stored by an authorized system. In this article, the authors discuss the problem of peer-to-peer privacy for personal RFID data. In this setting, they assume a system with trusted owners and administrators, and focus on ways to constrain peers' access to information about one another. An access control policy, called Physical Access Control, protects privacy by constraining the data a user can obtain from the system to those events that occurred when and where that user was physically present. PAC provides a high level of privacy. It also offers a database view that augments users' memory of places, objects, and people. PAC is a natural, intuitive access-control policy for peer-to-peer privacy. It enables many classes of applications while providing a good baseline trade-off between privacy and utility. This article is part of a special issue on security and privacy.
Artifacts and Process
Authors: Grady Booch
Venue: IEEE Software (2007)

A comparison of building architecture and software architecture reveals the differences, congruences, and commonalities between the two. There are differences in cost estimation, but there are similarities in divisions of labor or knowledge, degrees of formality, and the use of different viewpoints, use cases, an incremental design, and a particular style.
A note on the meshless method using radial basis functions
Authors: Yong Duan
Venue: Computers Mathematics with Applications (2008)

In this paper, we prove some inverse inequalities for the finite dimensional subspace interpolated by radial basis functions. The properties of these inequalities are worse than those in finite element spaces. These bad properties result in a huge condition number for both the collocation method and Galerkin method using radial basis functions. As applications, theoretical estimates of the condition numbers of a meshless method using radial basis functions are given.
Identification Of Software Performance Bottleneck Components In Reuse based Software Products With The Application Of Acquaintanceship Graphs
Authors: Jasmine K.S, R. Vasantha
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Component-Based software engineering provides an opportunity for better quality and increased productivity in software development by using reusable software components [9]. Also performance is a make-or-break quality for software. The systematic application of software performance engineering techniques throughout the development process can help to identify design alternatives that preserve desirable qualities such as extensibility and reusability while meeting performance objectives [1]. Implementing the effective performance-based management of software intensive projects has proven to be challenging task now a days. This paper aims at identifying the major reasons of software performance failures in terms of the component communication path. My work focused on one of the applications of discrete mathematics namely graph theory. This study makes an attempt to predict the most used components to the least used with the help of acquaintanceship Graphs and also the shortest communication path between any two components with the help of adjacency matrix. Experiments are conducted with four components and the result shows a promising approach towards component utilization and bottleneck determination that describe the major areas in the component communication to concentrate in achieving success in cost-effective development of highly performance software.
Agents Redux
Authors: James Hendler
Venue: IEEE Intelligent Systems (2007)

Editor in Chief James Hendler comments on responses he received about his essay "Where Are All the Intelligent Agents?" in the May/June issue.