ppxscal/embedding_network huggingface dataset:
A new approach to a first year undergraduate information systems course
Authors: Denise Tolhurst, Bob Baker
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

This paper describes the development, implementation and evaluation of a new teaching approach for a large first year undergraduate course in information systems at the University of New South Wales. Poor quality of experience for students attending large lecture courses was recognised, and an alternative approach developed that aimed to improve the first year experience by minimising large formal lectures and encouraging both student independent learning and quality small group interactions. A course structure based on small regular workshop groups, weekly web-supported independent activities (WSIA) completed by students before attending class and occasional lectures was initially implemented in first session 2002. A variety of course evaluation approaches were used to assess the success of the course design and implementation, including student focus groups, student feedback questionnaires, standard university course and teaching evaluations, weekly meetings of staff, observations and informal conversations with students. This paper describes the recognition of the need to improve the course, the design and development of the course, discusses the first implementation of the course, it reports on the evaluation of the course and describes some consequent changes implemented in the subsequent offering of the course.
Path Profile Guided Partial Redundancy Elimination Using Speculation
Authors: Rajiv Gupta, David A. Berson, Jesse Z. Fang
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

While programs contain a large number of paths, a very small fraction of these paths are typically exercised during program execution. Thus, optimization algorithms should be designed to trade off the performance of less frequently executed paths in favor of more frequently executed paths. However, traditional formulations to code optimizations are incapable of performing such a trade-off. We present a path profile guided partial redundancy elimination algorithm that uses speculation to enable the removal of redundancy along more frequently executed paths at the expense of introducing additional expression evaluations along less frequently executed paths. We describe cost-benefit data flow analysis that uses path profiling information to determine the profitability of using speculation. The cost of enabling speculation of an expression at a conditional is determined by identifying paths along which an additional evaluation of the expression is introduced. The benefit of enabling speculation is determined by identifying paths along which additional redundancy elimination is enabled by speculation. The results of this analysis are incorporated in a speculative expression hoisting framework for partial redundancy elimination.
The SPHINX-II Speech Recognition System: An Overview
Authors: Xuedong Huang, Fileno Alleva, Hsiao Hon, Mei Hwang, Ronald Rosenfeld
Venue:  (1992)

In order for speech recognizers to deal with increased task perplexity, speaker variation, and environment variation, improved speech recognition is critical. Steady progress has been made along these three dimensions at Carnegie Mellon. In this paper, we review the SPHINX-II speech recognition system and summarize our recent efforts on improved speech recognition.
A Generic Scheme and Sample Implementation Architecture for Graceful Service Adaptation in Multimedia Database Systems
Authors: H. Thimm, M. T. Özsu
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Today's limitations of general purpose distributed computing environments require for multimedia database systems capabilities for graceful adaptation of the Quality of Service (QoS). This requirement is in particular acute for presentational applications where possibly hundreds of multimedia presentations must be performed simultaneously. The QoS adaptations must be coordinated with each other to provide for an optimal global resource utilization and the maximal viewer acceptance. To meet this goal, we propose the distributed playout load control scheme PYLOT which may be customized by content providers and viewers. Furthermore, we describe a generic implementation framework to deploy PYLOT and demonstrate this framework based on the AMOS multimedia database management system.
A 2-3/4-Approximation Algorithm for the Shortest Superstring Problem
Authors: Chris Armen, Clifford Stein
Venue:  (1994)

Given a collection of strings S={s_1,...,s_n} over an alphabet Sigma, a superstring alpha of S is a string containing each s_i as a substring, that is, for each i, 1>=i>=n, alpha contains a block of |s_i| consecutive characters that match s_i exactly. The shortest superstring problem is the problem of finding a superstring alpha of minimum length. The shortest superstring problem has applications in both computational biology and data compression. The problem is NP-hard [GallantMS80]; in fact, it was recently shown to be MAX SNP-hard [BlumJLTY91]. Given the importance of the applications, several heuristics and approximation algorithms have been proposed. Constant factor approximation algorithms have been given in [BlumJLTY91] (factor of 3), [TengY93] (factor of 2-8/9), [CzumajGPR94] (factor of 2-5/6) and [KosarajuPS94] (factor of 2-50/63). Informally, the key to any algorithm for the shortest superstring problem is to identify sets of strings with large amounts of similarity, or overlap. While the previous algorithms and their analyses have grown increasingly sophisticated, they reveal remarkably little about the structure of strings with large amounts of overlap. In this sense, they are solving a more general problem than the one at hand. In this paper, we study the structure of strings with large amounts of overlap and use our understanding to give an algorithm that finds a superstring whose length is no more than 2-3/4 times that of the optimal superstring. We prove several interesting properties about short periodic strings, allowing us to answer questions of the following form: given a string with some periodic structure, characterize all the possible periodic strings that can have a large amount of overlap with the first string.
A Reuse-Based Software Architecture for Management Information Systems
Authors: Jeffrey S. Poulin, Norm Kemerer, Mike Freeman, Tim Becker, Kathy Begbie, Cheryl D'Allesandro, Chuck Makarsky
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

This paper describes a Software Architecture for applications in the domain of Management Information Systems (MIS). Using principles of software reuse and the architectural concepts introduced by Garlan and Shaw, this paper describes the software architecture in terms of reusable components (of both applications and data) which provide domain-independent and domain-specific components for shared business functions. The architecture identifies the connectors between the components and gives rules that specify the constraints within which to apply the architecture. We describe the architecture using four "views" in order to help interpret the architecture for developers. We then implement the architecture with a set of architectural models in our CASE toolset; these models serve as reusable templates from which developers can instantiate their own architectural models. Designed to fully comply with Open Systems Environment standards and in use today on one of the U.S. Army's largest information systems, this architecture has led to unmodified component reuse levels of over 20% after completing only 7 of as many as 60 projected applications.
Augmented Sifting of Multiple-Valued Decision Diagrams
Authors: D. Michael Miller, Rolf Drechsler
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Discrete functions are now commonly represented bybinary (BDD) and multiple-valued (MDD) decisiondiagrams. Sifting is an effective heuristic techniquewhich applies adjacent variable interchanges to find agood variable ordering to reduce the size of a BDD orMDD.Linear sifting is an extension of BDD sifting where XORoperations involving adjacent variable pairs augmentadjacent variable interchange leading to furtherreduction in the node count. In this paper, we considerthe extension of this approach to MDDs. In particular,we show that the XOR operation of linear sifting can beextended to a variety of operations. We term the resultingapproach augmented sifting.Experimental results are presented showing sifting andaugmented sifting can be quite effective in reducing thesize of MDDs for certain types of functions.
An Optimal Randomized Ranking Algorithm on the k-channel Broadcast Communication Model
Authors: Koji Nakano
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

A Broadcast Communication Model (BCM, for short) is a distributed system with no central arbiter populated by n processing units referred to as stations. The stations can communicate by broadcasting/receiving data packets in one of k communication channels. We assume that the stations run on batteries and expands power while broadcasting/receiving a data packet. Thus, the most important measure to evaluate algorithms on the BCM is the numberof awake time slots, in which a station is broadcasting/receiving a data packet. We also assume that the stations are identical and have no unique ID number, and no station knows the number n of the stations. For given n keys one for each station, the ranking problem asks each station to determine the number of keys in the BCM smaller than its own key. The main contribution of this paper is to present an optimal randomized ranking algorithm on thek-channel BCM. Our algorithm solves the ranking problem, with high probability, in 0(\frac {n}{k} + \log n time slots with no station being awake for more than O(log n) time slots. We also prove that any randomized ranking algorithm is required to run in expected \Omega (\frac {n}{k} + \log n) time slots with at least one station being awake for expected \Omega(log n) time slots. Therefore, our ranking algorithm is optimal.
Implementation of Multiple-Precision Parallel Division and Square Root on Distributed-Memory Parallel Computers
Authors: Daisuke Takahashi
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

We present efficient parallel algorithms for multiple-precision division and square root operation of more than sever al million decimal digits on distributed-memory parallel computers. It is well known that multiple-precision division and square root operation can be reduced to multiple-precision addition, subtraction, and multiplication by using Newton iteration. Because a key operation in fast multiple-precision arithmetic is multiplication, a parallel implementation of floating-point real FFT-base d multiplication is used. We also parallelized an operation of releasing propagate d carries and borrows in multiple-precision addition, subtraction, and multiplication. In parallel implementation of Newton, iteration based multiple-precision division and square root operation, there is a tradeoff between load balance and communication overhead on distributed-memory parallel computers. An efficient data distribution for multiple-precision division and square root operation by using Newton iteration is given with confirmation of the theoretical analysis. We achieved high performance multiple-precision calculation of division and square root operation on distributed-memory parallel computers.
Architecture Recovery of Dynamically Linked Applications: A Case Study
Authors: Igor Ivkovic, Michael W. Godfrey
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Most previously published case studies in architecture recovery have been pegormed on statically linked software systems. Due to the increase in use of middleware technologies, such as CORBA, and OOP concepts, such as polymorphism there is an opportunity and a need to analyze architectures of these dynamically linked systems. This paper presents the results of software architecture extraction of the Nautilus file manager, which employs CORBA in its implementation. A combination of existing static analysis and use-case modeling architecture recovery techniques was used with the expectation of complex but complete architecture extraction of a system such as Nautilus. We have found that this combined approach named Dynamo-l presented in this paper provided successful focused architecturerecovery and guidance for the future work in complete architecture recovery of dynamically linked applications.
Portable Runtime Support for Graph-oriented Parallel and Distributed Programming
Authors: J. Cao, Y. Liu, L. Xie, K. Zhang
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

In this paper, we describe the design and implementation of a portable run-time system for GOP, a graph-oriented programming framework aiming at providing high-level abstractions for configuring and programming cooperative parallel processes. The runtime system provides an intelface with a library of programming primitives to the low-level facilities required to support graph-oriented communications and synchronization. The implementation is on top of theParallel Virtual Machine (PVM) in a local area network of Sun workstations. Issues related to the implementation of graph operations in a distributed environment are discussed. Performance of the runtime system is evaluated by estimating the overheads associated with using GOP primitives as opposed to PVM.
Quaternion wavelets on CAGD
Authors: L. Traversoni
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

It is shown how wavelets may be built in quaternion Hilbert spaces and some possible uses as well as the advantages it may represent.
Parallel Solution of Arbitrarily Sparse Linear Systems
Authors: A R Wagner
Venue:  (1984)

A parallel algorithm for the iterative solution of sparse linear systems is presented. This algorithm is shown to be efficient for arbitrarily sparse matrices. Analysis of this algorithm suggests that a network of Processing Elements [PEs] equal in number to the number $R$ of non-zero matrix entries is particularly useful. If this collection of PEs is interconnected by a message-passing, or a synchronous, communication network which is fast enough, the iteration time grows as the logarithm of the number of PEs. A comparison with earlier work, which suggested that only $\sqrt{R}$ PEs are useful for this task, is also presented.
A Real-Time Multi-Agent System Architecture for E-Commerce Applications
Authors: Lisa Cingiser DiPippo, Victor Fay-Wolfe, Lekshmi Nair, Ethan Hodys, Oleg Uvarov
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper describes an architecture for real-time multi-agent systems (RTMAS) that builds upon an existing real-time CORBA architecture. The RTMAS architecture provides real-time agent services for real-time agent communication, real-time agent scheduling and real-time agent facilitation. These services work together to allow for the expression and enforcement of real-time agent interactions. The paper describes the design of these services, along with a prototype implementation of the RTMAS architecture that is based upon an existing agent communication implementation.
A parallel one dimensional resampling algorithm
Authors: H. M. Sueyllam, M. A. Ismail, K. M. Ahmed
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Separable algorithms are useful in casting image warping into a framework that is amenable to hardware implementation. Growing interest in this area has gained impetus from the widespread proliferation of advanced workstations and digital signal processors. Examples include realtime hardware for video effects among others. The central benefit of separable algorithms is the reduction in complexity of one dimensional resampling algorithms. When the input is restricted to be one-dimensional, efficient solutions are made possible for the image reconstruction and antialiasing components of resampling. Fant (1986) presented such a solution that is well suited for hardware implementation. Fant's algorithm, however, is inherently serial. We present an alternative but equivalent (in the sense of producing exactly the same output scan lines) algorithm, that is parallel. The new algorithm was inspired by Wolberg's algorithm (1990). The new algorithm adds some overhead to the hardware implementation of Fant's algorithm to be able to achieve parallelism.
Higher-Order Logic Programming
Authors: Gopalan Nadather, Dale Miller
Venue:  (1994)

This paper, which is to be a chapter in a handbook, provides an exposition of the notion of higher-order logic programming. It begins with an informal consideration of the nature of a higher-order extension to usual logic programming languages. Such an extension is then presented formally by outlining a suitable higher-order logic --- Church''s simple theory of types --- and by describing a version of Horn clauses within this logic. Various proof-theoretic and computational properties of these higher-order Horn clauses that are relevant to their use in programming are observed. These observations eventually permit the description of an actual higher-order logic programming language. The applications of this language are examined. It is shown, first of all, that the language supports the forms of higher-order programming that are familiar from other programming paradigms. The true novelty of the language, however, is that it permits typed lambda terms to be used as data structures. This feature leads to several important applications for the language in the realm of meta-programming. Examples that bring out this facet of the language are presented. A complete exploitation of this meta-programming capability requires certain additional abstraction mechanisms to be present in the language. This issue is discussed, the logic of hereditary Harrop formulas is presented as a means for realizing the needed strengthening of the language, and the virtues of the features arising out the extension to the logic are illustrated.
A Single Server Queue in a Hard-Real-Time Environment
Authors: Francois Baccelli, S K Trivedi
Venue:  (1985)

We consider a single server first in first out queue in which each arriving task has to be completed within a certain period of time (its deadline). More precisely, each arriving task has its own deadline - a non-negative real number - and as soon as the response time of one task exceeds its deadline, the whole system is considered to have failed. (In that sense the deadline is hard). The main practical motivation for analyzing such queues comes from the need to evaluate mathematically the reliability of computer systems working with real time constraints (space or aircraft systems for instance). We shall therefore be mainly concerned with the analytical characterization of the transient behavior of such a queue in order to determine the probability of meeting all hard deadlines during a finite period of time (the ``mission time''''). The probabilistic methods for analyzing such systems are suggested by earlier work on impatience in telecommunication systems [1],[2].
Advanced Train Administration and Communication System Based on ADS Technologies
Authors: Teruo Kobayashi, Osamu Iba, Hiroshi Ebine, Shigeharu Aoyagi
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Conventional train control is performed in the following manner. Train location is detected by wayside signaling facilities, and according to train location, train control signals are indicated to prevent crashes between trains. However, this control requires enormous number of facilities, that means large amount installation and maintenance expenditures. Recent remarkable progress in the field of information technology makes a new train control system where train itself detects it's location and communicates with other trains through radio transmission. Development of the new train control system called ATACS started in 1995, the control run tests was conducted in Senseki line at 300 km north of Tokyo from September,1997 to March, 1998. This paper describes outline of ATACS and the results of control run tests.
Deriving Service Models in Cross-Organizational Workflows
Authors: bibliothek ARRAY(0x8477904) EMAIL::
Venue:  (1998)

Competitive markets force companies to form virtual enterprises by outsourcing activities to external service providers. The workflow concept has been very successful in streamlining busi-ness processes by automating the coordination of activities, but has so far been limited to the use within single organizations. To address the problems of cross-organizational workflows we use a service-oriented work-flow model. Within this approach, we present a technique how to derive a model of the external services, based on continuous-time Markov chains, by analyzing their externally observable be-havior. This allows to assess the quality of external services, without compromising the auton-omy of the service providers. LOCLANGUAGE:: German LOC :: Zunehmender Wettbewerb zwingt Firmen, sich in virtuellen Unternehmen zusammenzuschliessen, um ihr Produktportfolio durch Hinzunahme der Dienste externer Anbieter zu optimieren. Konzepte und Technologien des Workflow-Managements sind bereits sehr erfolgreich in der Automatisierung von Geschaftsprozessen, doch ihre Anwendbarkeit ist bisher auf einzelne Unternehmen beschrankt. Um auf die Probleme von organisationsubergreifenden Workflows einzugehen, schlagen wir ein serviceorientiertes Workflow-Modell vor. Innerhalb dieses Modells entwickeln wir ein Verfahren, das es ermglicht, sich ein eigenes Modell von Diensten externer Serviceanbieter zu bilden. Dazu konstruieren wir zeitkontinuierliche Markov-Ketten, die aus dem nach au?en sichtbaren Verhalten von Dienstausfuhrungen abgeleitet werden. Unser Verfahren erlaubt es, die Qualitat externer Dienstleister und der von ihnen angebotenen Dienste zu beurteilen, ohne gleichzeitig die Autonomie der beteiligten Serviceanbieter einzuschranken. 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
Low Power BIST for Wallace Tree-Based Fast Multipliers
Authors: D. Bakalis, D. Nikolos, G. Alexiou, E. Kalligeros, H. T. Vergos
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The low power as a feature of a BIST scheme is a significant target due to quality as well as cost related issues. In this paper we examine the testability of multipliers based on Booth encoding and Wallace tree summation of the partial products and we present a methodology for deriving a low power Built In Self Test (BIST) scheme for them. We propose several design rules for designing the Wallace tree in order to be fully testable under the Cell Fault Model. The proposed low power BIST scheme for the derived multipliers is achieved by: (a) introducing suitable Test Pattern Generators (TPG), (b) properly assigning the TPG outputs to the multiplier inputs and (c) significantly reducing the test set length with respect to earlier schemes. Our results indicate that the total power dissipated during test can be reduced from 64.8% to 72.8%, while the average power per test vector can be reduced from 19.6% to 27.4% and the peak power dissipation can be reduced from 16.8% to 36.0%, depending on the implementation of the basic cells and the size of the multiplier. The test application time is also significantly reduced, while the introduced BIST scheme implementation area is small.