ppxscal/embedding_network huggingface dataset:
Collaborative Spam Filtering Using E-Mail Networks
Authors: Joseph S. Kong, Behnam A. Rezaei, Nima Sarshar, Vwani P. Roychowdhury, P. Oscar Boykin
Venue: Computer (2006)

A distributed spam-filtering system that leverages e-mail networks' topological properties is more efficient and scalable than client-server-based solutions. Large-scale simulations of a prototype system reveal that this approach achieves a near-perfect spam detection rate while minimizing bandwidth cost.
Generic Visualization and Manipulation Framework for Three-Dimensional Medical Environments
Authors: Brian S. Tani, Tiago Nobrega, Thiago R. dos Santos, Aldo von Wangenheim
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

We present a visualization and manipulation framework for three-dimensional medical environments. The MVC architecture of the framework allows the use of different API technologies such as OpenGL and Direct3D, different model representations, and controllers. This facilitates the implementation of medical applications offering resources commonly needed by such systems. Two case studies are shown as examples of such applications.
Unified Presentation Contents Retrieval Using Laser Pointer Information
Authors: Wataru NAKANO, Yuta OCHI, Takashi KOBAYASHI, Yutaka KATSUYAMA, Satoshi NAOI, Haruo YOKOTA
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We have proposed unifying presentation contents, such as lecture video and presentation slides used in lectures, using metadata. For the unified contents, we have also proposed a search mechanism named UPRISE (Unified Presentation Slide Retrieval by Impression Search Engine). In this paper, we focus on the position, count, and duration information of a laser pointer, and propose a retrieval method using the information. In proposed method, we extract the position of laser pointer from video, and choose a sentence near the laser pointer position with a number of candidates. We evaluate our approach by applying it to actual presentation contents.
Multi-Dimensional Packet Classification Using Tuple Space Based on Bit-Parallelism
Authors: Xue-Guang Wang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

With the development of the Internet, routers must support extra functions such as packet filtering, QOS and traffic billing in addition to the routing lookup. The input packets should be processed at wire speed to meet these demands. Bit-Parallelism is a fast scheme for packet classification, but it scales poorly as the filter databases grow in size. In this paper, by taking the Bit-Parallelism scheme and introducing the ideas of bitmap mapping and tuple space, we present a new algorithm. The new algorithm reduces the complexities of both the time and space and it can scale well with the growth of the filter databases in size. At the end of this paper, we have realized the algorithm in a virtual environment and analyze the experimental data.
An Enhancement of Reeb Graph for Modeling Hydrogeological Information
Authors: Rungwit Laichuthai, Pizzanu Kanongchaiyos
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

Creating 3D geographical simulations have been useful to many applications of geological information. Generally, typical CG simulations cannot properly and accurately represent the multilayer geographical data, due to the lack of ability to display the relations or connections between each soil layer. Also, there are errors in the position of soil layers, and classification of soil layers which does not correspond to the actual data. This research therefore presents a 3D hydrogeological data which can display the complex internal structure of soil layer classification, and can calculate required geological information, such as the position of soil layers, the cross section of soil layers and height contours, accurately in correspondence to the actual data. Calculation to create the simulation begins by specifying the position of each soil layer, and then creating a surface for each soil layer by estimating from the received depth inputs, to calculate the cross section of each soil layer at critical heights calculated based on Morse theory. After that, we create the Reeb graph to create the surface and the complete internal structure of the geological information, which can be displayed in three-dimensions, with the ability to display soil layer cross sections and the soil layer structure, and it can also be used to represent and store the geographical information systematically for efficient retrieval.
An Efficient Token-based Approach for Web-Snippet Clustering
Authors: Jianchao Li, Tianfang Yao
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Online clustering of the results returned by search engines becomes prevailing in recent times. It addresses the problem of too many records returned by current search engines, which renders the manual search of actually desired information difficult, especially if the query encompasses several subtopics. Clustering is a useful technique to group records to clusters and thereby make it more convenient to retrieve information of interest. We first propose an innovative approach by using tokens as basic units for clustering, which avoids segmentation for oriental languages and can be applied to any language. Second, we introduce a Directed Probability Graph (DPG) model that identifies meaningful phrases as cluster labels using statistical methods without any external knowledge. The clustering procedure is performed without calculating the similarity between pair-wise documents. As shown by our experiments, our clustering algorithm is very efficient and suitable for online Web-snippet clustering.
Problems of regular behaviour and deterministic chaos in mathematical models of Mendelian limited populations
Authors: E. Y. Frisman, E. A. Kolbina, O. L. Zdanova
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

We investigate the fitness differences model with Mendelian one-locus di-allele limited population in cases of linear and exponential rules of selection. We present an analytical and numerical investigation of the model. The possibility of population number fluctuations with stable genetic structure was shown. Also found were joint fluctuations of genetic structure and population number. This result contradicts the well-known hypothesis of "genetic control" . The stable chaotic attractors with non-integer dimensions were found. It was made the generalization of model for polyallele population with some admissions and its analytical investigation was carried out.
Extending EER Modeling Concepts for Biological Data
Authors: Ramez Elmasri, Feng Ji, Jack Fu, Yiming Zhang, Zoe Raja
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Biological data such as protein structure and function, DNA sequences, and metabolic pathways require conceptual modeling characteristics that are not available in the widely used ER (Entity-Relationship) model and its variant the EER (enhanced-ER) model. In this paper, we suggest a solution to this problem, requiring only minimal changes to the EER model by introducing specialized formal relationships for ordering, input/output processes and spatial structure. These changes facilitate more accurate modeling of biological ontologies, their structures, and mediator systems. We propose new EER schema constructs to represent the ordering of DNA sequences, the structure of proteins, and the processes of metabolic pathways.
Decomposition of a linear-quadratic optimal control problem with fast and slow variables
Authors: N. V. Voropaeva, V. A. Sobolev
Venue: Automation and Remote Control (2006)

A linear-quadratic optimal control problem for a discrete different time-scale system is studied. The decomposition of the boundary value problem for the maximum principle is based on the geometric approach using the properties of invariant manifolds of slow and fast motions. This approach aids in constructing a transformation for reducing the initial problem to a boundary-value problem for slow variables and two initial-value problems for fast variables. The transformation is expressed as an asymptotic siries in powers of a small parameter.
Design and Implementation of the Intelligent Multi-Agent System Based on Web Services
Authors: Minwoo Son, Dongil Shin, Dongkyoo Shin
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

Automatic controls of multiple user devices along with intelligent web information services become one of the most important enabling technologies for ubiquitous computing. In this paper, we analyze the issues related to multi-agent and the OSGi (Open Service Gateway Initiative) service platform, which include a manual resource discovery, manual service dependency resolution, non-distributed system, etc. Then, we presents the intelligent Multi-Agent System based on the proposed architecture is the most capable at efficiently managing various service bundles. We conclude the implementation results for the Intelligent Multi-Agent System.
PD3: a handheld observation tool to support instructional leadership
Authors: Mark Chung, William R. Penuel
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

We designed and developed a handheld classroom walkthrough to support data-based decision making about professional development and school improvement planning. We used methods of participatory design to maximize the usability and value of our technology to policymakers, school leaders, and teachers, who had different and conflicting goals and concerns. We describe design decisions that met their constraints and led to a tool with potential for wide adoption, and impact at the local level.
Reduction of the Communication Traffic for Multi-word Searches in DHTs
Authors: Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In large-scale wireless networks, efficient file searching mechanisms are essential for users. Many studies have been done on a distributed hash tables (DHTs) which are one kind of peer-to-peer system. I n DHT networks, we can certainly and effectively get the desired files i f they exist. However, much communication traffic comes from multi-word searches. If we increase the storage redundancy, we can reduce the traffic. However, storage constrains of mobile devices make doing so impossible. I n our previous work, we proposed a divided bloom filter to reduce the traffic in DHTs. However, the effect of divided bloom filters depends strongly on their parameters, and optimizing them is difficult. Hence, we have developed and tested the method to determine optimum parameters of divided bloom filters.
A simplified approach to web service development
Authors: Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Most languages used for developing web services and clients exhibit properties which make calling remote functions across a network a non-trivial task. The type systems used by object oriented languages have many incompatibilities with those required for service interfaces, and the complicated tasks of generating proxy objects and WSDL service definitions mean that a lot of effort is required to create a service, in comparison with defining classes and functions to be used locally. We discuss the problems with existing systems and propose a new model for web services development based on an implementation of XSLT that we are currently developing. This provides a number of features useful for distributed applications such as automatic fault tolerance and load balancing, as well as a seamless mechanism for exposing and accessing web services.
Level-of-detail based modeling of object movement in tracking and surveillance system
Authors: Jianfeng Peng, Lizhi Yang, Faisal Momen, Jerzy W. Rozenblit
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper proposes a Level-of-Detail (LOD) based method for modeling object movement in wireless sensor network tracking and surveillance applications. This method addresses the dilemma of achieving maximum information with limited power and bandwidth in wireless sensor network. LOD provides the researchers with various fidelity levels of data to perform such tasks as regional traffic statistics analysis, object classification and clustering, and at the highest level, object behavior analysis. A simulation test bed extracted from the sensor network hardware platform is being built to allow users to easily generate objects with various behavioral models, design three-dimensional sensor deployment layouts and related surveillance environments, test the accuracy and efficiency of tracking, and calculate lifetime of system and power consumption. An illustrative experiment with preliminary results is provided at the end of this paper.
Text Mining of Business News for Forecasting
Authors: Petr Kroha, Ricardo Baeza-Yates, Bjorn Krellner
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In this paper, we analyze the relation between the content of business news and long-term market trends. We describe cleansing and classification of business news, we investigate how much similarity good news and bad news have, and how their ratio behaves in context of long-terms market trends. We have processed more than 400 thousand business news coming from the years 1999 to 2005. We present results of our experiments and their possible impact on forecasting of long-term market trends.
Unsupervised Discovery of Action Classes
Authors: Yang Wang, Hao Jiang, Mark S. Drew, Ze-Nian Li, Greg Mori
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

In this paper we consider the problem of describing the action being performed by human figures in still images. We will attack this problem using an unsupervised learning approach, attempting to discover the set of action classes present in a large collection of training images. These action classes will then be used to label test images. Our approach uses the coarse shape of the human figures to match pairs of images. The distance between a pair of images is computed using a linear programming relaxation technique. This is a computationally expensive process, and we employ a fast pruning method to enable its use on a large collection of images. Spectral clustering is then performed using the resulting distances. We present clustering and image labeling results on a variety of datasets.
Simultaneous detection and frequency estimation of sinusoidal signals
Authors: P. M. Djuric
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A novel Bayesian approach to detection-estimation of complex sinusoids and their frequencies is proposed. Based on Bayesian predictive densities, an objective function is derived whose minimization yields the optimal number of sinusoids and the estimates of their frequencies. This function is similar in form to the well known minimum description length (MDL) principle and Akaike's information criteria (ALC) in the sense that it also consists of data and penalty terms. The minimization of the data term provides the frequency estimates, and the overall minimization yields the detected number of sinusoids. The simulation results show excellent performance.
Who gets spammed?
Authors: Il-Horn Hann, Kai-Lung Hui, Yee-Lin Lai, S.Y.T. Lee, I.P.L. Png
Venue: Communications of the ACM (2006)

Spam is no random event, but specifically targets those with purchasing power.
Construction of a fault-tolerant wireless communication topology using distributed agreement
Authors: Heinrich Moser, Bernd Thallner
Venue: Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks (2006)

This paper presents a proven correct implementation of a distributed topology construction algorithm based upon agreement on minimal-weight clusters for creating a k - regular, k -node connected fault-tolerant communication network. It adapts to crashing nodes, moving nodes and changing communication cost and is guaranteed to converge. We analyze the requirements imposed upon the system model by this class of agreement-based algorithms and show that our implementation works in asynchronous distributed systems augmented with unreliable failure detectors.
Formal Modelling and Verification of an Asynchronous Extension of SOAP
Authors: Maurice H. ter Beek, Stefania Gnesi, Franco Mazzanti, Corrado Moiso
Venue: Proceedings of the European Conference on Web Services (2006)

Current web services are largely based on a synchronous request-response model that uses the Simple Object Access Protocol SOAP. Next-generation telecommunication networks, on the contrary, are characterised by the need to handle asynchronous interactions among distributed service components, e.g., to deal with long-running computations and with events produced by the network resources. As these worlds are more and more converging into a single application context, several solutions have been proposed to deal with asynchronous events in the context of web services. In this paper we formalise and verify one such approach, viz., an original asynchronous extension of SOAP, and draw some conclusions. The formal model is specified as a set of communicating state machines. The semantics of the model is seen as a doubly-labelled transition system, and its behavioural properties are expressed in the actionand state-based temporal logic \mu-UCTL and verified with the on-the-fly model checker UMC.
General-purpose 3D animation with VITASCOPE
Authors: Vineet R. Kamat, Julio C. Martinez
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper presents VITASCOPE, a general-purpose, user-extensible 3D visualization system for animating processes that are modeled using Discrete-Event Simulation tools. VITASCOPE is an ASCII stream driven 3D animation tool that runs readily on a wide variety of hardware platforms ranging from commonly used desktops and laptops to high-end, room-sized, immersive virtual environments such as the CAVE. VITASCOPE parses and interprets an ASCII stream, and imports and manipulates existing 3D CAD models of the simulated system entities to visually depict modeled processes. The used CAD models may be created in any CAD modeling package capable of exporting models in the VRML format. VITASCOPE's architecture is open and loosely-coupled, thus allowing it to serve as a post-processed or concurrent 3D visualization engine for simulation models created in a wide variety of languages and tools. VITASCOPE is built on the industry standard OpenGL graphics library and runs on Windows and Irix based workstations.
Updating XML views published over relational databases: towards the existence of a correct update mapping
Authors: Ling Wang, Elke A. Rundensteiner, Murali Mani
Venue: Data Knowledge Engineering (2006)

XML data management using relational database systems has been intensively studied in the last few years. However, in order for such systems to be viable, they must support not only queries, but also updates over virtual XML views that wrap the relational data. While view updating is a long-standing difficult issue in the relational context, the flexible XML data model and nested XML query language both pose additional challenges for view updating.This paper addresses the question, if for a given update over an XML view, a correct relational update translation exists. First, we propose a clean extended-source theory as criteria for determining whether a given translation mapping is correct. To determine the existence of such a correct mapping, we classify a view update as either un-translatable, conditionally or unconditionally translatable under a given update translation policy. This classification depends on several features of the XML view and the update: (a) granularity of the update at the view side, (b) properties of the view construction, and (c) types of duplication appearing in the view. These features are represented in the Annotated Schema Graph. This is further utilized by our Schema-driven Translatability Reasoning algorithm (STAR) to classify a given update into one of the three above update categories. The correctness of the algorithm is proven using our clean extended-source theory. This technique represents a practical approach that can be applied by any existing view update system in industry and academia for analyzing the translatability of a given update statement before translation of it is attempted. To illustrate the working algorithm, we provide a concrete case study on the translatability of XML view updates.
Are GSM Phones THE Solution for Localization?
Authors: Alex Varshavsky, Mike Y. Chen, Eyal de Lara, Jon Froehlich, Dirk Haehnel, Jeffrey Hightower, Anthony LaMarca, Fred Potter, Timothy Sohn, Karen Tang, Ian Smith
Venue: Proceedings of the Seventh IEEE Workshop on Mobile Computing Systems & Applications (2006)

In this paper, we argue that localization solution based on cellular phone technology, specifically GSM phones, is a sufficient and attractive option in terms of coverage and accuracy for a wide range of indoor, outdoor, and placebased location-aware applications. We present preliminary results that indicate that GSM-based localization systems have the potential to detect the places that people visit in their everyday lives, and can achieve median localization accuracies of 5 and 75 meters for indoor and outdoor environments, respectively.
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
Authors: Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V,E) is a subset S of V such that every node v \in V \ S has at least k neighbors in S. We study the problem in two network models. In general graphs, for arbitrary parameter t, we propose a distributed algorithm that runs in time O(t^2) and achieves an approximation ratio of O(t\delta^2/t log\delta), where n and \delta denote the number of nodes in the network and the maximal degree, respectively. When the network is modeled as a unit disk graph, we give a probabilistic algorithm that runs in time O(log log n) and achieves an O(1) approximation in expectation. Both algorithms require only small messages of size O(log n) bits.