ppxscal/embedding_network huggingface dataset:
A Methodology for Structural Conflict Resolution in the Integration of Entity-Relationship Schemas
Authors: Li Lee, Wang Ling
Venue: Knowledge and Information Systems (2003)

The integration ofinf ormation systems is becoming increasingly important. A common requirement in distributed data-intensive applications, such as data warehousing and data mining, is that the various databases involved be joined in a process called schema integration. The entity-relationship (ER) model or a variant of the ER model is often used as the common data model. To aid the schema conforming, merging and restructuring phases of the integration process, various transformations have been defined to map between various equivalent ER representations. In this paper, we describe a different approach to integrate ER schemas. We focus on the resolution of structural conflicts, that is, when related real-world concepts are modeled using different constructs in different schemas. Unlike previous work, our approach proposes to resolve the structural conflict between an entity type in one schema and an attribute in another schema and show that the other structural conflicts are automatically resolved. This reduces the manual effort required in integration. We give a detailed algorithm to transform an attribute in one schema into an equivalent entity type in another schema without any loss of semantics, that is, our transformation is both information preserving and constraint preserving.
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
Authors: Michael Backes, Birgit Pfitzmann
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

Recently we showed how to justify a Dolev-Yao typemodel of cryptography as used in virtually all automatedprotocol provers under active attacks and in arbitrary protocolenvironments. The justification was done by definingan ideal system handling Dolev-Yao-style terms and acryptographic realization with the same user interface, andby showing that the realization is as secure as the idealsystem in the sense of reactive simulatability. This definitionencompasses arbitrary active attacks and enjoys generalcomposition and property-preservation properties. Securityholds in the standard model of cryptography and understandard assumptions of adaptively secure primitives.A major primitive missing in that library so far is symmetricencryption. We show why symmetric encryption isharder to idealize in a way that allows general compositionthan existing primitives in this library. We discuss severalapproaches to overcome these problems. For our favoriteapproach we provide a detailed provably secure idealizationof symmetric encryption within the given frameworkfor constructing nested terms.
Wireless Support for Telemedicine in disaster Management
Authors: S. Olariu, K. Maly, E. C. Foudriat, S. M. Yamany
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Disaster response and recovery require timely interactionand coordination of public emergency services in order tosave lives and property.An important role in this effortmust be played by wireless telemedicine whose mandateis to bring to the scene of the disaster the experience andexpertise of medical personnel that can direct andsupervise paramedics in providing necessary life-supportservices.The main contribution of this work is to discussa novel wireless architecture in support of a recently-proposedtelemedicine architecture called WIRM [A Dependable Architecture for Telemedicine in Support of Disaster Relief] incorporating leading-edge image compressiontechnology, a robust interactive visualization tool, and ahigh-performance wireless multimedia network.
Adapting to source properties in processing data integration queries
Authors: Zachary G. Ives, Alon Y. Halevy, Daniel S. Weld
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

An effective query optimizer finds a query plan that exploits the characteristics of the source data. In data integration, little is known in advance about sources' properties, which necessitates the use of adaptive query processing techniques to adjust query processing on-the-fly. Prior work in adaptive query processing has focused on compensating for delays and adjusting for mis-estimated cardinality or selectivity values. In this paper, we present a generalized architecture for adaptive query processing and introduce a new technique, called adaptive data partitioning (ADP), which is based on the idea of dividing the source data into regions, each executed by different, complementary plans. We show how this model can be applied in novel ways to not only correct for underestimated selectivity and cardinality values, but also to discover and exploit order in the source data, and to detect and exploit source data that can be effectively pre-aggregated. We experimentally compare a number of alternative strategies and show that our approach is effective.
Distributed Cooperative Outdoor Multirobot Localization and Mapping
Authors: Raj Madhavan, Kingsley Fregene, Lynne E. Parker
Venue: Autonomous Robots (2004)

The subject of this article is a scheme for distributed outdoor localization of a team of robots and the use of the robot team for outdoor terrain mapping. Localization is accomplished via Extended Kalman Filtering (EKF). In the distributed EKF-based scheme for localization, heterogeneity of the available sensors is exploited in the absence or degradation of absolute sensors aboard the team members. The terrain mapping technique then utilizes localization information to facilitate the fusion of vision-based range information of environmental features with changes in elevation profile across the terrain. The result is a terrain matrix from which a metric map is then generated. The proposed algorithms are implemented using field data obtained from a team of robots traversing an uneven outdoor terrain.
Comparing 3D Protein Structures Similarity by Using Fractal Features
Authors: Chenyang Cui, Donghui Wang, Jiaoying Shi
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In this paper, we propose a new method for finding similarity in 3-D protein structure comparison. Different from the other existing methods, our method is grounded in the theory of fractal geometry. The proposed feature vectors of protein structures are simple to implement . The method is very fast because it requires neither alignment of the chains nor any chain-chain comparison. We calculate the fractal features of a set of 200 protein structures selected from PDB(Protein Data Bank). The experimental result shows that our method is very effective in classification of 3-D protein structures.
A Secure TCP Connection Migration Protocol to Enable the Survivability of Client-Server Applications Under Malicious Attack
Authors: Indrajit Ray, Sonja Tideman
Venue: Journal of Network and Systems Management (2004)

Transmission Control Protocol (TCP) connection migration has been previously proposed to allow for the mobility of servers. In this paper we revisit TCP connection migration for purposes of server survivability against malicious denial-of-service attacks. We present a protocol that allows an on-going TCP connection to be migrated from one server to another. This migration is performed in a secure manner such that the protocol itself cannot be exploited for malicious attacks. Further the migration can be performed even in the case where the original server is compromised. The protocol has been designed so as to allow interoperability with legacy TCP protocols. It is intended to be the transport layer foundations over which survivable applications can be built.
Flat3D: A Shared Virtual 3D World Grown by Creative Activities and Communication through the Network
Authors: Hiroaki Tobita, Jun Rekimoto
Venue: Proceedings of the Computer Graphics International (2004)

Flat3D is a shared 3D virtual world system that canbe grown by userýs creative activities andcommunication over the network. In conventionalshared virtual 3D world systems, users sharing thevirtual 3D world communicated with each other onlyby text-based chatting through avatars, so thecommunication capabilities were quite limited. Incontrast, the Flat3D system allows users to createobjects freely in a wade 3D world by simplemanipulations. These creative activities becomecommunication trigger and scene elements directly, sothe virtual 3D world would be grown by userýscreation and communication. In this paper, wedescribe the Flat3D system and its capabilities.
Absolute polynomial factorization in two variables and the knapsack problem
Authors: Guillaume Chèze
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X,Y), after a linear change of coordinates, is via a factorization modulo X3. This was proposed by A. Galligo and D. Rupprecht in [7],[16]. Then absolute factorization is reduced to finding the minimal zero sum relations between a set of approximated numbers b;i;, i =1 to n such that ∑n;i =1; b;i; =0, (see also [17]). Here this problem with an a priori exponential complexity, is efficiently solved for large degrees (n›100). We rely on LLL algorithm, used with a strategy of computation inspired by van Hoeij's treatment in [23]. For that purpose we prove a theorem on bounded integer relations between the numbers b;i;,, also called linear traces in [19].
Reducing power consumption and enhancing performance by direct slave-to-slave and group communication in Bluetooth WPANs
Authors: Carlos de Morais Cordeiro, Sachin Abhyankar, Dharma P. Agrawal
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

Bluetooth is a promising wireless technology aiming at supporting electronic devices to be instantly interconnected into short-range ad hoc networks. The Bluetooth medium access control protocol is based on the Master/Slave concept wherein any communication between slave devices has to go through the Master. While this model provides for simplicity, it incurs longer delay between any two slaves devices due to far from optimal packet forwarding, the use of double the bandwidth, and also wastes additional energy at the Master. Moreover, if more than two devices want to communicate as a group, this can only be achieved by either multiple unicast transmissions or a piconet-wide broadcast, clearly resulting in inefficiency. In this paper, we propose a novel Dynamic Slot Assignment (DSA) scheme whereby the Master device dynamically assigns slots to Slaves so as to allow them to communicate directly with each other without any Master intervention. This proposed communication architecture also provides for Quality of Service (QoS) requests, admission control, and multi-device conversation by which a multicast-like communication is implemented within a piconet. Through extensive simulation, we observe that DSA drastically enhances Bluetooth performance in terms of delay and throughput, while significantly reducing power consumption at the master and also of the overall piconet.
Discriminative models for information retrieval
Authors: Ramesh Nallapati
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Discriminative models have been preferred over generative models in many machine learning problems in the recent past owing to some of their attractive theoretical properties. In this paper, we explore the applicability of discriminative classifiers for IR. We have compared the performance of two popular discriminative models, namely the maximum entropy model and support vector machines with that of language modeling, the state-of-the-art generative model for IR. Our experiments on ad-hoc retrieval indicate that although maximum entropy is significantly worse than language models, support vector machines are on par with language models. We argue that the main reason to prefer SVMs over language models is their ability to learn arbitrary features automatically as demonstrated by our experiments on the home-page finding task of TREC-10.
Policy-Based Mobile Ad Hoc Network Management
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Ad hoc networking is the basis of the future militarynetwork-centric warfare architecture. Such networks arehighly dynamic in nature, as mobile ad hoc networks areformed over wireless links that are susceptible to failure.Strict requirements on security and reliability combinedwith the dynamic nature of the network provide a strongmotivation for self-forming, self-configuring, and self-healingcapabilities in the network. This paper describesa policy-based mobile ad hoc network managementsystem that addresses these needs. The system providesthe capability to express networking requirements in theform of policies at a high level and have themautomatically realized in the network by intelligentagents. Our system provides the following capabilities:flexible monitoring and reporting that enables collectionof management information from network elements atconfigurable intervals; automated configuration and reconfigurationof network elements based on reportednetwork status; user-definable aggregation and filteringof monitored management information at the source ofthe data so as to reduce management station processingand network transmission overhead.
Equivalences and Separations Between Quantum and Classical Learnability
Authors: Rocco A. Servedio, Steven J. Gortler
Venue: SIAM Journal on Computing (2004)

We consider quantum versions of two well-studied models of learning Boolean functions: Angluin's model of exact learning from membership queries and Valiant's probably approximately correct (PAC) model of learning from random examples. For each of these two learning models we establish a polynomial relationship between the number of quantum or classical queries required for learning. These results contrast known results that show that testing black-box functions for various properties, as opposed to learning, can require exponentially more classical queries than quantum queries. We also show that, under a widely held computational hardness assumption (the intractability of factoring Blum integers), there is a class of Boolean functions which is polynomial-time learnable in the quantum version but not the classical version of each learning model. For the model of exact learning from membership queries, we establish a stronger separation by showing that if any one-way function exists, then there is a class of functions which is polynomial-time learnable in the quantum setting but not in the classical setting. Thus, while quantum and classical learning are equally powerful from an information theory perspective, the models are different when viewed from a computational complexity perspective.
KITTY: Keyboard Independent Touch Typing in VR
Authors: Carsten Mehring, Falko Kuester, Kunal Deep Singh, Michelle Chen
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

A new hand- and finger-mounted data input device is presented, using traditional touch-typing skills as method ofalphanumeric data input to provide an ultra-portable solution for ioquietlr data input into portable computer systems. The presented keyboard independent touch-typing device (KITTY) offers high data input rates and minimal training requirements for new users.
Extending query rewriting techniques for fine-grained access control
Authors: Shariq Rizvi, Alberto Mendelzon, S. Sudarshan, Prasan Roy
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views, to control which parts of the data can be accessed by each user. Fine-grained access control is often enforced in the application code, which has numerous drawbacks; these can be avoided by specifying/enforcing access control at the database level. We present a novel fine-grained access control model based on authorization views that allows "authorization-transparent" querying; that is, user queries can be phrased in terms of the database relations, and are valid if they can be answered using only the information contained in these authorization views. We extend earlier work on authorization-transparent querying by introducing a new notion of validity, conditional validity. We give a powerful set of inference rules to check for query validity. We demonstrate the practicality of our techniques by describing how an existing query optimizer can be extended to perform access control checks by incorporating these inference rules.
Long-time behavior of solutions to a semilinear wave equation with boundary damping
Authors: I. N. Kostin
Venue: Dynamics and Control (2001)

For the semilinear dissipative hyperbolic problem (1.1), (1.2) in a class of non star-shaped domains the existence of a compact global attractor is established. Some connections with the problem of stabilizability arising in the control theory are pointed out.
Client-Side Deep Web Data Extraction
Authors: Manuel Alvarez, Alberto Pan, Juan Raposo, Angel Vina
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The problem of data extraction from the Deep Web can be divided into two tasks: crawling the client-side and the server-side deep web. The objective of this paper is to define an architecture and a set of related techniques to access the information placed in the client-side deep web. This involves dealing with aspects such as JavaScript technology, non-standard session maintenance mechanisms, client redirections, pop-up menus, etc. Our work uses current browser APIs as building blocks and leverages them to implement novel crawling models and algorithms.
Psychological Models in Autonomic Computing Systems
Authors: Andrew Lee
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper considers three psychological theories of motivation with respect to their potential contributions to autonomic systems design. Motivational theories are explored here since they seek to explain the mechanisms by which behaviours in living organisms are initiated. These motivational drives offer an analogy with the management of autonomic functions by modelling the criteria under which autonomic behaviours are controlled. A correlation between the two fields is suggested, raising the possibility of adopting concepts from established psychological theories in the design of autonomic computing systems.
A Method for Performance Analysis of Earliest-Deadline-First Scheduling Policy
Authors: Mehdi Kargahi, Ali Movaghar
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

This paper introduces an analytical method forapproximating the fraction of jobs that miss theirdeadlines in a real-time system when earliest-deadline-firstscheduling policy (EDF) is used. In the system, jobseither all have deadlines until the beginning of service ordeadlines until the end of service. In the former case,EDF is known to be optimal and, in the latter case, it willbe optimal if preemption is allowed. In both cases, thesystem is modeled by an M/M/1/EDF+M queue, i.e., asingle server queue with Poisson arrival, and servicetimes and customer impatience, which are exponentiallydistributed. The optimality property of EDF is used forthe estimation of a key parameter, ¿{n}, which is the lossrate when there are n customers in the system. Theestimation is possible by finding an upper bound and alower bound for ¿{n} and linearly combining these twobounds. The resulting Markov chains are then easy tosolve numerically. Comparing numerical and simulationresults, we find that the existing errors are relatively small.
A Scan-Line Algorithm for Clustering Line Segments
Venue: Proceedings of the Shape Modeling International 2004 (2004)

Transformation of hardcopy ship drawings to electronicones is usually accomplished through scanning and raster-to-vector conversions. Such conversions are, however,limited to produce low-degree vector entities, such as linesegments, poly-lines and circular arcs. As a consequence,free-form curves, appearing in the original hardcopy, areusually disintegrated to a significant number of overlappingline and/or arc segments. The algorithm presented inthis paper, consists of a scan-line processing of line segmentsthat are grouped (clustered) with the aid of a movingscan-line and an appropriately defined distance to previouslygrouped entities. The performance of the algorithm isillustrated for the body-plan of a bulk carrier.
Weather Data Mining Using Independent Component Analysis
Authors: Jayanta Basak, Anant Sudarshan, Deepak Trivedi, M. S. Santhanam
Venue: The Journal of Machine Learning Research (2004)

In this article, we apply the independent component analysis technique for mining spatio-temporal data. The technique has been applied to mine for patterns in weather data using the North Atlantic Oscillation (NAO) as a specific example. We find that the strongest independent components match the observed synoptic weather patterns corresponding to the NAO. We also validate our results by matching the independent component activities with the NAO index.
Plone and Content Management
Authors: George K. Thiruvathukal, Konstantin Laufer
Venue: Computing in Science and Engineering (2004)

In this column, the authors look at Plone, which they feel is one of the best content management systems available today. Even better, it's distributed under a free open-source license: the cost of getting started is only limited to the time you have available to set up the software on a server. Plone is written in Python and uses the Zope application server infrastructure; it runs on most modern operating systems. The authors have even set it up at Loyola University Chicago in the Department of Computer Science. Besides being two faculty members who rely on Plone to host all our Web content, they have recently customized Plone for their department's public Web site (www.cs.luc.edu). The end result is a site on which content can be maintained entirely over the Web at zero cost to their department. Everything you see on their Web pages was generated by a unique combination of plaintext authoring, clever plug-ins, and a site-wide style.
The role of educational software as a support for teaching and learning conversations
Authors: Rupert Wegerif
Venue: Computers Education (2004)

Much recent educational research focuses on teaching and learning within classroom conversations. This raises the question of the role of ICT as a support for such conversations. The central argument of this paper is that the dual nature of computers, as machines (objects) which can be made to act as if they were people (subjects), allows them to play a potentially distinctive and valuable role within educational conversations. This role is to resource and, at the same time, to frame and direct, learning conversations amongst small groups of children. Evidence in support of this argument is provided through the findings of an empirical study. In the study preparation for group work at computers was combined with the use of principles for the selection and design of software in order to develop educational activities to support discussion within the science and maths curricula over one year. One hundred and nineteen children aged between nine and ten participated in the study. The evaluation included video-recording, transcript analysis and a matching control group who covered the same areas of the curriculum without the intervention. The qualitative findings show learning occurring in the talk of the children working around computers and the quantitative findings suggest that this approach can produce significant learning gains within the normal curriculum.