ppxscal/embedding_network huggingface dataset:
Product Heterogeneity: Moderating Effect on Online Consumer Behavior
Authors: Young Chan Choe, Deok-Ran Hwang, Miyoung Kim, Junghoon Moon
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The main goal of this study is to investigate moderating effects of product heterogeneity on online consumer behavior. It is hypothesized that relationships between shopping motives, emotions, and behavioral intention of online consumers that shop for agro products (high product heterogeneity) must be different from those of consumers who shop for regular industrial products (low product heterogeneity). A literature review supports this hypothesis, providing theoretical background that the perceived risk increases when consumers shop for high heterogeneity products). A structural equation model was proposed and examined through survey research. Data was collected from customers of two leading B2C e-marketplaces in Korea (N=279). One sub-group of the sample was the low-heterogeneity-product purchasing group, and another one was the high-heterogeneity-product purchasing group. Moderating effects of online product heterogeneity in the model were investigated. The findings show that product heterogeneity has a strong influence on online consumer buying behavior.
A Trust Overlay Architecture and Protocol for Enhanced Protection against Spam
Authors: Jimmy McGibney, Dmitri Botvich
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The effectiveness of current anti-spam systems is limited by the ability of spammers to adapt to new filtering techniques and the lack of incentive for mail domains to filter outgoing spam. This paper describes a new approach to spam protection based on distributed trust management. This is motivated by the fact that the SMTP mail infrastructure is managed in a distributed way by a community of mail domain administrators. A trust overlay architecture and a new protocol are presented. The TOPAS protocol specifies how experiences and recommendations are communicated between a spam filter at each mail domain and its associated trust manager, and between trust managers of different mail servers. A technique for improving mail filtering using these trust measures is also described. Initial simulations indicate the potential of this approach to improve rates of false positives and false negatives in anti-spam systems.
Proposal of an Architecture to Retrieve Information from Multiple Devices Using Matchmaking Algorithms
Authors: J. Javier Samper, Vicente R. Tomas, R. P. do Nascimento, Juan J. Martinez
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Semantic Web Services (SWS) propose to extend the traditional Web Services technologies on the way to consolidate ontologies and semantics. This makes possible the selection, the integration and the dynamic invocation of services. In this way, services are able to dynamically adapt themselves to changes without human intervention. The main purpose of this paper is to present an algorithm for matching SWS. The algorithm uses the description of the services capabilities to match the semantic values. The traditional matching has been improving using ontologies witch constitutes a step further in the matching algorithms. To implement the algorithm an agent FIPA compliant architecture has been designed and implemented. The results obtained are positives. The semantic web services framework developed in combination with the use of the matchmaking algorithm allows to find services based on their similarities.
Guest Editors' Introduction: Interacting with Autonomy
Authors: Holly A. Yanco, Jill L. Drury
Venue: IEEE Intelligent Systems (2007)

This special issue presents five articles and one invited essay on designing and implementing human interaction with autonomous (orsemiautonomous) physical robots. In keeping with the human focus, they all discuss evaluation with humans, and most of the evaluationstake into account the effects of varying automation levels. This article is part of a special issue on Interacting with Autonomy.
Impact of Modern Process Technologies on the Electrical Parameters of Interconnects
Authors: Debjit Sinha, Jianfeng Luo, Subramanian Rajagopalan, Shabbir Batterywala, Narendra V. Shenoy, Hai Zhou
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper presents the results obtained from an experimental study of the impact of modern process technologies on the electrical parameters of interconnects. Variations in parasitic capacitances and resistances due to dummy metal fills, chemical mechanical polishing, multiple thin inter-layer dielectrics and trapezoidal conductor crosssections are presented. Accurate variations in the parasitics are reported for a set of timing critical nets using 3d field solvers for extraction. Results obtained on a set of industrial designs show that the impact of dummy fills and trapezoidal conductor cross-sections are significant.
Alternative Logics: a book review: SIGACT news logic column 18
Authors: Riccardo Pucella
Venue: ACM SIGACT News (2007)

A few years ago, Bill Gasarch, editor of the Book Review Column, sent me a copy of the book Alternative Logics: Do Sciences Need Them? [28], edited by Paul Weingartner, and asked if I was interested in reviewing it. The book is a collection of essays discussing whether there is a need for logics other than classical logic in various areas of science. Interestingly, I had just finished reading a copy of philosopher Susan Haack's Deviant Logic [13], concerning the philosophical foundation of alternative logics. This was fortuitous, because Haack's monograph provided a wonderful introduction to the essays collected in Weingartner's volume.
Extending the operating system at the user level: the Ufo global file system
Authors: Albert D. Alexandrov, Maximilian Ibel, Klaus E. Schauser, Chris J. Scheiman
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

In this paper we show how to extend the functionality of standard operating systems completely at the user level. Our approach works by intercepting selected system calls at the user level, using tracing facilities such as the /proc file system provided by many Unix operating systems. The behavior of some intercepted system calls is then modified to implement new functionality. This approach does not require any re-linking or recompilation of existing applications. In fact, the extensions can even be dynamically "installed" into already running processes. The extensions work completely at the user level and install without system administrator assistance. We used this approach to implement a global file system, called Ufo, which allows users to treat remote files exactly as if they were local. Currently, Ufo supports file access through the FTP and HTTP protocols and allows new protocols to be plugged in. While several other projects have implemented global file system abstractions, they all require either changes to the operating system or modifications to standard libraries. The paper gives a detailed performance analysis of our approach to extending the OS and establishes that Ufo introduces acceptable overhead for common applications even though intercepting system calls incurs a high cost.
Software Editions: An Application of Segmentation Theory to the Packaged Software Market
Authors: Srinivasan Raghunathan
Venue: Journal of Management Information Systems (2000)

Introducing multiple editions of the same software is a relatively recent innovation in the software market. The editions serve to differentiate among different user segments. Introduction of similar low- and high-end products in other markets has been analyzed using segmentation theory. However, the software market is fundamentally different from other product markets in two respects: (1) Software is characterized by negligible marginal production cost, and (2) the option of offering upgrades also exists. Weanalyze the problem of software introduction using segmentation theory. Our analysis shows that if cannibalization is low, the vendor should introduce the full software as one edition. This result differs from that obtained in prior research, which showed that the seller should introduce two distinct products in such cases. When cannibalization is high, introducing multiple editions simultaneously is optimal under a variety of conditions. The strategy of introducing a highend edition in the first period followed by the low-end edition in the second period is optimal only when the consumers are extremely impatient and the software is large. A significant result of our analysis is that offering upgrades is clearly superior to other strategies only in a very restricted range of parameters. Our analysis also suggests that the vendor's profit is higher when it announces the future strategy. Our theoretical results are supported by evidence from the software market.
Edge Programming
Authors: Kevin Sullivan
Venue: Proceedings of the International Workshop on Software Technologies for Ultra-Large-Scale Systems (2007)

Complex systems of the future will often comprise networks of distributed programmable parts without centralized control over the programming of the parts. In other words, programming will happen at the edge. In this position paper I suggest that edge programming will create interesting and important problems for the field of software design and engineering. Chief among them will be to maintain conceptual integrity, thus ease of use, software quality, thus system dependability, and a coherent global view, thus system understandability and analyzability (at some level) in the absence of what to now has been a centralized control paradigm of software development. Edge programming is related to but distinct from end-user programming and from open-source development.
What Can OSS Mailing Lists Tell Us? A Preliminary Psychometric Text Analysis of the Apache Developer Mailing List
Authors: Peter C. Rigby, Ahmed E. Hassan
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

Developer mailing lists are a rich source of information about Open Source Software (OSS) development. The unstructured nature of email makes extracting information difficult. We use a psychometrically-based linguistic analysis tool, the LIWC, to examine the Apache httpd server developer mailing list. We conduct three preliminary experiments to assess the appropriateness of this tool for information extraction from mailing lists. First, using LIWC dimensions that are correlated with the big five personality traits, we assess the personality of four top developers against a baseline for the entire mailing list. The two developers that were responsible for the major Apache releases had similar personalities. Their personalities were different from the baseline and the other developers. Second, the first and last 50 emails for two top developers who have left the project are examined. The analysis shows promise in understanding why developers join and leave a project. Third, we examine word usage on the mailing list for two major Apache releases. The differences may reflect the relative success of each release.
Code Optimization for Packet Filters
Authors: Yoshiyuki Yamashita, Masato Tsuru
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Packet filters play an essential role for network traffic/ security management in today's Internet. To make software-based packet filters so fast that could work even in suffering from DOS attacks, the authors are challenging to effectively combine both the higher-level optimization relating to algorithmic structure adapted to the input packet sequence and the lower-level one relating to acceleration techniques in compiler study. In this paper, we focus on the lower-level (machine code) optimization using software pipelining, and report preliminary experimental results indicating that our approach has great potential to accelerate packet filter performance. Our code optimization achieves more than ten times higher performance compared with a conventional interpreter-based packet filter for each of seven typical fragments of packet filter rules.
Lipreading from color motion video
Authors: R. Chellappa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We have designed and implemented a lipreading system which recognises isolated words using only color motion video of human lips (without acoustic data). The lipreading system performs color motion video recognition using "snakes" (active contour models), principal component analysis (PCA), and hidden Markov models (HMM). The snake algorithm and PCA are used to extract two sets of visual features from every frame (image) in the video sequence. The snake algorithm looks for contour features in the geometric space, while PCA seeks principal components in the eigenspace. An HMM recognizer is used to train and recognise a sequence of the combined visual features. With the visual information alone, we were able to achieve 94% recognition accuracy for 10 isolated words of a single speaker without using any special marker or lipstick.
Approximation spaces in off-policy Monte Carlo learning
Authors: James F. Peters, Christopher Henry
Venue: Engineering Applications of Artificial Intelligence (2007)

This paper introduces an approach to off-policy Monte Carlo (MC) learning guided by behaviour patterns gleaned from approximation spaces and rough set theory introduced by Zdzislaw Pawlak in 1981. During reinforcement learning, an agent makes action selections in an effort to maximize a reward signal obtained from the environment. The problem considered in this paper is how to estimate the expected value of cumulative future discounted rewards in evaluating agent actions during reinforcement learning. The solution to this problem results from a form of weighted sampling using a combination of MC methods and approximation spaces to estimate the expected value of returns on actions. This is made possible by considering behaviour patterns of an agent in the context of approximation spaces. The framework provided by an approximation space makes it possible to measure the degree that agent behaviours are a part of (''covered by'') a set of accepted agent behaviours that serve as a behaviour evaluation norm. Furthermore, this article introduces an adaptive action control strategy called run-and-twiddle (RT) (a form of adaptive learning introduced by Oliver Selfridge in 1984), where approximate spaces are constructed on a ''need by need'' basis. Finally, a monocular vision system has been selected to facilitate the evaluation of the reinforcement learning methods. The goal of the vision system is to track a moving object, and rewards are based on the proximity of the object to the centre of the camera field of view. The contribution of this article is the introduction of a RT form of off-policy MC learning.
Dual /spl nu/-support vector machine with error rate and training size biasing
Authors: Hong-Gunn Chew
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Support vector machines (SVMs) have been successfully applied to classification problems. The difficulty in selecting the most effective error penalty has been partly resolved with /spl nu/-SVM. However, the use of uneven training class sizes, which occurs frequently with target detection problems, results in machines with biases towards the class with the larger training set. We propose an extended /spl nu/-SVM to counter the effects of the unbalanced training class sizes. The resulting dual /spl nu/-SVM provides the facility to counter these effects, as well as to adjust the error penalties of each class separately. The parameter /spl nu/ of each class provides a lower bound to the fraction of support vector of that class, and the upper bound to the fraction of bounded support vector of that class. These bounds allow the control on the error rates allowed for each class, and enable the training of machines with specific error rate requirements.
A Robust Single Sign-On Model Based on Multi-Agent System and PKI
Authors: Somchart Fugkeaw, Piyawit Manpanpanich, Sekpon Juntapremjitt
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In this paper, we propose a novel Single Sign-On (SSO) approach based on Multi-Agent System (MAS) and Public Key Infrastructure (PKI) authentication scheme. This allows the model to benefit from key advantages of the two schemes, i.e. the capability of the multi-agent technique and the strength of PKI. In addition we also deal with the issue of agent service disruption and recovery as well as real-time client privilege management. We apply MAS concept to facilitate multi-application authentication and authorization process for multiple concurrent users. Depending on the type, an agent serves such various functions as client certificate validation, authorization check, access granting, administration, application delegation scheduling. PKI is employed to create trust among agents. Finally, we proved our idea with real implementation and testing.
A set of protocols for micropayments in distributed systems
Authors: Lei Tang
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

Micropayments refer to low-value financial transactions ranging from several pennies to a few dollars. A big portion of electronic commerce occurring in the Internet belong to the category of micropayments. The cost of micropayments should be kept as low as possible in order for the service provider (the merchant) to profit from the low-value transactions. We propose several protocols for micropayments in distributed systems. Our main goal is to reduce the charging cost by choosing a suitable security model, a charging model, and cryptographic algorithms; and by employing the properties unique to the information goods. Our protocols satisfy the requirements of a payment system and are "cheap" in terms of computation costs, communication costs, and key management costs. We select the debit model for designing our protocols and base our protocols on the private key cryptosystems. We show that the existing authentication protocols and systems can be extended to handle micropayments in distributed systems. We also present possible extensions to our protocols.
Clustering algorithms for categorical data
Authors: William Andreopoulos
Venue:  (2006)

Categorical datasets in many domains, such as biology or software analysis, have a rich underlying cluster structure. Categorical clustering methods that are motivated by uncovering interesting local cluster structure could produce high clustering quality, and potentially help analysts to study hidden roles of objects in a dataset.This thesis presents several clustering algorithms for categorical data. First, we introduce the HIERDENC algorithm for hierarchical density-based clustering of categorical data. Then, we present the MULIC algorithm, which is a faster simplification of HIERDENC. MULIC is designed for categorical datasets with a multi-layered structure, such as protein interaction data. Our experimental evaluation of MULIC on such datasets shows that it can uncover their underlying structure better than other algorithms and has comparable runtimes.Next, we present the MULICsoft algorithm for clustering large software systems. MULICsoft is an extension of MULIC that incorporates in the clustering process information on a software system's runtime execution. We evaluate MULICsoft on a large open-source system. MULICsoft is able to produce decompositions that are close to those created by system experts.We continue with the BILCOM algorithm which is an extension of MULIC. BILCOM is used for clustering mixed categorical and numerical biomedical data. We apply BILCOM to datasets of mixed types, such as hepatitis, thyroid disease and yeast gene expression data with Gene Ontology annotations. The results show that BILCOM can partition these datasets significantly better than using just categorical or numerical type.Finally, we present the M-BILCOM algorithm, which is an extension of BILCOM for clustering mixed numerical and low quality categorical data. M-BILCOM incorporates in the clustering process the confidence on the categorical values' correctness. We apply M-BILCOM to yeast gene expression data with Gene Ontology-annotations and GO Evidence codes representing evidence on the annotations' correctness.
Fixed window constant modulus algorithms
Authors: Xiang-Yang Zhaung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined if the peak position of the initialized global channel/equalizer response is known. These fixed window CM algorithms are data efficient, computationally inexpensive and no step-size tuning is required. The effect of noise, and the relationship between the converging delay and noise enhancement are analyzed as well.
An Enhanced CAM Architecture to Accelerate LZW Compression Algorithm
Authors: Rupak Samanta, Rabi. N. Mahapatra
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper presents efficient hardware architecture for Lempel-Ziv-Welch (LZW) data compression algorithm that can perform both encoding and decoding operations simultaneously using a CAM array. An enhanced CAM cell design has been proposed to achieve search and twofold store operations in single access during regular match operations. The proposed architecture utilizes these enhanced CAM cells to accelerate the implementation of the LZW algorithm. The performance of the proposed design is evaluated using the Corpus benchmarks, where on an average a performance improvement of 53x is achieved when compared to the software approach.
Simplified motion language for 3D computer animation with turtle metaphor
Authors: Masayuki Ueno, Kazuma Tanida, Katsuhide Tsushima
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Human visual cognition in 3D is depend on view point, therefore, making 3D animation process is very complex for human. Simplified Motion Language to describe motion for animator has been developed. On this interface, animator describe 3D object motion with motion icons that correspond to elemental motion with turtle metaphor. Arranged icons of elemental motions are combined and synthesized to one motion on each time step, then, the complex motion in animation is generated. Hence, animators without programming skill can also make 3D animation with this system.