ppxscal/embedding_network huggingface dataset:
Network utility maximization with nonconcave, coupled, and reliability-based uilities
Authors: Mung Chiang, J. W. Lee, R. Calderbank, D. Palomar, M. Fazel
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Network Utility Maximization (NUM) has significantly extended the classical network flow problem and provided an emerging framework to design resource allocation algorithms such as TCP congestion control and to understand layering as optimization decomposition. We present a summary of very recent results in the theory and applications of NUM. We show new distributed algorithms that converge to the globally optimal rate allocation for NUM problems with nonconcave utility functions representing inelastic flows, with coupled utility functions representing interference effects or hybrid social-selfish utilities, and with rate-reliability tradeoff through adaptive channel coding in the physical layer. We conclude by discussing how do different decompositions of a generalized NUM problem correspond to different layering architectures.
Performance Comparison of a Web Cache Simulation Framework
Authors: L. G. Cardenas, J. A. Gil, J. Domenech, J. Sahuquillo, A. Pont
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Performance comparison studies are primarily carried out through real systems or simulation environments. Simulation is the most commonly used method to explore new proposals due to both its flexibility and the relatively reduced time taken to obtain performance results. This paper presents a framework to simulate web proxy cache systems. Our tool provides a comfortable environment to simulate and explore cache management techniques. In order to validate our framework and show how accurate it executes, a performance comparison has been done. We analyzed the details of a commercial proxy cache system and compare its results with those obtained from our simulator using the most commonly replacement algorithm (LRU). For this purpose, the proposed environment was adapted to match the performance of the real proxy cache. Experimental results show that proxy cache hit ratio deviations fall very close to the real system, since them never exceeds 3.42%.
Outsourcing & offshoring: impact on the user experience
Authors: Liam Friedland, Jon Innes, Roman Longoria, Wayne Hom, Pradeep Henry, Richard Anderson
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In a June 2003 survey, the management consulting firm McKinsey & Company reported that 51 percent of software executives surveyed have indicated that their offshore development strategy is already underway. Furthermore, another 20 percent of those surveyed indicated that they would move some portion of their product development offshore within the next 12 months.While offshore development has distinct advantages from the cost of labor perspective, it raises a significant number of challenges as well as opportunities for HCI practitioners and companies that wish to develop well designed, usable products. Offshoring is already changing the practice of HCI in industry, and will continue to impact practitioners more significantly over time.
MDP-Based Fast Handoff with Reducing Waste Rate Method for Management Radio Resource in 3GPP Cellular Networks
Authors: Ben-Jye Chang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

The 3G Wideband CDMA systems (WCDMA) adopt the Orthogonal Variable Spreading Factor (OVSF) code tree as the channelization codes management for achieving high data rate transmission in mobile communications. It assigns a single channelization code for each accepted connection. Nevertheless, the data rate of traffic classes should be powers of two of the basic rate, which is impractical and wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution to reduce the waste rate is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners at both of the base stations and the mobile nodes. Therefore, we propose herein an adaptive efficient partition algorithm with the Markov Decision Process (MDP) analysis approach to provide fast handoff while reducing the waste rate significantly. Numerical results show that the proposed approach outperforms the single code assignment scheme in GOS and waste rate. Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities
Authors: Mohammad R. Oskoorouchi, Jean-Louis Goffin
Venue: Mathematics of Operations Research (2005)

The convex feasibility problem in general is a problem of finding a point in a convex set that contains a full dimensional ball and is contained in a compact convex set. We assume that the outer set is described by second-order cone inequalities and propose an analytic center cutting plane technique to solve this problem. We discuss primal and dual settings simultaneously. Two complexity results are reported: the complexity of restoration procedure and complexity of the overall algorithm. We prove that an approximate analytic center is updated after adding a second-order cone cut (SOCC) inO(1) Newton step, and that the analytic center cutting plane method (ACCPM) with SOCC is a fully polynomial algorithm.
Efficient parallel implementations of near Delaunay triangulation with High Performance Fortran: Research Articles
Authors: Min-Bin Chen, Tyng-Ruey Chuang, Jan-Jan Wu
Venue: Concurrency and Computation: Practice Experience (2004)

Unstructured mesh generation exposes highly irregular computation patterns, which imposes a challenge in implementing triangulation algorithms on parallel machines. This paper reports on an efficient parallel implementation of near Delaunay triangulation with High Performance Fortran (HPF). Our algorithm exploits embarrassing parallelism by performing sub-block triangulation and boundary merge independently at the same time. The sub-block triangulation is a divide & conquer Delaunay algorithm known for its sequential efficiency, and the boundary triangulation is an incremental construction algorithm with low overhead. Compared with prior work, our parallelization method is both simple and efficient. In the paper, we also describe a solution to the collinear points problem that usually arises in large data sets. Our experiences with the HPF implementation show that with careful control of the data distribution, we are able to parallelize the program using HPF's standard directives and extrinsic procedures. Experimental results on several parallel platforms, including an IBM SP2 and a DEC Alpha farm, show that a parallel efficiency of 42&ndash;86&percnt; can be achieved for an eight-node distributed memory system. We also compare efficiency of the HPF implementation with that of a similarly hand-coded MPI implementation. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Extraction of affective components from texts and their use in natural language dialogue systems
Authors: Gábor Tatai, László Laufer
Venue: Acta Cybernetica (2004)

We are carrying out a research in the field of Human Computer Interaction and developing a natural language dialogue system in Hungarian. In the beginning chapters we briefly describe the architecture of our dialogue system, BotCom with examples of its semantic processing capabilities. We give examples of how the system is handling the topics of the discussion, how the dialogue history is being used in order to enhance the reply generation. In the subsequent parts we give an overview of the emotional state detecting, processing and generating module, called GALA, which is founded on the grounds of Robert Plutchik's emotional model. We show how BotCom is utilizing the detected emotional loads of the user's messages, therefore enabling the chatterbot to give relevant answers both semantically and affectively. In the final chapter we explain how the database of GALA was filled up with expressions assigned to their emotional loads. We also describe a graphical user interface (GUI) being designed to model the changing emotional loads in dialogues, songs and poems, and how it can be used for the emotional labeling of the phrases.
Special issue on AI and Database research
Authors: Jonathan J. King
Venue: Issue 86 (October 1983) (1983)

This collection of research summaries spans a very wide range of interests under the general heading of AI and Database research. In this introduction, I briefly describe the leading areas of interest that emerge from the reports submitted for this issue. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Force constancy and its effect on haptic perception of virtual surfaces
Authors: Seungmoon Choi, Laron Walker, Hong Z. Tan, Scott Crittenden, Ron Reifenberger
Venue: ACM Transactions on Applied Perception (TAP) (2005)

The force-constancy hypothesis states that the user of a force-feedback device maintains a constant penetration force when stroking virtual surfaces in order to perceive their topography. The hypothesis was developed to address a real-world data perceptualization problem where the perception of surface topography was distorted when the surface stiffness was nonuniform. Two experiments were conducted. In Experiment I, we recorded the penetration depths of the probe tip while the user stroked two surfaces with equal height but different stiffness values. We found that the data could be quantitatively modeled by the force-constancy hypothesis when the virtual surfaces were neither too soft nor too hard. In Experiment II, we demonstrated that given two adjacent surfaces, their perceived height difference depended on both the surface stiffness values as well as the relative heights of the surfaces. Specifically, we showed that the higher but softer surface could be perceived to be lower, at the same height, or higher than the other surface, depending on how much higher it was than the other surface. The results were consistent with the predictions of the force-constancy hypothesis. Our findings underscore the importance of understanding the interplay of haptic rendering parameters.
Energy Efficient Multi-Hop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
Authors: Zhenghao Zhang, Ming Ma, Yuanyuan Yang
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper we study two-layered heterogeneous sensor networks where two types of nodes are deployed in the network: basic sensor nodes and cluster head nodes. Basic sensor nodes are simple and inexpensive, while cluster head nodes are much powerful and much richer in energy. A cluster head node organizes the basic sensor nodes around it into a cluster. A basic sensor node does data collections and sends the data packets when polled by the cluster head. By introducing hierarchy, such a two-layered heterogeneous sensor network has better scalability than homogeneous sensor networks. It also has a smaller overall cost since networking functionalities are shifted from sensors to the cluster head. It also has a longer life time, as sensors send packets only when polled by the cluster head and less energy is consumed in collisions and idle listening. This type of network will be ideally suited for applications such as environmental monitoring. In this paper, we focus on finding energy efficient and collision-free polling schedules in the multi-hop cluster. To reduce energy consumption in idle listening, a schedule is optimal if it uses minimum time. We show that the problem of finding an optimal schedule is NPhard, and then give a fast on-line algorithm. We also consider dividing a cluster into sectors to further reduce the idle listening time of sensors. We conducted simulations on the NS-2 simulator, and the results show that our polling scheme can reduce the active time of sensors by a significant amount while sustaining 100% throughput.
Concept and prototype of a collaborative business process environment for document processing
Authors: Thomas B. Hodel-Widmer, Klaus R. Dittrich
Venue: Data Knowledge Engineering (2005)

Text documents are a valuable resource for virtually any enterprise and organization, and in many cases, document processing is a highly collaborative process. Thus documents have to be stored, managed and handled with the utmost care and efficiency.Strangely enough, while other data (most prominently customer, product, finance, and the like) have long been supported by sophisticated database and workflow technologies, until now, documents have typically been treated as second-class citizens, where mostly ad-hoc, home-grown, and often intricate solutions are being used.As a consequence, many of the achievements (with respect to data organization and querying, recovery, integrity and security enforcement, multi-user operation, distribution management, uniform tool access, and similar) are not easily available for documents.We propose a radically different approach, centered on natively representing text in fully-fledged databases, and incorporating all necessary collaboration support.This paper presents the overall concept and details of the approach's implementation. It also shows that such an approach--against first-glance scepticism, something often used as a killer argument--is indeed feasible with respect to efficiency.
Finding minimum transmission radii for preserving connectivity and constructing minimal spanning trees in ad hoc and sensor networks
Authors: Francisco Javier Ovalle-Martínez, Ivan Stojmenović, Fabián García-Nocetti, Julio Solano-González
Venue: Journal of Parallel and Distributed Computing (2005)

Ad hoc networks are normally modeled by unit graphs, where two nodes are connected if and only if their distance is at most the transmission radius R, equal for all nodes. Larger than necessary values of R cause communication interference and consumption of increased energy, while smaller values may disable data communication tasks such as routing and broadcasting. It was recognized that the minimum value of R that preserves the network connectivity is equal to the longest edge in the minimum spanning tree. However, all existing solutions for finding R rely on algorithms that require global network knowledge or inefficient straightforward distributed adaptations of centralized algorithms. This article proposes to use the longest LMST (local minimum spanning tree, recently proposed message free approximation of MST) edge to approximate R using a wave propagation quasi-localized algorithm. The differences between exact and so approximated values of R are estimated for two and three-dimensional random unit graphs. Despite small number of additional edges in LMST with respect to MST (under 5%), they can extend R by about 33% its range on networks with up to 500 nodes. We then prove that MST is a subset of LMST and describe a quasi-localized scheme for constructing MST from LMST. It needs less than 7 messages per node on average (for networks up to 500 nodes). The algorithm eliminates LMST edges which are not in MST by a loop breakage procedure, which iteratively follows dangling edges from leaves to LMST loops, and breaks loops by eliminating their longest edges, until the procedure finishes at a single node (as a byproduct, this single node can also be considered as an elected leader of the network). This so elected leader also learns longest MST edge in the process, and may broadcast it to other nodes. We also describe an algorithm for updating MST when a single node is added to the network.
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Authors: Zhiyi Tan, Yong He, Leah Epstein
Venue: Information and Computation (2005)

In this paper, we consider an ordinal on-line scheduling problem. A sequence of n independent jobs has to be assigned non-preemptively to two uniformly related machines. We study two objectives which are maximizing the minimum machine completion time, and minimizing the lp, norm of the completion times. It is assumed that the values of the processing times of jobs are unknown at the time of assignment. However it is known in advance that the processing times of arriving jobs are sorted in a non-increasing order. We are asked to construct an assignment of all jobs to the machines at time zero, by utilizing only ordinal data rather than actual magnitudes of jobs. For the problem of maximizing the minimum completion time we first present a comprehensive lower bound on the competitive ratio, which is a piecewise function of machine speed ratio s. Then, we propose an algorithm which is optimal for any s ≥ 1. For minimizing the lp norm, we study the case of identical machines (s = 1) and present tight bounds as a function of p.
Digital crustaceans: homesteading on the world wide web
Authors: Ingrid Bachmann
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

In Digital Crustaceans: Homesteading on the World Wide Web, a low level biological entity -- a hermit crab -- explores the World Wide Web to find sites for occupation and modification. This project views the World Wide Web as more than an address in cyberspace for the exchange of information or promotion. It views the Web as a form of organic architecture to be worked in and on and across to explore the material base of digital technologies, a factor often overlooked amidst the transcendent claims of new technologies. This web project is a pictorial and video narrative of those explorations.
Describing namespaces with GRDDL
Authors: Erik Wilde
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Describing XML Namespaces is an open issue for many users of XML technologies, and even though namespaces are one of the foundations of XML, there is no generally accepted and widely used format for namespace descriptions. We present a framework for describing namespaces based on GRDDL using a controlled vocabulary. Using this frame-work, namespace descriptions can be easily generated, har-vested and published in human- or machine-readable form.
Attack Trends: 2004 and 2005
Authors: Bruce Schneier
Venue: Queue (2005)

Counterpane Internet Security Inc. monitors more than 450 networks in 35 countries, in every time zone. In 2004 we saw 523 billion network events, and our analysts investigated 648,000 security &ldquo;tickets.&rdquo; What follows is an overview of what&rsquo;s happening on the Internet right now, and what we expect to happen in the coming months.
A unified and flexible framework for comparing simple and complex patterns
Authors: Ilaria Bartolini, Paolo Ciaccia, Irene Ntoutsi, Marco Patella, Yannis Theodoridis
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

One of the most important operations involving Data Mining patterns is computing their similarity. In this paper we present a general framework for comparing both simple and complex patterns, i.e., patterns built up from other patterns. Major features of our framework include the notion of structure and measure similarity, the possibility of managing multiple coupling types and aggregation logics, and the recursive definition of similarity for complex patterns.
Collecting the internet AS-level topology
Authors: Beichuan Zhang, Raymond Liu, Daniel Massey, Lixia Zhang
Venue: ACM SIGCOMM Computer Communication Review (2005)

At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has been widely used in a variety of research efforts. Conventionally this topology graph is derived from routing tables collected by Route Views or RIPE RIS. In this work, we assemble the most complete AS-level topology by extending the conventional method along two dimensions. First, in addition to using data from RouteViews and RIPE RIS, we also collect data from many other sources, including route servers, looking glasses, and routing registries. Second, in addition to using routing tables, we also accumulate topological information from routing updates over time. The resulting topology graph on a recent day contains 44% more links and 3% more nodes than that from using RouteViews routing tables alone. Our data collection and topology generation process have been automated, and we publish the latest topology on the web on a daily basis.
The uniform closure of non-dense rational spaces on the unit interval
Authors: Tamás Erdélyi
Venue: Journal of Approximation Theory (2004)

Let Pn denote the set of all algebraic polynomials of degree at most n with real coefficients. Associated with a set of poles {a1, a2, ....., an} ⊂ R\[-1, 1] we define the rational function spaces Pn(a1,a2, ....,an): = {f: f(x) = b0 + Σj=1n bj/x - aj, b0, b1,...., bn ∈ R}. Associated with a set of poles {a1,a2,....} ⊂ R\[-1,1], we define the rational function spaces P(a1,a2,....): ∪n=1∞ Pn (a1,a2,...,an). It is an interesting problem to characterize sets {a1,a2,....} ⊂ R\[-1,1] for which P(a1, a2,....) is not dense in C[-1, 1], where C[-1, 1] denotes the space of all continuous functions equipped with the uniform norm on [-1,1]. Akhieser showed that the density of P(a1, a2,....) is characterized by the divergence of the series Σn=1∞ √an2-1.In this paper, we show that the so-called Clarkson-Erdös-Schwartz phenomenon occurs in the non-dense case. Namely, if P(a1, a2,....) is not dense in C[-1,1], then it is "very much not so". More precisely, we prove the following result. Theorem. Let {a1,a2,...} ⊂ R\[-1,1]. Suppose P(a1,a2,...) is not dense in C[-1,1], that is, Σn=1∞ √an2 - 1 < ∞.Then every function in the uniform closure of P(a1,a2,...) in C[-1,1] can be extended analytically throughout the set C\{-1,1,a1,a2,...}.
Detecting, Localizing and Recovering Kinematics of Textured Animals
Authors: Deva Ramanan, D. A. Forsyth, Kobus Barnard
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We develop and demonstrate an object recognition system capable of accurately detecting, localizing, and recovering the kinematic configuration of textured animals in real images. We build a deformation model of shape automatically from videos of animals and an appearance model of texture from a labeled collection of animal images, and combine the two models automatically. We develop a simple texture descriptor that outperforms the state of the art. We test our animal models on two datasets; images taken by professional photographers from the Corel collection, and assorted images from the web returned by Google. We demonstrate quite good performance on both datasets. Comparing our results with simple baselines, we show that for the Google set, we can recognize objects from a collection demonstrably hard for object recognition.