ppxscal/embedding_network huggingface dataset:
Doctoral Symposium at MODELS 2008
Authors: Alexander Pretschner
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

The doctoral symposium solicited submissions on research-in-progress that is meant to lead to a PhD dissertation. The goal of the symposium is to provide doctoral students with independent constructive criticismby written reviews of three members of the program committee; andby discussing their work with senior scientists and other doctoral studentsRegardless of whether or not the submission is accepted for presentation, students would hence benefit from submitting to the symposium.
Second HAREM: New Challenges and Old Wisdom
Authors: Diana Santos, Cláudia Freitas, Hugo Gonçalo Oliveira, Paula Carvalho
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

Discussion of the Second HAREM: changes to the guidelines, introduction of new tracks, improvement of evaluation measures and description of the new evaluation resources.
Improved Web Content Adaptation for Visual Aspect of Mobile Services
Authors: WonSeop Kim, DongHeon Jang, TaeYong Kim
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In conversion of web pages for mobile devices, the original intention of a web designer is often spoiled since the existing web conversion systems eliminate images indiscriminately or only convert objects into hyperlink. Considering current web environment with improved performance of hardware/software and the transition of information representation from text to visual, we need a new method that not only minimizes the deterioration of the image-layout but also respects the intention of the web author. In this paper, we propose anadaptation method that minimizes the loss of information and preserves the original intention of a web designer from the visual aspect. In image conversion, the proposed method extracts meaningful information from the back-ground instead of resizing in the conventional method. It also performs layout-based conversion for the arrangement of image objects. The experimental results show that the proposed method achieved both the accuracy and the usability in comparison with the existing methods.
Aligator: A Mathematica Package for Invariant Generation (System Description)
Authors: Laura Kovács
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra with computational logic, and is applicable to the rich class of P-solvable loops. Aligator contains routines for checking the P-solvability of loops, transforming them into a system of recurrence equations, solving recurrences and deriving closed forms of loop variables, computing the ideal of polynomial invariants by variable elimination, invariant filtering and completeness check of the resulting set of invariants.
Quick Matrix Multiplication on Clusters of Workstations
Authors: Eyas El-Qawasmeh, Abdel-Elah Al-Ayyoub, Nayef Abu-Ghazaleh
Venue: Informatica (2004)

A quick matrix multiplication algorithm is presented and evaluated on a cluster of networked workstations consisting of Pentium hosts connected together by Ethernet segments. The obtained results confirm the feasibility of using networked workstations to provide fast and low cost solutions to many computationally intensive applications such as large linear algebraic systems. The paper also presents and verifies an accurate timing model to predict the performance of the proposed algorithm on arbitrary clusters of workstations. Through this model the viability of the proposed algorithm can be revealed without the extra effort that would be needed to carry out real testing.
Proxy Re-signatures in the Standard Model
Authors: Sherman S. Chow, Raphael C. Phan
Venue: Proceedings of the 11th international conference on Information Security (2008)

This paper studies proxy re-signature schemes. We first classify the expected security notions for proxy re-signature schemes with different properties. We then show how to attack on a recently proposed bidirectional scheme that is purported to be secure without random oracles, and discuss the flaw in their proof. Next, we show how to design a generic unidirectional proxy re-signature scheme using a new primitive called homomorphic compartment signature as the building block. We give a concrete instantiation which yields the first known unidirectional proxy re-signature scheme which is proven secure under standard assumption in the standard model. We also discuss how to incorporate the concept of forward-security into the proxy re-signature paradigm, such that the signing and the transformation are both time-limited.
Infrastructure and Self-organization in Postmodern Internet Architecture
Authors: Ken L. Calvert
Venue: Proceedings of the 2nd international workshop on Self-Organizing Systems (2007)

The Postmodern Internetwork Architecture project, a collaboration among researchers at the Universities of Kentucky, Kansas and Maryland, aims to produce a clean-slate design for a thin (inter)network layer. Design goals for this Internet layer include complete separation of routing from forwarding, avoidance of hierarchical or centrally-assigned identifiers in the forwarding plane, and provision of explicit mechanisms to support policies of the various stakeholders (specifically users and service providers).
Arc Consistency Projection: A New Generalization Relation for Graphs
Authors: Michel Liquiere
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

The projection problem (conceptual graph projection, homomorphism, injective morphism, ¿-subsumption, OI-subsumption) is crucial to the efficiency of relational learning systems. How to manage this complexity has motivated numerous studies on learning biases, restricting the size and/or the number of hypotheses explored. The approach suggested in this paper advocates a projection operator based on the classical arc consistency algorithm used in constraint satisfaction problems. This projection method has the required properties : polynomiality, local validation, parallelization, structural interpretation. Using the arc consistency projection, we found a generalization operator between labeled graphs. Such an operator gives the structure of the classification space which is a concept lattice. 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
Secure Construction of Contingency Tables from Distributed Data
Authors: Haibing Lu, Xiaoyun He, Jaideep Vaidya, Nabil Adam
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Contingency tables are widely used in many fields to analyze the relationship or infer the association between two or more variables. Indeed, due to their simplicity and ease, they are one of the first methods used to analyze gathered data. Typically, the construction of contingency tables from source data is considered straightforward since all data is supposed to be aggregated at a single party. However, in many cases, the collected data may actually be federated among different parties. Privacy and security concerns may restrict the data owners from free sharing of the raw data. However, construction of the global contingency tables would still be of immense interest. In this paper, we propose techniques for enabling secure construction of contingency tables from both horizontally and vertically partitioned data. Our methods are efficient and secure. We also examine cases where the constructed contingency table may itself leak too much information and discuss potential solutions.
eCSM: Semantic Classification Model for Educational Repositories
Authors: Dongwon Jeong, Myounghoi Choi, Keunhwan Jeon
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

This paper proposes a new classification model for management of resources in an educational repository. To facilitate usability of educational resources, a proper classification model should be provided. If no classification model, it causes several issues such as inefficient management of educational resources, incorrect retrieval, and low usability. To achieve the goal of this paper, the model should support a classification mechanism in multiple viewpoints. The proposed model enables more precise and systematic management of implementation resources, and also increases the ease of usability.
Neural Network Based Kinematic Control of the Hyper-Redundant Snake-Like Manipulator
Authors: Jinguo Liu, Yuechao Wang, Bin Li, Shugen Ma
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In a sinusoid like curve configuration, the snake-like manipulator (also called snake arm) has a wide range of potential applications for its redundancy to overcome conventional industrial robot's limitation when carrying out a complex task. It can perform many kinds of locomotion like the nature snake or the animal's tentacle to avoid obstacles, follow designated trajectories, and grasp objects. Effectively control of the snake-like manipulator is difficult for its redundancy. In this study, we propose an approach based on BP neural network to kinematic control the hyper-redundant snake-like manipulator. This approach, inspired by the Serpenoid curve and the concertina motion principle of the nature snake, is completely capable of solving the control problem of a planar snake-like manipulator with any number of links following any desired direction and trajectory. With shape transformation and base rotation, the manipulator's configuration changes accordingly and moves actively to perform the designated tasks. By using BP neural networks in modeling the inverse kinematics, this approach has such superiorities as few control parameters and high precision. Simulations have demonstrated that this control technique for the snake-like manipulator is available and effective.
Monitoring Atomicity in Concurrent Programs
Authors: Azadeh Farzan, P. Madhusudan
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space-efficient monitoring algorithms for checking atomicity that use space polynomial in the number of active threads and entities, and independent of the length of the run monitored. Second, by interpreting the monitoring algorithm as a finite automaton, we solve the model checking problem for atomicity of finite-state concurrent models. This establishes (for the first time) that model checking finite-state concurrent models for atomicity is decidable, and remedies incorrect proofs published in the literature. Finally, we exhibit experimental evidence that our atomicity monitoring algorithm gives substantial time and space benefits on benchmark applications.
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Authors: Sunil Arya, David M. Mount, Antoine Vigneron, Jian Xia
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound ¿> 0. The objective is to build a data structure so that given any query point q in the space, it is possible to efficiently determine a point of S whose distance from q is within a factor of (1 + ¿) of the distance between q and its nearest neighbor in S. In this paper we obtain the following space-time tradeoffs. Given a parameter ¿ ¿ [2,1/¿], we show how to construct a data structure of space $n \gamma^{O(\dim)} \log(1/\varepsilon)$ space that can answer queries in time $O(\log(n\gamma)) + (1/(\varepsilon \gamma))^{O(\dim)}$. This is the first result that offers space-time tradeoffs for approximate nearest neighbor queries in doubling spaces. At one extreme it nearly matches the best result currently known for doubling spaces, and at the other extreme it results in a data structure that can answer queries in time O(log(n/¿)), which matches the best query times in Euclidean space. Our approach involves a novel generalization of the AVD data structure from Euclidean space to doubling space.
A Simple Method of the ${\rm\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$ Surface Drawing Suitable for Teaching Materials with the Aid of CAS
Authors: Masataka Kaneko, Hajime Izumi, Kiyoshi Kitahara, Takayuki Abe, Kenji Fukazawa, Masayoshi Sekiguchi, Yuuki Tadokoro, Satoshi Yamashita, Setsuo Takato
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The authors have been developing KETpic as a bundle of macro packages for Computer Algebra Systems (CASs) to draw fine ${\rm\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$ -pictures. Recently we have developed a new method of the surface drawing using KETpic. The equation of envelopes is used to draw ridgelines of surfaces. Also the technique of hidden line elimination is used. By these methods, we can draw 3D-graphics which are so simple that the global (i.e. sketchy) shapes of them are easily understood.
An Entity Resolution Framework for Deduplicating Proteins
Authors: Lucas Lochovsky, Thodoros Topaloglou
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

An important prerequisite to successfully integrating protein data is detecting duplicate records spread across different databases. In this paper, we describe a new framework for protein entity resolution, called PERF, which deduplicates protein mentions using a wide range of protein attributes. A mention refers to any recorded information about a protein, whether it is derived from a database, a high-throughput study, or literature text mining, among others. PERF can be easily extended to deduplicate protein-protein interactions (PPIs) as well. This framework translates mentions into instances of a reference schema to facilitate mention comparisons. PERF also uses "virtual attribute dependencies" to "enhance" mentions with additional attribute values. PERF computes a likelihood measure based upon the textual value similarity of mention attributes. A prototype implementation of the framework was tested, and these tests indicate that PERF can clearly separate duplicate mentions from non-duplicate mentions.
Applying Machine Learning to Extract New Knowledge in Precision Agriculture Applications
Authors: Savvas Dimitriadis, Christos Goumopoulos
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

We are considering a facet of precision agriculture that concentrates on plant-driven crop management. By monitoring soil, crop and climate in a field and providing a decision support system that is able to learn, it is possible to deliver treatments, such as irrigation, fertilizer and pesticide application, for specific parts of a field in real time and proactively. In this context, we have applied machine learning techniques to automatically extract new knowledge in the form of generalized decision rules towards the best administration of natural resources like water. The machine learning application model suggested in this paper is based on an inductive and iterative process of discovering knowledge on the basis of which, patterns and associations having arisen initially are re-examined to expand the pre-existing knowledge. The result of this study was the creation of an effective set of decision rules used to predict the plants' state and the prevention of unpleasant impacts from the water stress in plants.
Validation Algorithms for a Secure Internet Routing PKI
Authors: David Montana, Mark Reynolds
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

A PKI in support of secure Internet routing was first proposed in [1] and refined in later papers, e.g., [2]. In this "Resource" PKI (RPKI) the resources managed are IP address allocations and Autonomous System number assignments. In a typical PKI the validation problem for each relying party is fairly simple in principle, and is well defined in the standards, e.g. RFC 3280 [3]. The RPKI presents a very different challenge for relying parties with regard to efficient certificate validation. In the RPKI every relying party needs to validate every certificate at fairly frequent intervals (e.g., daily). In addition, certificates on the validation path may be acquired from multiple repositories in an arbitrary order. These dramatic differences motivated us to develop performance-optimized validation algorithms for the RPKI. This paper describes the software developed by BBN for the RPKI, with a special focus on this optimized validation approach.
The snapping dipoles of ferroelectrics as a memory element for digital computers
Authors: Charles F. Pulvari
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

A brief review is given of the memory properties of non-linear ferroelectric materials in terms of the direction of polarization. A sensitive pulse method has been developed for obtaining static remanent polarization data of ferroelectric materials. This method has been applied to study the effect of pulse duration and amplitude and decay of polarization on ferroelectric ceramic materials with fairly high crystalline orientation. These studies indicate that ferroelectric memory devices can be operated in the megacycle ranges. Attempts have been made to develop electrostatically induced memory devices using ferroelectric substances as a medium for storing information. As an illustration, a ferroelectric memory using a new type of switching matrix is presented having a selection ratio 50 or more.
Improving Web Service Discovery by Using Semantic Models
Authors: Aishwarya Bose, Richi Nayak, Peter Bruza
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

With the advent of service oriented architecture, Web services have gained tremendous popularity. This warrants the need to establish an effective and reliable process of Web service discovery. This paper presents a novel approach to enhance the accuracy of Web service discovery by finding semantically similar Web services for a user query using the support-based latent semantic kernel. The empirical evaluation confirms that the accuracy of Web service discovery with the proposed method shows a significant improvement over traditional discovery methods.
An Exploration into the Power of Formal Concept Analysis for Domestic Violence Analysis
Authors: Jonas Poelmans, Paul Elzinga, Stijn Viaene, Guido Dedene
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

The types of police inquiries performed are very diverse in nature and the current data processing architecture is not sufficiently tailored to cope with this diversity. Many information concerning cases is still stored in databases as unstructured text. Formal Concept Analysis is showcased as an exploratory data analysis technique for discovering new knowledge from police reports. It turns out that it provides a powerful framework for exploring the dataset, resulting in essential knowledge for improving current practices. It is shown that the domestic violence definition employed by the police organisation of the Netherlands is not always as clear as it should be, making it hard to use it effectively for classification purposes. In addition, newly discovered knowledge for automatically classifying certain cases as either domestic or non-domestic violence is presented. Moreover, essential techniques for detecting incorrect classifications, performed by police officers, are provided. Finally, some problems encountered because of the sometimes unstructured way of working of police officers are discussed. Both using Formal Concept Analysis for exploratory data analysis and its application on this area are novel enough to make this paper into a valuable contribution to the literature.
Integration of Geographic Information into Multidimensional Models
Authors: Sandro Bimonte, Anne Tchounikine, Michela Bertolotto
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Data warehousing and On Line Analytical Processing (OLAP) are technologies intended to support business intelligence. Spatial OLAP integrates spatial data into OLAP systems. Spatial OLAP models reformulate main OLAP concepts to define spatial dimensions and measures, and spatio-multidimensional navigation operators. Spatial OLAP reduces geographic information to its spatial component without taking into account map generalization relationships into the multidimensional decision process. In this paper, we present the concept of Geographic Dimension which extends the classical definition of spatial dimension by introducing map generalization hierarchies, as they enhance analysis capabilities of SOLAP models and systems. A Geographic Dimension is described by spatial, descriptive and/ormap generalization hierarchies. These hierarchies permit to define ad-hoc aggregation functions, but at the same time raise several modeling problems.
The Dynamics of Probabilistic Population Protocols
Authors: Ioannis Chatzigiannakis, Paul G. Spirakis
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

Angluin et al. [1] introduced the notion of "Probabilistic Population Protocols" (PPP) where extremely limited agents are represented as finite state machines that interact in pairs under the control of an adversary scheduler. We provide a very general model that allows to examine the continuous dynamics of population protocols and we show that it includes the model of [1], under certain conditions, with respect to the continuous dynamics of the two models.
Conceptions and Modeling for Transmitted Information Evaluation by ANN
Authors: Algis Garliauskas
Venue: Informatica (2004)

In this paper, the main measure, an amount of information, of the information theory is analyzed and corrected. The three conceptions of the theory on the microstate, dissipation pathways, and self-organization levels with a tight connection to the statistical physics are discussed. The concepts of restricted information were introduced as well as the proof of uniqueness of the entropy function, when the probabilities are rational numbers, is presented. The artificial neural network (ANN) model for mapping the evaluation of transmitted information has been designed and experimentally approbated in the biological area.
A Palm-Worn Haptic Display for Bimanual Operations in Virtual Environments
Authors: Kouta Minamizawa, Sho Kamuro, Naoki Kawakami, Susumu Tachi
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

We propose a wearable haptic display that indicates the pressure and vibration on the palm for bimanual operations in virtual reality environments. This system aims to provide the touch and stroke sensations of virtual objects or virtual creatures. We constructed a prototype device that can reproduce vertical and shearing forces on the palm and evaluate the capability of the proposed method to recognize the existence of a virtual object in one-handed and two-handed operations.