ppxscal/embedding_network huggingface dataset:
An Information Database for VRML Cities
Authors: A. Heinonen, I. Rakkolainen
Venue: Proceedings of the International Conference on Information Visualisation (2000)

A system is presented to visualize information about city with a three-dimensional web user interface. We present a novel way to connect a VRML world to an information database. As the data, code and models are kept separate, updates and maintenance of the system is easy. The information visualization of a city becomes easier and more intuitive in 3D. The location of any service, shop etc. is shown both in a 3D world and on a 2D map, which are interconnected. Our implementation works on standard web browsers. In addition, we built optional steering wheel navigation, which is an intuitive way of moving around in a city for home Internet users. An experimental immersive VR interface was also made.
Load management in distributed video servers
Authors: N. Venkatasubramanian, S. Ramanathan
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We define and formulate various policies for load management in distributed video servers. We propose a predictive placement policy that determines the degree of replication necessary for popular videos using a cost based optimization procedure based on a priori predictions of expected subscriber requests. For scheduling requests, we propose an adaptive scheduling policy that compares the relative utilization of resources in a video server to determine an assignment of requests to replicas. To optimize storage utilization, we also devise methods for dereplication of videos based on changes in their popularities and in server usage patterns. Performance evaluations indicate that a load management procedure which uses a judicious combination of the different policies performs best for most server configurations. Advances in storage technologies are making high performance video servers a reality. These video servers are being deployed over emerging broadband networks to deliver a variety of interactive, digital video services to thousands of residential subscribers. To meet the scalability requirements in such large deployments, distributed video server architectures are being considered (M. Buddhikot and G. Parulkar, 1995). We propose various methods for load management that are targeted at improving the cost effectiveness of distributed video servers.
Towards Knowledge Discovery from WWW Log Data
Authors: Feng Tao, Fionn Murtagh
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

As the result of interactions between visitors and a web site, an http log file contains very rich knowledge about users on-site behaviors, which, if fully exploited, can better customer services and site performance. Different to most of the existing log analysis tools which use statistical counting summaries on pages, hosts, etc., we propose a transaction model to represent users access history and a framework to adapt data mining techniques such as sequence and association rule mining to these transactions. In this framework, all transactions are extracted from the raw log file though a series of systematic data preparation phases. We discuss different methods to identify a user, and separate long convoluted sequences into semantically meaningful sessions and transactions. A new feature called interestingness is defined to model user interests in different web sections. With all the transactions being imported into an adapted cube structure with a concept hierarchy attached to each dimension of it, it is possible to carry out multi-dimensional data mining at multi-abstract levels. Using interest context rules, we demonstrate the potentially significant meaning of this system prototype.
Superconvergence of the local discontinuous Galerkin method for elliptic problems on Cartesian grids
Authors: G. K B. Cockburn
Venue:  (2000)

In this paper, we present a super-convergence result for the local discontinuous Galerkin (LDG) method for a model elliptic problem on Cartesian grids. We identify a {\em special} numerical flux for which the L$^2$-norm of the gradient and the L$^2$-norm of the potential are of order $k+1/2$ and $k+1$, respectively, when tensor product polynomials of degree at most $k$ are used; for arbitrary meshes, this special LDG method gives only the orders of convergence of $k$ and $k+1/2$, respectively. We present a series of numerical examples which establish the sharpness of our theoretical results. (SIAM J. Numer. Anal., 39 (2001), 264-285) 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
The Graduate Course Advisor: A Multi-Phase Rule-Based Expert System
Authors: G M Valtorta, T B Smith, W D Loveland
Venue:  (1984)

The Graduate Course Advisor (GCA) is a rule-based expert system that advises graduate students in Computer Science. It is implemented in Prolog, using an inference engine modeled after MYCIN''s. The advising task is divided into four phases, each of which may apply the inference engine to its own rule base and invoke other procedures. Some phases are diagnostic (e.g., determining a student''s needs), whereas others involve planning (e.g., planning a student''s schedule). The decomposition helps to manage the complexity of the advising task, it simplifies the knowledge engineering problem, and it will enhance the clarity of explanations. However, the decomposition is tightly bound to basis design decisions; a major decoupling in the GCA followed from our assumption that best schedules are almost always chosen from the top-valued courses.
Memory aware query scheduling in a database cluster
Authors: Florian Waas, Martin L. Kersten
Venue:  (2000)

Query throughput is one of the primary optimization goals in interactive web-based information systems in order to achieve the performance necessary to serve large user communities. Queries in this application domain differ significantly from those in traditional database applications: they are of lower complexity and almost exclusively read-only. The architecture we propose here is specifically tailored to take advantage of the query characteristics. It is based on a large parallel shared-nothing database cluster where each node runs a separate server with a fully replicated copy of the database. A query is assigned and entirely executed on one single node avoiding network contention or synchronization effects. However, the actual key to enhanced throughput is a resource efficient scheduling of the arriving queries. We develop a simple and robust scheduling scheme that takes the currently memory resident data at each server into account and trades off memory re-use and execution time, reordering queries as necessary. Our experimental evaluation demonstrates the effectiveness when scaling the system beyond hundreds of nodes showing super-linear speedup.
Real-time Analysis of Data from Many Sensors with Neural Networks
Authors: Kristof Van Laerhoven, Kofi A. Aidoo, Steven Lowette
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Much research has been conducted that uses sensor-based modules with dedicated software to automatically distinguish the user's situation or context. The best results were obtained when powerful sensors (such as cameras or GPS systems) and/or sensor-specific algorithms (like sound analysis) were applied. A somewhat new approach is to replace the one smart sensor by many simple sensors. We argue that neural networks are ideal algorithms to analyze the data coming from these sensors and describe how we came to one specific algorithm that gives good results, by giving an overview of several requirements. Finally, wearable implementations are given to show the feasibility and benefits of this approach and its implications.
Sweepline the music!
Authors: Esko Ukkonen, Kjell Lemström, Veli Mäkinen
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

The problem of matching sets of points or sets of horizontal line segments in plane under translations is considered. For finding the exact occurrences of a point set of size m within another point set of size n we give an algorithm with running time O(mn), and for finding partial occurrences an algorithm with running time O(mnlogm). To find the largest overlap between two line segment patterns we develop an algorithm with running time O(mnlog(mn)). All algorithms are based on a simple sweepline traversal of one of the patterns in the lexicographic order. The motivation for the problems studied comes from music retrieval and analysis.
The effect of inheritance on the maintainability of object-oriented software: an empirical study
Authors: J. Daly, A. Brooks, J. Miller, M. Roper, M. Wood
Venue: Proceedings of the International Conference on Software Maintenance (1995)

The empirical study was undertaken as part of a programme of research to explore unsupported claims about the object-oriented paradigm: a series of experiments tested the effect of inheritance on the maintainability of object-oriented software. Subjects were asked to modify object-oriented software with a hierarchy of 3 levels of inheritance depth and equivalent object-based software with no inheritance. The collected timing data showed that subjects maintaining object-oriented software using inheritance performed the modification tasks, on average, approximately 20% quicker than those maintaining equivalent object-based software with no inheritance. An initial inductive analysis revealed that 2 out of 3 subjects performed faster when maintaining the object-oriented software with inheritance. The findings are sufficiently important that attempts to verify the results should be made by independent researchers. Subsequent studies should seek to scale up the findings to the maintenance of more complex software by professional programmers.
An Incremental Drawing Algorithm for Planar Graphs
Authors: David Harel, Meir Sardas
Venue:  (1995)

We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generalization of the algorithm of Chrobak and Payne, which in turn, is based on an algorithm by de Fraysseix, Pach and Pollack. Our algorithm improves the previous ones in that it does not require a preliminary triangulation step; triangulation proves problematic in drawing graphs ``nicely", as it has the tendency to ruin the structure of the input graph. The new algorithm retains the positive features of the previous algorithms: It embeds a graph of $n$ vertices on a grid of size $(2n-4)\times (n-2)$ in linear time. We have implemented the algorithm as part of a software system for drawing graphs nicely.
Peering through the RISC/CISC fog: an outline of research
Authors: Robert P. Colwell, Charles Y. Hitchcock, E. Douglas Jensen
Venue: ACM SIGARCH Computer Architecture News (1983)

We are defining a computer architecture to support a decentralized operating system that is under development. Since complex functions of this system could appear directly in the architecture's instruction set, we are immersed in the current RISC/CISC debate where we have found many questions and few answers. Hoping to shed light on aspects of this conflict, we have embarked on two studies. The first seeks to find an environment where complex instructions can enhance system performance. The second tries to decouple multiple register set performance from instruction set performance in general-purpose register machines.
Stochastic and neural techniques for on-line wave prediction
Authors: J. D. Agrawal, M. C. Deo
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Continuous collection of wave data is being increasingly practiced since recent past all over the world. This is done in order to provide an essential input to carry out various operational civil engineering works in the oceans. Based on such continuous observations at the specific site, on-line prediction of wave heights can be made using different analytical schemes. This paper evaluates performance of several such schemes. The theoretical approaches involved are stochastic techniques of Kalman Filter, ARIMA, ARMA, AR and also that of neural networks. No single technique emerged as supreme when wave predictions over different short term periods were desired. Lower prediction intervals indicated superiority of neural networks, while higher ones were better tackled by the stochastic technique of Kalman Filter. The models with a very high degree of number of freedoms performed better than those with smaller flexibility of fitting.
Repairing coordination mismatches among legacy components
Authors: K. C. Wallnau
Venue: Proceedings of the International Conference on Software Maintenance (1997)

An increasingly commonplace reengineering problem involves the integration of legacy software components into new and often novel configurations. These scenarios are arising more frequently, in large measure because of the success of network computing concepts, and in particular the success of web-based Intranets. The author considers the problem of coordination mismatch in legacy components. He discusses their classification and repair, and considers the use of distributed object technology.
An Online Scheduling Problem with Job Set-ups
Authors: Saks Michael
Venue:  (2000)

Machine scheduling and paging are two fundamental problems that have been studied extensively from the view of online algorithms. In both problems, one processes a sequence $J_1,\ldots,J_n$ of {\em jobs} (or {\em page requests}) that arrive over time. In the paging problem, requests must be answered in the order of arrival because the requests arise in the context of the execution of a sequential program. The need for decision making comes from the presence of a cache which can store a limited number of pages, where serving a cached page is considerably cheaper than an uncached one. Thus algorithms for paging are focused around the choice of caching policy. In scheduling, there is no cache, but the scheduler has (at least limited) freedom to reorder the jobs, and choosing the order is the major issue in the design of online scheduling algorithms. In computer systems, however, there are important situations where both caching and job reordering are available. One very natural setting where this happens is handling web page requests at a high volume web site. As in the usual paging problem, the server must manage a cache. But here the requests are (essentially) independent, so the server is free to reorder them. In this paper, we begin the study of online algorithms for scheduling systems where both caching and reordering are available. We consider a simple, but already interesting and nontrivial, case: that of a single machine with a cache of unit size, and uniform page size. This particular special case is also natural in the usual machine scheduling context where jobs are classified into one of $\{1,2,...,F\}$ job types, and before processing a job, the machine must be configured (or set-up) according to the type of the job. This configuring (or set-up) is required unless the previously served job is of the same type as the current one. The current configuration of the machine in this scheduling problem, corresponds exactly to the contents of the unit cache in the page server problem. In this context, we consider the online problem of scheduling a sequence $J=(J_{1},J_{2},...,J_{N})$ of jobs with release times, processing times and sequence independent set-up times, on a single machine, to minimize the maximum flow time. A partitioning of the jobs into $F$ job types is given. A set-up is required at the start of each batch, where a batch is the largest set of contiguously scheduled jobs of the same job type. This problem is a special case of the maximum lateness problem, a problem known to be $NP$-hard even for very restrictive special cases and for which there are no known polynomial time $O(1)$ approximation algorithms. In this paper, we present a polynomial time $O(1)$-competitive online algorithm for the maximum flow time problem and also prove the $NP$-Hardness of the offline version of this problem.
Transaction Management in Mobile Mutidatabase Systems
Authors: Weijun Xiao, Zhengding Lu, Bing Li, Mudar Sarem
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Tremendous advances in wireless networks and portable computing devices have led to development of mobile computing. Traditional transaction management in multidatabase systems cannot be applied to mobile environment. In this paper, we analyze the features ofmobile multidatabase environment. A mobile transaction model based nested transactions is proposed and a serializability theory is presented for this model. In addition, concurrency control of mobile transactions is discussed.
Micro Electromechanical Systems (MEMS): Miniaturization Beyond Microelectronics
Authors: Nadim Maluf
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

The concept of a "system-on-a-chip" quickly invokes in our minds integrated microelectronic circuits. It took the semiconductor industry over 30 years to reach this level of integration, putting many millions of transistors on the same chip to perform extremely complex digital functions. Throughout this "system-level" revolution, the core element remained the MOS transistor, and the interface between the electronics and society has changed little.The same micro-fabrication methods of the electronics industry are now being adapted to design components and systems that integrate multiple physical functions including mechanics, fluid flow, optics, biology, etc on the same substrate. The net result is systems for complex non-digital applications, and sophisticated interfacing with the "real world." This technology is only beginning to emerge and the level of integration is in its early stages, yet the enabled functionality has already been phenomenal. For example, the integration of a small accelerometer and gyroscope with electronics is now at the center of modern vehicle stability systems. In another example, the DMD? display contains nearly one million little mirrors to control the intensity of individual pixels. In biology and biochemistry, on-going efforts aim at miniaturizing genetic analysis and diagnostic systems.In this presentation, we will review the basic fundamentals of micro-electromechanical systems. The presentation will also include a brief survey of existing micro-systems and provide a peek into the future. 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
Consistency in a Partitioned Network: A Survey
Authors: Susan B. Davidson, Hector Garcia-Molina, Dale Skeen
Venue:  (1984)

Recently, several strategies for transaction processing in partitioned distributed database systems with replicated data have been proposed. We survey these strategies in light of the goal of maintaining reliability. Extensions and combinations are then discussed, and guidelines for the selection of a strategy for a particular application are presented.
Some Results on the Centralizers of Monoids in Clone Theory
Authors: Hajime Machida, Masahiro Miyakawa, Ivo G. Rosenberg
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

For a set $S$ of multi-variable operations on a $k$-element set, thecentralizer $S^*$ is theset of operations which commute with all operations in $S$. In thispaper we concentrate onmonoids of unary operations and centralizers of such monoids. In thecourse of discussion theKuznetsov criterion is effectively used. First we study such monoidswhose centralizer is thetrivial (least) clone ${\cal J}_k$. Next we prove that the trivialmonoid {id} is the onlymonoid whose centralizer is the clone of all operations. We also showthat the centralizer ofevery (non-trivial) monoid is included in maximal clones of somespecific kinds.
Dienst: Implementation Reference Manual
Authors: Carl Lagoze, Erin Shaw, James R. Davis, Dean B. Krafft
Venue:  (1995)

We describe the architecture and implementation of Dienst: a protocol and server that provides distributed document libraries over the World Wide Web. Dienst is based on a document model that incorporates unique document names, multiple document formats, and multiple document decompositions. Interoperability among Dienst servers provides the user with a single logical document collection, even though the actual collection is distributed across multiple servers. The Dienst protocol uses HTTP (the protocol of the World Wide Web) as a transport layer, making Dienst servers accessible from any WWW client. Dienst is currently used as the infrastructure for a distributed computer science technical report library by a number of U.S. universities. This document is intended as a guide for Dienst site administrators and implementors of other digital library systems. It describes the architecture of an individual server and network of Dienst servers and includes the server installation instructions. Appendices describe copyright issues and retrospective conversion of the Cornell technical report collection.
Program families: some requirements issues for the process languages
Authors: G. Cugola, C. Ghezzi
Venue: Proceedings of the 10th International Software Process Workshop (1996)

We address the workshop theme by discussing some issues concerning process support for product families. In particular, we discuss how the particular problem of supporting product family developments affects the notation used for process representation and enactment. Based on our current understanding of the problem, our conclusion is that the development of program families does not introduce new requirements, but stress some of the requirements that are intrinsic to most software processes to their extreme. That is, they do not demand new language mechanisms, but require specific processes to be put in place.
A Formal Scenario and Metalanguage Support Means to Reason about It
Authors: Boris Galitsky
Venue:  (1998)

We build the reasoning tool of metalanguage support (MS) with the embedded mechanism of the invention of predicates and metapredicates for the comprehension and synthesis tasks. This tool, based on metalanguage representation with weakened soundness, gains the inference flexibility to represent the formal scenarios (for example, a limited class of "logical" anecdotes, derived from NL). We introduce the concept of formal scenario as an alternative to the traditional axiomatic method (logical program) for the practical applications and develop specific MS means to perform the reasoning within a formal scenario. The anecdote scenario is an appealing object of study in the logical programming because it reflects the top level of human intellectual activity on one hand and is rather compact on the other. We present such applications as scenario comprehension and generation, genetic algorithm of MS formula modifications, NL aspects of scenarios and modeling of the psychological disorder with corrupted pretending and believing concepts (autism). Such MS capabilities for scenario representation as reasoning about action, change and belief, temporal and spatial reasoning, are illustrated. MS is based on the rules of metalanguage transfer (inconsistency shift, variability shift and assumption enforcement), which connect the object level with the metalevel and introduce a number of ways to construct the scenario explanation predicates.