ppxscal/embedding_network huggingface dataset:
Pricing of partially compatible products
Authors: David Kempe, Adam Meyerson, Nainesh Solanki, Ramnath Chellappa
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

In this paper, we examine a duopolistic market where the two firms compete to sell a system of components. Components are digital (firms haveunlimited supply at no marginal cost), and customers are homogeneous in their component preferences. Each customer will assemble a utility maximizing system by purchasing each necessary component from one of the two firms. While components from the same firm are always compatible, pairwise compatibility of components from rival firms may vary; in addition to utility due to the quality of the system purchased, customers have negative utility for purchasing incompatible parts. We investigate algorithms and hardness results for profit-maximizing decisions of the firms with regards to their price-setting, component value-enhancing and compatibility-enabling strategies. The users' behavior can be modeled as a minimum cut computation, and the company's strategies require addressing novel and interesting questions about graph cuts and flows. We develop a polynomial-time algorithm for finding profit-maximizing prices if the qualities and compatibilities are fixed. On the other hand, we show that finding profit-maximizing quality improvements is equivalent to the Maximum Size Bounded Capacity Cut problem, and thus NP-complete. Finally, for the problem of improving compatibilities to maximize the price, we give polynomial approximation hardness results even in very restricted cases, but show that if all components have uniform prices, and quality differences are small, then an approximation can be found in polynomial time.
Mini-Track Introduction: Collaboration Issues in Cross-Organizational and Cross-Border IS/IT
Authors: Nicholas C. Jr. Romano, James B. Pick, Narcyz Roztocki
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Current investments in IS/IT are increasingly being deployed across multiple countries and world regions. In this connected global economy, crosssystem integration and collaboration technologies play essential roles and often determine the success or failure of IS/IT systems and projects. The intensive investigation for two decades of different aspects of IS/IT collaboration sets the context of this minitrack. The theme is the integration of people, systems, processes and infrastructure across organizations, borders, nations and world regions to enable productive teamwork toward accomplishing mutual goals. Until now, studies have been almost entirely focused on a single country or region.
Controlling Access to Preserve QoS in a Self-Aware Network
Authors: Erol Gelenbe, Georgia Sakellari, Maurizio D'Arienzo
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Multimedia traffic and real-time applications created a need for network Quality of Service (QoS). This demand led to the development of autonomous networks that use adaptive packet routing in order to provide the best possible QoS. Admission Control (AC) is a mechanism which takes those networks a step further in guaranteeing packet delivery even under strict QoS constraints. This paper describes a measurement-based admission control algorithm which decides whether a new connection can be served without affecting the existing users of the network, based on the multiple QoS metrics that the users of a Self-Aware Network have specified. Our algorithm promises QoS throughout the lifetime of all accepted connections in the network. The impact that the new call will have, on the QoS of both the new and the existing users, is estimated by sending probe packets and monitoring the networks by exploiting its selfawareness. The decision of whether to accept a new call is made using a novel algebra of QoS metrics, inspired by Warshall's algorithm, which looks for a path with acceptable QoS values that can accommodate the new flow. In this paper we describe the underlying mathematical principles and present experimental results obtained by evaluating the method in a large laboratory test-bed operating the Self-Aware Cognitive Packet Network (CPN) protocol.
Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer
Authors: Paolo Bertasi, Mauro Bianco, Andrea Pietracaprina, Geppino Pucci
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

We address the problem of developing a suite of microbenchmarking experiments aimed at providing the basic functionalities of a measurement tool for a P2P-based globally distributed computing platform, usually referred to as Overlay Computer. We argue that such a measuring system should take into account the communication patterns generated by the applications in order to provide useful performance insights.
Pyramidal image compression using anisotropic and error-corrected interpolation
Authors: Yu-Li You
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

In pyramidal coding, the key to significant bit rate reduction is the reduction of interpolation error. This is usually accomplished through well-designed nonlinear interpolation filters, such as median and morphological filters. These filters are usually isotropic, hence cannot account for the anisotropic nature of the images. In addition, these filters base their interpolation solely on the image at the immediate higher level (lower resolution), hence a smaller interpolation error can be expected if the already-transmitted error signals are used for the interpolation of the remaining pixels. In view of these two problems, this paper proposes to decrease the interpolation error through the introduction of anisotropic techniques and the use of the transmitted error signals to improve the interpolation of the remaining pixels. This error is further reduced through the usage of anisotropic diffusion as the low-pass filter. Finally, an anisotropic DPCM coder is presented to code the image at the top of the pyramid.
Autonomous end to end QoS monitoring
Authors: D. Raz, R. Wolff
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

Verifying that each flow in the network satisfies its QoS requirements is one of the biggest scalability challenges in the current DiffServ architecture. This task is usually performed by a centralized allocation entity that monitors the flows' QoS parameters. Efficient detection of problematic flows is even more challenging when considering aggregated information such as the end to end delay suffered by packets belonging to a specific flow. Known oblivious and reactive monitoring techniques do not scale well when the number of flows and the length of their paths increase, and when the network load increases. This is due both to load on the centralized bandwidth allocation entity and to the excessive number of monitoring and control messages needed. We propose a new monitoring paradigm termed autonomous monitoring, in which the network itself (i.e. the routers along the flow path) is responsible to discover when a violation of the SLA occurs (or is soon to occur). Only in such cases the centralized allocation entity is notified, and can take the required actions. We study the performance of this new distributed algorithm through theoretical analysis and extensive simulations. Our results indicate that in addition to dramatically reducing the load from the centralized allocation entity, the amount of network traffic needed is relatively small and thus the new monitoring scheme scales well.
Delivering Chalk Talks on the Internet
Authors: Satoshi Ichimura
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

A well-presented chalk talk often provides a rich and interactive learning environment that cannot easily be replaced with PowerPoint slideshows. However, it has a disadvantage in that information written on the blackboard is hard to archive or share with others who do not attend. We developed a ChalkTalk system that automatically produces e-learning materials from a videotaped chalk talk lecture in front of an ordinary blackboard or whiteboard. The system separately captures images of the blackboard with and without the lecturer from a chalk talk lecture video recorded with a high-definiton digital camcorder placed in the back of the room. The ChalkTalk system automatically tracks the lecturer as he/she moves in front of the blackboard and stores the images near the lecturer as a movie. Meanwhile, it stores occasionally updated information on the entire blackboard as an animation of snapshot images. Our method can dramatically reduce the necessary network bandwidth.
Knowing when to say no
Authors: Allan Cantos
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

You see a new piece of software posted on freshmeat, and you just know that it will solve that nagging problem you've been having with (insert name here). But what many of us don't realize, until it's far too late, is all the possible ramifications of installing (or deleting) even one simple piece of software. Allan Cantos, CTO at Acrylis (www.acrylis.com) will explore many real-world scenarios and pose questions that every Linux Administrator should ask prior to hitting the download button. Things like how much work is involved if I install that new software? What, if anything, will break in the process? Do I need to update any existing libraries on my system? What other key applications rely on those libraries? In the end, is it worth my time to do an upgrade?
RFInD: An RFID-Based System to Manage Virtual Spaces
Authors: Akhilesh Saxena, Samrat Ganguly, Sudeept Bhatnagar, Rauf Izmailov
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

We present RFInD, a cost-effective utilitarian system for locating objects using RFID technology. RFInD separates the notion of location from that of physical co-ordinates by using the abstraction of a Virtual Space. A virtual space is created by using RFID tags to label entities and locations in the physical space as references. RFInD manages the virtual space by using the references to create a spatial map, over which objects can be tracked and located. The target objects are labeled and embedded in a virtual space by associating them with proximate reference tags. RFInD creates the technology to automatically and efficiently manage these associations. In this work, we first characterize the capabilities of a commercially available RFID reader. We show how to use these capabilities for two tasks, namely Proximity Detection and Tag Association. RFInD uses these capabilities as primitives to create virtual spaces, embed objects in the virtual space, and navigate the space to track the embedded objects. Further, our experiments establish the effectiveness of our approach in managing virtual spaces.
A multi-stage classification system for detecting intrusions in computer networks
Authors: Luigi Pietro Cordella, Carlo Sansone
Venue: Pattern Analysis Applications (2007)

A serial multi-stage classification system for facing the problem of intrusion detection in computer networks is proposed. The whole decision process is organized into successive stages, each one using a set of features tailored for recognizing a specific attack category. All the stages employ suitable criteria for estimating the reliability of the performed classification, so that, in case of uncertainty, information related to a possible attack are only logged for further processing, without raising an alert for the system manager. This permits to reduce the number of false alarms. On the other hand, in order to keep low the number of missed detections, the proposed system declares a connection as normal traffic only if all the stages do not detect an attack. The proposed multi-stage intrusion detection system has been tested on three different services (http, telnet and ftp) of a standard database used for benchmarking intrusion detection systems and also on real network traffic data. The experimental analysis highlights the effectiveness of the approach: the proposed system behaves significantly better than other multiple classifier systems performing classification in a single stage.
SPEX: Streamed and Progressive Evaluation of XPath
Authors: Dan Olteanu
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Streams are preferable over data stored in memory in contexts where data is too large or volatile, or a standard approach to data processing based on storing is too time or space consuming. Emerging applications such as publish-subscribe systems, data monitoring in sensor networks, financial and traffic monitoring, and routing of MPEG-7 call for querying streams. In many such applications, XML streams are arguably more appropriate than flat streams, for they convey (possibly unbounded) unranked ordered trees with labeled nodes. However, the flexibility enabled by XML streams in data modeling makes query evaluation different from traditional settings and challenging. This paper describes SPEX, a streamed and progressive evaluation of XML Path Language (XPath). SPEX compiles queries into networks of simple and independent transducers and processes XML streams with polynomial combined complexity. This makes SPEX especially suitable for implementation on devices with low memory and simple logic as used, for example, in mobile computing.
A Data Integration Broker for Healthcare Systems
Authors: David Budgen, Michael Rigby, Pearl Brereton, Mark Turner
Venue: Computer (2007)

A prototype information broker uses a software service model to collect and integrate diverse patient data from autonomoushealthcare agencies, potentially solving many problems that challenge current enterprise-based file systems.
Classification systems optimization with multi-objective evolutionary algorithms
Authors: Paulo Vinicius Wolski Radtke
Venue:  (2006)

The optimization of classification systems is most of the time performed by a human expert. Classifier complexity may be reduced through feature subset selection (FSS), and a recent trend is to combine several classifiers into ensemble of classifiers (EoC). This thesis proposes a feature extraction based approach to optimize classification systems using a multi-objective genetic algorithm. The approach optimizes feature sets using the Intelligent Feature Extractor methodology. After this stage, the selected classifier can have its complexity reduced through FSS, or the entire IFE result set is used to optimize an EoC. This thesis also details a validation strategy to control over-fit, inspired by classifier training. Finally, a stopping criterion based on the approximation set improvement is proposed and tested. An experiment set is performed on isolated handwritten symbols demonstrate that the approach to optimize classification systems outperforms the traditional approach, also confirming the global validation strategy and the stop criterion.
Fast Enhancement of Validation Test Sets to Improve Stuck-at Fault Coverage for RTL circuits
Authors: L. Lingappan, V. Gangaram, N. K. Jha
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

A digital circuit usually comprises a controller and datapath. The time spent for determining a valid controller behavior to detect a fault usually dominates test generation time. A validation test set is used to verify controller behavior and, hence, it activates various controller behaviors. In this paper, we present a novel methodology wherein the controller behaviors exercised by test sequences in a validation test set are reused for detecting faults in the datapath. A heuristic is used to identify controller behaviors that can justify/propagate pre-computed test vectors/responses of datapath register-transfer level (RTL) modules. Such controller behaviors are said to be compatible with the corresponding precomputed test vectors/responses. The heuristic is fairly accurate, resulting in the detection of a majority of stuck-at faults in the datapath RTL modules. Also, since test generation is performed at the RTL and the controller behavior is predetermined, test generation time is reduced. For microprocessors, if the validation test set consists of instruction sequences then the proposed methodology also generates instruction-level test sequences.
On identifying functionally untestable transition faults
Authors: X. Liu, M. S. Hsiao
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

This paper presents a new approach on identifying functionally untestable transition faults in nonscan sequential circuits. We formulate a new dominance relationship for transition faults and use it to identify more sequentially untestable transition faults. The proposed method consists of two phases: first, a large number of functionally untestable transition faults is identified by a fault-independent sequential logic implications implicitly crossing multiple time-frames, and the identified untestable faults are classified into three conflict categories. Next, additional functionally untestable transition faults are identified by dominance relationships from the previous identified untestable transition faults. The experimental results for ISCAS89 sequential benchmark circuits showed that our approach can quickly identify many more functionally untestable transition faults than previously reported.
Jointly rate and power control in contention based MultiHop Wireless Networks
Authors: Abdorasoul Ghasemi, Karim Faez
Venue: Computer Communications (2007)

This paper presents a new algorithm for jointly optimal control of session rate, link attempt rate, and link power in contention based MultiHop Wireless Networks. Formulating the problem in the framework of nonlinear optimization, we derive the required updates at end points and links to reach the optimal operating point. The proposed algorithm is a cross layer algorithm considering power control at the physical layer, attempt rate control at the Medium Access Control (MAC) layer and rate control at the transport layer of the network. The optimization variables are coordinated through two shadow prices. The first one regulates each session rate to the throughput of the links in its path, and the second one controls the attempt rates to meet maximal clique capacity constraint. Considering a model for successful transmission, the excitatory and inhibitory factors affecting each variable are derived. The proposed algorithm can be implemented in distributed fashion by message passing in the network. Simulation results at the link level verify the analytical approach and show that the algorithm converge and reach joint optimal point.
Performance of ultra-wideband time-hopping spread spectrum impulse radio systems with antenna array
Authors: Sheu-sheu Tan, B. Kannan, A. Nallanathan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Impulse radio (IR) is a time-hopping spread spectrum technique in which sub-nanosecond pulses are modulated to convey information exclusively in the relative time position of the pulses. In this paper, the influence of temporal and spatial diversities is analyzed on the performance of ultra-wideband impulse radio systems. We investigate how antenna diversity can be used to improve the bit error rate of the IR system in dense multipath environments. Numerical results show that the performance of the IR system improves when the number of array elements is increased. The performance can be further improved by coherently adding more multipaths at the receiver.
Adaptive Monitoring for Virtual Machine Based Reconfigurable Enterprise Systems
Authors: Fumio Machida, Masahiro Kawato, Yoshiharu Maeno
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Dynamic monitoring adaptation to system reconfigurations such as server scale-out is required especially for the virtual machine based flexible IT systems. For any states of the systems, the monitoring server must provide fresh information with a stabilized load. In this paper, we propose an adaptive monitoring method that generates the monitoring schedule for each state of the target systems. The schedule regulates the processes for updating information cache to keep the required freshness and to stabilize the monitoring load. Since the problem for schedule generation is classified in NP-hard, we propose an approximation algorithm. Results from experiments with system reconfigurations show that the adaptive monitoring method improves the variation coefficients of CPU usages and network traffics of monitoring server by at most 80%.
From Home to Home Page: New Challenges to Basic Notions of Privacy and Property
Authors: Daniel J. Weitzner
Venue: IEEE Internet Computing (2007)

As people increasingly move their personal business online, we must redefine the notion of "home" and its boundaries in order tomaintain privacy.
HClustream: A Novel Approach for Clustering Evolving Heterogeneous Data Stream
Authors: Chunyu Yang, Jie Zhou
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Recently, the continuously arriving and evolving data stream has become a common phenomenon in many fields, such as sensor networks, web click stream and internet traffic flow. One of the most important mining tasks is clustering. Clustering has attracted extensive research by both the community of machine learning and data mining. Many stream clustering methods have been proposed. These methods have proven to be efficient on specific problems. However, most of these methods are on continuous clustering and few of them are about to solve the heterogeneous clustering problems. In this paper, we propose a novel approach based on the CluStream framework for clustering data stream with heterogeneous features. The centroid of continuous attributes and the histogram of the discrete attributes are used to represent the Micro clusters, and k-prototype clustering algorithm is used to create the Micro clusters and Macro clusters. Experimental results on both synthetic and real data sets show its efficiency.
Protecting Online Transactions with Unique Embedded Key Generators
Authors: Martin Boesgaard, Erik Zenner
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We present a novel approach for protecting transactions over networks. While we use the example of a netbank application, the proposal is relevant for many security-critical transactions. The approach is based on two major changes compared to current solutions. The first one is the use of individualized key derivation functions, which ensure that given the same input, each copy of the application ends up with different keys. The second contribution is the individualizing of program copies by subtle code modification. This makes automated analysis and patching of a client-side application very difficult. In combination, these techniques allow to build a secure channel between the client program and the server, while current solutions only build such a channel between the client computer and the server.