ppxscal/embedding_network huggingface dataset:
Computing nash equilibria through particle swarm optimization
Authors: N. G. Pavlidis, K. E. Parsopoulos, M. N. Vrahatis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This paper considers the application of a novel optimization method, namely Particle Swarm Optimization, to compute Nash equilibria. The problem of computing equilibria is formed as one of detecting the global minimizers of a real-valued, non-negative, function. To detect more than one global minimizers of the function at a single run of the algorithm and address effectively the problem of local minima, the recently proposed Deflection technique is employed. The performance of the proposed algorithm is compared to that of algorithms implemented in the popular game theory software suite, GAMBIT. Conclusions are derived.
Towards robust person recognition on handheld devices using face and speaker identification technologies
Authors: Timothy J. Hazen, Eugene Weinstein, Alex Park
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Most face and speaker identification techniques are tested on data collected in controlled environments using high quality cameras and microphones. However, the use of these technologies in variable environments and with the help of the inexpensive sound and image capture hardware present in mobile devices presents an additional challenge. In this study, we investigate the application of existing face and speaker identification techniques to a person identification task on a handheld device. These techniques have proven to perform accurately on tightly constrained experiments where the lighting conditions, visual backgrounds, and audio environments are fixed and specifically adjusted for optimal data quality. When these techniques are applied on mobile devices where the visual and audio conditions are highly variable, degradations in performance can be expected. Under these circumstances, the combination of multiple biometric modalities can improve the robustness and accuracy of the person identification task. In this paper, we present our approach for combining face and speaker identification technologies and experimentally demonstrate a fused multi-biometric system which achieves a 50% reduction in equal error rate over the better of the two independent systems.
A Fast Algorithm for Finding Maximal Empty Rectangles for Dynamic FPGA Placement
Authors: Manish Handa, Ranga Vemuri
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

In this paper, we present a fast algorithm for finding empty area on the FPGA surface with some rectangular tasks placed on it. We use a staircase datastructure to report the empty area in the form of a list of maximal empty rectangles. We model the FPGA surface using an innovative encoding scheme that improves runtime and reduces memory requirement of our algorithm.Worst-case time complexity of our algorithm is O(xy) where x is number of columns,y is number of rows and x.y is the total number of cells on the FPGA.
Manipulation of Java agent bytecode to add roles
Authors: Giacomo Cabri, Luca Ferrari, Letizia Leonardi
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Roles are a powerful paradigm to develop distributed applications based on agents, especially when they are in need of interacting with other entities. An agent-oriented approach requires that roles are conceived as first-class entities, and at the same time that roles are dynamically embedded into agents at runtime. In this paper we propose an approach that addresses such requirements, enabling Java agents to dynamically assume roles. We present a mechanism that modifies the agent bytecode to add the role features.
An empirical study on predicting user acceptance of e-shopping on the Web
Authors: Hung-Pin Shih
Venue: Information and Management (2004)

This study develops an extended model to predict consumer acceptance of electronic-shopping (e-shopping) based on the theory of reasoned action (TRA) and the technology acceptance model (TAM). Our model was tested using data collected from 212 questionnaires and analyzed using multiple regression. The results show that individual attitudes toward e-shopping are strongly and positively correlated with user acceptance. The empirical results confirmed that perceived ease of use of trading on-line (PEOUT) and perceived usefulness (PU) significantly determine individual attitudes toward e-shopping, as well as confirming the significant effect of perceived ease of use of the Web on PEOUT, which in turn affects PU. However, PU was not found to affect user acceptance significantly. Additionally, user satisfaction with the Internet/WWW and perceptions of information, system and service were shown to affect user acceptance significantly. Overall, the proposed model could be used to predict consumer willingness to shop on the Web.
Accurate Estimation of Parasitic Capacitances in Analog Circuits
Authors: Anuradha Agarwal, Hemanth Sampath, Veena Yelamanchili, Ranga Vemuri
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

This paper presents efficient and accurate techniques for modeling parasitic capacitances in analog CMOS circuits. A layout aware synthesis .ow using these parasitic models has been proposed. The fast parasitic estimation process replaces the time consuming steps of layout generation and extraction during synthesis. Results indicate that these models are extremelyfast and accurate.
Estimating the Development Effort of Web Projects in Chile
Authors: Sergio F. Ochoa, M. Cecilia Bastarrica, Germán Parra
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

This article presents a method to fast estimate the development effort of Web-based information systems in Chile. The method, called Chilean Web Application Development Effort Estimation (CWADEE), addresses a necessity to get effort estimations in a short period of 24to 72 hours using limited information. In contrast with other existing methods, CWADEE uses raw historical information about development capability and high granularity information about the system to be developed, in order to carry out such estimations. This method is simple and specially suited for small or medium-size Web-based information systems. CWADEE has been applied to twenty-two projects with very accurate results.
IM [@Work] Adoption of Instant Messaging in a Knowledge Worker Organisation
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

After massive and rapid consumer adoption in recent years, Instant Messaging (IM) applications are beginning to move into the workplace. We investigated the adoption of IM from four months before to three months after it was formally introduced in a mid-sized organization involved in knowledge work. Employees were free, within reasonable limits for private use, to use IM or not, not only with internal contacts (colleagues) but also with external contacts (work relations, friends, family). Based on data obtained before and after introduction from surveys, interviews, and communication traffic logs, we investigated the adoption of IM by individual users and pairs of users.We found a sudden and stable fourfold increase in IM use after introduction, both in terms of users and the number of conversations. IM users primarily report that IM improves the way they reach others and can be reached themselves. Technology self-efficacy, perceived compatibility of IM with work and pressure from social contacts at work to use IM explained best why some employees adopted and used IM more than others.
Adaptive and statistical expectations in a renewable resource market
Authors: Ilaria Foroni, Laura Gardini, J. Barkley Rosser,  Jr.
Venue: Mathematics and Computers in Simulation (2003)

Rational expectations models have increasingly been replaced by models with various forms of learning. This paper studies the global dynamics of a model of renewable resource markets due to Hommes and Rosser [Macroecon. Dyn. 5 (2001) 180] under adaptive and statistical learning systems. The statistical learning system is seen to generate greater complexity of the structures of the basins of attraction, especially at higher discount rates. An element of particular interest is that bifurcations generating lobes in the basins arise from particular focal points, associated with prefocal sets at infinity on the Poincaré equator in the statistical learning model.
An Arithmetic Structure for Test Data Horizontal Compression
Authors: Marie-Lise Flottes, Regis Poirier, Bruno Rouzeyre
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We propose a method for reducing test data volume of integrated circuits or cores in a System-on-Chip. This method is intended to reduce the required number of Automatic Test Equipment (ATE) output channels compared to the number of scan-in input pins in a classical multi-chain implementation (horizontal compression). Compression and decompression are based on arithmetic operations and structures which present a very low area overhead. The proposed compression scheme does not impact the fault coverage achieved by the original test sequence before compression.
Dual metal SiC Schottky rectifiers with low power dissipation
Authors: Fabrizio Roccaforte, Francesco La Via, Salvatore Di Franco, Vito Raineri
Venue: Microelectronic Engineering (2003)

Nickel and titanium are the most commonly used metals for Schottky barrier diodes on silicon carbide (SiC). Ti has a low Schottky barrier height (i.e. ∼0.8 eV on 6H-SiC), whilst Ni has a higher barrier (i.e. ∼1.25 eV). Therefore, the first metal allows to achieve a low forward voltage drop VF but leads to a high leakage current. On the other hand, the second one presents the advantage of a lower reverse leakage current but has also a high value of VF. In this work, dual-metal-planar (DMP) Schottky diodes on silicon carbide are reported. The rectifying barrier was formed by using an array of micrometric Ti and NiaSi (nickel silicide) stripes. This low/high Schottky barrier allowed to combine the advantages of the two metals, i.e. to fabricate diodes with a forward voltage drop close to that of a Ti diode and with a level of reverse current comparable to that of a Ni2Si diode. Under the application point of view, using this kind of barrier can lead to a reduction of the device power dissipation and an increase of the maximum operating temperature.
Automatic association of web directories with word senses
Authors: Celina Santamaría, Julio Gonzalo, Felisa Verdejo
Venue: Computational Linguistics (2003)

We describe an algorithm that combines lexical information (from WordNet 1.7) with Web directories (from the Open Directory Project) to associate word senses with such directories. Such associations can be used as rich characterizations to acquire sense-tagged corpora automatically, cluster topically related senses, and detect sense specializations. The algorithm is evaluated for the 29 nouns (147 senses) used in the Senseval 2 competition, obtaining 148 (word sense, Web directory) associations covering 88% of the domain-specific word senses in the test data with 86% accuracy. The richness of Web directories as sense characterizations is evaluated in a supervised word sense disambiguation task using the Senseval 2 test suite. The results indicate that, when the directory/word sense association is correct, the samples automatically acquired from the Web directories are nearly as valid for training as the original Senseval 2 training instances. The results support our hypothesis that Web directories are a rich source of lexical information: cleaner, more reliable, and more structured than the full Web as a corpus.
Optimal Dynamic Auctions for Revenue Management
Authors: Gustavo Vulcano, Garrett van Ryzin, Costis Maglaras
Venue: Management Science (2002)

We analyze a dynamic auction, in which a seller withC units to sell faces a sequence of buyers separated intoT time periods. Each group of buyers has independent, private values for a single unit. Buyers compete directly against each other within a period, as in a traditional auction, and indirectly with buyers in other periods through the opportunity cost of capacity assessed by the seller. The number of buyers in each period, as well as the individual buyers' valuations, are random. The model is a variation of the traditional single leg, multiperiod revenue management problem, in which consumers act strategically and bid for units of a fixed capacity over time.For this setting, we prove that dynamic variants of the first-price and second-price auction mechanisms maximize the seller's expected revenue. We also show explicitly how to compute and implement these optimal auctions. The optimal auctions are then compared to a traditional revenue management mechanism--in which list prices are used in each period together with capacity controls--and to a simple auction heuristic that consists of allocating units to each period and running a sequence of standard, multiunit auctions with fixed reserve prices in each period. The traditional revenue management mechanism is proven to be optimal in the limiting cases when there is at most one buyer per period, when capacity is not constraining, and asymptotically when the number of buyers and the capacity increases. The optimal auction significantly outperforms both suboptimal mechanisms when there are a moderate number of periods, capacity is constrained, and the total volume of sales is not too large. The benefit also increases when variability in the dispersion in buyers' valuations or in the number of buyers per period increases.
Constraint based web mining
Authors: I. Petrounias, A. Tseng, P. Chountas
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

As the rapid growing number of WWW users, the hidden information becomes ever increasingly valuable. As the consequence of such phenomenon, mining Web data and analysing on-line users' behaviour and their on-line traversal pattern have emerged into a new popular research area. Primarily based on the Web servers' log files, the main objective of traversal pattern mining is to discover the frequent patterns in users' browsing paths and behaviours. This paper presents a complete framework for web mining, allows users to predefine physical constraints when analysing complex traversal patterns in order to improve the efficiency of algorithms and offer flexibility in producing the results.
Progressive transmission of scientific data using biorthogonal wavelet transform
Authors: Hai Tao, Robert J. Moorhead
Venue: Proceedings of the conference on Visualization '94 (1994)

An important issue in scientific visualization systems is the management of data sets. Most data sets in scientific visualization, whether created by measurement or simulation, are usually voluminous. The goal of data management is to reduce the storage space and the access time of these data sets to speed up the visualization process. A new progressive transmission scheme using spline biorthogonal wavelet bases is proposed in this paper. By exploiting the properties of this set of wavelet bases, a fast algorithm involving only additions and subtractions is developed. Due to the multiresolutional nature of the wavelet transform, this scheme is compatible with hierarchical-structured rendering algorithms. The formula for reconstructing the functional values in a continuous volume space is given in a simple polynomial form. Lossless compression is possible, even when using floating-point numbers. This algorithm has been applied to data from a global ocean model. The lossless compression ratio is about 1.5:1. With a compression ratio of 50:1, the reconstructed data is still of good quality. Several other wavelet bases are compared with the spline biorthogonal wavelet bases. Finally, the reconstructed data is visualized using various algorithms and the results are demonstrated.
The Compleat Requirements Analyste
Authors: Ian Graham
Venue: IEEE Software (2003)

Recently a requirements analyst said that he was far too busy to read anything except technical books and articles after all, isn't that how we improve our skill? But requirements are concerned with much more than technical solutions, and building successful products depends on being able to broadly view the world and the people in it. The author explains how this exogenous attitude enhances our requirements skills.
To buy or not to buy: mining airfare data to minimize ticket purchase price
Authors: Oren Etzioni, Rattapoom Tuchinda, Craig A. Knoblock, Alexander Yates
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

As product prices become increasingly available on the World Wide Web, consumers attempt to understand how corporations vary these prices over time. However, corporations change prices based on proprietary algorithms and hidden variables (e.g., the number of unsold seats on a flight). Is it possible to develop data mining techniques that will enable consumers to predict price changes under these conditions?This paper reports on a pilot study in the domain of airline ticket prices where we recorded over 12,000 price observations over a 41 day period. When trained on this data, Hamlet --- our multi-strategy data mining algorithm --- generated a predictive model that saved 341 simulated passengers $198,074 by advising them when to buy and when to postpone ticket purchases. Remarkably, a clairvoyant algorithm with complete knowledge of future prices could save at most $320,572 in our simulation, thus HAMLET's savings were 61.8% of optimal. The algorithm's savings of $198,074 represents an average savings of 23.8% for the 341 passengers for whom savings are possible. Overall, HAMLET saved 4.4% of the ticket price averaged over the entire set of 4,488 simulated passengers. Our pilot study suggests that mining of price data available over the web has the potential to save consumers substantial sums of money per annum.
Incorporating bioinformatics in an algorithms course
Authors: Lawrence D'Antonio
Venue: ACM SIGCSE Bulletin (2003)

In this paper we examine ways in which ideas from the exciting new field of bioinformatics can be used in an algorithms course intended for computer science majors. Bioinformatics studies biological sequences such as DNA or protein that are the building blocks of life. Algorithms that involve searching, matching, or combining such sequences are primary tools in bioinformatics. These algorithms use many key ideas that are important to the computer science major, such as dynamic programming. In addition, bioinformatics makes for an interesting and timely application that can enliven the algorithms course.
The Effect of Customer Participation in Electricity Markets: An Experimental Analysis of Alternative Market Structures
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

An experimental structure is demonstrated that represents end-use customers in electricitymarkets who can substitute part of their usage between day and night. Individuals' demandrelationships are represented by a two-step value function for each period that are disaggregated from observed market demand relationships. Demand varies between day and night and during heat waves. Three alternative demand-side market structures are evaluated: 1) customers pay the same fixed price (FP) in all periods -- the base case, 2) a demand response feature (DRP) is added in periods of supply shortages, wherein buyers receive a prespecified credit for reduced purchases, and 3) a real time pricing (RTP) case where prices are forecast for the upcoming day/night pair, then buyers select their quantity purchasessequentially and are charged the actual market-clearing prices.Initial experiments were conducted with active demand-participants, but with a predetermined typical "hockey-stick" supply structure that was varied randomly, over elevenday-night pairs that included heat wave and supply shortages. The RTP structure resulted inthe greatest market efficiency, despite the more difficult cognitive problem it poses for buyers.Furthermore, a preference poll comparing DRP and RTP was conducted after each trial; andwhile 64% of the participants said they preferred DRP before RTP experiments, 76% selected the RTP structure afterwards, a statistically significant reversal of preferences.
An algorithm for improving optimal placement for river-routing
Authors: Steven T. Healey
Venue: Proceedings of the conference on European design automation (1991)

This paper describes a linear-time, terminal-position assignment algorithm that can be used in conjunction with the optimal-placement-for-river-routing algorithm of [9] to eliminate, or greatly reduce, the routing area between cells within a module. The terminal-position algorithm that is described, may be used to optimise the positions of the interconnections between the interior rows and columns of cells within a module for custom module generation. The method uses river routing within the cells to virtually eliminate routing channels between the cell rows and columns while producing little or no increase in cell area. Use of this pin assignment algorithm for optimising the interconnections between custom-synthesized cells provides a significant improvement in area usage in comparison with using the method of [9] alone.
Reusability, open implementation and Java's dynamic proxies
Authors: Youssef Hassoun, Roger Johnson, Steve Counsell
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

In this paper we investigate the implications of Java's dynamic proxies for supporting open architectures to implement reusable code. Dynamic proxies are interpreted as meta-objects, which define the behavior of other objects and allow the implementation of meta-objects protocols.
Bone-marrow post-transplant care application of data mining organisation
Authors: Isabelle Bichindaritz
Venue: ACM SIGBIO Newsletter (1998)

Our project is to build and evaluate a knowledge-based computerized decision-support system for bonemarrow post-transplant care on the WWW. Its main reasoning methodologies are case-based reasoning and rule-based reasoning. Data mining is used in this project in synergy with machine learning to automatically update the knowledge-base (learn new rules, refine existing rules) and to predict the evolution of a patient's state in an adaptive way.
Passive and Active Identification of a Linear Discrete System with Bounded Disturbance
Authors: A. L. Bunich
Venue: Automation and Remote Control (2003)

Passive and active identifications of a linear system under bounded disturbance are studied. The parameter of the system is estimated by an algorithm with &ldquo;insensitivity zone&rdquo; mismatch transformation.
Embedded Compact Deterministic Test for IP-Protected Cores
Authors: Adam B. Kinsman, Jonathan I. Hewitt, Nicola Nicolici
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Motivated by the dif.culty of implementing pseudo-random built-in self-test (BIST) to non-BIST-ready intellectual property (IP) cores, this paper introduces StreamBIST, a new low cost methodology for embedded deterministic test. By combining low overhead pseudo-random on-chip generation with external control for test pattern expansion, the proposed StreamBIST methodology provides maximum coverage for IP cores' compact and deterministic test sets. In addition to guaranteeing IP-protection, StreamBIST facilitates reduction in volume of test data, testing time, tester channel capacity requirements and it can seamlessly be integrated into the existing tool flows for modular system-on-a-chip (SOC) testing.