ppxscal/embedding_network huggingface dataset:
HSM: A Fast Packet Classification Algorithm
Authors: Bo Xu, Dongyi Jiang, Jun Li
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Packet classification on multiple header fields is one of the basic techniques used in network devices such as routers and firewalls, and usually the most computation intensive task among others. To determine what action needs to be taken to a packet, a network device responsible for packet classification must identify the packetýs property, such as associated packet flow, based on multiple fields of its header. Fast packet classification on multiple fields is known to be difficult mathematically and expensive practically. In this paper, we describe and discuss a fast packet classification algorithm using a multiple stage reduction scheme similar to the previously well-know Recursive Flow Classification (RFC) algorithm. The proposed Hierarchical Space Mapping (HSM) algorithm requires much less memory usage than RFC while keeps average search time on the same order. HSM has been proved to be very effective with commercial products in real networks.
Balanced paths in acyclic networks: Tractable cases and related approaches
Authors: Paola Cappanera, Maria Grazia Scutellà
Venue: Networks (2005)

Given a weighted acyclic network G and two nodes s and t in G, we consider the problem of computing k balanced paths from s to t, that is, k paths such that the difference in cost between the longest and the shortest path is minimized. The problem has several variants. We show that, whereas the general problem is solvable in pseudopolynomial time, both the arc-disjoint and the node-disjoint variants &lpar;i.e., the variants where the k paths are required to be arc-disjoint and node-disjoint, respectively&rpar; are strongly NP-Hard. We then address some significant special cases of such variants, and propose exact as well as approximate algorithms for their solution. The proposed approaches are also able to solve versions of the problem in which k origin-destination pairs are provided, and a set of k paths linking the origin-destination pairs has to be computed in such a way to minimize the difference in cost between the longest and the shortest path in the set. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 104-111 2005
Enhancing ebXML Registries to Make them OWL Aware
Authors: Asuman Dogac, Yildiray Kabak, Gokce B. Laleci, Carl Mattocks, Farrukh Najmi, Jeff Pollock
Venue: Distributed and Parallel Databases (2005)

ebXML is a standard from OASIS and UN/CEFACT which specifies an infrastructure to facilitate electronic business. In this paper, we address how ebXML registry semantics support can be further enhanced to make it OWL aware. OWL constructs are represented through ebXML registry information model constructs, and stored procedures are defined in the ebXML registry for processing the OWL semantics. These predefined stored queries provide the necessary means to exploit the enhanced semantics stored in the registry. In this way, an application program does not have to be aware of the details of how this semantics support is achieved in ebXML registry, and does not have to contain additional code to process this semantics.We believe that this approach is quite powerful to associate semantics with registry objects: it becomes possible to retrieve knowledge through queries, the enhancements to the registry are generic and also the registry specification is kept intact. The capabilities provided move the semantics support beyond what is currently available in ebXML registries and it does so by using a standard ontology language.To be able to demonstrate the benefits of the enhancements, we also show how the resulting semantics can be made use of in Web service discovery and composition.
Graph-theoretical approach to 2-switch DC&ndash;DC converters: Research Articles
Authors: Masato Ogata, Tetsuo Nishi
Venue: International Journal of Circuit Theory and Applications (2005)

This paper presents a graph-theoretic approach to analyse and synthesize switch mode DC&ndash;DC converters. The result is based on the state-space averaging equation and the fundamental graph theory. Hence our proposed method is applied to various kinds of DC&ndash;DC converters with two switches and topological conditions for two-switch DC&ndash;DC converters are obtained systematically. Copyright &copy; 2005 John Wiley & Sons, Ltd.
The efficient generation of random programs and their applications
Authors: Jue Wang
Venue: Journal of Computing Sciences in Colleges (2004)

My project is investigating the efficient generation of random programs and their applications. A computer program is typically viewed as a specific set of instructions written to perform a certain task and it is developed through many iterations of careful planning, coding, debugging and testing. However, more fundamentally, a program is just a tree-shaped datum and, as such, can be analyzed and created by other programs. For example, compilers, type checkers and parser generators are programs that either take other programs as inputs or yield programs as results. Since programs can be easily represented as trees, the problem of generating programs is really the problem of constructing legal trees. 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
Using the divide and conquer strategy to teach Java framework design
Authors: H. Conrad Cunningham, Yi Liu, Cuihua Zhang
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

All programmers should understand the concept of program families and know the techniques for constructing them. This paper describes a case study that can be used to introduce students in a Java software design course to the construction of program families using software frameworks. The example is the family of programs that use the well-known divide and conquer algorithmic strategy.
Pretty printing with lazy dequeues
Authors: Olaf Chitil
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

There are several purely functional libraries for converting tree structured data into indented text, but they all make use of some backtracking. Over twenty years ago, Oppen published a more efficient imperative implementation of a pretty printer. This article shows that the same efficiency is also obtainable without destructive updates by developing a similar but purely functional Haskell implementation with the same complexity bounds. At its heart lie two lazy double ended queues.
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Authors: David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
Venue: Journal of Computer and System Sciences (2005)

A language L over an alphabet A is said to have a neutral letter if there is a letter e@?A such that inserting or deleting e's from any word in A^* does not change its membership or non-membership in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate useless, i.e., that if a language L with a neutral letter is not definable in first-order logic with linear order, then it is not definable in first-order logic with any set N of numerical predicates. Named after the location of its first, flawed, proof this conjecture is called the Crane Beach conjecture (CBC, for short). The CBC is closely related to uniformity conditions in circuit complexity theory and to collapse results in database theory. We investigate the CBC in detail, showing that it fails for N={+,x}, or, possibly stronger, for any set N that allows counting up to the m times iterated logarithm, for any constant m. On the positive side, we prove the conjecture for the case of all monadic numerical predicates, for the addition predicate +, for the fragment BC(@S"1) of first-order logic, for regular languages, and for languages over a binary alphabet. We explain the precise relation between the CBC and so-called natural-generic collapse results in database theory. Furthermore, we introduce a framework that gives better understanding of what exactly may cause a failure of the conjecture.
Iterative Decoding of Orthogonal Space-Time Coded CPM Systems
Authors: Shengli Fu, Genyuan Wang, Xiang-Gen Xia
Venue: Wireless Personal Communications: An International Journal (2004)

We present an iterative decoding/demodulation technique for an orthogonal space-time coded continuous-phase modulation (OST-CPM) system. A low-complexity soft input and soft output (SISO) demodulator is developed based on the bidirectional soft output Viterbi algorithm (BSOVA) for the multiple antennas CPM systems. By taking advantage of the orthogonal structure, the complexity of extrinsic information extraction can be significantly reduced at each iteration.
A measure for mesh compression of time-variant geometry: Research Articles
Authors: Prasun Mathur, Chhavi Upadhyay, Parag Chaudhuri, Prem Kalra
Venue: Computer Animation and Virtual Worlds (2004)

We present a novel measure for compression of time-variant geometry. Compression of time-variant geometry has become increasingly relevant as transmission of high quality geometry streams is severely limited by network bandwidth. Some work has been done on such compression schemes, but none of them give a measure for prioritizing the loss of information from the geometry stream while doing a lossy compression. In this paper we introduce a cost function which assigns a cost to the removal of particular geometric primitives during compression, based upon their importance in preserving the complete animation. We demonstrate that the use of this measure visibly enhances the performance of existing compression schemes. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Deep blue: interactive game-based learning for deep-sea environments
Authors: Stephen Lecrenski
Venue: Journal of Computing Sciences in Colleges (2005)

In 1977, a team of scientists and engineers headed by Dr. Robert Ballard made a stunning discovery on the bottom of the Pacific Ocean that forever changed mankind's understanding of life on our planet. They found deep-sea hydrothermal vent sites in which life exists even in the cold, dark depths of the sea. The discovery of these hydrothermal vents and the process of chemosynthesis to produce organic matter forever changed the theory that photosynthesis is the only process that results in the creation of life.
Exploiting Correlated Attributes in Acquisitional Query Processing
Authors: Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel Madden
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency, or computational resources. When executing queries that contain several predicates over such expensive attributes, we observe that it can be beneficial to use correlations to automatically introduce low-cost attributes whose observation will allow the query processor to better estimate the selectivity of these expensive predicates. In particular, we show how to build conditional plans that branch into one or more sub-plans, each with a different ordering for the expensive query predicates, based on the runtime observation of low-cost attributes. We frame the problem of constructing the optimal conditional plan for a given user query and set of candidate low-cost attributes as an optimization problem. We describe an exponential time algorithm for finding such optimal plans, and describe a polynomial-time heuristic for identifying conditional plans that perform well in practice. We also show how to compactly model conditional probability distributions needed to identify correlations and build these plans. We evaluate our algorithms against several real-world sensor-network data sets, showing several-times performance increases for a variety of queries versus traditional optimization techniques.
Information systems based on space monitoring for solution of some problems of sustainable development
Authors: Umirzak Sultangazin
Venue: Mathematics and Computers in Simulation (2004)

The problem of creation of scientific and information base of sustainable development in the Aral Sea region and former Semipalatinsk nuclear test site is considered. This problem can be solved with the usage of space satellites, methods of remote sensing, and proper mathematical models. The ecological and economical model of some regions of Central Asia and its informational base has been developed. Suggested GIS and remote sensing data will provide necessary information.
On stiffness improvement of the Tricept machine tool
Authors: Dan Zhang
Venue: Robotica (2005)

In this paper, an alternate passive leg structure is proposed for the Tricept machine tool to form a modified Tricept machine tool. The global stiffness of the modified Tricept machine tool is derived and compared with that of the Tricept machine tool. First, the configurations of the Tricept machine tool and the modified Tricept machine tool are introduced, respectively. Then, the global velocity equations are derived and the stiffness models of the two configurations are presented and analyzed. Finally, the advantages and disadvantages of the two types of passive leg structure are analyzed and discussed and stiffness simulations are conducted.
WSPeer - An Interface to Web Service Hosting and Invocation
Authors: Andrew Harrison, Ian J. Taylor
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

This paper introduces WSPeer, a high level interface to hosting and invoking Web services. WSPeer aims to support the diversification of Web service deployments by providing a pluggable architecture that can be used to host Web services in a number of different ways. In particular, we are interested in the cross-fertilisation between Web services and Peer-to-Peer (P2P) systems by enabling entities to act as both service providers and consumers in a flexible and extensible way. Further, we support the behaviour needed within a P2P environment by allowing Web services to be dynamically deployed through the use of a lightweight container that is more suited to highly transient connectivity. This approach allows standard Web services to be deployed within a P2P environment and yet still adhere to a Service Oriented Architecture. We argue therefore that both Web services and P2P are exponents of Service Oriented Architecture, approaching the same goals from very different directions, and that a combination of the strengths of these approaches can lead to more robust and ubiquitousWeb service and P2P deployments.
Standards Factor: A CLOSER LOOK AT ISO 9241
Authors: Pat Billingsley
Venue: ACM SIGCHI Bulletin (1993)

Beginning with this column, I will periodically depart from my usual summary of ISO and ANSI committee activities to present more in-depth information about an individual user interface standard. This change in emphasis reflects the fact that many standards have reached, or are about to reach, a point where their contents and structure are largely stabilized. At the same time, several standards are beginning to have a direct impact on the way computer products are designed, developed, and marketed for European customers. 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
CVSscan: visualization of code evolution
Authors: Lucian Voinea, Alex Telea, Jarke J. van Wijk
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

During the life cycle of a software system, the source code is changed many times. We study how developers can be enabled to get insight in these changes, in order to understand the status, history and structure better, as well as for instance the roles played by various contributors. We present CVSscan, an integrated multiview environment for this. Central is a line-oriented display of the changing code, where each version is represented by a column, and where the horizontal direction is used for time, Separate linked displays show various metrics, as well as the source code itself. A large variety of options is provided to visualize a number of different aspects. Informal user studies demonstrate the efficiency of this approach for real world use cases.
Typical problems for stiff differential equations
Authors: M. K. Gordon, L. F. Shampine
Venue: ACM SIGNUM Newsletter (1975)

The solution of stiff differential equations has become a very active area in recent years. To have some idea as to the wishes of practitioners would be of obvious value to researchers developing new tools, to software designers producing new codes, and to those evaluating the codes available at present. Because there is surprisingly little quantitative information published about the characteristics of the problems being solved, we have conducted a survey at the Sandia Laboratory in Albuquerque. This is a non-profit research and development firm contracted to the AEC (now ERDA) which does a variety of scientific computing. The size of the computing effort is suggested by the number of employees with Ph.D.'s, about 500, and the array of computers, three CDC 6600's, a UNIVAC 1108, a PDP-10, an IBM 7090, and some smaller machines. While our interviews can be no more than indicative, we hope others will also find this brief summary useful.
Real-time rendering of 3D medical data sets
Authors: Kai Xie, Jie Yang, Y. M. Zhu
Venue: Future Generation Computer Systems (2005)

Interactive exploration of three dimension (3D) medical data sets is required by many applications, but the huge amount of computational time and storage space needed for rendering do not allow the visualization of large medical data sets by now. In this paper we present a new algorithm for rendering large medical data sets at interactive frame rates on standard PC hardware. The input data is converted into a compressed hierarchical wavelet representation in a preprocessing step. During rendering, the wavelet representation is decompressed on-the-fly and rendered using hardware texture mapping. The level of detail used for rendering is adapted to the local frequency spectrum of the data and its position relative to the viewer. Using a prototype implementation of the algorithm we were able to perform an interactive walkthrough of large medical data sets on a single of-the-shelf PC.
A dynamic compiler for embedded Java virtual machines
Authors: Mourad Debbabi, Abdelouahed Gherbi, Lamia Ketari, Chamseddine Talhi, Nadia Tawbi, Hamdi Yahyaoui, Sami Zhioua
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

A new acceleration technology for Java embedded virtual machines is presented in this paper. Based on the selective dynamic compilation technique, this technology addresses the J2ME/CLDC (Java 2 Micro Edition for Connected Limited Device Configuration) platform. The primary objective of our work is to come up with an efficient, lightweight and low-footprint accelerated embedded Java Virtual Machine. This is achieved by the means of integrating a selective dynamic compiler that we called E-Bunny into the J2ME/CLDC virtual machine KVM. This paper presents the motivations, the architecture, the design and the implementation issues of E-Bunny and how we addressed them. Experimental results on the performance of our modified KVM demonstrate that we accomplished a speedup of 400% with respect to the latest version of KVM. This experimentation was carried on using standard J2ME benchmarks.
Some approaches to implementation of virtual learning environments
Authors: Galina Ivanova, Angel Smrikarov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

A short analysis of well-known types of virtual learning environments today is presented in the paper. Some examples of world practice are adduced. Four main approaches to implementation of such environments are given. A conception for implementation of uniform virtual learning environment is proposed. As a conclusion the creation of Bulgarian Virtual University as a part of the third stage in national project for implementation of virtual learning environments is announced.
Dynamic supernetworks for the integration of social networks and supply chains with electronic commerce: modeling and analysis of buyer--seller relationships with computations
Authors: Tina Wakolbinger, Anna Nagurney
Venue: Netnomics (2004)

In this paper, we develop a dynamic supernetwork framework for the modeling and analysis of supply chains with electronic commerce that also includes the role that relationships play. Manufacturers are assumed to produce a homogeneous product and to sell it either through physical or electronic links to retailers and/or directly to consumers through electronic links. Retailers, in turn, can sell the product through physical links to consumers. Increasing relationship levels in our framework are assumed to reduce transaction costs as well as risk and to have some additional value for both sellers and buyers. Establishing those relationship levels incurs some costs that have to be borne by the decision-makers in the supernetwork, which is multilevel in structure and consists of the supply chain and the social network. The decision-makers, who are located at distinct tiers in the supernetwork, try to optimize their objective functions and are faced with multiple criteria including relationship-related ones and weight them according to their preferences. We establish the optimality conditions for the manufacturers, retailers, and consumers, derive the equilibrium conditions, and provide the variational inequality formulation. We then present the projected dynamical system, which describes the disequilibrium dynamics of the product transactions, relationship levels, and prices on the supernetwork, and whose set of stationary points coincides with the set of solutions of the variational inequality problem. We also illustrate the dynamic supernetwork model through several numerical examples, for which the explicit equilibrium patterns are computed.
On musical stylometry-a pattern recognition approach
Authors: Eric Backer, Peter van Kranenburg
Venue: Pattern Recognition Letters (2005)

In this short communication we describe some experiments in which methods of statistical pattern recognition are applied for musical style recognition and disputed musical authorship attribution. Values of a set of 20 features (also called ''style markers'') are measured in the scores of a set of compositions, mainly describing the different sonorities in the compositions. For a first study over 300 different compositions of Bach, Handel, Telemann, Mozart and Haydn were used and from this data set it was shown that even with a few features, the styles of the various composers could be separated with leave-one-out-error rates varying from 4% to 9% with the exception of the confusion between Mozart and Haydn which yielded a leave-one-out-error rate of 24%. A second experiment included 30 fugues from J.S. Bach, W.F. Bach and J.L. Krebs, all of different style and character. With this data set of compositions of undisputed authorship, the F minor fugue for organ, BWV 534 (of which Bach's authorship is disputed) then was confronted. It could be concluded that there is experimental evidence that J.L. Krebs should be considered in all probability as the composer of the fugue in question.