ppxscal/embedding_network huggingface dataset:
Collaborative filtering with decoupled models for preferences and ratings
Authors: Rong Jin, Luo Si, ChengXiang Zhai, Jamie Callan
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In this paper, we describe a new model for collaborative filtering. The motivation of this work comes from the fact that two users with very similar preferences on items may have very different rating schemes. For example, one user may tend to assign a higher rating to all items than another user. Unlike previous models of collaborative filtering, which determine the similarity between two users only based on their rating performance, our model treats the user's preferences on items separately from the user's rating scheme. More specifically, for each user, we build two separate models: a preference model capturing which items are favored by the user and a rating model capturing how the user would rate an item given the preference information. The similarity of two users is computed based on the underlying preference model, instead of the surface ratings. We compare the new model with several representative previous approaches on two data sets. Experiment results show that the new model outperforms all the previous approaches that are tested consistently on both data sets.
Speculation Agents for Dynamic Multi-Period Continuous Double Auctions in B2B Exchanges
Authors: Li Li, Stephen F. Smith
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Business-to-business (B2B) exchanges provide opportunities for companies to streamline their supply chains in dynamic business situations, but they also create new management challenges. Managers are faced with more frequent buying and selling decisions, more available information, and even new problems such as speculation. Due to these new challenges, trading support systems will play an important role in helping companies to achieve maximum pro.ts in B2B exchanges. In this paper, we focus on providing support for two core capabilities, bidding and speculating, in the context of B2B exchanges with Continuous Double Auctions (CDA). Our work extends previous research on biding agents to more dynamic and realistic B2B exchange situations where both demands and supplies change from period to period. Changes in demand and supply cause price fluctuations and motivate companies to speculate on inventory. The action of speculation is one fundamental aspect of exchanges in general, and is the main way in which B2B exchanges can hedge against costly shortages. We develop a multi-agent system in which a speculation agent makes speculation decisions for a given buyer or seller and interacts with a set of bidding agents. The related algorithms are discussed in detail. We also propose a theoretical model for the economic equilibrium in this dynamic situation. Under various market conditions, the experiments show that our system significantly increases the overall profit of the entire market.
Precongruence formats for decorated trace semantics
Authors: Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
Venue: ACM Transactions on Computational Logic (TOCL) (2004)

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labeled transition systems, and formats of transition system specifications using Plotkin's structural approach. For several preorders in the linear time---branching time spectrum a format is given, as general as possible, such that this preorder is a precongruence for all operators specifiable in that format. The formats are derived using the modal characterizations of the corresponding preorders.
Techniques for transparent program specialization in dynamic optimizers
Authors: S.Subramanya Sastry
Venue:  (2003)

Program specialization speeds up program execution by eliminating computation that depends on semi-invariant values: known program inputs, or repetitive data encountered during program execution. All existing techniques either rely on the programmer or expensive offline program analysis to determine the semi-invariant values, and to determine what code to specialize. Consequently, there is no existing program specialization technique that can be performed at runtime without user intervention (transparently). This dissertation proposes and investigates techniques for enabling transparent runtime specialization of programs within a dynamic optimizer. The primary contribution of this dissertation is in the form of techniques that address the first two parts above: determining what values are semi-invariant, and determining what code to specialize. The specializer collects a store profile to identify frequently modified portions of the program's data structures. Based on this, the specializer predicts which parts of the program's data structures might be invariant for the rest of the program's execution. This store-profile based invariance detection technique, in addition to being transparent, is more powerful than existing annotation-based approaches. The correctness of this optimistic, but speculative invariance assumptions is ensured by runtime guards that detect modifications of the specialized memory locations. Due to infrastructural limitations, these runtime guarding techniques have not been implemented and studied in this dissertation. The collected runtime profiles are used by a scope-building algorithm that identifies the code regions that can be profitably specialized. The identified code regions are specialized using a specializer based on the Sparse Conditional Constant Propagation algorithm that has been extended to eliminate invariant memory accesses as well as unroll and specialize loops. This dissertation implements a specializer that specializes Java programs available in bytecode form. Experimental evaluation using a profile-driven recompilation process shows that transparent runtime specialization is feasible and can be implemented within dynamic optimizers. The runtime costs are not prohibitive and the specializer can provide good speedups (for example, 1.9x on a Scheme interpreter). With a better engineered implementation of the specializer and with an improved specialization model, the speedups are expected to be higher.
OfflineIMAP
Authors: John Goerzen
Venue: Linux Journal (2004)

Get the reliability of server-side mail with the speed of localfolders.
Frequency domain estimation and parameter decoupling using modulating function techniques
Authors: Allan E. Pearson
Venue:  (2003)

An extended adaptive weighted least squares (EAWLS) algorithm using a modulating function technique (MFT) is developed for the identification of a continuous-time differential system with complex parameters. Using the EAWLS and the adaptive weighted least squares (AWLS/MFT) by Pearson et al., high resolution frequency estimators are devised for complex-valued and real sinusoids, respectively. A Modified EAWLS (MEAWLS) algorithm is also devised for the frequency estimation of pure complex sinusoids which gives better performance than the EAWLS. For the real sinusoidal case, resolution bands are compared for the AWLS and LS estimates. The results show that the AWLS estimator is a high resolution frequency estimator and has much wider resolution bands with respect to SNR, sample frequency, observation time interval, and the highest modulating function frequency index M. Also developed is a modified parameter decoupling algorithm for transfer function identification using AWLS/MFT. The use of a high frequency sinusoid input just above the system bandwidth is suggested in order to decouple the denominator parameters during transient operation. This makes it possible to use lower harmonic Fourier series coefficients and results in better performance than the low frequency input signal. In the second stage for the decoupling of numerator parameters, a one-step estimation is suggested using a nonharmonic input signal which improves the computational efficiency. Lastly, the identification of a modal system with initial conditions is studied and compared with an alternative approach.
A BDD-Based Algorithm for Analysis of Multistate Systems with Multistate Components
Authors: Xinyu Zang, Dazhi Wang, Hairong Sun, Kishor S. Trivedi
Venue: IEEE Transactions on Computers (2003)

Abstract--In this paper, a new algorithm based on Binary Decision Diagram (BDD) for the analysis of a system with multistate components is proposed. Each state of a multistate component is represented by a Boolean variable, and a multistate system is represented by a series of multistate fault trees. A Boolean algebra with restrictions on variables is used to address the dependence among these Boolean variables that collectively represent the same component and a new BDD operation is proposed to realize this Boolean algebra. Due to the nature of the BDD, the sum of disjoint products (SDP) can be implicitly represented, which avoids huge storage and high computational complexity for large multistate systems. Some applications are given to illustrate the use of our new algorithm.
Sun ONE Messaging Server: Practices and Techniques for Enterprise Customers
Authors: Dave Pickens
Venue:  (2003)

Selecting the best architecture Adding functionality Monitoring the Sun ONE Messaging Server Availability considerations and issuesAs messaging or email increases in volume and size, the need for a scalable enterprise messaging system becomes more apparent to many organizations. The Sun™ ONE Messaging Server product fills this requirement and more. However, as with any system, the planning, installation, and routine maintenance tasks have a significant impact on throughput and availability.This book details best practices for architecting, deploying, and integrating the Sun ONE Messaging Server 5.2 product. It covers topics ranging from the basics of planning the system, to a sample installation, and on to monitoring and tuning the system to ensure that it is operational.
Accurate methods for the statistics of surprise and coincidence
Authors: Ted Dunning
Venue: Computational Linguistics (1993)

Much work has been done on the statistical analysis of text. In some cases reported in the literature, inappropriate statistical methods have been used, and statistical significance of results have not been addressed. In particular, asymptotic normality assumptions have often been used unjustifiably, leading to flawed results.This assumption of normal distribution limits the ability to analyze rare events. Unfortunately rare events do make up a large fraction of real text.However, more applicable methods based on likelihood ratio tests are available that yield good results with relatively small samples. These tests can be implemented efficiently, and have been used for the detection of composite terms and for the determination of domain-specific terms. In some cases, these measures perform much better than the methods previously used. In cases where traditional contingency table methods work well, the likelihood ratio tests described here are nearly identical.This paper describes the basis of a measure based on likelihood ratios that can be applied to the analysis of text.
Hildegard Westerkamp's Kits Beach Soundwalk: shifting perspectives in real world music
Authors: David Kolber
Venue: Organised Sound (2002)

Hildegard Westerkamp's Kits Beach Soundwalk challenges us as listeners to re-evaluate our acoustic soundscape. Juxtaposing the sounds of barnacles with the noise of the city, Westerkamp reveals an unbalanced world in which individual voices are silenced. Kits Beach Soundwalk allows Westerkamp to help rectify that imbalance. It provides her with the opportunity to create a place in which a listener can take pleasure in simply being. She reveals the metaphors, the hidden entrances, within sounds that take us into other spaces. A listener travels with Westerkamp into worlds of tiny sounds and tiny voices, dreams, and places of fantasy and the imagination. She challenges us as listeners to re-establish our place within the world around us. By designing the piece to reach the audience on a number of levels - intellectual, physiological, metaphorical - Westerkamp effectively promotes the changing of listening habits; the distancing of individuals from oppressive sonic environments; and the regaining of an individual's inner voice.
Good quality point sets and error estimates for moving least square approximations
Authors: Carlos Zuppa
Venue: Applied Numerical Mathematics (2003)

The goal of this paper is to study the relation of the condition number of the star of nodes in normal equations for error estimates of Moving Least Square approximations in Sobolev spaces. The condition numbers are closely related to the good quality of the set of nodes and the approximating power of the method.
Analysis of Profitability of Inter-system Handovers between IEEE 802.11b and UMTS
Authors: Pawel Matusz, Przemyslaw Machan, Jozef Wozniak
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Internet access using relatively fast Wireless LocalArea Networks (WLANs) is often perceived as a localcomplement to slower, but widely available access usingcellular networks, e.g. GSM/GPRS or UMTS. To benefitfrom the advantages offered by both radio accessnetworks, a mobile user should be able to seamlesslychange the access network while moving, experiencingtemporary network congestions or whenever switching tothe other network seems profitable.The goal of this paper is to analyse the profitability ofperforming vertical handovers between IEEE 802.11band UMTS in case of using Mobile IPv4. Such researchhas not yet been done in detail before. The profitability ofperforming vertical handovers has been analyseddepending on the available UMTS channel bandwidth,channel quality, number of WLAN users and generatedtraffic type. Several detailed simulations have beencarried out using NS2 and results are presented. Basedon these results, a general criterion for profitableswitching between UMTS and IEEE 802.11b is proposed,analysed and verified by simulations.
Specification of timing constraints for controller synthesis
Authors: Rumi Zahir, Wolfgang Fichtner
Venue: Proceedings of the conference on European design automation (1991)

For controller synthesis to be successful, detailed knowledge of the timing constraints of the system under synthesis is essential. This paper presents a method for extracting timing constraints from a behavioral description, architectural restrictions, component timing requirements and protocol specifications. The timing constraints are combined in a timing constraint graph that can be solved in polynomial time using algorithms known from symbolic layout compaction.
Extraction of Schematic Array Models for Memory Circuits
Authors: Soumitra Bose, Amit Nandi
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The modeling and simulation of memory circuits remains an outstanding problem when accuracy with respect to the actual schematic implementation is desired. Functionally equivalent RTL models often cannot be used for designs with embedded memory blocks, because schematic models for the surr ounding logic may be required for fault modeling accuracy. Existing methods derive a latch model that essentially represents each memory location as a latch primitive, and have a large number of gates. We present new algorithms that model such circuits as decoded arrays that access entire rows of cells for individual read and write operations. Decoded array models allow fault modeling accuracy for the surrounding logic, including the memory address decoder. Experimental data show improvements of an order of magnitude for both logic and fault simulations, when compared to the equivalent latch model.
Control parameters for musical instruments: a foundation for new mappings of gesture to sound
Authors: Daniel J. Levitin, Stephen McAdams, Robert L. Adams
Venue: Organised Sound (2002)

In this paper we describe a new way of thinking about musical tones, specifically in the context of how features of a sound might be controlled by computer musicians, and how those features might be most appropriately mapped onto musical controllers. Our approach is the consequence of one bias that we should reveal at the outset: we believe that electronically controlled (and this includes computer-controlled)musical instruments need to be emancipated from the keyboard metaphor; although piano-like keyboards are convenient and familiar, they limit the musician's expressiveness (Mathews 1991, Vertegaal and Eaglestone 1996, Paradiso 1997, Levitin and Adams 1998). This is especially true in the domain of computer music,in which timbres can be created that go far beyond the physical constraints of traditional acoustic instruments.
The k-feature set problem is W[2]-complete
Authors: Carlos Cotta, Pablo Moscato
Venue: Journal of Computer and System Sciences (2003)

We prove the W[2]-completeness of the feature subset selection problem when the cardinality of the subset is the parameter. Aside from the many applications the problem has in data mining literature, the problem is highly relevant in Computational Biology since it arises in differential gene expression analysis using microarray technologies. It is also related to genetic-based prognosis and regulatory interaction discovery using DNA chip technologies.
Integration of control system design and implementation over the internet using the Jini technology
Authors: S. H. Yang, X. Chen, L. Yang
Venue: Software&mdash;Practice Experience (2003)

This paper describes an approach for the integration of control system software design, testing, and implementation over the Internet using the Java and Jini technologies. Process models and control systems are remotely designed and tested in a virtual laboratory (also called the virtual world), and then implemented in a physical plant (also called the real world) through an integrated environment. Although control system and process model designers and real-site operators are geographically dispersed they work together as a team over the Internet to provide the maintenance support to all the authorized industrial processes. As a consequence, time and money can both be saved because there is no need for an expert of the control software supplier to travel to the site of the real plant and conduct on-site implementation. A generic control system life cycle model is presented first in this paper. Then three enabling technologies including Java, Jini and WWW are briefly introduced. Taking advantage of the Java, Jini and WWW technologies, an Internet-based general infrastructure is proposed to remotely facilitate process modelling, control system design, simulation, validation and on-site implementation. An integrated environment is established to implement the infrastructure. A water tank with a liquid level control system is refereed as a case study to illustrate how the prototype of the integrated environment works over the Internet. Further work and the conclusions are given at the end.
Event-driven molecular dynamics in parallel
Authors: S. Miller, S. Luding
Venue: Journal of Computational Physics (2004)

Although event-driven algorithms have been shown to be far more efficient than time-driven methods such as conventional molecular dynamics, they have not become as popular. The main obstacle seems to be the difficulty of parallelizing event-driven molecular dynamics. Several basic ideas have been discussed in recent years, but to our knowledge no complete implementation has been published yet. In this paper we present a parallel event-driven algorithm including dynamic load-balancing, which can be easily implemented on any computer architecture. To simplify matters our explanations refer to a basic multi-particle system of hard spheres, but can be extended easily to a wide variety of possible models.
E-Business experiences with online auctions
Authors: Bernhard Rumpe
Venue: Managing e-commerce and mobile computing technologies (2003)

Online auctions are among the most influential e-business application. Their impact on trading for businesses, as well as consumers, is both remarkable and inevitable. There have been considerable efforts in setting up market places, but, with respects to market volume, online trading is still in its early stages. This chapter discusses the benefits of the concept of Internet marketplaces, with the highest impact on pricing strategies, namely, the conduction of online business auctions. We discuss their benefits, problems and possible solutions. In addition, we sketch actions for suppliers to achieve a better strategic position in the upcoming Internet market places.
Accurate numerical solution of coupled time dependent parabolic initial value problems
Authors: L. Jódar, J. I. Castaño, J. A. Sánchez, G. Rubio
Venue: Applied Numerical Mathematics (2003)

This paper deals with the construction of numerical solutions with a prefixed accuracy of initial value problem for coupled time dependent initial value problems using Fourier transform, numerical integration and numerical resolution of differential equations. An algorithm is included.
Electrical resistivity of thin electroless Ag-W films for metallization
Authors: E. E. Glickman, V. Bogush, A. Inberg, Y. Shacham-Diamand, N. Croitoru
Venue: Microelectronic Engineering (2003)

It is shown that optimization of the electroless deposition and the use of vacuum annealing yield dramatic decrease in the resistivity and its scatter in 100- and 50-nm silver-tungsten (Ag-W) films. Physical processes, which control the resistivity drop during low-temperature annealing and the residue resistivity in the annealed films are discussed.
Structure and analysis of IS decision-making processes
Authors: Albert Boonstra
Venue: European Journal of Information Systems (2003)

Decisions to invest in information systems (IS) are made by many organisations on a very regular basis. Such decisions can vary from quickly identifying the problem, screening options and choosing a solution in a very straightforward way, to very extensive and repeated search, screen, design and negotiation activities that can take many years. There has been little explicit research into the process by which managers and organisations decide to develop IS applications. This research addresses this by analysing 20 IS decision-making processes, using a phase-based as well as an attribute-based approach. Mintzberg's typology is used to characterise seven types of IS decisions from a phase-based or process-based perspective. For the attribute approach, the decisions have been analysed on the basis of subjective/objective and offensive/ defensive contrasts and placed in one of the four following categories: innovative, rational, necessary or political. The paper concludes by identifying five factors that result in major differences in IS decision-making processes. These issues are: (1) whether there is scope to design a solution; (2) whether distinct alternatives have to be searched for; (3) the degree of urgency and necessity from the perspective of the decision-makers; (4) whether the decision can be subdivided in order to follow a gradual process path (planned vs incremental) and (5) the number and power of stakeholders involved in the process and the extent that their interests vary and contrast. The paper suggests that managers deciding on IS applications should be aware of these factors in order to design a process that fits best with the specific circumstances: no single process should be considered universally applicable. This conclusion is in contrast with many decision-making models rooted in the MIS-field, which suggest to use prescriptive and rational approaches to organise IS decision-making processes.