ppxscal/embedding_network huggingface dataset:
A Framework for Online Learning: The Virtual-U
Authors: Linda Harasim
Venue: Computer (1999)

Much of the online post-secondary education available in North America and Europe has been created piece-meal. This situation arose because educators began adopting computer networking in the mid-1970s, soon after the invention of packet-switched networks (1969) and e-mail and computer conferencing (1971) for exchange of scientific information. In late 1993, the author set out to help design a system using the Internet that would encourage the adoption of a collaborative learning approach. She and her colleagues also wanted to develop embedded tools to meet the needs of both instructors and students. The goal of their system, now known as the Virtual-U (http://www.vu.vlei. com), was to provide a flexible frame-work to support advanced pedagogies based on active learning, collaboration, multiple perspectives, and knowledge building. With two years of field trials serving more than 8,000 students and hosting 300 courses from 14 institutions, the Virutal-U provides a flexible yet well-organized framework for online, collaborative education. It brings together a multidisciplinary research team of educators, HCI specialists, engineers, computer scientists, and database and instructional designers, fulfilling the promise of integrated online learning.
Bounds on the Performance of Message Routing Heuristics
Authors: P. J. Bernhard
Venue: IEEE Transactions on Computers (1993)

Let S be a set of messages to be routed on an N*N omega network. In addition, suppose that S contains communication conflicts. One strategy to deal with such conflicts is to partition S into some number of subsets, called rounds, such that each subset is conflict-free. The messages are then routed through the network by successively routing the messages in each subset. The minimum round partitioning problem is the problem of partitioning a given message set into a minimum number of rounds. The author establishes upper and lower bounds on the performance ratio for two heuristics for partitioning message patterns into rounds. For both of these heuristics they give upper and lower bounds of O (log N) and Omega (logN), respectively.
Optimal Architectures and Algorithms for Mesh-Connected Parallel Computers with Separable Row/Column Buses
Authors: M. J. Serrano, B. Parhami
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A two-dimensional mesh of processing elements (PE's) with separable row and columnbuses (i.e., broadcast mechanisms for rows and columns that can be logically divided intoa number of local buses through the use of PE-controlled switches) has been shown to bequite effective for semigroup computation, prefix computation, and a wide class of othercomputations that do not require excessive communication or data routing. For mesheswith separable row/column buses, the authors show how semigroup and prefixcomputations can be performed with the same asymptotic time complexity without theprovision of buses for every row and every column and discuss the VLSI implications ofthis new architecture.
Determination of Stenosis and Occlusion in Arteries with the Application of FFT, AR, and ARMA Methods
Authors: Elif Derya Übeyli, İnan Güler
Venue: Journal of Medical Systems (2003)

Doppler ultrasound is a noninvasive technique that allows the examination of the direction, velocity, and volume of blood flow. Therefore, Doppler ultrasonography is known as reliable technique, which demonstrates the flow characteristics and resistance of arteries in various vascular disease. In this study, arterial Doppler signals recorded from 105 subjects were processed by PC-computer using fast Fourier transform, Burg autoregressive, and least squares modified Yule&ndash;Walker autoregressive moving average methods. Doppler power spectrums of arterial Doppler signals were obtained by using these spectrum analysis techniques. The variations in the shape of the Doppler power spectrums as a function of time were presented in the form of sonograms in order to obtain medical information. These sonograms were then used to compare the applied methods in terms of their frequency resolution and the effects in determination of stenosis and occlusion in arteries. Reliable information on hemodynamic alterations in arteries can be obtained by evaluation of these sonograms.
What Do You Mean by COTS? Finally, a Useful Answer
Authors: David Carney, Fred Long
Venue: IEEE Software (2000)

The use of the "COTS" acronym can be a convenience, but it can also lead to confusion. The authors propose a mechanism that clarifies communication about components, improves understanding of how components are used in particular systems, and sheds light on evaluation strategies. The method separates attributes along different axes of interest, locating each component in a graphical space with different axes of interest and multiple points of interest. Given the need for better understanding of component-based systems and their growing importance, the value of such a mechanism could outweigh the increased effort of using it
Design Validation: Comparing Theoretical and Empirical Results of Design Error Modeling
Authors: Sungho Kang, Stephen A. Szygenda
Venue: IEEE Design Test (1994)

To use simulation for design verification, designers need a confidence measure for a given set of simulation patterns, specifically for cases in which only a subset of the possible patterns is used. The authors derive a measure of design verification coverage based on the number of design errors detected in a theoretical analysis of a circuit. To verify the theoretical analysis, they simulate errors and compare the results.
The Montgomery Inverse and Its Applications
Authors: Burton S. Kaliski
Venue: IEEE Transactions on Computers (1995)

The Montgomery inverse of b modulo a is b¿12n mod a, where n is the number of bits in a. The right-shifting binary algorithm for modular inversion is shown naturally to compute the new inverse in fewer operations than the ordinary modular inverse. The new inverse facilitates recent work by Koç on modular exponentiation and has other applications in cryptography.
NCSA's World Wide Web Server: Design and Performance
Authors: Thomas T. Kwan, Robert E. McGrath, Daniel A. Reed
Venue: Computer (1995)

Shortly after the National Center for Supercomputing Applications' World Wide Web server was established, it became clear that the volume of WWW traffic would stress operating systems and network implementations in ways not originally envisioned by their designers. To support continued growth, WWW servers must manage a multigigabyte (in some instances a multiterabyte) database of multimedia information while concurrently serving multiple request streams. This places enormous demands on the servers' underlying operating and file systems. Simply put, WWW servers must become more adaptive and intelligent. This article describes the design of NCSA's WWW server and analyzes the access patterns to it. The analysis shows that scalability, protocol efficiency, and effective caching strategies are the major issues for the next generation of servers. In particular, the authors maintain that to improve performance, both clients and servers must aggressively exploit caching and prefetching on the basis of knowledge of request patterns, data types, and hardware capabilities.
Algebraic Techniques for Constructing Minimal Weight Threshold Functions
Authors: Vasken Bohossian, Jehoshua Bruck
Venue: SIAM Journal on Discrete Mathematics (2003)

A linear threshold element computes a function that is a sign of a weighted sum of the input variables. The best known lower bounds on the size of threshold circuits are for depth-2 circuits with small (polynomial-size) weights. However, in general, the weights are arbitrary integers and can be of exponential size in the number of input variables. Namely, obtaining progress in lower bounds for threshold circuits seems to be related to understanding the role of large weights. In the present literature, a distinction is made between the two extreme cases of linear threshold functions with polynomial-size weights, as opposed to those with exponential-size weights. Our main contributions are in devising two novel methods for constructing threshold functions with minimal weights and filling up the gap between polynomial and exponential weight growth by further refining the separation. Namely, we prove that the class of linear threshold functions with polynomial-size weights can be divided into subclasses according to the degree of the polynomial. In fact, we prove a more general result---that there exists a minimal weight linear threshold function for any arbitrary number of inputs and any weight size.
Managing Knowledge Work
Authors: Sue Newell, Harry Scarbrough, Maxine Robertson, Jacky Swan
Venue:  (2002)

:Designed as a true teaching text complete with pedagogical features to support learning, this book will provide a rigorous yet accessible approach to the new area of knowledge management. Based on empirical research rather than anecdotal evidence, the text is written specifically for a student audience rather than an academic one.
Software Metrics Knowledge and Databases for Project Management
Authors: Raymond A. Paul, Tosiyasu L. Kunii, Yoshihisa Shinagawa, Muhammad F. Khan
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Construction and maintenance of large, high-quality software projects is a complex, error-prone, and difficult process. Tools employing software database metrics can play an important role in efficient execution and management of such large projects. In this paper, we present a generic framework to address this problem. This framework incorporates database and knowledge-base tools, a formal set of software test and evaluation metrics, and a suite of advanced analytic techniques for extracting information and knowledge from available data. The proposed combination of critical metrics and analytic tools can enable highly efficient and cost-effective management of large and complex software projects. The framework has potential for greatly reducing venture risks and enhancing the production quality in the domain of large software project management.
Generalized Production Rules as a Basis for Integrating Active and Deductive Databases
Authors: Luigi Palopoli, Riccardo Torlone
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

We address the problem of providing a homogeneous framework for integrating, in a database environment, active rules, which allow the specification of actions to be executed whenever certain events take place, and deductive rules, which allow the specification of deductions in a logic programming style. Actually, it is widely recognized that both kinds of rules enhance the capabilities of database systems since they provide very natural mechanisms for the management of various important activities (e.g., knowledge representation, complex data manipulation, integrity constraint enforcement, view maintenance). However, in spite of their strong relationship, little work has been done on the unification of these powerful paradigms. In this paper, we present a rule-based language with an event-driven semantics that allows programmers to express both active and deductive computations. The language is based on a new notion of production rules whose effect is both a change of state and an answer to a query. By using several examples, we show that this simple language schema allows us to uniformly define different computations on data, including complex data manipulations, deductive evaluations, and active rule processing. We define the semantics of the language and then describe the architecture of a preliminary implementation of the language. Finally, we report about application and experience of use of the language.
An Iris Biometric System for Public and Personal Use
Authors: Michael Negin, Thomas A. Chmielewski, Marcos Salganicoff, Theodore A. Camus, Ulf M. Cahn von Seelen, Péter L. Venetianer, Guanghua G. Zhang
Venue: Computer (2000)

Much work in the emerging field of biometrics has focused on identification applications. Biometrics offers the means to identify individuals without requiring that they carry ID cards and badges or memorize passwords. A leading concern in the development of such applications, however, is how to avoid rejecting valid users or approving impostors. The iris of the eye may provide a solution by offering a much more discriminating biometric than fingerprint or face recognition. The authors have designed and implemented an iris biometric system for personal electronic identification. Further, their system solves problems associated with public-use devices such as automated teller machines, where habituated use is not the norm. The system also addresses personal- use arenas, such as home banking, and other Internet and network applications, such as secure business logons. The article describes the public- and personal-use systems, as well as relating statistical analysis and field trials to gauge the effectiveness of their system.
Explaining 'Explaining Away'
Authors: M. P. Wellman, M. Henrion
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

'Explaining away' is a common pattern of reasoning in which the confirmation of one cause of an observed or believed event reduces the need to invoke alternative causes. The opposite of explaining away also an occur, where the confirmation of one cause increases belief in another. A general qualitative probabilistic analysis of intercausal reasoning is provided and the property of the interaction among the causes (product synergy) that determines which form of reasoning is appropriate is identified. Product synergy extends the qualitative probabilistic network (QPN) formalism to support qualitative intercausal inference about the directions of change in probabilistic belief. The intercausal relation also justifies Occam's razor, facilitating pruning in the search for likely diagnoses.
Deadline Assignment in a Distributed Soft Real-Time System
Authors: Ben Kao, Hector Garcia-Molina
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

In a distributed environment, tasks often have processing demands at multiple different sites. A distributed task is usually divided into several subtasks, each to be executed in order at some site. In a real-time system, an overall deadline is usually specified by an application designer indicating when a distributed task is to be finished. In this paper, we present and analyze techniques for automatically translating the overall deadline into deadlines for the individual subtasks.
Knowledge-Based Image Retrieval with Spatial and Temporal Constructs
Authors: Wesley W. Chu, Chih-Cheng Hsu, Alfonso F. Cárdenas, Ricky K. Taira
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

A knowledge-based approach to retrieve medical images by feature and content with spatial and temporal constructs is developed. Selected objects of interest in a medical image (e.g., x-ray, MR image) are segmented, and contours are generated from these objects. Features (e.g., shape, size, texture) and content (e.g., spatial relationships among objects) are extracted and stored in a feature and content database. Knowledge about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). The high-level nodes in the TAH represent more general concepts than low-level nodes. Thus, traversing along TAH nodes allows approximate matching by feature and content if an exact match is not available. TAHs can be generated automatically by clustering algorithms based on feature values in the databases and hence are scalable to large collections of image features. Further, since TAHs are generated based on user classes and applications, they are context- and user-sensitive. A knowledge-based semantic image model is proposed that consists of four layers (raw data layer, feature and content layer, schema layer, and knowledge layer) to represent the various aspects of an image objects' characteristics. The model provides a mechanism for accessing and processing spatial, evolutionary, and temporal queries. A knowledge-based spatial temporal query language (KSTL) has developed that extends ODMG's OQL and supports approximate matching of feature and content, conceptual terms, and temporal logic predicates. Further, a visual query language has been developed that accepts point-click-and-drag visual iconic input on the screen that is then translated into KSTL. User models are introduced to provide default parameter values for specifying query conditions. We have implemented a Knowledge-Based Medical Database System (KMeD) at UCLA, and it is currently under evaluation by the medical staff. The results from this research should be applicable to other multimedia information systems as well.
TBSAM: An Access Method for Efficient Processing of Statistical Queries
Authors: J. Srivastava, J. S. E. Tan, V. Y. Lum
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The domain of statistical and scientific databases is targeted here, and the class of aggregate queries which are very often encountered in this domain is considered. Such a query is aimed at retrieving some aggregate characteristics of the raw data. The tree-based statistics access method (TBSAM), which provides support for the efficient processing of aggregate queries, is presented. It is related to the B/sup tree and also processes the B/sup tree's efficient update properties. Complementing TBSAM is the provision of a grouped update algorithm for minimizing expensive indexed database updates.
Performance Tuning Software DSM Applications using Visualisation
Authors: Mats Brorsson, Martin Kral
Venue: The Journal of Supercomputing (1999)

Small organisations can now have access to high raw processing power using networks of workstations (NOW) as parallel computing platforms. Software Distributed Shared Memory (Software DSM) packages have been developed to facilitate the programming of such systems. However, because of the high interprocess latencies in a NOW, the performance of a software DSM application is more susceptible to the partitioning of the problem than what might be expected.This paper presents an approach for a tool to visualise the execution of a program in a way that highlights performance bottlenecks. The tool associates identified bottlenecks with the corresponding source code lines in order to determine what piece of code is the cause of poor performance. The visualisation technique is demonstrated in two case studies. They clearly show that the visualisation is indeed useful and provides an effective way to acquire an understanding of what characterises an applications sharing behaviour.
A Reconfigurable Modular Fault-Tolerant Hypercube Architecture
Authors: C. S. Yang, L. P. Zu, Y. N. Wu
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We propose a new fault-tolerant design of a hypercube system. We first build thefault-tolerant modules (FTM's), then we interconnect these FTM's as the modularhypercube. Finally, we obtain our proposed system by augmenting links, called thespare-sharing links (SSL's), in the modular hypercube, which forms a ring connection inour architecture. The characteristic of our system is that the spare nodes in an FTM canbe used as local spares to replace the faulty nodes in the FTM, or as remote spares toreplace the faulty nodes in other FTM's via the spare-sharing links in the architecture.Thus, the use of spare nodes in any FTM will increase, and the proposed system reliability will improve. In the system, the switch and link failures are also considered. The modular diagnosis and modular reconfiguration are proposed to identify and reconfigure the failure of nodes, switches, and links.
Rothko: A Three-Dimensional FPGA
Authors: Miriam Leeser, Waleed M. Meleis, Mankuan M. Vai, Silviu Chiricescu, Weidong Xu, Paul M. Zavracky
Venue: IEEE Design Test (1998)

Rothko is a novel 3-dimensional field programmable gate array architecture that is based on the three dimensional VLSI technology developed at Northeastern University. This technology uses transferred circuits and allows for the placement of metal interconnections between layers of active devices. These metal interconnections can be placed anywhere on the chip. Our FPGA architecture, called Rothko, extends the Routing and Logic Block (RLB) model developed for the Triptych architecture to three dimensions. Triptych makes use of a model, similar to a sea-of-gates model, where individual cells can be used for routing, logic, or both. We extend this to three dimensions by adding connections to each RLB from above and below. This makes our architecture truly 3-D with each logic block having connections to logic blocks on other layers. In this paper we present the architecture of a two layer RLB, discuss the 3-D technology we use, and discuss CAD tools for mapping designs onto Rothko.
Time-Division Optical Communications in Multiprocessor Arrays
Authors: C. Qiao, R. G. Melhem
Venue: IEEE Transactions on Computers (1993)

An optical communication structure is proposed for multiprocessor arrays which exploits the high communication bandwidth of optical waveguides. The structure takes advantage of two properties of optical signal transmissions on waveguides, namely, unidirectional propagation and predictable propagation delays per unit length. Because of these two properties, time-division multiplexing (TDM) of messages has the same effect as message pipelining on optical waveguides. Two TDM approaches are proposed, and the combination of the two is used in the design of the optical communication structure. Analysis and simulation results are given to demonstrate the communication effectiveness of the system. A clock distribution method is proposed to address potential synchronization problems. Feasibility issues with current and future technologies are discussed.
Parallel High-Radix Nonrestoring Division
Authors: E. M. Schwarz, M. J. Flynn
Venue: IEEE Transactions on Computers (1993)

An algorithm for high-radix nonrestoring division is proposed which combines a cost-efficient quotient estimation technique with collapsing of the division into one operation each iteration. The quotient estimation technique is a direct combinatorial algorithm which allows a more generalized partial remainder than similar studies. In addition, the successor partial remainder is calculated directly from the previous partial remainder. The intermediate steps of calculating the next quotient estimate, multiplying it by the divisor, and then subtracting the result from the previous remainder are telescoped into one step. This is possible due to the use of simple direct combinatorial equations for the quotient estimate. Thus, one operation is used to generate the next remainder from the previous remainder. This operation is similar to a multiplication with a reduced carry propagate adder. This algorithm reduces the latency of each iteration to less than the delay of one multiplication. Thus, high-radix nonrestoring division is possible with a low latency and no need for an off-chip ROM to hold a quotient estimate.
Performance and the i860 Microprocessor
Authors: Mark Atkins
Venue: IEEE Micro (1991)

The internal design of the i860 CPU, which exploits pipelining and parallelism more than previous microprocessors, is described. The i860 uses RISC concepts and memory-performance optimizations in several novel ways. Other innovations include simultaneous floating-point operations similar to digital signal processing, a two-instruction-per-clock mode, fast floating-point pipelines graphics instructions, and high-bandwidth registers and caches on-chip. These features make it one of the fastest single-chip processors available.
E3 2001: The Birth of Ubiquitous Gaming?
Authors: Michael Macedonia
Venue: Computer (2001)

Synergistic developments across the video game industry pave the way for gaming anytime, anywhere.