ppxscal/embedding_network huggingface dataset:
Course and exercise sequencing using metadata in adaptive hypermedia learning systems
Authors: Stephan Fischer
Venue: Journal on Educational Resources in Computing (JERIC) (2001)

In the last few years the (semi-) automatic sequencing of course material has become an important research issue, particularly the standardization of metadata for educational resources. Sequencing can help to generate hypermedia documents which, at their best match the learner's needs. To perform (semi-) automatic course sequencing, a knowledge library as well as modular resources can be used. Both must be described by metadata. First, metadata standards (IEEE Learning Objects Metadata, Instructional Mangement Systems Global Learning Consortium, Dublin Core) are analyzed with regard to course sequencing. As an application example, Multibook, an adaptive hypermedia system used to teach multimedia technology, is described. Multibook uses metadata to create course sequences semi-automatically. In this article we explain how a knowledge library can be used to create exercises automatically. We give an example of how courses can be sequenced in general by analyzing the creation of exercises. An evaluation of our system shows the advantages and drawbacks of the automatic sequencing approach. are analyzed with regard to course sequencing. As an application example, Multibook uses metadata to create course sequences semi-automatically. In this article we explain how a knowledge library can be used to create automatically. We give an example of how courses can be sequenced in general by analyzing the creation of exercises. An evaluation of our system shows the advantages and drawbacks of the automatic course sequencing approach.
A fast algorithm for detection of Chinese lihe words (poster session)
Authors: Wang Gang, Wang Yongcheng, Lua Kim Teng
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

In the Chinese linguistic study, there is a kind of words that are called lihe words. These words can be separated by certain modifier words such as adjective, quantifier, and so on, but the meaning of the word is not changed. If we separated the part of the lihe Chinese word as an independent word, it is not reasonable and easily makes some unnecessary ambiguous segmentation. So how to detect lihe word quickly and effectively is a real problem in Chinese natural language processing. In this paper, we introduced a model of processing lihe words, which use Semantics Extracting Tree to detect the lihe words quickly and accurately.
Max-fit biarc fitting to STL models for rapid prototyping processes
Authors: Bahattin Koc, Yuan-Shin Lee, Yawei Ma
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

This paper presents a method of Max-Fit biarc curve fitting technique to improve the accuracy of STL files and to reduce the file size for rapid prototyping. STL file has been widely accepted as a de facto standard file format for the rapid prototyping industry. However, STL format is an approximated representation of a true solid/surface model, and a huge amount of STL data is needed to provide sufficient accuracy for rapid prototyping. This paper presents a Max-Fit biarc curve fitting technique to reconstruct STL slicing data for rapid prototyping. The Max-Fit algorithm progresses through the STL slicing intersection points to find the most efficient biarc curve fitting, while improving the accuracy. Our results show the proposed biarc curve-fitting technique can significantly improve the accuracy of poorly generated STL files by smoothing the intersection points for rapid prototyping. Therefore less strict requirements (i.e. loose triangle tolerances) can be used while genarating the STL files.
Searching the deep web: distributed explorit directed query applications
Authors: Valerie S. Allen, Abe Lederman
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In 1999 a directed query distributed search engine was integrated into a new Department of Energy Virtual Library of Energy Science and Technology. Millions of pages of government information across multiple agencies were made immediately searchable via one query, setting the stage for the development of a variety of interagency initiatives and applications.
iFind—a system for semantics and feature based image retrieval over Internet
Authors: Hongjiang Zhang, Liu Wenyin, Chunhui Hu
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

iFind&copy; (v 1.0) is a web based image retrieval system developed at Microsoft Research China. It provides the functionalities of keyword based image search, query by image example, category based image browsing, relevance feedback, and semi-automatic image annotation. The key technology in the system is the integrated semantics and feature based image retrieval and relevance feedback approach, which will be presented in our paper in the ACM Multimedia 2000 Proceedings [1]. When the user provides feedback images, the system can refine the retrieval result based on the user's feedback. In the meantime, the system updates the annotation of feedback images by increasing the linkage to the positive examples' annotation and decreasing the linkage to the negative examples' annotation. The updated annotation can further help to improve image retrieval results of the system in later use.
Well-Spaced Labelings of Points in Rectangular Grids
Authors: Jeffrey C. Lagarias
Venue: SIAM Journal on Discrete Mathematics (2000)

We describe methods to label the M1 &times; M2 grid with the integers 1 to M1 M2 so that any K consecutively labeled cells are relatively far apart in the grid in the Manhattan metric. Constructions of such labelings are given which are nearly optimal in a range of conditions. Such labelings can be used in addressing schemes for storing data on two-dimensional arrays that include randomly located "blobs" of defective cells. The data can be precoded using block error-correcting codes before storage, and the usefulness of well-spaced points is to decrease the probability of "burst" errors which cannot be corrected. Possible applications include the storage of speech or music on low-quality memory chips and in "holographic memories" to store bit-mapped data.More generally, we present a general family of mappings of the integers 1 to M1 M2 . . . Md onto the d-dimensional grid of size M1 &times; M2 &times; . . . &times; Md, called mixed radix vector mappings. These mappings give labelings whenever they are one to one. We give a sufficient condition for these mappings to be one to one, which is easy to verify in many cases.
Optimal program and data locations in computer networks
Authors: Howard L. Morgan, K. Dan Levin
Venue: Communications of the ACM (1977)

An optimization procedure for the allocation of program and data files in a computer network is presented. This algorithm takes into account the dependencies between files and programs such as occur in real heterogeneous computer networks. Insights into whether or not to convert programs from one computer to another can also be gained from the model. A search procedure for the file location problem is described, along with an example and a possible application of the model.
Touring the C++ classroom project
Authors: Mike Otten
Venue: Journal of Computing Sciences in Colleges (2001)

This workshop will lead participants through the &ldquo;C++ Classroom Project&rdquo;, a project designed to help faculty bring exciting applications into the introductory classroom. This project has created, class tested, and documented a number of C++ classes that enable students to: draw 2D graphics, populate Excel worksheets and charts, control PowerPoint presentations, and interact with talking/animated MS-Agent characters. The classes are packaged with Visual-C++ console applications in order to maintain a focus on learning standard C++ from a standard textbook. All system-dependent api's and nuances are &ldquo;hidden&rdquo; in the class internals for stepping over, or tracing into, as preference would have it! Following a brief overview, participants will download the project files, step through the starter modules, and have the opportunity to write a few short exercises. A familiarity with C++, especially Visual C++, is helpful but not imperative. Feel free to join for the overview and/or the entire workshop.
Monitoring Activities from Multiple Video Streams: Establishing a Common Coordinate Frame
Authors: Lily Lee, Raquel Romano, Gideon Stein
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Monitoring of large sites requires coordination between multiple cameras, which in turn requires methods for relating events between distributed cameras. This paper tackles the problem of automatic external calibration of multiple cameras in an extended scene, that is, full recovery of their 3D relative positions and orientations. Because the cameras are placed far apart, brightness or proximity constraints cannot be used to match static features, so we instead apply planar geometric constraints to moving objects tracked throughout the scene. By robustly matching and fitting tracked objects to a planar model, we align the scene's ground plane across multiple views and decompose the planar alignment matrix to recover the 3D relative camera and ground plane positions. We demonstrate this technique in both a controlled lab setting where we test the effects of errors in the intrinsic camera parameters, and in an uncontrolled, outdoor setting. In the latter, we do not assume synchronized cameras and we show that enforcing geometric constraints enables us to align the tracking data in time. In spite of noise in the intrinsic camera parameters and in the image data, the system successfully transforms multiple views of the scene's ground plane to an overhead view and recovers the relative 3D camera and ground plane positions.
QuARC: expressive security mechanisms
Authors: John D. Yesberg, Mark S. Anderson
Venue: Proceedings of the 1995 workshop on New security paradigms (1995)

Security mechanisms in current distributed computer systems only allow a small range of security policies to be implemented. We present a system which uses some unusual mechanisms that allow it to implement a much wider variety of policies. This will allow computer security policies to be much better aligned with organisational policies.The mechanisms discussed are quantitative authentication and vouching, rule-based roles with quantitatives privileges, and committees. This paper provides an introduction to these mechanisms and shows how they are used in our system.
Expertise recommender: a flexible recommendation system and architecture
Authors: David W. McDonald, Mark S. Ackerman
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Locating the expertise necessary to solve difficult problems is a nuanced social and collaborative problem. In organizations, some people assist others in locating expertise by making referrals. People who make referrals fill key organizational roles that have been identified by CSCW and affiliated research. Expertise locating systems are not designed to replace people who fill these key organizational roles. Instead, expertise locating systems attempt to decrease workload and support people who have no other options. Recommendation systems are collaborative software that can be applied to expertise locating. This work describes a general recommendation architecture that is grounded in a field study of expertise locating. Our expertise recommendation system details the work necessary to fit expertise recommendation to a work setting. The architecture and implementation begin to tease apart the technical aspects of providing good recommendations from social and collaborative concerns.
Mutual Information Theory for Adaptive Mixture Models
Authors: Zheng Rong Yang, Mark Zwolinski
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Many pattern recognition systems need to estimate an underlying probability density function (pdf). Mixture models are commonly used for this purpose in which an underlying pdf is estimated by a finite mixing of distributions. The basic computational element of a density mixture model is a component with a nonlinear mapping function, which takes part in mixing. Selecting an optimal set of components for mixture models is important to ensure an efficient and accurate estimate of an underlying pdf. Previous work has commonly estimated an underlying pdf based on the information contained in patterns. In this paper, mutual information theory is employed to measure whether two components are statistically dependent. If a component has small mutual information, it is statistically independent of the other components. Hence, that component makes a significant contribution to the system pdf and should not be removed. However, if a particular component has large mutual information, it is unlikely to be statistically independent of the other components and may be removed without significant damage to the estimated pdf. Continuing to remove components with large and positive mutual information will give a density mixture model with an optimal structure, which is very close to the true pdf.
Predictability requirements of a soft modem
Authors: Michael B. Jones, Stefan Saroiu
Venue: Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2001)

Soft Modems use the main processor to execute modem functions traditionally performed by hardware on the modem card. To function correctly, soft modems require that ongoing signal processing computations be performed on the host CPU in a timely manner. Thus, signal processing is a commonly occurring background real-time application---one running on systems that were not designed to support predictable real-time execution. This paper presents a detailed study of the performance characteristics and resource requirements of a popular soft modem. Understanding these requirements should inform the efforts of those designing and building operating systems needing to support soft modems. Furthermore, we believe that the conclusions of this study also apply to other existing and upcoming soft devices, such as soft Digital Subscriber Line (DSL) cards. We conclude that (1) signal processing in an interrupt handler is not only unnecessary but also detrimental to the predictability of other computations in the system and (2) a real-time scheduler can provide predictability for the soft modem while minimizing its impact on other computations in the system.
Speedup of a sparse system simulation
Authors: James Nutaro, Hessam Sarjoughian
Venue: Proceedings of the fifteenth workshop on Parallel and distributed simulation (2001)

Optimistic and conservative simulation algorithms have been effective for speeding up the execution of many simulation programs. Event stepped techniques have also been shown to be effective for certain types of problems. This paper presents a conjecture that sparse systems are effectively simulated by conservative and optimistic techniques, where sparseness is characterized by the ratio of output generating states to non-output generating states. The speedup results for a representative sparse simulation are shown to support this conjecture.
The Finite Mass Method
Authors: Christoph Gauger, Peter Leinen, Harry Yserentant
Venue: SIAM Journal on Numerical Analysis (2000)

The finite mass method, a new Lagrangian method for the numerical simulation of gas flows, is presented and analyzed. In contrast to the finite volume and the finite element method, the finite mass method is founded on a discretization of mass, not of space. Mass is subdivided into small mass packets of finite extension, each of which is equipped with finitely many internal degrees of freedom. These mass packets move under the influence of internal and external forces and the laws of thermodynamics and can undergo arbitrary linear deformations. The method is based on an approach recently developed by Yserentant and can attain a very high accuracy.
ScaLAPACK: a portable linear algebra library for distributed memory computers - design issues and performance
Authors: Laura Susan Blackford, J. Choi, A. Cleary, A. Petitet, R. C. Whaley, J. Demmel, I. Dhillon, K. Stanley, J. Dongarra, S. Hammarling, G. Henry, D. Walker
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

This paper outlines the content and performance of ScaLAPACK, a collection of mathematical software for linear algebra computations on distributed memory computers. The importance of developing standards for computational and message passing interfaces is discussed. We present the different components and building blocks of ScaLAPACK, and indicate the difficulties inherent in producing correct codes for networks of heterogeneous processors. Finally, this paper briefly describes future directions for the ScaLAPACK library and concludes by suggesting alternative approaches to mathematical libraries, explaining how ScaLAPACK could be integrated into efficient and user-friendly distributed systems.
A cognitive model of learning from examples
Authors: Eric S. Fleischman
Venue: Journal of Computing Sciences in Colleges (2001)

I am working on a project involving cognitive modeling. I am currently examining some of the types of study habits that cause students to learn most effectively. For this project we are focusing on students learning introductory physics. My current goal is to investigate an existing computer program called Cascade (VanLehn, Jones, Chi, 1992), and evaluate its coverage of some recent psychological data on human learning. In past research Cascade was able to model psychological data on the &ldquo;Self-Explanation Effect&rdquo; (Chi, Bassok, Lewis, Reimann, Glaser, 1989). I intend to use Cascade to explain new results (Renkl, Atkinson, Maier, 2000) showing how student learning can depend on the particular presentation of examples and study problems. To summarize, Renkl et al. found that it is possible to increase the effectiveness of studying worked out examples, if the examples are gradually &ldquo;faded&rdquo; from fully worked out examples to increasingly more incomplete problems.
On the generalized dining philosophers problem
Authors: Oltea Mihaela Herescu, Catuscia Palamidessi
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully distributed systems, and we address the problem of guaranteeing progress and lockout-freedom, even in presence of adversary schedulers, by using randomized algorithms. We show that the well-known algorithms of Lehmann and Rabin do not work in the generalized case, and we propose an alternative algorithm based on the idea of letting the philosophers assign a random priority to their adjacent forks.
An undergraduate program in computer science&mdash;preliminary recommendations
Authors: S. D. Conte, John W. Hamblen, William B. Kehl, Silvio O. Navarro, Werner C. Rheinboldt, David M. Young,  Jr., William F. Atchinson
Venue: Communications of the ACM (1965)

The Curriculum Committee on Computer Science (C3S) of the Association for Computing Machinery has been considering curriculum problems for approximately three years. During the early part of this period, a number of informal sessions were held with computer people at various national meetings. In the latter part of this three-year period, the Committee has been formally organized and has made a definite effort to arrive at a concrete suggestions for a curriculum.
Algorithms for phylogenetic footprinting
Authors: Mathieu Blanchette
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Phylogenetic footprinting is a technique that identifies regulatory elements by finding unusually well conserved regions in a set of orthologous non-coding DNA sequences from multiple species. In an earlier paper, we presented an exact algorithm that identifies the most conserved region of a set of sequences. Here, we present a number of algorithmic improvements that produce a 1000 fold speedup over the original algorithm. We also show how prior knowledge can be used to identify weaker motifs, and how to handle data sets in which only an unknown subset of the sequences contain the regulatory element. Each technique is implemented and successfully identifies a large number of known binding sites, as well as several highly conserved but uncharacterized regions.
Optimal space allocation on disk storage devices
Authors: Howard Lee Morgan
Venue: Communications of the ACM (1974)

When the amount of space required for file storage exceeds the amount which can be kept online, decisions must be made as to which files are to be permanently resident and which mountable. These decisions will affect the number of mount requests issued to the operators. This is often a bottleneck in a computing facility, and reducing the number of mounts thus decreases turnaround time. An optimization model for the assignment of files to disk packs, and packs to either resident or nonresident status is presented. Heuristics are suggested for those cases in which it is Inefficient to compute the actual optimum.
Pattern computer (abstract only)
Authors: Taras Vintsiuk
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

Problems of designing, creation, developing, production and dissemination for principally new so called pattern computers and respective intellectual information technologies and systems are discussed. Research strategy and technical policy for Ukraine on 2000-2010 years period as well as on nearest 2000-2003 years period are considered too. For example, ways how to create a dictation and spoken translation machine are debated.
Intelligent information triage
Authors: Sofus A. Macskassy, Foster Provost
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In many applications, large volumes of time-sensitive textual information require triage: rapid, approximate prioritization for subsequent action. In this paper, we explore the use of prospective indications of the importance of a time-sensitive document, for the purpose of producing better document filtering or ranking. By prospective, we mean importance that could be assessed by actions that occur in the future. For example, a news story may be assessed (retrospectively) as being important, based on events that occurred after the story appeared, such as a stock price plummeting or the issuance of many follow-up stories. If a system could anticipate (prospectively) such occurrences, it could provide a timely indication of importance. Clearly, perfect prescience is impossible. However, sometimes there is sufficient correlation between the content of an information item and the events that occur subsequently. We describe a process for creating and evaluating approximate information-triage procedures that are based on prospective indications. Unlike many information-retrieval applications for which document labeling is a laborious, manual process, for many prospective criteria it is possible to build very large, labeled, training corpora automatically. Such corpora can be used to train text classification procedures that will predict the (prospective) importance of each document. This paper illustrates the process with two case studies, demonstrating the ability to predict whether a news story will be followed by many, very similar news stories, and also whether the stock price of one or more companies associated with a news story will move significantly following the appearance of that story. We conclude by discussing how the comprehensibility of the learned classifiers can be critical to success.}