ppxscal/embedding_network huggingface dataset:
A Performance Comparison of On-Demand Routing Protocols for Application Data in Mobile Ad hoc Networks
Authors: Kil Sup Lee, Sung Jong Lee, Yeon Ki Chung
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Recently, many researchers have become interested in Mobile Ad hoc Networks (MANET) to construct a selfconfigurable network without existing communication infrastructure. In this paper we focus on the performance of on-demand routing protocols such as DSR, AODV, and TORA in MANET. We have observed the performance change of each protocol through simulations with varying the application data such as sensor, text, voice, and video data. And then, we have evaluated the performance of three protocols in a predesigned ad hoc network, which has 20 mobile nodes. We have also assumed the link layer as the IEEE 802.11 wireless LAN. We have analyzed the simulation results with respect to packet delivery fraction, average end-toend delay, routing load for application data. Then, we present the possible alternative to routing protocols and wireless characteristics for the types of application data. Moreover, we believe that research result can be helpful to the community with similar interest.
GASP: un intergiciel pour les jeux en r&eacute;seaux multijoueurs sur t&eacute;l&eacute;phones mobiles
Authors: R. Pellerin, F. Delpiano, E. Gressier-Soudan, M. Simatic
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

This paper describes an ongoing work. We are designing and implementing a library of services dedicated to multiplayer on-line games for mobile phones. This library, called GASP, conforms to Open Mobile Alliance (OMA) v2.0 specifications. It is implemented in Java and offers a server and a client part. The latter is defined for MIDP 2.0 and DOJA 1.5 J2ME profiles. GASP v1.O implements partially OMA specification: We are working on a new version more complete.
Mobility Patterns
Authors: Cédric Mouza, Philippe Rigaux
Venue: Geoinformatica (2005)

We present a data model for tracking mobile objects and reporting the result of queries. The model relies on a discrete view of the spatio-temporal space, where the 2D space and the time axis are respectively partitioned in a finite set of user-defined areas and in constant-size intervals. We define a generic query language to retrieve objects that match mobility patterns describing a sequence of moves. We also identify a subset of restrictions to this language in order to express only deterministic queries for which we discuss evaluation techniques to maintain incrementally the result of queries. The model is conceptually simple, efficient, and constitutes a practical and effective solution to the problem of continuously tracking moving objects with sequence queries.
Notes for a survey of text editors and formatters
Authors: Jonathan Sachs
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

I've had experience with only two formatters: FORMAT and FMT. I can't think of anything worth doing that FORMAT does better than FMT, so I'll largely ignore the former. I'll mainly be reacting to FMT: the things it does that I like, and the things it lacks that I want. 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
Databases for Research on Recognition of Handwritten Characters of Indian Scripts
Authors: U. Bhattacharya, B. B. Chaudhuri
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Three image databases of handwritten isolated numerals of three different Indian scripts namely Devnagari, Bangla and Oriya are described in this paper. Grayscale images of 22556 Devnagari numerals written by 1049 persons, 12938 Bangla numerals written by 556 persons and 5970 Oriya numerals written by 356 persons form the respective databases. These images were scanned from three different kinds of handwritten documents postal mails, job application form and another set of forms specially designed by the collectors for the purpose. The only restriction imposed on the writers is to write each numeral within a rectangular box. These databases are free from the limitations that they are neither developed in laboratory environments nor they are non-uniformly distributed over different classes. Also, for comparison purposes, each database has been properly divided into respective training and test sets.
Stochastic Voting Algorithms for Web Services Group Testing
Authors: W. T. Tsai, Dawei Zhang, Raymond Paul, Yinong Chen
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

This paper proposes a stochastic voting for testing a large number of Web Services (WS) under group testing. In the future, a large number of WS will be available and they need to be tested and evaluated in real time. While numerous test input generation techniques are available to generate test inputs, the oracle or the expected output of these test input is often difficult to obtain. One way to obtain the oracle in this case is to give the same input to multiple WS and to establish the oracle by a majority voting. This is based on the assumption that faulty WS often will not produce consistent results, and thus if a majority can be reached, the oracle can be established statistically. However, even correct WS may still produce slightly different outputs, and thus the majority-voting scheme must be carefully designed to distinguish correct but slightly variant output from truly incorrect output. This paper proposes a hierarchical classification based on simulated annealing and multi-dimensional Chisquare statistical techniques to analyze data to see if a majority can be reached. The algorithm is evaluated by a comprehensive simulated data as well as actual data. The data show that the proposed algorithm is effective even in a difficult situation where clusters of WS produce clusters of output.
Randomness is a belief
Authors: Henk Koppelaar, Leo Konst
Venue: ACM SIGSIM Simulation Digest (1976)

In "Randomness is Nonsense," Dr. Preston C. Hammer argues that a property (randomness) of a sequence which disappears on testing is not a property of the sequence. We feel randomness to be a matter of belief, which may be explained as follows:In observing a series of numbers one may view them to behave at random or totally predictable. The latter view is based on the fact that every number obeys laws of number theory <u>and</u> is based on the belief that if time and money are available to simulate the series of numbers we would be able to precisely predict the behavior of the series (for instance, via a nonlinear congruential method). So both views are a matter of belief. 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
Exact and heuristic algorithms for the q-mode problem
Authors: Girish Kulkarni
Venue:  (2005)

In this dissertation we focus on the development of exact and inexact (i.e., heuristic) algorithms for the q-mode problem. The exact algorithms are based on integer programming models for the q-mode problem. We discuss the theoretical properties of an existing IP model and propose several enhancements. We also propose a new IP model for the problem and investigate these models through a comprehensive computational experiment. These experiments reveal that, in practice, the IP models are more effective for instances with strong natural clusters but less effective for instances containing weak natural clusters. We also propose exact algorithms based on the Benders decomposition for one of the IP models. The heuristic algorithm that we propose for the q-mode problem is a local improvement algorithm that is based on a very large scale neighborhood structure. We evaluate the algorithm through a computational experiment and empirically demonstrate its effectiveness.
Data Alignment and Integration
Authors: Patrick Pantel, Andrew Philpot, Eduard Hovy
Venue: Computer (2005)

An information theory-based technology measures the importance of observations and leverages them to quantify the similarity between entities, improving accuracy and reducing the time required to find related entities in a population.
Ten years of Forth in ACM Sigplan Notices: part 1
Authors: Paul Frenger
Venue: ACM SIGPLAN Notices (2005)

So here we are: ten years of the ACM Sigplan Notices Forth Report is behind us. How amazing it is that we have reached this milestone! I hope that this column's longevity is a reflection of its popularity and perceived value to our readers.
Real Time Aerial Natural Image Interpretation for Autonomous Ranger Drone Navigation
Authors: Babak Majidi, Alireza Bab-Hadiashar
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

In this paper a method for real time interpretation of environmental features for use in visual navigation system of an Unmanned Aerial Vehicle (UAV) is presented. The proposed approach uses manually sampled colour values to classify different land covers. Colour information of a set of manually selected windows is compared to select the best attributes needed for discrimination between different land covers in various (natural) lighting conditions. Each frame is then partially scanned and desired environmental features are extracted and classified. The results show that the proposed technique meets the minimum speed and accuracy requirement of aforementioned application.
LBP Discriminant Analysis for Face Verification
Authors: Jiali Zhao, Haitao Wang, Haibing Ren, Seok-Cheol Kee
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

This paper presents a novel Local Binary Pattern (LBP) based Kernel Fisher Discriminant Analysis (KFDA) approach by integrating the LBP descriptor of face images and the KFDA method for face classifier. LBP extracts desirable facial features which consider both shape and texture information to cope with the variation due to facial expression and illumination changes. The KFDA method is then extended to take all the advantages of LBP descriptor for improved face verification performance. We introduce the kernel function by using Chi square statistic distance and RBF as inner product for KFDA classifier. The effectiveness of the LBP based KFDA method with Chi square statistic distance as inner product is shown in terms of comparison with original LBP and KFDA methods on FRGC database.
Deadline Spanning: A Graph Based Approach
Authors: Stefan M. Petters
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Microkernel based systems tend to depend heavily on IPC. This paper adresses the problem of a system response spanning more than one task in an embedded real-time system. The approach is based on a mix of classical response time analysis equations and a graph based approach to estimate the impact of different parts of the system on the time needed by the system to respond. This approach has the major advantage of being intuitive.
Uniform Application-level Access Control Enforcement of Organizationwide Policies
Authors: Tine Verhanneman, Frank Piessens, Bart De Win, Wouter Joosen
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Fine-grained and expressive access control policies on application resources need to be enforced in applicationlevel code. Uniformly enforcing a single policy (referred to as the organizationwide policy) in diverse applications is challenging with current technologies. This is due to a poor delimitation of the responsibilities of application deployer and security officer, which hampers a centralized management of a policy and therefore compromises the uniformity of its enforcement. To address this problem, the concept of an access interface is introduced as a contract between an organizationwide authorization engine and the various applications that need its services. The access interface provides support for the central management of the policy by the security officer. By means of a view connector, the application deployer ensures that each application complies with this contract, so that the policy can be enforced.
mRegistry: A Registry Representation for Fault Diagnosis
Authors: R. P. Jagadeesh Chandra Bose, S. H. Srinivasan
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Microsoft Windows uses the notion of registry to store all configuration information. The registry entries have associations and dependencies. For example, the paths to executables may be relative to some home directories. The registry being designed with faster access as one of the objectives does not explicitly capture these relations. In this paper, we explore a representation that captures the dependencies more explicitly using shared and unifying variables. This representation, called mRegistry exploits the tree-structured hierarchical nature of the registry, is concept-based and obtained in multiple stages. mRegistry captures intra-block, inter-block and ancestor-children dependencies (all leaf entries of a parent key in a registry put together as an entity constitute a block thereby making the block as the only child of the parent). In addition, it learns the generalized concepts of dependencies in the form of rules. We show that mRegistry has several applications: fault diagnosis, prediction, comparison, compression etc.
Some ideas of a "user" about simulation software: (esp. for continuous system simulation)
Authors: Inge Troch
Venue: ACM SIGSIM Simulation Digest (1984)

The following ideas are not new, but despite this it seems appropriate to reflect them once again.
BORDER: Efficient Computation of Boundary Points
Authors: Chenyi Xia, Wynne Hsu, Mong Li Lee, Beng Chin Ooi
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

This work addresses the problem of finding boundary points in multidimensional data sets. Boundary points are data points that are located at the margin of densely distributed data such as a cluster. We describe a novel approach called BORDER (a BOundaRy points DEtectoR) to detect such points. BORDER employs the state-of-the-art database technique—the Gorder kNN join and makes use of the special property of the reverse k nearest neighbor (RkNN). Experimental studies on data sets with varying characteristics indicate that BORDER is able to detect the boundary points effectively and efficiently.
Evaluation axes for medical image retrieval systems: the imageCLEF experience
Authors: Henning Müller, Paul Clough, William Hersh, Thomas Deselaers, Thomas Lehmann, Antoine Geissbuhler
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Content--based image retrieval in the medical domain is an extremely hot topic in medical imaging as it promises to help better managing the large amount of medical images being produced. Applications are mainly expected in the field of medical teaching files and for research projects, where performance issues and speed are less critical than in the field of diagnostic aid. Final goal with most impact will be the use as a diagnostic aid in a real--world clinical setting.Other applications of image retrieval and image classification can be the automatic annotation of images with basic concepts or the control of DICOM header information.ImageCLEF is part of the Cross Language Evaluation Forum (CLEF). Since 2004, a medical image retrieval task has been added. Goal is to create databases of a realistic and useful size and also query topics that are based on real--world needs in the medical domain but still correspond to the limited capabilities of purely visual retrieval at the moment. Goal is to direct the research onto real applications and towards real clinical problems to give researchers who are not directly linked to medical facilities a possibility to work on the interesting problem of medical image retrieval based on real data sets and problems. The missing link between computer science research departments and clinical routine is one of the biggest problems that becomes evident when reading much of the current literature on medical image retrieval. Most databases are extremely small, the treated problems often far from clinical reality, and there is no integration of the prototypes into a hospital infrastructure. Only few retrieval articles specifically mention problems related to the DICOM format (Digital Imaging and Communications in Medicine) and the sheer amount of data that needs to be treated in an image archive ( > 30.000 images per day in the Geneva radiology).This article develops the various axes that can be taken into account for medical image retrieval system evaluation. First, the axes are developed based on current challenges and experiences from ImageCLEF. Then, the resources developed for ImageCLEF are listed and finally, the application of the axes is explained to show the bases of the ImageCLEFmed evaluation campaign. This article will only concentrate on the medical retrieval tasks, the non-medical tasks will only shortly be mentioned.
An Intelligent Knowledge Sharing Strategy Featuring Item-Based Collaborative Filtering and Case Based Reasoning
Authors: Zeina Chedrawy, Syed Sibte Raza Abidi
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

In this paper, we propose a new approach for combining item-based Collaborative Filtering (CF) with Case Based Reasoning (CBR) to pursue personalized information filtering in a knowledge sharing context. Functionally, our personalized information filtering approach allows the use of recommendations by peers with similar interests and domain experts to guide the selection of information deemed relevant to an active user's profile. We apply item-based similarity computation in a CF framework to retrieve N information objects based on the user's interests and recommended by peer. The N information objects are then subjected to a CBR based compositional adaptation method to further select relevant information objects from the N retrieved past cases in order to generate a more fine-grained recommendation.
An Efficient Incremental Algorithm for Mining Web Traversal Patterns
Authors: Show-Jane Yen, Yue-Shi Lee, Min-Chi Hsieh
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Web mining is one of the mining technologies, which applies data mining techniques in large amount of web data to improve the web services. Web traversal pattern mining discovers most of the users' access patterns from web logs. This information can provide the navigation suggestions for web users such that appropriate actions can be adopted. However, the web data will grow rapidly in the short time, and some of the web data may be antiquated. The user behaviors may be changed when the new web data is inserted into and the old web data is deleted from web logs. Therefore, we must re-discover the user behaviors from the updated web logs. However, it is very time-consuming to re-find the users' access patterns. Hence, many researchers pay attention to the incremental mining in recent years. The essence of incremental mining is that it utilizes the previous mining results and finds new patterns just from the inserted or deleted part of the web logs such that the mining time can be reduced. In this paper, we propose an efficient incremental web traversal pattern mining algorithm. The experimental results show that our algorithm is more efficient than the other approaches.
Automatic Tuning of Inlining Heuristics
Authors: John Cavazos, Michael F. P. O'Boyle
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Inlining improves the performance of programs by reducing the overhead of method invocation and increasing the opportunities for compiler optimization. Incorrect inlining decisions, however, can degrade both the running and compilation time of a program. This is especially important for a dynamically compiled language such as Java. Therefore, the heuristics that control inlining must be carefully tuned to achieve a good balance between these two costs to reduce overall total execution time. This paper develops a genetic algorithms based approach to automatically tune a dynamic compiler's internal inlining heuristic. We evaluate our technique within the Jikes RVM [1] compiler and show a 17% average reduction in total execution time on the SPECjvm98 benchmark suite on a Pentium-4. When applied to the DaCapo benchmark suite, our approach reduces total execution time by 37%% outperforming all existing techniques.
The Cost of Data
Authors: Chris Suver
Venue: Queue (2005)

In the past few years people have convinced themselves that they have discovered an overlooked form of data. This new form of data is semi-structured. Bosh! There is no new form of data. What folks have discovered is really the effect of economics on data typing—but if you characterize the problem as one of economics, it isn’t nearly as exciting. It is, however, much more accurate and valuable. Seeing the reality of semi-structured data clearly can actually lead to improving data processing (in the literal meaning of the term). As long as we look at this through the fogged vision of a “new type of data,” however, we will continue to misunderstand the problem and develop misguided solutions to address it. It’s time to change this.
Mining Frequent Spatio-Temporal Sequential Patterns
Authors: Huiping Cao, Nikos Mamoulis, David W. Cheung
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Many applications track the movement of mobile objects, which can be represented as sequences of timestamped locations. Given such a spatio-temporal series, we study the problem of discovering sequential patterns, which are routes frequently followed by the object. Sequential pattern mining algorithms for transaction data are not directly applicable for this setting. The challenges to address are (i) the fuzziness of locations in patterns, and (ii) the identification of non-explicit pattern instances. In this paper, we define pattern elements as spatial regions around frequent line segments. Our method first transforms the original sequence into a list of sequence segments, and detects frequent regions in a heuristic way. Then, we propose algorithms to find patterns by employing a newly proposed substring tree structure and improving Apriori technique. A performance evaluation demonstrates the effectiveness and efficiency of our approach.