ppxscal/embedding_network huggingface dataset:
Psychologically targeted persuasive advertising and product information in e-commerce
Authors: Timo Saari, Niklas Ravaja, Jari Laarni, Marko Turpeinen, Kari Kallinen
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In this paper, we describe a framework for a personalization system to systematically induce desired emotion and attention related states and promote information processing in viewers of online advertising and e-commerce product information. Psychological Customization entails personalization of the way of presenting information (user interface, visual layouts, modalities, structures) per user to create desired transient psychological effects and states, such as emotion, attention, involvement, presence, persuasion and learning. Conceptual foundations and empiric evidence for the approach are presented.
Development Life Cycle Management: A Multiproject Experiment
Authors: Darren Dalcher, Oddur Benediktsson, Helgi Thorbergsson
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

A variety of life cycle models for software systems development are generally available. However, it is generally difficult to compare and contrast the methods and very little literature is available to guide developers and managers in making choices. Moreover in order to make informed decisions developers require access to real data that compares the different models and the results associated with the adoption of each model. This paper describes an experiment in which fifteen software teams developed comparable software products using four different development approaches (V-model, incremental, evolutionary and Extreme Programming). Extensive measurements were taken to assess the time, quality, size, and development efficiency of each product. The paper presents the experimental data collected and the conclusions related to the choice of method, its impact on the project and the quality of the results as well as the general implications to the practice of systems engineering project management.
A comprehensive comparative study on term weighting schemes for text categorization with support vector machines
Authors: Man Lan, Chew-Lim Tan, Hwee-Boon Low, Sam-Yuan Sung
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Term weighting scheme, which has been used to convert the documents as vectors in the term space, is a vital step in automatic text categorization. In this paper, we conducted comprehensive experiments to compare various term weighting schemes with SVM on two widely-used benchmark data sets. We also presented a new term weighting scheme tf-rf to improve the term's discriminating power. The controlled experimental results showed that this newly proposed tf-rf scheme is significantly better than other widely-used term weighting schemes. Compared with schemes related with tf factor alone, the idf factor does not improve or even decrease the term's discriminating power for text categorization.
A compressed memory hierarchy using an indirect index cache
Authors: Erik G. Hallnor, Steven K. Reinhardt
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

The large and growing impact of memory hierarchies on overall system performance compels designers to investigate innovative techniques to improve memory-system efficiency. We propose and analyze a memory hierarchy that increases both the effective capacity of memory structures and the effective bandwidth of interconnects by storing and transmitting data in compressed form.Caches play a key role in hiding memory latencies. However, cache sizes are constrained by die area and cost. A cache's effective size can be increased by storing compressed data, if the storage unused by a compressed block can be allocated to other blocks. We use a modified Indirect Index Cache to allocate variable amounts of storage to different blocks, depending on their compressibility.By coupling our compressed cache design with a similarly compressed main memory, we can easily transfer data between these structures in a compressed state, increasing the effective memory bus bandwidth. This optimization further improves performance when bus bandwidth is critical.Our simulation results, using the SPEC CPU2000 benchmarks, show that our design increases performance by up to 225% on some benchmarks while degrading performance in general by no more than 2%, other than a 12% decrease on a single benchmark. Compressed bus transfers alone account for up to 80% of this improvement, with the remainder coming from increased effective cache capacity. As memory latencies increase, our design becomes even more beneficial.
Downward Refinement in the ALN Description Logic
Authors: Nicola Fanizzi, Stefano Ferilli, Luigi Iannone, Ignazio Palmisano, Giovanni Semeraro
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

We focus on the problem of specialization in a Description Logics (DL) representation, specifically the ALN language. Standard approaches to learning in these representations are based on bottom-up algorithms that employ the lcs operator, which, in turn, produces overly specific (overfitting) and still redundant concept definitions. In the dual (top-down) perspective, this issue can be tackled by means of an ILP downward operator. Indeed, using a mapping from DL descriptions onto a clausal representation, we define a specialization operator computing maximal specializations of a concept description on the grounds of the available positive and negative examples.
Genetic algorithms with applications in wireless communications
Authors: Y. Hong, Z. Dong
Venue: International Journal of Systems Science (2004)

Genetic algorithms (GAs) are known to locate the global optimal solution provided sufficient population and/or generation is used. Practically, a near-optimal satisfactory result can be found by Gas with a limited number of generations. In wireless communications, the exhaustive searching approach is widely applied to many techniques, such as maximum likelihood decoding (MLD) and distance spectrum (DS) techniques. The complexity of the exhaustive searching approach in the MLD or the DS technique is exponential in the number of transmit antennas and the size of the signal constellation for the multiple-input multiple-output (MIMO) communication systems. If a large number of antennas and a large size of signal constellations, e.g. PSK and QAM, are employed in the MIMO systems, the exhaustive searching approach becomes impractical and time consuming. In this paper, the GAs are applied to the MLD and DS techniques to provide a near-optimal performance with a reduced computational complexity for the MIMO systems. Two different GA-based efficient searching approaches are proposed for the MLD and DS techniques, respectively. The first proposed approach is based on a GA with sharing function method, which is employed to locate the multiple solutions of the distance spectrum for the Space-time Trellis Coded Orthogonal Frequency Division Multiplexing (STTC-OFDM) systems. The second approach is the GA-based MLD that attempts to find the closest point to the transmitted signal. The proposed approach can return a satisfactory result with a good initial signal vector provided to the GA. Through simulation results, it is shown that the proposed GA-based efficient searching approaches can achieve near-optimal performance, but with a lower searching complexity comparing with the original MLD and DS techniques for the MIMO systems.
Partial Clustering: Maintaining Connectivity in a Low Duty-Cycled Dense Wireless Sensor Network
Authors: Chih-fan Hsin, Mingyan Liu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the sensor network is surveillance and monitoring, where upon observation of certain event of interest, a sensor node generates a message and forwards it to a gateway located somewhere in or near the network. This forwarding relies on routes constructed using sensors whose radios are on/active. In order for such messages to reach the gateway with minimal delay, any sensor in the network should ideally have a route to the gateway consisting of active sensors at all times. Prior approaches to similar problems include clustering, virtual backbone, and connected dominating sets. Low energy consumption and good connectivity are potentially conflicting objectives. Our principal goal is to find an approach that results in the lowest possible duty cycle, and that provides better trade-off between the two objectives. In this paper we introduce the concept of partial clustering, which may be viewed as a generalized method of clustering. We compare the theoretical performance of different instances of partial clustering to that of standard clustering, and show that partial clustering can achieve lower duty cycle and provide greater flexibility in the trade-off between energy efficiency and connectivity. We then present a distributed algorithm based on the partial clustering method. Simulation results are provided to evaluate their effectiveness and energy efficiency.
Exploring Parallel Programming Knowledge in the Novice
Authors: Ryan Eccles, Blair Nonneck, Deborah A. Stacey
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Parallel programming is a difficult task for programmers. Simplifying the learning of this job first requires that we understand what needs to be taught. Evaluating the novice and expert parallel programmer for their knowledge framework can aid in the transition. This exploratory study examines novicesý assumptions about the difficulty of parallel programming. Novices in this pilot study were capable of understanding race conditions and mutual exclusion but had trouble determining the difficulty of scalability and division of tasks.
A system for supporting collaborative learning with networked sensing boards
Authors: Masanori Sugimoto, Fusako Kusunoki, Shigenori Inagaki, Kuniyoshi Takatoki, Atsushi Yoshikawa
Venue: Systems and Computers in Japan (2004)

The authors have used sensing boards based on RFID technology to construct a face-to-face group learning support system integrating the physical world and the virtual world. The system is shown to be useful through performance in that a learner without sufficient skill in using a computer can easily participate in learning, and knowledge acquired through textbooks and the like can be tested in the physical world. On the other hand, some problems have been pointed out: the utterances depend more strongly on the leader, and learning support with a higher degree of realism is desired. Consequently, in the system proposed in this paper, multiple sensing boards are placed at different sites so that the learner groups can communicate face-to-face. The sensing boards are connected through a network so that the operations on the board can influence each other. The learners in the group gather around the board and try to solve the problem face-to-face. They also interact with the learners in another group through a chat system. The learners in a primary school classroom used the system to study city design and environmental problems, and the effectiveness of the proposed system was demonstrated. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 39&ndash;50, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10502
Time, space, and energy in reversible computing
Authors: Paul Vitányi
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

We survey some results of a quarter century of work on general reversible computation about energy-, time- and space requirements.
A Predictive, Decentralized Load Balancing Approach
Authors: Dazhang Gu, Lin Yang, Lonnie R. Welch
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

The growth of load balancing system raises the issue of scalability, and decentralized load balancing architecture has been proposed to address this issue. In this paper, we investigate how a load balancing architecture can be built on decentralized policies based on CORBA and enhanced by predictive algorithm. The L_2 E predictive filtering model was used to supply workstations with robust cluster load information, which allows them to make more accurate independent allocation decisions. Experimental results showed that our decentralized load balancing approach was able to suppress thrashing and oscillations compared to other load monitoring and prediction techniques, and it was able to achieve a highly balanced system than Sun Grid Engine.
Towards systolizing compilation
Authors: Christian Lengauer, Michael Barnett, Duncan G. Hudson
Venue: Distributed Computing (1991)

A scheme for the compilation of imperative or functional programs into systolic programs is demonstrated on matrix composition/decomposition and Gauss-Jordan elimination. Using this scheme, programs for the processor network Warp and for several transputer networks have been generated.
Predicting node availability in peer-to-peer networks
Authors: James W. Mickens, Brian D. Noble
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Unlike the well-administered servers in traditional distributed systems, machines in peer-to-peer networks have widely varying levels of availability. Accurate modeling of node uptime is crucial for predicting per-machine resource burdens and selecting appropriate data replication strategies. In this research project, we improve upon the accuracy of previous peer-to-peer availability models, which are often too conservative to dynamically predict system availability at a fine-grained level. We test our predictors on availability traces from the PlanetLab distributed test bed and the Microsoft corporate network. Each trace has a distinct predictability profile, and we explain these differences by examining the fundamental uptime classes contained in each trace. We also show how availability-guided replica placement reduces the amount of object copying in a distributed data store.
A novel two-dimensional tactile slip display: design, kinematics and perceptual experiments
Authors: Robert J. Webster,  III, Todd E. Murphy, Lawton N. Verner, Allison M. Okamura
Venue: ACM Transactions on Applied Perception (TAP) (2005)

A novel two-degree-of-freedom tactile display reproduces the sensations of sliding contact and incipient slip through the rotation of a ball positioned under the user's fingertip. A pair of motor-driven wheels actuates the ball via contact friction. Mechanical performance requirements are used to define the dimensions and construction method of the device. Kinematic analysis shows that the drive wheel angles and their contact locations with the ball must be carefully selected in order to accurately control the axis of rotation and speed of the ball. However, psychophysical experiments indicate that some kinematic error is tolerable; errors of up to 20&deg; in slip angle and 30&percnt; of a nominal velocity may be applied without detection from an average user. The lightweight, modular tactile display was attached to a multi-degree-of-freedom kinesthetic interface and used to display virtual environments with slip. Experimental results demonstrate that users complete a virtual paper manipulation task with lower applied forces using combined slip and force feedback in comparison with conventional force feedback alone.
Effects of Computation Speed on the Stability of a Self-Controlling Process.
Authors: Nilgun Fescioglu-Unver, Mieczyslaw M. Kokar
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

In this paper we consider the impact of the speed of the processor on the stability of the adaptation process. The problem is investigated on a case study that involves a real-time system for monitoring illuminations of multiple emitters by one receiver mounted on a moving platform. This is a self-controlling system whose goal is to schedule the receiver so that the uncertainty about the times of illuminations of radars in the direction of the platform is minimized. The system has several controllers and a scheduler which are using the same computer as the computation resource. This paper demonstrates the effects of computation time on a real time self-controlling system and shows the changes in stability of the system under high computation loads.
Intelligent access to text: integrating information extraction technology into text browsers
Authors: Robert Gaizauskas, Patrick Herring, Michael Oakes, Michelline Beaulieu, Peter Willett, Helene Fowkes, Anna Jonsson
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper we show how two standard outputs from information extraction (IE) systems -- named entity annotations and scenario templates -- can be used to enhance access to text collections via a standard text browser. We describe how this information is used in a prototype system designed to support information workers' access to a pharmaceutical news archive as part of their "industry watch" function. We also report results of a preliminary, qualitative user evaluation of the system, which while broadly positive indicates further work needs to be done on the interface to make users aware of the increased potential of IE-enhanced text browsers.
Low traffic overlay networks with large routing tables
Authors: Chunqiang Tang, Melissa J. Buco, Rong N. Chang, Sandhya Dwarkadas, Laura Z. Luan, Edward So, Christopher Ward
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

The routing tables of Distributed Hash Tables (DHTs) can vary from size O(1) to O(n). Currently, what is lacking is an analytic framework to suggest the optimal routing table size for a given workload. This paper (1) compares DHTs with O(1) to O(n) routing tables and identifies some good design points; and (2) proposes protocols to realize the potential of those good design points.We use total traffic as the uniform metric to compare heterogeneous DHTs and emphasize the balance between maintenance cost and lookup cost. Assuming a node on average processes 1,000 or more lookups during its entire lifetime, our analysis shows that large routing tables actually lead to both low traffic and low lookup hops. These good design points translate into one-hop routing for systems of medium size and two-hop routing for large systems.Existing one-hop or two-hop protocols are based on a hierarchy. We instead demonstrate that it is possible to achieve completely decentralized one-hop or two-hop routing, i.e., without giving up being peer-to-peer. We propose 1h-Calot for one-hop routing and 2h-Calot for two-hop routing. Assuming a moderate lookup rate, compared with DHTs that use O(log n) routing tables, 1h-Calot and 2h-Calot save traffic by up to 70% while resolving lookups in one or two hops as opposed to O(log n) hops.
Improving quantum circuit dependability with reconfigurable quantum gate arrays
Authors: Mihai Udrescu, Lucian Prodan, Mircea Vlǎduţiu
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

The need for error detection and correction techniques is vital in quantum computation, due to the omnipresent nature of quantum errors. No realistic prospect of an operational quantum computational device may be warranted without such mechanisms. Therefore, the fact that error detecting and correcting techniques have been developed has enhanced the feasibility of a potential quantum computer [15] [18]. This paper presents a methodology for improving the fault tolerance of quantum circuits by using the so-called reconfigurable Quantum Gate Arrays (rQGAs). Our solution reduces the problem of stabilizer coding safe recovery to preserving a given quantum configuration state. As shown in this paper's practical example, the configuration register to be protected has a reduced number of qubits, and the overall dependability attribute [2]-- reliability measured by the accuracy threshold [15]-- is drastically improved
Probabilistic model checking in practice: case studies with PRISM
Authors: Marta Kwiatkowska, Gethin Norman, David Parker
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

In this paper, we describe some practical applications of probabilistic model checking, a technique for the formal analysis of systems which exhibit stochastic behaviour. We give an overview of a selection of case studies carried out using the probabilistic model checking tool PRISM, demonstrating the wide range of application domains to which these methods are applicable. We also illustrate several benefits of using formal verification techniques to analyse probabilistic systems, including: (i) that they allow a wide range of numerical properties to be computed accurately; and (ii) that they perform a complete and exhaustive analysis enabling, for example, a study of best- and worst-case scenarios.
Toward an automatic parallelization of sparse matrix computations
Authors: Roxane Adle, Marc Aiguier, Franck Delaplace
Venue: Journal of Parallel and Distributed Computing (2005)

In this paper, we propose a generic method of automatic parallelization for sparse matrix computation. This method is based on both a refinement of the data-dependence test proposed by Bernstein and an inspector-executor scheme which is specialized to each input program of the compiler. This analysis mixes compilation process and run-time process. The sparsity of underlying data-structure determines a specific parallelism which increases the degree of parallelism of an algorithm. Such a source of parallelism had already been applied to many numerical algorithms such as the usual Cholesky factorization or LU-decomposition algorithms considered as the gold standards of parallelization based on sparsity. The standard automatic parallelization method cannot tackle such source of parallelism because it is based on the value of cells arrays and not merely on the memory addressing function. Addressing the automatization of this parallelism requires to develop a mixed compile-time and runtime approach integrated in a inspector-executor process. The compilation step provides a dedicated inspector devoted to the analyzed program. The inspector computes the dependence graph at runtime which allows a dynamic parallelization of the execution. As expressed just before, the generic scheme developed in this paper follows the design principles which have been applied, but at each time in an ad hoc way, to many sparse parallelization of numerical algorithms such as Cholesky algorithm. As far as we know, no general formal framework has been proposed to automate such a method of sparse parallelization. In this paper, we propose a generic framework of sparse parallelization (i.e. numerical program independent) which can be applied to any numerical programs satisfying the usual syntactic constraints of parallelization.
Fluent-based web animation: exploring goals for requirements validation
Authors: Robert Chatley, Sebastian Uchitel, Jeff Kramer, Jeff Magee
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We present a tool that provides effective graphical animations as a means of validating both goals and software designs. Goals are objectives that a system is expected to meet. They are decomposed until they can be represented as fluents. Animations are specified in terms of fluents and driven by behaviour models.