ppxscal/embedding_network huggingface dataset:
Optimizing Packet Capture on Symmetric Multiprocessing Machines
Authors: Gianluca Varenni, Mario Baldi, Loris Degioanni, Fulvio Risso
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

Traffic monitoring and analysis based on general purpose systems with high speed interfaces, such as Gigabit Ethernet and 10 Gigabit Ethernet, requires carefully designed software in order to achieve the needed performance. One approach to attain such a performance relies on deploying multiple processors. This work analyses some general issues in multiprocessorsystems that are particularly critical in the context of packet capture and network monitoring applications. More important, a new algorithm is proposed to coordinate multiple producers concurrently accessing a shared buffer, which is instrumental in packet capture on symmetrical multiprocessor machines.
An Analytic Center Cutting Plane Method for Solving Semi-Infinite Variational Inequality Problems
Authors: Shu-Cherng Fang, Soon-Yi Wu, Jie Sun
Venue: Journal of Global Optimization (2004)

We study a variational inequality problem VI(X,F) with X being defined by infinitely many inequality constraints and F being a pseudomonotone function. It is shown that such problem can be reduced to a problem of finding a feasible point in a convex set defined by infinitely many constraints. An analytic center based cutting plane algorithm is proposed for solving the reduced problem. Under proper assumptions, the proposed algorithm finds an &epsi;-optimal solution in O*(n2/&rho;2) iterations, where O*(&middot;) represents the leading order, n is the dimension of X, &epsiv; is a user-specified tolerance, and &rho; is the radius of a ball contained in the &epsiv;-solution set of VI(X,F).
News 2.0
Venue: Queue (2004)

Microsoft is getting serious about security—really serious. Gates and crew have stepped forward and announced the Anti-Virus Reward Program, offering a quarter-million dollars for information leading to the arrest and conviction of the “saboteurs of cyberspace” behind the Blaster worm; a quarter-million dollars for helping capture and convict those behind the Sobig virus attack; and four-and-a-half million has been set aside for future rewards.
A first-order one-pass CPS transformation
Authors: Olivier Danvy, Lasse R. Nielsen
Venue: Theoretical Computer Science (2003)

We present a new transformation of λ-terms into continuation-passing style (CPS). This transformation operates in one pass and is both compositional and first-order. Previous CPS transformations only enjoyed two out of the three properties of being first-order, one-pass, and compositional, but the new transformation enjoys all three properties. It is proved correct directly by structural induction over source terms instead of indirectly with a colon translation, as in Plotkin's original proof. Similarly, it makes it possible to reason about CPS-transformed terms by structural induction over source terms, directly.The new CPS transformation connects separately published approaches to the CPS transformation. It has already been used to state a new and simpler correctness proof of a direct-style transformation, and to develop a new and simpler CPS transformation of control-flow information.
The Development of an Instrument to Measure Readiness for Knowledge Management
Authors: Daniel T. Holt, Summer E. Bartczak, Steven W. Clark, Martin R. Trent
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Implementing knowledge management (KM) projects or knowledge-sharing philosophies in organizations require significant organization change. Because the introduction of change is difficult, leaders have been encouraged to proactively prepare their organizations and its members as they begin one of these initiatives. As the first step in this process, managers should comprehensively examine their organization's underlying readiness to embrace these initiatives. Unfortunately, the measurement of an organization's readiness for KM initiatives poses significant challenges because no known instrument is available to do so. Accordingly, this study draws on the KM and organizational change literature to propose a synergistic instrument to measure readiness for KM and applied it in an organizational setting.
A Multiservice Architecture for Dynamic Bandwidth Allocation and Traffic Engineering Applications
Authors: Y. L. Takahashi-Iturriaga, J. Martínez, V. Alarcón
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The primary goal of this paper is to analyzebandwidth control techniques in order to propose anarchitecture to improve bandwidth usage. Networkarchitecture employs several techniques in order tomanage, predict and handle traffic issues due toEthernet's best effort delivery system. Bandwidthallocation, traffic engineering and a post analysisresulting architecture are presented in that order.Ethernet's resources are dissected in order to studyeach component separately and present a traffic-effectivearchitecture at each hierarchical level. Theanalysis reported in this paper indicate that byimproving each topology hierarchical level, networkperformance is increased globally.
DOSE: A Distributed Open Semantic Elaboration Platform
Authors: Dario Bonino, Fulvio Corno, Laura Farinetti
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

The paper proposes a Distributed Open Semantic Elaboration platform based on a modular multilingual enabled architecture, which includes ontology, annotations, lexical entities and search functions. The platform is implemented as a distributed set of services including: semantic annotations for document substructures (e.g. chapters, sections, paragraphs), an external annotation repository (based on XPath and XPointer technologies) that is automatically populated starting from a known ontology and a lexical representation of concept classes, and a semantic search engine used to extract and recombine relevant document fragments. Annotated resources may be XML or XHTML static or dynamic documents, and need not be stored nor modified. Preliminary experimental results are presented to show the feasibility and the advantages of the proposed approach.
Order-incompleteness and finite Lambda reduction models
Authors: Peter Selinger
Venue: Theoretical Computer Science (2003)

Many familiar models of the untyped lambda calculus are constructed by order-theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory of β- or βη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the untyped lambda calculus cannot be non-trivially partially ordered. Our second result is a syntactical characterization, in terms of so-called generalized Mal'cev operators, of those lambda theories which cannot be induced by any non-trivially partially ordered model. We also consider a notion of finite models for the untyped lambda calculus, or more precisely, finite models of reduction. We demonstrate how such models can be used as practical tools for giving finitary proofs of term inequalities.
Efficient QoS routing
Authors: Stavroula Siachalou, Leonidas Georgiadis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

We consider the problem of routing in a network where quality of service constraints are placed on network traffic. We provide two optimal algorithms that are based on determining the discontinuities of functions related to the optimization at hand. The proposed algorithms have pseudopolynomial worst case running time and for a wide variety of tested networks they have fairly satisfactory running times. They perform significantly better than the algorithm based on the direct application of the dynamic programming equations and can also be used in conjunction with known polynomial-time approximation algorithms to provide good average case behavior, in addition to guaranteeing polymonial worst-case running time.
XISL: a language for describing multimodal interaction scenarios
Authors: Kouichi Katsurada, Yusaku Nakamura, Hirobumi Yamada, Tsuneo Nitta
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

This paper outlines the latest version of XISL (eXtensible Interaction Scenario Language). XISL is an XML-based markup language for web-based multimodal interaction systems. XISL enables to describe synchronization of multimodal inputs/outputs, dialog flow/transition, and some other descriptions required for multimodal interaction. XISL inherits these features from VoiceXML and SMIL. The original feature of XISL is that XISL has enough modality-extensibility. We present the basic XISL tags, outline of XISL execution systems, and then make a comparison with other languages.
Generating and characterizing the perfect elimination orderings of a chordal graph
Authors: L. S. Chandran, L. Ibarra, F. Ruskey, J. Sawada
Venue: Theoretical Computer Science (2003)

We develop a constant time transposition "oracle" for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the initialization of the algorithm can be performed in linear time. We also develop two new characterizations of perfect elimination orderings: one in terms of chordless paths, and the other in terms of minimal u-v separators.
Applications Integration: Is it Always Desirable?
Authors: Lester A. Singletary
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

This paper describes a qualitative research study that surfaced practitioner interpretations (assumptions, knowledge, and expectations) of applications integration downsides. Although integration is the primary benefit of enterprise systems, like most things, integration also has adownside. However, most people agree that integration is still desirable. The challenge is to understand and manage the negative aspects of integration to minimize the adverse effects. Doing this requires an awareness of the potential problems. This paper augments past research on this subject with the results from a recent investigation of integration of applications for enterprise systems. Fifty-one people representing three stakeholder groups from four organizations were interviewed. The data revealed thirty-one unique integration downsides representing at least five dimensions. It now appears that integration is not always desirable or practical for a number of legitimate reasons. Collectively, organizations spend billions of dollars to achieve integration so it seems reasonable that understanding applications integration downsides is important to success. Yet, little is known about practitioners' perceptions of integration that influence their decisions and actions.
A framework for narrowing the digital divide
Authors: Alexander Osterwalder, Mathias Rossi, Minyue Dong
Venue: Managing globally with information technology (2003)

The bridging of the so-called digital divide is an important issue in today's development efforts of international and non-governmental organizations and developing countries. This does not only concern access to new information and communication technology (ICT) such as the Internet, but also access to the knowledge how to use these technologies for economic development. This chapter outlines the business model framework and the business model handbook that shall help to develop a knowledgeable class of e-entrepreneurs that are able to use ICT and to detect the opportunities of the Internet era.
Ontology Generation from Tables
Authors: Yuri A. Tijerino, David W. Embley, Deryle W. Lonsdale, George Nagy
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

We often need to access and reorganize information available in multiple tables in diverse Web pages. To understand tables, we rely on acquired expertise, background information, and practice. Current computerized tools seldom consider the structure and content in the context of other tables with related information. This paper addresses the table processing issue by developing a new framework to table understanding that applies an ontology-based conceptual modeling extraction approach to: (i) understand a table's structure and conceptual content to the extent possible; (ii) discover the constraints that hold between concepts extracted from the table; (iii) match the recognized concepts with ones from a more general specification of related concepts; and (iv) merge the resulting structure with other similar knowledge representations for use in future situations. The result will be a formalized method of processing the format and content of tables while incrementally building a relevant reusable conceptual ontology.
&#x0394;-stepping: a parallelizable shortest path algorithm
Authors: U. Meyer, P. Sanders
Venue: Journal of Algorithms (2003)

The single source shortest path problem for arbitrary directed graphs with n nodes, m edges and nonnegative edge weights can sequentially be solved using O(n ċ log n + m) operations. However, no work-efficient parallel algorithm is known that runs in sublinear time for arbitrary graphs. In this paper we present a rather simple algorithm for the single source shortest path problem. Our new algorithm, which we call Delta-stepping, can be implemented very efficiently in sequential and parallel setting for a large class of graphs. For random edge weights and arbitrary graphs with maximum node degree d, sequential Δ-stepping needs O(n + m + d ċ L) total average-case time, where L denotes the maximum shortest path weight from the source node s to any node reachable from s. For example, this means linear time on directed graphs with constant maximum degree. Our best parallel version for a PRAM takes O(d ċ L ċ log n + log2 n) time and O(n + m + d ċ L ċ log n) work on average. For random graphs, even O(log2 n) time and O(n + m) work on average can be achieved. We also discuss how the algorithm can be adapted to work with nonrandom edge weights and how it can be implemented on distributed memory machines. Experiments indicate that already a simple implementation of the algorithm achieves significant speedup on real machines.
Constructing a dem from grid-based data by computing intermediate contours
Authors: Michael B. Gousie, Wm. Randolph Franklin
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

We present a technique for creating a digital elevation model (DEM) from grid-based contour data. The method computes new, intermediate contours in between existing isolines. These are found by finding the shortest line segment that connects points on two neighboring contours with differing elevations. The midpoint of the line segment becomes a point on the intermediate contour. The contours are completed by connecting individual points. The new contours are then used as data for successive iterations, until an initial surface is formed. Peaks are computed by Hermite splines that follow the slope trend. Gaussian smoothing is applied to the entire surface or only to newly computed elevations, yielding an approximated or interpolated surface, respectively. The DEMs are tested with quantitative methods, and are shown to compare favorably to well established algorithms.
Test Compaction by Using Linear-Matrix Driven Scan Chains
Authors: Sandeep Bhatia
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents a linear matrix driven scan based test methodology for ASIC designs which, compared to conventional scan methodology, reduces the test application time as wellas the required tester memory and test data by an order of magnitude - without deteriorating the test quality. The proposed test methodology uses a linear matrix to drive a large number ofparallel scan chains from a small set of chip pins. A multi-input-signature-register (MISR) is used at the output of chains to compress the test output response. By increasing the number of parallel scan chains, the length of the chains is reduced, which directly impacts the number of test cycles required to shift test data through the chains. This allows one to considerably reduce the test application time required for shifting data through scan chains. It also reduces the test data required to be stored in tester memory, thus, considerably reducing the manufacturing test cost, and allowing the reuse of older generation of less expensive testers with smaller memory.
Proceedings of the 2nd international conference on Principles and practice of programming in Java
Venue: PPPJ; Vol. 42 (2003)

It gives me great pleasure to be able to welcome you to Kilkenny City for the second international conference on the Principles and Practice of Programming in Java. The inaugural conference, held in Trinity College Dublin in 2002, provided an interesting and varied forum for the discussion of Java-related issues, and we hope that this year's conference will be able to build on that success.This year's conference is being organised through the National University of Ireland, Maynooth, who have a campus here in Kilkenny City. As well as being a fine example of a medieval city and an internationally renowned centre for craft and design, Kilkenny is also warm and friendly city, and I hope you will have the opportunity to explore some of it during and after the conference.This year's conference is sponsored in a large part by the Science Foundation Ireland (SFI). The SFI is central to an ambitious funding scheme aimed at academic researchers and research teams who are most likely to generate new knowledge and leading edge technologies in the area of information and communications technology. We are grateful for the recognition that their support lends to our conference's aim in this regard.PPPJ 2003 is organised in conjunction with the ACM SIGAPP, the Special Interest Group in Applied Computing. As well as underpinning the conference's academic standards, the help and advice provided by the ACM has been most useful in the conference organisation. The inclusion of the conference proceedings in the ACM digital library will ensure rapid and widespread dissemination of the work presented here.A total of 86 full papers were submitted to PPPJ 2003. Each paper was reviewed anonymously by at least two reviewers from independent institutions, using a "double-blind" system. There were many detailed, helpful reviews, and I am very grateful for the time and effort taken by the reviewers to produce them.The results of the review process were collated and considered by the PPPJ steering committee, and in some borderline cases subsequent reviews were conducted. Of the 86 submitted papers, a total of 39 papers were selected for presentation in full at PPPJ 2003, an acceptance rate of just over 45%. A further 12 papers were deemed sufficiently of interest to be presented in abbreviated form, either as extended abstracts or posters.
Magnitostatic analysis by employing absorbing boundary condition
Authors: E. Afjei, M. H. Arbab
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The need for absorbing boundary condition and coordinate stretching arises when one wishes to simulate the extension to infinity on a finite domain of computation for a problem. This paper develops the proper absorbing boundary operators for an elliptical partial differential equation for a magnetostatic problem. It then uses finite difference technique with the founded absorbing boundary condition in order to investigate its effect on the solution of the problem. In this procedure a finite distance is considered instead of the original infinite distance. Applying proper boundary conditions at that distance one can emulate the open boundary conditions. The absorbing boundary condition have been employed extensively to hyperbolic problems in which the solutions move at finite speed are limited in duration by the return of outwardly propagating feature of the solution. In this problem we consider an elliptic magnetostatic problem and then try to develop absorbing boundary condition formulas of different orders and finally applying them to the problem using the finite difference technique.
Spectral Grouping Using the Nyström Method
Authors: Charless Fowlkes, Serge Belongie, Fan Chung, Jitendra Malik
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Spectral graph theoretic methods have recently shown great promise for the problem of image segmentation. However, due to the computational demands of these approaches, applications to large problems such as spatiotemporal data and high resolution imagery have been slow to appear. The contribution of this paper is a method that substantially reduces the computational requirements of grouping algorithms based on spectral partitioning making it feasible to apply them to very large grouping problems. Our approach is based on a technique for the numerical solution of eigenfunction problems known as the Nyström method. This method allows one to extrapolate the complete grouping solution using only a small number of samples. In doing so, we leverage the fact that there are far fewer coherent groups in a scene than pixels.
A protection scheme for collaborative environments
Authors: Issa Traoré, Suraiya Khan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In collaborative working environments where multiple users use and/or provide multiple services, a more flexible security model is needed. Security must be enforced in such environments without affecting usability, scalability, and performance. In this paper, we propose a flexible protection scheme based on the lattice security model that combines information flow and access control mechanisms in order to address privacy and integrity requirements in scalable collaborative environments.
Localized Prediction of Continuous Target Variables Using Hierarchical Clustering
Authors: Aleksandar Lazarevic, Ramdev Kanapady, Chandrika Kamath, Vipin Kumar, Kumar Tamma
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper, we propose a novel technique for the efficientprediction of multiple continuous target variablesfrom high-dimensional and heterogeneous data sets usinga hierarchical clustering approach. The proposed approachconsists of three phases applied recursively:partitioning, localization and prediction. In thepartitioning step, similar target variables are groupedtogether by a clustering algorithm. In the localizationstep, a classification model is used to predict which groupof target variables is of particular interest. If theidentified group of target variables still contains a largenumber of target variables, the partitioning andlocalization steps are repeated recursively and theidentified group is further split into subgroups with moresimilar target variables. When the number of targetvariables per identified subgroup is sufficiently small, thethird step predicts target variables using localized predictionmodels built from only those data records thatcorrespond to the particular subgroup. Experimentsperformed on the problem of damage prediction incomplex mechanical structures indicate that ourproposed hierarchical approach is computationally moreefficient and more accurate than straightforward methodsof predicting each target variable individually orsimultaneously using global prediction models.