ppxscal/embedding_network huggingface dataset:
Packet classification in large ISPs: design and evaluation of decision tree classifiers
Authors: Edith Cohen, Carsten Lund
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Packet classification, although extensively studied, is an evolving problem. Growing and changing needs necessitate the use of larger filters with more complex rules. The increased complexity and size pose implementation challenges on current hardware solutions and drive the development of software classifiers, in particular, decision-tree based classifiers. Important performance measures for these classifiers are time and memory due to required high throughput and use of limited fast memory.We analyze Tier 1 ISP data that includes filters and corresponding traffic from over a hundred edge routers and thousands of interfaces. We provide a comprehensive view on packet classification in an operational network and glean insights that help us design more effective classification algorithms.We propose and evaluate decision tree classifiers with common branches. These classifiers have linear worst-case memory bounds and require much less memory than standard decision tree classifiers, but nonetheless, we show that on our data have similar average and worst-case time performance. We argue that common-branches exploit structure that is present in real-life data sets.We observe a strong Zipf-like pattern in the usage of rules in a classifier, where a very small number of rules resolves the bulk of traffic and most rules are essentially never used. Inspired by this observation, we propose traffic-aware classifiers that obtain superior average-case and bounded worst-case performance. Good average-case can boost performance of software classifiers that can be used in small to medium sized routers and are also important for traffic analysis and traffic engineering.
An experience with an enriched task model for educational software
Authors: Raquel Oliveira Prates, Rosa Maria Videira de Figueiredo
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The educational domain brings new issues and specific requirements to interface design. Often traditional HCI principles and guidelines need to be disregarded or broken in order to allow for the intended learning to take place [1, 6]. How to adapt existing HCI methods and techniques to this domain is still an open issue for the HCI and Education fields [5]. In this paper we propose the Scaffold Representation Model (SRM), which allows intended educational support for learners in the application to be abstractly described. The model allows for the generation of educational information that can be added to a traditional HCI task model. We describe an experiment in which SRM was used in the design of a learning support system and its contribution to the process of design.
Color Image Adaptive Clustering Segmentation
Authors: Guizhi Li, Chengwan An, Jie Pang, Min Tan, Xuyan Tu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents an adaptive clustering segmentation approach based on fuzzy entropy and Rival Penalized Competitive Learning (RPCL) for color image. It can adaptively acquire appropriate number of color clusters and their centers of color image. Firstly, fuzzy entropy approach is applied to smooth color componentsý histograms and centers of each color component are determined. Then these centers of different color components are combined to form initial centers for RPCL. Finally, RPCL converges some of initial centers to actual centers of original color image and pushes other initial centers away and image is segmented by the former learned centers. The experiment shows that the method can effectively and adaptively segment color images without specifying the number of initial clusters in advance.
First evaluation of a novel tactile display exerting shear force via lateral displacement
Authors: Knut Drewing, Michael Fritschi, Regine Zopf, Marc O. Ernst, Martin Buss
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Based on existing knowledge on human tactile movement perception, we constructed a prototype of a novel tactile multipin display that controls lateral pin displacement and, thus produces shear force. Two experiments focus on the question of whether the prototype display generates tactile stimulation that is appropriate for the sensitivity of human tactile perception. In particular, Experiment I studied human resolution for distinguishing between different directions of pin displacement and Experiment II explored the perceptual integration of information resulting from the displacement of multiple pins. Both experiments demonstrated that humans can discriminate between directions of the displacements, and also that the technically realized resolution of the display exceeds the perceptual resolution (>14&deg;). Experiment II demonstrated that the human brain does not process stimulation from the different pins of the display independent of one another at least concerning direction. The acquired psychophysical knowledge based on this new technology will in return be used to improve the design of the display.
On the Absolute Quadratic Complex and Its Application to Autocalibration
Authors: J. Ponce, K. McHenry, T. Papadopoulo, M. Teillaud, B. Triggs
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This article introduces the absolute quadratic complex formed by all lines that intersect the absolute conic. If ¿ denotes the 3 × 3 symmetric matrix representing the image of that conic under the action of a camera with projection matrix {\rm P}, it is shown that \omega\approx \overline {\rm P} \underline \Omega\overline {\rm P} ^{\rm T}, where {\rm P} is the 3 × 6 line projection matrix associated with {\rm P}, and \underline \Omegais a 6 × 6 symmetric matrix of rank 3 representing the absolute quadratic complex. This simple relation between a camera's intrinsic parameters, its projection matrix expressed in a projective coordinate frame, and the metric upgrade separating this frame from a metric one.as respectively captured by the matrices ¿, \overline {\rm P}, and \underline \Omega ¿ provides a new framework for autocalibration, particularly well suited to typical digital cameras with rectangular or square pixels since the skew and aspect ratio are decoupled from the other intrinsic parameters in ¿.
An Integrated Course Based on Educational Games
Authors: Hye Sun Kim, Seong Baeg Kim
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

It's not practical to integrate efficiently two subjects in face-to-face education. In this paper, by applying web technology effectively, we develop a web-based integrated course about the subjects like computing and English, which represent heterogeneity between each other from the perspective of discipline. We present the integrated course structure and lesson plans at middle schools. Also, we show that our interdisciplinary approach could be plausible and effective by using both web technology and a variety of quiz & game-based learning materials. Specially, we develop the various types of educational games, which can be orthogonal to learning contents by constructing them through the parameters. Then, we evaluate the learning effects after teaching students the lesson using the lesson plans devised. The results show that the students in the integrated course did better than those in the traditional one in achieving the learning objectives given.
Connectedness of digraphs and graphs under constraints on the conditional diameter
Authors: X. Marcote, C. Balbuena, J. Fàbrega
Venue: Networks (2005)

Given a digraph G with minimum degree &delta; and an integer 0&le; &nu; &le; &delta;, consider every pair of vertex subsets V1 and V2 such that both the minimum out-degree of the induced subdigraph G&lsqb;V1&rsqb; and the minimum in-degree of G&lsqb;V2&rsqb; are at least &nu;. The conditional diameter D&nu; of G is defined as the maximum of the distances d&lpar;V1, V2&rpar; between any two such vertex subsets. Clearly, D0 is the standard diameter and D0 &ge; D1 &ge; &middot;&middot;&middot; &ge; D&delta; holds. In this article, we guarantee appropriate lower bounds for the connectivities and superconnectivities of a digraph G when D&nu; &le; h&lpar;&ell;&pi;&rpar;, h&lpar;&ell;&pi;&rpar; being a function of the parameter &ell;&pi;&mdash;which is related to the shortest paths in G. As a corollary of these results, we give some constraints of the kind D&nu; &le; h&lpar;&ell;&pi;&rpar;, which assure that the digraph is maximally connected, maximally edge-connected, superconnected, or edge-superconnected, extending other previous results of the same kind. Similar statements can be obtained for a graph as a direct consequence of those for its associated symmetric digraph. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 80&ndash;87 2005
HPC Productivity: An Overarching View
Authors: Jeremy Kepner
Venue: International Journal of High Performance Computing Applications (2004)

The Defense Advanced Research Projects Agency (DARPA) High Productivity Computing Systems (HPCS) program is focused on providing a new generation of economically viable high productivity computing systems for national security and for the industrial user community. The value of a high performance computing (HPC) system to a user includes many factors, such as execution time on a particular problem, software development time, direct hardware costs, and indirect administrative and maintenance costs. This special issue, which focuses on HPC productivity, brings together, for the first time, a series of novel papers written by several distinguished authors who share their views on this topic. The topic of productivity in HPC is very new and the authors have been encouraged to speculate. The goal of this first paper is to present an overarching context and framework for the other papers and to define some common ideas that have emerged in considering the problem of HPC productivity. In addition, this paper defines several characteristic HPC workflows that are useful for understanding how users exploit HPC systems, and discusses the role of activity and purpose benchmarks in establishing an empirical basis for HPC productivity.
E-government and NPM: a perfect marriage?
Authors: Vincent Homburg
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

E-Government and New Public Management (NPM) are two concepts that are often used in discussions about modernizing government. Both concepts refer to various forms of reform of the public sector and, at least to a certain degree, address the same problems public administration is nowadays confronted with (lack of accountability, underperformance and diminished level of legitimacy, to name a few).The fact that e-government and new public management address the same problems does not imply that the contents of these concepts indeed overlap. Both concepts comprise heterogeneous elements and multiple dimensions; intuitively, some of these elements may be understood as overlapping, but a clear conceptual framework indicating where new public management and E-government overlap and reinforce one another, is lacking.Based on theoretical and empirical evidence, a framework for classification of reforms is presented. The framework highlights various types of reforms, and identifies requirements for architectures and accountability routes in technological and institutional reforms.
Friendships that last: peer lifespan and its role in P2P protocols
Authors: Fabian E. Bustamante, Yi Qiao
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

We consider the problem of choosing who to "befriend" among a collection of known peers in distributed P2P systems. In particular, our work explores a number of P2P protocols that, by considering peers' lifespan distribution a key attribute, can yield systems with performance characteristics more resilient to the natural instability of their environments.This article presents results from our initial efforts, focusing on currently deployed decentralized P2P systems. We measure the observed lifespan of more than 500,000 peers in a popular P2P system for over a week and propose a functional form that fits the distribution well. We consider a number of P2P protocols based on this distribution, and use a trace-driven simulator to compare them against alternative protocols for decentralized and unstructured or loosely-structured P2P systems. We find that simple lifespan-based protocols can reduce the ratio of connection breakdowns and their associated costs by over 42%.
A Rational Function Lens Distortion Model for General Cameras
Authors: David Claus, Andrew W. Fitzgibbon
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We introduce a new rational function (RF) model for radial lens distortion in wide-angle and catadioptric lenses, which allows the simultaneous linear estimation of motion and lens geometry from two uncalibrated views of a 3D scene. In contrast to existing models which admit such linear estimates, the new model is not specialized to any particular lens geometry, but is sufficiently general to model a variety of extreme distortions. The key step is to define the mapping between image (pixel) coordinates and 3D rays in camera coordinates as a linear combination of nonlinear functions of the image coordinates. Like a "kernel trick", this allows a linear algorithm to estimate nonlinear models, and in particular offers a simple solution to the estimation of nonlinear image distortion. The model also yields an explicit form for the epipolar curves, allowing correspondence search to beefficiently guided by the epipolar geometry. We show results of an implementation of the RF model in estimating the geometry of a real camera lens from uncalibrated footage, and compare the estimate to one obtained using a calibration grid.
PDE-Based Robust Robotic Navigation
Authors: M. Sabry Hassouna, Alaa E. Abdel-Hakim, A. A. Farag
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper, we propose a general, robust, and fast path planning framework for robotic navigation using level set methods. A medial point of the map is selected automatically to be a point source that transmits two wave fronts of different speeds. The first front propagates with a moderate speed to capture the map topology, while the second one propagates much faster at medial points such that the safest paths intersect the propagating fronts at those points of maximum positive curvature, which are identified by solving an ordinary differential equation (ODE). The motion of the front is governed by a nonlinear partial differential equation (PDE), which is efficiently solved using robust level set methods. The framework is general in the sense that it can be used for both 2D and 3D environments. It generates a collision-free optimum paths for partial or complete configuration space. Optimum planned paths can be controlled according to the surrounding environment and running conditions in order to follow the safest, shortest, or hybrid paths. We demonstrate the robustness of the proposed method by correctly extracting planned paths of complex maps with several obstacles.
XML stream transformer generation through program composition and dependency analysis
Authors: Susumu Nishimura, Keisuke Nakano
Venue: Science of Computer Programming (2005)

XML stream transformation, which sequentially processes the input XML data on the fly, makes it possible to process large sized data within a limited amount of memory. Though being efficient in memory-use, stream transformation requires stateful programming, which is error-prone and hard to manage.This paper proposes a scheme for generating XML stream transformers. Given an attribute grammar definition of transformation over an XML tree structure, we systematically derive a stream transformer in two steps. First, an attribute grammar definition of the XML stream transformation is inferred by applying a program composition method. Second, a finite state transition machine is constructed through a dependency analysis. Due to the closure property of the program composition method, our scheme also allows modular construction of XML stream transformers.We have implemented a prototype XML stream transformer generator, called altSAX. The experimental results show that the generated transformers are efficient in memory consumption as well as in execution time.
FCD: A Framework for Compositional Development in Open Embedded Systems
Authors: Ying Qiao, Valdis Berzins, Luqi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In open embedded systems, configuration changes are likely to have negative impact on the certified properties of existing component systems. Although many design methodologies have been proposed for building open embedded systems in recent years, none of them provides an efficient way to enable reuse of certified components of resource-sensitive systems without repeating the performance and scheduling analysis that guarantees critical timing and behavioral properties of systems. To tackle this problem, in this paper we present a framework for compositional development of open embedded systems, called FCD. This framework uses processor partition to reduce the interdependency of applications and provides a set of synthesis methods to isolate the certified properties of unchanged components of the system from configuration changes.
Exploiting the web for point-in-time file sharing
Authors: Roberto J. Bayardo, Sebastian Thomschke
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We describe a simple approach to "point-in-time" file sharing based on time expiring web links and personal webservers. This approach to file sharing is useful in environments where instant messaging clients are varied and don't necessarily support (compatible) file transfer protocols. We discuss the features of such an approach along with a successfully deployed implementation now in wide use throughout the IBM corporation.
A Weighted Nearest Mean Classifier for Sparse Subspaces
Authors: Cor J. Veenman, David M. J. Tax
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standpoint, such small sample size problems have some interesting challenges. First, in any subspace with as many dimensions as objects the data set can be separated with an almost arbitrary linear hyperplane. Second, another important issue is to determine which features are responsible for the phenomenon under consideration. This problem comes down to finding as few features as possible that still can discriminate the classes involved. To attack these problems, we propose the LESS (Lowest Error in a Sparse Subspace) classifier. The LESS classifier is a weighted nearest mean classifier that efficiently finds linear discriminants in sparse subspaces, where the subspace is found automatically. In the experiments we compare LESS to related state-of-the-art classifiers like among others linear ridge regression with the LASSO and the Support Vector Machine. It turns out that LESS performs competitively while it uses the fewest features.
Teaching wireless networking with limited resources
Authors: Benjamin Stull
Venue: Journal of Computing Sciences in Colleges (2004)

In recent years, we have developed applications for teaching both wired and wireless networking. These applications have been written for the Cybiko personal digital assistant, an inexpensive alternative to other hardware. Unfortunately, the Cybiko PDA was recently discontinued. As a result, these applications had to be ported to other platforms to remain useful. Instead of porting each application to individual platforms, which would prove to be extremely time consuming because of other API's and networking protocols, we created the Vassar College Messaging Layer. This layer abstracts the Cybiko networking structure and interface, allowing Cybiko applications to be ported to other platforms with minimal code alteration.
Virtual Grasping for Virtual Assembly Tasks
Authors: Huagen Wan, Shuming Gao, Qunsheng Peng
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Intuitive and natural interactions are key aspects of virtual assembly applications. In this paper, we present intuitive virtual hand interactions with parts, subassemblies and tools. Grasping patterns are developed based on the abstraction of various mechanic shapes, kinematics model of virtual hand is built upon the anatomic structure of the human hand to guarantee motion realism, and real-time collision detection scheme is used to identify whether the current finger configuration matches a specific grasping pattern. Experiments on assembly models with a CyberGlove dataglove show that our virtual grasping scheme works well for virtual assembly tasks.
Efficient breadth-first mining of frequent pattern with monotone constraints
Authors: Francesco Bonchi, Fosca Giannotti, Alessio Mazzanti, Dino Pedreschi
Venue: Knowledge and Information Systems (2005)

The key point of this article is that, in frequent pattern mining, the most appropriate way of exploiting monotone constraints in conjunction with frequency is to use them in order to reduce the input data; this reduction in turn induces a stronger pruning of the search space of the problem. Following this intuition, we introduce ExAMiner, a breadth-first algorithm that exploits the real synergy of antimonotone and monotone constraints: the total benefit is greater than the sum of the two individual benefits. ExAMiner generalizes the basic idea of the preprocessing algorithm ExAnte (Bonchi et al. 2003(b)), embedding such ideas at all levels of an Apriori-like computation. The resulting algorithm is the generalization of the Apriori algorithm when a conjunction of monotone constraints is conjoined to the frequency antimonotone constraint. Experimental results confirm that this is, so far, the most efficient way of attacking the computational problem in analysis.
Heterogeneous Search in Unstructured Peer-to-Peer Networks
Authors: Xiuguo Bao, Binxing Fang, Mingzhen Hu, Binbin Xu
Venue: IEEE Distributed Systems Online (2005)

Distributed search has become a very important research area in light of the proliferation of peer-to-peer networks and grids, which heavily rely on the effectiveness of forwarding algorithms to propagate queries among peers. Most present search techniques apply homogeneous forwarding logic in each peer. None of these forwarding algorithms is perfect. This article introduces heterogeneous search, a promising approach for improving search performance through the use of multiple forwarding algorithms among peers in unstructured P2P networks. Simulation results demonstrate that this technique shows significant advantages over others.