ppxscal/embedding_network huggingface dataset:
Designing Templates for Mining Association Rules
Authors: Elena Baralis, Giuseppe Psaila
Venue: Journal of Intelligent Information Systems (1997)

Current approaches to data mining usually address specific user requests, while no general design criteria for the extraction of association rules are available for the end-user. In this paper, we propose a classification of association rule types, which provides a general framework for the design of association rule mining applications. Based on the identified association rule types, we introduce predefined templates as a means to capture the user specification of mining applications. Furthermore, we propose a general language to design templates for the extraction of arbitrary association rule types.
Hierarchic document classification using Ward's clustering method
Authors: A. El-Hamdouchi, P. Willett
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

In this paper, we discuss the application of a recent hierarchic clustering algorithm to the automatic classification of files of documents. Whereas most hierarchic clustering algorithms involve the generation and updating of an inter-object dissimilarity matrix, this new algorithm is based upon a series of nearest neighbor searches. Such an approach is appropriate to several clustering methods, including Ward's method which has been shown to perform well in experimental studies of hierarchic document clustering. A description is given of heuristics which can increase the efficiency of the new algorithm when it is used to cluster three document collections by Ward's method.
Object oriented students? (poster)
Authors: J. Carter, A. Fowler
Venue: ACM SIGCSE Bulletin (1998)

In this poster, we describe our initial experiences when teaching an Object Oriented programming language to first year undergraduate students.
A kernel-finding state assignment algorithm for multi-level logic
Authors: Wayne Wolf, Kurt Keutzer, Janaki Akella
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

We present a new algorithm for state assignment designed for use with multi-level logic optimization algorithms. The algorithm encodes states to select good common factors (kernels) in the final combinational logic. Encoding is performed on a programmable-encoding machine model, which models state codes as machine inputs and allows logic optimization algorithms to be performed directly on the unencoded logic. We discuss our experiments with the algorithm and with other methods of state assignment.
A mobility-aware file system for partially connected operation
Authors: Dane Dwyer, Vaduvur Bharghavan
Venue: ACM SIGOPS Operating Systems Review (1997)

The advent of affordable off-the-shelf wide-area wireless networking solutions for portable computers will result in partial (or intermittent) connectivity becoming the common networking mode for mobile users. This paper presents the design of PFS, a mobility-aware file system specially designed for partially connected operation.PFS supports the extreme modes of full connection and disconnection gracefully, but unlike other mobile file systems, it also provides an interrace for mobility-aware applications to direct the file system in its caching and consistency decisions in order to fully exploit intermittent connectivity. Using PFS, it is possible for an application to maintain consistency on only the critical portions of its data files. Since PFS provides adaptation at the file system level, even unaware applications can 'act' mobile-aware as a result of the transparent adaptation provided by PFS.
Parametric polymorphism for Java: a reflective solution
Authors: Jose H. Solorzano, Suad Alagić
Venue: ACM SIGPLAN Notices (1998)

A number of inadequacies of existing implementation techniques for extending Java trade; with parametric polymorphism are revealed. Homogeneous translations are the most space-efficient but they are not compatible with reflection, some models of persistence, and multiple dispatch. Heterogeneous translations, on the other hand, can potentially produce large amounts of redundant information. Implementation techniques that address these concerns are developed. In languages that support run-time reflection, an adequate implementation of parametric, bounded and F-bounded polymorphism is shown to require (reflective) run-time support. In Java, extensions to the core classes are needed. This is in spite of the fact that parametric polymorphism is intended to be managed statically.
Object-oriented design and programming: an Eiffel, C++, and Java course for C programmers
Authors: Dale A. Schoenefeld
Venue: ACM SIGCSE Bulletin (1997)

An undergraduate junior or senior level course in object-oriented design and programming is described. The course assumes familiarity with ANSI C and with data structures. The course is a popular elective among upper division students. The small, elegant, pure, and powerful object-oriented language Eiffel is used to illustrate the significant object concepts and as a guide to identifying the most relevant subsets of the C++ and Java languages.
Tighter Upper Bounds on the Exact Complexity of String Matching
Authors: Richard Cole, Ramesh Hariharan
Venue: SIAM Journal on Computing (1997)

This paper considers how many character comparisons are needed to find all occurrences of a pattern of length m in a text of length n. The main contribution is to show an upper bound of the form of n + O(n/m) character comparisons, following preprocessing. Specifically, we show an upper bound of $n + \frac{8}{3(m+1)}(n-m)$ character comparisons. This bound is achieved by an online algorithm which performs O(n) work in total and requires O(m) space and O(m2) time for preprocessing. The current best lower bound for online algorithms is $n + \frac{16}{7m+27}(n-m)$ character comparisons for $m=16k+19$, for any integer $k\geq 1$, and for general algorithms is $n+\frac{2}{m+3}(n-m)$ character comparisons, for $m=2k+1$, for any integer $k\geq 1$.
≅USER: the user-definable system function in Data General's AOS/VS APL
Authors: Jan-Willem Neurdenburg, Phil S. Schwarz
Venue: ACM SIGAPL APL Quote Quad (1985)

This paper describes the implementation of an APL interface to user-provided subroutines written in a language other than APL. The user's subroutines are incorporated directly into the APL interpreter, yet the interface is implemented in a way which prevents such problems as unintentional corruption of the APL workspace. Examples illustrate the use in APL. via the interface, of Data General's GKS (Graphical Kernel System) subroutine package, a flexible, powerful, standard-compliant library of graphics subroutines for compiled languages.
A Linearized Crank-Nicolson-Galerkin Method for the Ginzburg-Landau Model
Authors: Mo Mu
Venue: SIAM Journal on Scientific Computing (1997)

The time-dependent Ginzburg-Landau model is used extensively in studying the nonequilibrium state of superconductivity. The computer simulation of this model requires high-performance computing power and reliable and efficient numerical methods to solve the Ginzburg-Landau equtions. In this paper, a linearized Crank-Nicolson-Galerkin method is proposed for solving these nonlinear and coupled partial differential equations. The method uses the Galerkin finite element approximation in spatial discretization and the Crank-Nicolson implicit scheme in time discretization, together with certain techniques which linearize and decouple the Ginzburg-Landau equations. While retaining the stabillity and accuracy of the Crank-Nicolson scheme, the proposed approach results in symmetric and positive definite matrix problems, thus substantially improving the computational efficiency. Furthermore, and even more important, the proposed approach is suitable for large-scale parallel computation. Numerical results from simulating the vortex dynamics of superconductivity by using the linearized Crank-Nicolson-Galerkin method are presented.
Dataflow computer development in Japan
Authors: Toshitsugu Yuba, Toshio Shimada, Yoshinori Yamaguchi, Kei Hiraki, Shuichi Sakai
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

This paper describes the research activity on dataflow computing in Japan focusing on dataflow computer development at the Electrotechnical Laboratory (ETL). First, the history of dataflow computer development in Japan is outlined. Some distinguished milestones in the history are mentioned in detail. Second, two types of dataflow computing systems developed at ETL, SIGMA-1 and EM-4, are described with their research goals. The fundamental characteristics of the both systems are given and some comparisons are made. Finally, future problems toward new generation computer systems to meet the challenge of Tera FLOPS machines are discussed.
Hardware logic simulation by compilation
Authors: Craig Hansen
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A behavioral and logic simulation system which uses extensive optimization and compilation techniques to obtain high performance is described. It incorporates data flow analysis to optimize the evaluation of unordered assignment statement that define a hardware structure, and extract clocking rules. An integral code generator produces efficient assembly code for three different machines, and an associated run-time library provides a flexible interactive debugging environment.
A gradient approach for smartly allocating computing budget for discrete event simulation
Authors: Chun-Hung Chen, Hsiao-Chang Chen Liyi Dai
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Simulation plays a vital role in analyzing many discrete event systems. Usually, using simulation to solve such problems can be both expensive and time consuming. We present an effective approach to smartly allocate computing budget for discrete-event simulation. This approach can smartly determine the best simulation lengths for all simulation experiments and significantly reduce the total computation cost for obtaining the same confidence level. Numerical testing shows that our approach can obtain the same simulation quality with one-tenth the simulation effort.
Restructuring the BLAS level 1 routine for computing the modified givens transformation
Authors: Tim Hopkins
Venue: ACM SIGNUM Newsletter (1997)

We look at how both logical restructuring and improvements available from successive versions of Fortran allow us to reduce the complexity (measured by a number of the commonly used software metrics) of the Level 1 BLAS code used to compute the modified Givens transformation. With these reductions in complexity we claim that we have improved both the maintainability and clarity of the code; in addition, we report a fix to a minor problem with the original code. The performance of two commercial Fortran restructuring tools is also reported.
Support to the management of clinical activities in the context of protocol-based care
Authors: Domenico M. Pisanelli, Fabrizio Consorti
Venue: ACM SIGBIO Newsletter (1996)

In this paper we describe the system SMART (Supporting Medical Activities in Real-Time). The goal of the system is real-time assistance to physicians who execute diagnostic or therapeutic protocols in a clinical context. SMART is able to retrieve a protocol from its knowledge base and to monitor its execution step by step for a single patient. Different protocols for different patients can be followed at the same time in a health care structure.The prototype realized supports the execution of protocols for evaluating surgical risks. It has been implemented according to the specifications given by the 4th Surgical Clinic of "Policlinico Umberto I" and reflects the activities actually performed in that hospital. However, the protocol model defined is general-purpose and we envisage an easy application to other contexts and therefore to the informatization of other protocols.
TCP over ATM: ABR or UBR?
Authors: Teunis J. Ott, Neil Aggarwal
Venue: ACM SIGMETRICS Performance Evaluation Review (1997)

This paper reports on a simulation study of the relative performances of the ATM ABR and UBR service categories in transporting TCP/IP flows through an ATM Network. The objective is two-fold: (i) to understand the interaction between the window - based end-to-end flowcontrol TCP and the rate based flowcontrol ABR which is restricted to the ATM part of the network, and (ii) to decide whether the greater complexity of ABR (than UBR) pays off in better performance of ABR (than UBR).The most important conclusion is that there does not seem to be strong evidence that for TCP/IP workloads the greater complexity of ABR pays off in better performance.
SDLC protocol throughput analysis
Authors: Richard W. Plummer
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A mathematical model is presented to determine large message throughput utilizing Synchronous Data Link Control (SDLC) protocol in local or long haul networks. The model includes provisions for wait time which includes processor service times, plus satellite and/or land based propagation delays. Other inputs include the probability of ACK/NAK timeout, block size, and assumed bit error rate. Bit errors may be precipitated by electromechanical equipment malfunctions, lightning, power surges, crosstalk, thermal noise, and numerous other causes. Although bit errors are, therefore, bursty in nature, this analysis assumes that the bit error rate is random rather than bursty which will provide conservative results. Basic feedback theory is applied to both clarify and simplify the analysis. A detailed example illustrates use of the model in a Communication Satellite application to illustrate large message throughput degradation caused by the Satellite propagation delay for various bit error rates. An empirically derived simple expression to determine optimum block size for maximum throughput as a function of bit error rate is presented for the stated assumptions. 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
A Vlsi Neural Network Processor Based on Hippocampal Model
Authors: Richard H. Tsai, Bing J. Sheu, Theodore W. Berger
Venue: Analog Integrated Circuits and Signal Processing (1998)

The hippocampal region of the brain system can be analyzed with the nonlinear system modeling approach. The input-output relationship of the neural units is best represented by the kernel functions of different complexities. The modeling expression of the first and second order kernels are computed in analog current-mode instead of digital data processing in order to fully explore massively parallel processing capability of the neural networks. Two distinct methods are utilized: the table-look-up approach and the model-based approach. The former can achieve high accuracy but consumes large silicon area while the latter saves silicon area and maintains moderately high accuracy. Circuit-level simulation results and experimental data from two test structures are presented.
Optimization of Observations: a Stochastic Control Approach
Authors: Boris M. Miller, Wolfgang J. Runggaldier
Venue: SIAM Journal on Control and Optimization (1997)

We study a stochastic control problem for the optimization of observations in a partially observable stochastic system. Using a method of discontinuous time transformation, we associate with the original problem with unbounded controls a problem that has bounded controls. This latter problem allows us to construct nearly optimal nonanticipative Lipschitz Markov controls with finite observation power for the original problem. Since the controlled observation equation may degenerate, we also derive a corresponding filtering result and show a separation property of the optimal controls.
Stability Issues in the Factorization of Structured Matrices
Authors: Michael Stewart, Paul Van Dooren
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

This paper provides an error analysis of the generalized Schur algorithm of Kailath and Chun [SIAM J. Matrix Anal. Appl., 15 (1994), pp. 114--128]---a class of algorithms which can be used to factorize Toeplitz-like matrices, including block-Toeplitz matrices, and matrices of the form $T^{T}T$, where $T$ is Toeplitz. The conclusion drawn is that if this algorithm is implemented with hyperbolic transformations in the factored form which is well known to provide numerical stability in the context of Cholesky downdating, then the generalized Schur algorithm will be stable. If a more direct implementation of the hyperbolic transformations is used, then it will be unstable. In this respect, the algorithm is analogous to Cholesky downdating; the details of implementation of the hyperbolic transformations are essential for stability. An example which illustrates this instability is given. This result is in contrast to the ordinary Schur algorithm for which an analysis by Bojanczyk, Brent, De Hoog, and Sweet [SIAM J. Matrix Anal. Appl., 16 (1995), pp. 40--57] shows that the sta- bility of the algorithm is not dependent on the implementation of the hyperbolic transformations.
Pairwise Balanced Designs with Consecutive Block Sizes
Authors: Alan C. H. Ling, Xiaojun Zhu, Charles J. Colbourn, Ronald C. Mullin
Venue: Designs, Codes and Cryptography (1997)

This paper deals with existence for pairwise balanced designs with block sizes 5,6 and 7, block sizes 6,7 and 8 and block sizes 7,8 and 9 and some consequences of these results.
Matching 3-D Models to 2-D Images
Authors: David W. Jacobs
Venue: International Journal of Computer Vision (1997)

We consider the problem of analytically characterizing the set of all 2-D images that a group of 3-D features may produce, and demonstrate that this is a useful thing to do. Our results apply for simple point features and point features with associated orientation vectors when we model projection as a 3-D to 2-D affine transformation. We show how to represent the set of images that a group of 3-D points produces with two lines (1-D subspaces), one in each of two orthogonal, high-dimensional spaces, where a single image group corresponds to one point in each space. The images of groups of oriented point features can be represented by a 2-D hyperbolic surface in a single high-dimensional space. The problem of matching an image to models is essentially reduced to the problem of matching a point to simple geometric structures. Moreover, we show that these are the simplest and lowest dimensional representations possible for these cases.We demonstrate the value of this way of approaching matching by applying our results to a variety of vision problems. In particular, we use this result to build a space-efficient indexing system that performs 3-D to 2-D matching by table lookup. This system is analytically built and accessed, accounts for the effects of sensing error, and is tested on real images. We also derive new results concerning the existence of invariants and non-accidental properties in this domain. Finally, we show that oriented points present unexpected difficulties: indexing requires fundamentally more space with oriented than with simple points, we must use more images in a motion sequence to determine the affine structure of oriented points, and the linear combinations result does not hold for oriented points.
Incorporating syntactic information into a document retrieval strategy: an investigation
Authors: Alan F. Smeaton
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

This paper deals with mechanisms for performing text retrieval which incorporate a degree of linguistic processing into the overall strategy. We have performed some experiments using parsing of text an a test collection of documents and queries to try and find out exactly if and how parsing could contribute to an overall improvement in retrieval effectiveness. Investigating this topic has led us to the definition of a retrieval strategy which incorporates parsing of query text and a more &ldquo;shallow&rdquo; parsing of document texts, whose retrieval effectiveness is investigated and described. Our results indicate that significant improvements in retrieval effectiveness can be obtained by incorporating such linguistic processing into an overall retrieval strategy.
Test and diagnosis of fault logic blocks in FPGAs
Authors: Sying-Jyan Wang, Tsi-Ming Tsai
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Since Field programmable gate arrays (FPGAs) are reprogrammable, faults in them can be easily tolerated once fault sites are located. In this paper we present a method for the testing and diagnosis of faults in FPGAs. The proposed method imposes no hardware overhead, and requires minimal support from external test equipments. Test time depends only on the number of faults, and is independent of the chip size. With the help of this technique, chips with faults can still be used. As a result, the chip yield can be improved and chip cost is reduced. Experimental results are given to show the feasibility of this method.
Data networks as cascades: investigating the multifractal nature of Internet WAN traffic
Authors: A. Feldmann, A. C. Gilbert, W. Willinger
Venue: ACM SIGCOMM Computer Communication Review (1998)

In apparent contrast to the well-documented self-similar (i.e., monofractal) scaling behavior of measured LAN traffic, recent studies have suggested that measured TCP/IP and ATM WAN traffic exhibits more complex scaling behavior, consistent with multifractals. To bring multifractals into the realm of networking, this paper provides a simple construction based on cascades (also known as multiplicative processes) that is motivated by the protocol hierarchy of IP data networks. The cascade framework allows for a plausible physical explanation of the observed multifractal scaling behavior of data traffic and suggests that the underlying multiplicative structure is a traffic invariant for WAN traffic that co-exists with self-similarity. In particular, cascades allow us to refine the previously observed self-similar nature of data traffic to account for local irregularities in WAN traffic that are typically associated with networking mechanisms operating on small time scales, such as TCP flow control.To validate our approach, we show that recent measurements of Internet WAN traffic from both an ISP and a corporate environment are consistent with the proposed cascade paradigm and hence with multifractality. We rely on wavelet-based time-scale analysis techniques to visualize and to infer the scaling behavior of the traces, both globally and locally. We also discuss and illustrate with some examples how this cascade-based approach to describing data network traffic suggests novel ways for dealing with networking problems and helps in building intuition and physical understanding about the possible implications of multifractality on issues related to network performance analysis.