ppxscal/embedding_network huggingface dataset:
Observations About the Development of Theoretical Computer Science
Authors: Juris Hartmanis
Venue:  (1980)

This paper gives a personal account of some developments in automata theory and computational complexity theory. Though the account is subjective and deals primarily with the research areas of direct interest to the author, it discusses the underlying beliefs and philosophy which guided this research as well as the intellectual environment and the ideas and contacts which influenced it. An attempt is also made to draw some general conclusions about computer science research and to discuss the nature of theoretical computer science.
Adaptive Wavelet ADI Method: Application and parallelization
Authors: Wei Cai, Xian-He Sun
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Adaptive wavelet ADI method is a new numerical method, which supports non-uniform adaptive meshes and is mathematically efficient. In this study, we investigate the potential of the adaptive wavelet ADI method in a parallel computing environment. The investigation focuses on parallel wavelet simulation of combustion flow problems. First, the sequential wavelet method for combustion applications is introduced. Then, parallel algorithms are introduced. Based on algorithmic analysis and preliminary experimental testing, we have shown that the adaptive wavelet ADI method is parallel and scalable. It is a method, which is fundamentally more appropriate for parallel computing than existing methods.
Incorporating Functionalities of Expert Medical Critiquing Dialogues in the Design of a Graphical Interface
Authors: M. Baker, L. Charnay, M. Joab, B. Lemaire, B. Safar, D. Schlienger
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Analysis of expert medical diagnostic critiquing dialogues shows that explanation, argumentation and negotiation are strongly interlinked. After presenting analyses of a corpus of Wizard of Oz dialogues in this domain, we describe a design for a graphical interface that enables human-computer collaboration for the same task. Many of the dialogues' functionalities can be transferred to the interface, whilst avoiding natural language interpretation problems and providing a comparable degree of expressivity for the user.
A methodology for the design of courses in information systems
Authors: Kay C. Bryant
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

A wealth of literature exists on the use of Internet technologies for Information Systems education; however, there is little research on course design methodologies that are particularly suited to Information Systems courses. This paper reviews several generic frameworks for course design and develops one that incorporates the important elements of each for use in designing Information Systems courses. The development process revealed that there was a framework within a framework, that is a higher order cyclical framework and the lower level design/redesign framework. The results of initial research on the applicability of the framework for the design/redesign of Information Systems courses suggest support for the usefulness of the approach.
Trivial Pursuit and IT Applicant Exams
Authors: Phil Laplante
Venue: IT Professional (2003)

Relying on trivia tests is risky at best and might cost you a good employee. 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
An intelligent method for processing string in 3-D based on its minimum energy
Authors: Rahmat Budiarto, Abdullah Zawawi Hj. Talib, Zaharin Yusoff, Masashi Yamada
Venue: Neural, Parallel Scientific Computations (2003)

We propose a technique for representing string (rope) in three-dimensions based on its energy. The technique of obtaining a stable state of string diagram will be based on the computation of the energy of its equivalent knot diagram. We divide the technique into three steps: simplification of state string diagram, transformation from string state into its equivalent knot diagram, and computation of the minimum energy. We apply Reidemeister movements to simplify the string diagram. For computing the Minimum Energy, we use the Minimum Distance (MD) energy for regular n-polygonal knot. As a model we use the set of crossing model. We implement the technique to generate string figure of cat's cradle.
BSP Pro: A Java-Based BSP Performance Profiling System
Authors: Weiqun Zheng, Shamim Khan, Hong Xie
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

This paper introduces a new parallel performance profiling system for the Bulk Synchronous Parallel (BSP) model. The profiling system, called BSP Pro, consists of a performance profiling tool, BSP Profiler, and a performance visualisation tool, BSP Visualiser. The aim of BSP Pro is to assist in the analysis and improvement of BSP program performance by minimising load imbalance among processes. BSP Pro is different from other systems, such as the profiling tools within the Oxford BSP toolset, in terms of both its features and its implementation. It uses BSP Profiler to trace and generate more comprehensive profiling information resulting from BSP program executions. The profiling information is then visualised and shown as performance profiling graphs using BSP Visualiser. The visualising component of BSP Pro is fully developed in Java and utilises Java graphics to expose and highlight process load imbalance in both computation and interprocess communication.
Measuring Bottleneck Link Speed in Packet-Switched Networks
Authors: Robert Carter, Mark Crovella
Venue:  (1996)

Abstract The quality of available network connections can often have a large impact on the performance of distributed applications. For example, document transfer applications such as FTP, Gopher and the World Wide Web suffer increased response times as a result of network congestion. For these applications, the document transfer time is directly related to the available bandwidth of the connection. Available bandwidth depends on two things: 1) the underlying capacity of the path from client to server, which is limited by the bottleneck link; and 2) the amount of other traffic competing for links on the path. If measurements of these quantities were available to the application, the current utilization of connections could be calculated. Network utilization could then be used as a basis for selection from a set of alternative connections or servers, thus providing reduced response time. Such a dynamic server selection scheme would be especially important in a mobile computing environment in which the set of available servers is frequently changing. In order to provide these measurements at the application level, we introduce two tools: bprobe, which provides an estimate of the uncongested bandwidth of a path; and cprobe, which gives an estimate of the current congestion along a path. These two measures may be used in combination to provide the application with an estimate of available bandwidth between server and client thereby enabling application-level congestion avoidance. In this paper we discuss the design and implementation of our probe tools, specifically illustrating the techniques used to achieve accuracy and robustness. We present validation studies for both tools which demonstrate their reliability in the face of actual Internet conditions; and we give results of a survey of available bandwidth to a random set of WWW servers as a sample application of our probe technique. We conclude with descriptions of other applications of our measurement tools, several of which are currently under development.
Modeling and evaluating the time overhead induced by BER in COMA multiprocessors
Authors: Mohsen Sharifi, Behrouz Zolfaghari
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

Designing multiprocessors based on distributed shared memory (DSM) architecture considerably increases their scalability. But as the number of nodes in a multiprocessor increases, the probability of encountering failures in one or more nodes of the system raises as a serious problem. Thus, every large-scale multiprocessor should be equipped with mechanisms that tolerate node failures. Backward error recovery (BER) is one of the most feasible strategies to build fault tolerant multiprocessors and it can be shown that among various DSM-based architectures, cache only memory architecture (COMA) is the most suitable for implementing BER. The main reason is the existence of built-in mechanisms for data replication in COMA memory system. BER is applicable to COMA multiprocessors with minor hardware redundancy, but it will obviously cause some other kinds of overheads. The most important overhead induced by BER is the time required to produce and store recovery data. This paper introduces an analytical model for predicting the amount of this time overhead and then verifies the correctness of the model through comparing the results predicted from this model with the previously published simulation results. Both the analytical model and simulation results show that the overhead is nearly independent of the number of nodes. The immediate result is that BER is a cost-effective strategy for tolerating node failures in large-scale COMA multiprocessors with large numbers of nodes.
Size Arguments in the Study of Computation Speeds
Authors: Juris Hartmanis
Venue:  (1970)

In this paper we use arguments about the size of the computed functions to investigate the computation speed of Turing machines. It turns out that the size arguments yield several new results which we have not been able to obtain previously by diagonalization. For example, we show that for arbitrarily complex running times $T(n)$ there exist functions which can be computed on a one-tape Turing machine in time $T(n)$ but not in time $t(n)$ provided $\stackrel{\lim}{n \rightarrow \infty} \frac{t(n)}{T(n)}=0$. The same result is also shown to hold for many-tape machines. We show furthermore, that there exist arbitrarily complex computations for which one-tape machines are slower than two-tape machines by a factor equal to the logarithm of the computation time of the two-tape machine. We conclude by discussing several other computational complexity measures and compare results obtained by diagonalization and size arguments.
On Domain Decomposition Methods in Two-subdomain Nonoverlap Cases
Authors: Jin Gu, Zian Hu
Venue:  (1995)

We mainly consider the nonconforming finite elements with their continuity only at the vertices or the edge midpoints of the elements of the quasi-uniform mesh. Based on the extension theorems[10,11,19], we developed a unifying and systematic way to design and analyse the domain decomposition methods for the second order self-adjoint elliptic problems with two nonoverlap subdomins in the conforming or the nonconforming discrete cases, in spite of the loss of global continuity of the nonconforming elements. A concise summary of all existing domain decomposition algorithms is presented in this paper. The results of numerical experiments are reported.
Distance Education Evolution: Issues and Case Studies
Authors: Dominique Monolescu, Catherine Schifter, Linda Greenwood
Venue:  (2003)

The Distance Education Evolution: Case Studies addresses issues regarding the development and design of online courses, and the implementation and evaluation of an online learning program. Several chapters include design strategies for online courses that range from the specific to the universal. Many authors address pedagogical issues from both a theoretical and applied perspective. This diverse compilation of contributions by Temple University administrators and faculty gives a comprehensive overview of the distance education experience that can serve as a guide to others interested in providing quality distance education.
Multi-Node Broadcasting in an Arrangement Graph Using Multiple Spanning Trees
Authors: Yuh-Shyan Chen, Tong-Ying Juang, Ying-Ying Shen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The arrangement graph A_{n,k} is not only a generalization of star graph (n-k=1), but also more flexible. Designing efficient routing algorithm on a regular interconnection network is a fundamental issue for the parallel processing techniques. In this study, we elucidate multi-node broadcasting problem in the all-port communication model on the arrangement graph. Our routing strategy is proposed by constructing 2(n-k) spanning trees, where height of each spanning tree is 2k-1. We also extend the routing strategy to one-to-all broadcasting algorithm. Using 2(n-k) spanning trees allows us to present efficient (one/multi)-node broadcasting algorithms in arrangement graph. The arrangement graph is assumed to use models and packet-switching (or store-and-forward) technique. Moreover, we show that our (one/multi)-node broadcasting algorithms outperform previous results in the literature. This is justified by our performance analysis.
Toward Reliable User Authentication through Biometrics
Authors: Václav Matyás Jr., Zdenek Riha
Venue: IEEE Security and Privacy (2003)

Biometric authentication systems identify users by their measurable human characteristics. Although biometrics promises greater system security because identifying characteristics are tied to specific users, many issues remain.
A Study of Group Rekeying
Authors: Ohad Rodeh, Kenneth P. Birman, Danny Dolev
Venue:  (2000)

In this paper we study the key management problem, in the context of Group Communication Systems (GCS). GCSs are mid-sized systems scaling up to 100 members. We present a side-by-side comparison of three ways of managing keys, studying bandwidth and latency.
A performance study of the DDM - a cache-only memory architecture
Authors: Anders Landin, Seif Haridi
Venue:  (1991)

Large-scale multiprocessors suffer from long latencies for remote accesses. Caching is by far the most popular technique for hiding such delays. Caching not only hides the delay, but also decreases the network load. Cache-Only Memory Architectures (COMA), have no physically shared memory. Instead, all the memory resources are invested in caches, resulting in caches of the largest possible size. A datum has no home, and is moved by a protocol between the caches, according to its usage. It might exist in multiple caches. Even though no shared memory exists, the architecture still provides the shared memory view to a programmer. Simulation results from large programs running on 64 processors indicate that the COMA adapts well to existing programs for shared memory. They also show that an application with a poor locality can benefit by adopting to the COMA principle of no home for data, resulting in a reduced execution time of a factor three. In a COMA, a large majority of the misses are invalidation misses, or share misses caused by write-once/read-many behavior, or a producer-consumer relation, i.e. would ben- efit from write broadcast. A new protocol is proposed that behaves like a write-invalidate protocol by default for all data. A reader can detect its need for a write-broadcast behavior for a datum, which it enables by sending a subscribe request for the datum to the writer.
Case-Based Reasoning: An Implemented Methodology
Authors: Pradeep Raman
Venue:  (1995)

Case Based Reasoning (CBR) is the process by which a computer system solves a given problem based on the knowledge gained from solving precedents in the past. It is a popular AI technique in the area of customer service or HelpDesks, whereby a system that uses CBR as its problem solving approach is utilized to solve most of the commonly occurring customer problems or questions. While the implementation techniques may vary, most CBR systems include the following five steps in some form or other: Representation where problem storage is handled, Retrieval where the closest-matching precedent is identified, Adaptation where a solution is generated from the retrieved problem, Validation where the accuracy of the solution is verified, and finally Update where the database is modified or updated with the information gained from this problem solving process. This paper details the various implementation techniques for these five steps in the CBR process, while focusing on the methods used by one particular problem-solving application namely _Smart USA_. This system solves customer problems by filtering their problem descriptions through an "alias" table to handle abbreviations and non-key words and then matching the remaining keywords with those in the case database. It is an effective and user-friendly solution which successfully handles different descriptions of the same problem and allows for the case base to be built in free-formatted text. Major companies such as Compaq and NEC utilize a CBR based automated system to serve their customer service needs. These systems have played a significant role in reducing the overhead and the response times involved in the customer service departments of these organizations.
Completeness results for graph isomorphism
Authors: Birgit Jenner, Johannes Köbler, Pierre McKenzie, Jacobo Torán
Venue: Journal of Computer and System Sciences (2003)

We prove that the graph isomorphism problem restricted to trees and to colored graphs with color multiplicities 2 and 3 is many-one complete for several complexity classes within NC2. In particular we show that tree isomorphism, when trees are encoded as strings, is NC1-hard under AC0-reductions. NC1- completeness thus follows from Buss's NC1 upper bound. By contrast, we prove that testing isomorphism of two trees encoded as pointer lists is L-complete. Concerning colored graphs we show that the isomorphism problem for graphs with color multiplicities 2 and 3 is complete for symmetric logarithmic space SL under many-one reductions. This result improves the existing upper bounds for the problem. We also show that the graph automorphism problem for colored graphs with color classes of size 2 is equivalent to deciding whether a graph has more than a single connected component and we prove that for color classes of size 3 the graph automorphism problem is contained in SL.
Stable Families of Coalitions and Normal Hypergraphs
Authors: E. Boros, V. Gurvich, A. Vasin
Venue:  (1996)

The core of a game is defined as the set of outcomes acceptable for {\em all} coalitions. This is probably the simplest and most natural concept of cooperative game theory. However, the core can be empty because there are too many coalitions. Yet, some players may not like or know each other, so they cannot form a coalition. Let $\cK$ be a fixed family of coalitions. The $\cK$-core is defined as the set of outcomes acceptable for all the coalitions from $\cK$. The family $\cK$ is called {\em stable} if the $\cK$-core is not empty for any normal form game (or equivalently, for any game in generalized characteristic function form). \\*[\parskip] \hspace*{1.5em}{\em Normal hypergraphs} can be characterized by several equivalent properties, e.g. they are {\em dual} to the {\em clique hypergraphs} of {\em perfect graphs}. We prove that a family $\cK$ of coalitions is stable iff $\cK$ as a hypergraph is normal.
Enhancement of Decision Support Process in Road Administration Domain with the Use of GIS Technology
Authors: Cus Babic, Danijel Rebolj, Cveto Gregorc
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

In recent years, geographic information systems and spatial database technology are fast spreading across the tight circles of experts, working in the fields of geography and geodesy. In the first wave, GIS functions have been built into engineering applications, which were not just GIS centered (as for example road design, emission calculation, building site-plan etc.). The use has been accelerated through the component technology, which simplifies the insertion of GIS components into a variety of applications - including administration.In the article we describe the upgrading of the business information system of the Slovenian road administration, where the basic applications user interfaces were enriched with a specialized GIS component, which enables a fast and clear (geo)graphical view of the data about the selected part of the road network. The simplicity of using this intelligent digital map (as we could name this specialized component) makes it possible to effectively and clearly display the relevant information, which is so necessary in the process of decision making. Besides, there is no need to leave the application the user is familiar with.
Parallel Pascal Development System
Authors: Anthony P. Reeves
Venue:  (1986)

The Parallel Pascal Development System enables Parallel Pascal programs to be developed and tested on a conventional computer. It consists ofseveral system programs, including a Parallel Pascal to standard Pascal translator, and a library of Parallel Pascal subprograms. The library includes subprograms for using Parallel Pascal on a parallel system with a fixed degree of parallelism, such as the Massively Parallel Processor, to conveniently manipulate arrays which have different dimensions than the hardware. Programs can be conveniently tested with small sized arrays on the conventional computer before attempting to run on a parallel system.
The 123s of ABC in SAP: Using SAP R/3 to Support Activity-Based Costing
Authors: Dawn J. Sedgley, Christopher F. Jackiw
Venue:  (2002)

:Activity-Based Costing (ABC), a method that measures the cost and performance of activities, resources, and cost objects, is becoming increasingly adopted in today's market as more and more companies realize that the current generation of systems can efficiently support it. As companies continue to make a huge investment of both money and effort in their SAP system, they seek ways to incorporate the benefits of Activity-Based Costing into their current SAP system. The 123s of ABC in SAP shows corporations exactly how the ABC approach can be effectively incorporated into today's SAP systems. While SAP training teaches what buttons in the system to push and ABC courses and workshops teach the philosophy, consultants Dawn Sedgley and Christopher Jackiw provide the first documentation on how to apply the ABC philosophy to the SAP costing engine -- in short, how to use the tool to support the ideas. The book is designed for readers with advanced knowledge of the ABC framework but does not assume the reader has any familiarity with the SAP R/3 application. In clear, nontechnical language, the authors provide a basic explanation of SAP R/3, specifically, the Controlling Module (CO) including the CO-ABC component. The SAP-CO module, which is the costing engine of the system, is based on the German costing philosophy, which is being augmented and repackaged under the name Resource Consumption Accounting for the U.S. market. You will learn the difference between the American and German philosophies, the benefits of using them together, and what management decision information they can provide. To assist you in grasping the concepts, the book takes a pictorial approach. Illustrations are also completely linked and built upon, effectively generating a large-scale case study whose lessons you can apply to your needs. As large companies shift to enhancement-type projects once their SAP implementations have been completed, effective implementation of SAP ABC will become ever more critical to the success of your company. A must for CFOs, controllers, cost managers, SAP project managers, SAP-C level leaders, and SAP-CO team members, The 123s of ABC in SAP will provide valuable answers to the critical question, "How can I maximize my investment in my SAP R/3 system?" Dawn J. Sedgley and Christopher F. Jackiw are Partners with Alta Via Consulting