ppxscal/embedding_network huggingface dataset:
Range queries in OLAP data cubes
Authors: Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is specified by providing ranges of values for numeric dimensions. We present fast algorithms for range queries for two types of aggregation operations: SUM and MAX. These two operations cover techniques required for most popular aggregation operations, such as those supported by SQL. For range-sum queries, the essential idea is to precompute some auxiliary information (prefix sums) that is used to answer ad hoc queries at run-time. By maintaining auxiliary information which is of the same size as the data cube, all range queries for a given cube can be answered in constant time, irrespective of the size of the sub-cube circumscribed by a query. Alternatively, one can keep auxiliary information which is 1/bd of the size of the d-dimensional data cube. Response to a range query may now require access to some cells of the data cube in addition to the access to the auxiliary information, but the overall time complexity is typically reduced significantly. We also discuss how the precomputed information is incrementally updated by batching updates to the data cube. Finally, we present algorithms for choosing the subset of the data cube dimensions for which the auxiliary information is computed and the blocking factor to use for each such subset. Our approach to answering range-max queries is based on precomputed max over balanced hierarchical tree structures. We use a branch-and-bound-like procedure to speed up the finding of max in a region. We also show that with a branch-and-bound procedure, the average-case complexity is much smaller than the worst-case complexity.
Information Filtering: A New Two-Phase Model Using StereotypicUser Profiling
Authors: Bracha Shapira, Uri Hanani, Adi Raveh, Peretz Shoval
Venue: Journal of Intelligent Information Systems (1997)

Computer users often experience the &ldquo;lost in information space&rdquo; syndrome. Information filtering suggests a solution based on restricting the amount of information made available to users. This study suggests an advanced model for information filtering which is based on a two-phase filtering process. The user profiling in the model is constructed on the basis of the user&lsquo;s areas of interest and on sociological parameters about him that are known to the system. The system maintains a database of known stereotypes that includes rules on their information retrieval needs and habits. During the filtering process, the system relates the user to one or more stereotypes and operates the appropriate stereotypic rules.
Stochastic Scheduling with Priority Classes
Authors: R. Garbe, K. D. Glazebrook
Venue: Mathematics of Operations Research (1998)

We consider controlled stochastic systems in which multiple job types (customers, projects, jobs, etc.) may require processing by one or more servers. The job types are all members of priority classes and admissible controls must respect the constraints imposed by these. For systems which (when unconstrained) satisfy generalised conservation laws, we obtain the performance space and show that linear objectives are optimised by admissible controls which choose job types within each priority class according to a set of Gittins indices. Various degrees of decomposition of the problem are described and illustrated. In the special case of (discounted and undiscounted) branching bandits, the theory is developed further to yield index-based suboptimality bounds for general policies.
NSF workshop on &ldquo;Distributed information, computation and process management for scientific and engineering environments&rdquo;
Authors: Nicholas M. Patrikalakis
Venue: ACM SIGGROUP Bulletin (1998)

An Invitational Workshop on Distributed Information, Computation, and Process Management for Scientific and Engineering Environments (DICPM 2) was held at the Hyatt Dulles in Hemdon, Virginia, USA, on May 15-16, 1998. The objective of the workshop was to bring together domain scientists involved with the development and utilization of simulations of complex systems and computer scientists working on distributed intelligent repositories and process management. The application of further research efforts along these lines will help to increase the availability, effectiveness, and utilization of large-scale, multidisciplinary distributed scientific and engineering systems. Funding for the workshop was provided by the National Science Foundation (NSF). The 51 participants were drawn from academia, industry, and government, including program managers from NSF, National Aeronautics and Space Administration (NASA), National Institute of Standards and Technology (NIST), and National Oceanic and Atmospheric Administration (NOAA). The final detailed report of the workshop will be available after July 30, 1998, at the workshop web site.
Some New Optimal Ternary Linear Codes
Authors: Iliya Boukliev
Venue: Designs, Codes and Cryptography (1997)

Let d_3(n,k) be the maximum possible minimum Hamming distance of a ternary [ n,k,d;3]-code for given values of n and k. It is proved that d_3(44,6)=27, d_3(76,6)=48,d_3(94,6)=60 , d_3(124,6)=81,d_3(130,6)=84 , d_3(134,6)=87,d_3(138,6)=90 , d_3(148,6)=96,d_3(152,6)=99 , d_3(156,6)=102,d_3(164,6)=108 , d_3(170,6)=111,d_3(179,6)=117 , d_3(188,6)=123,d_3(206,6)=135 , d_3(211,6)=138,d_3(224,6)=147 , d_3(228,6)=150,d_3(236,6)=156 , d_3(31,7)=17 andd_3(33,7)=18 . These results are obtained by a descent method for designing good linear codes.
Risk-Sensitive and Robust Escape Criteria
Authors: Paul Dupuis, William M. McEneaney
Venue: SIAM Journal on Control and Optimization (1997)

The problem of controlling a noisy process so as to prevent it from leaving a prescribed set has a number of interesting applications. In this paper, new approaches to this problem are considered. First, a risk-sensitive criterion for a stochastic diffusion process model is examined, and it is shown that the value is a classical solution of a related PDE. The qualitative properties of this criterion are favorably contrasted with those of existing criteria in the risk-averse limit. It is proved that in the risk-averse limit the value of the risk-sensitive criterion converges to a viscosity solution of a first-order PDE. It is then demonstrated that the value function of a deterministic differential game is also a viscosity solution to the PDE. This game gives a robust control formulation of the escape time problem and is analogous to H$^{\infty}$ control. In particular, the opposing player attempts to push the process out of the prescribed set and suffers an L2 cost for his efforts. Lower bounds on the escape time as a function of this cost are obtained.
A sizing and timing analysis of an integrated computer network simulator
Authors: Udo W. Pooch, Mark J. Kiemele
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This research addressed the performance characteristics of a computer-communication network that integrates both voice and data traffic on the backbone of the network. Network performance was analyzed using an event-driven FORTRAN simulation model. The model was based on a circuit-switched communications subnet whose trunk lines carry both voice and data traffic simultaneously. A sizing and timing analysis is accomplished by collecting empirical performance data for a variety of system input parameter combinations. The data was analyzed to determine simulation running time needed to reach steady state and to size the input parameter ranges that correspond to feasible network performance.
Flick: a flexible, optimizing IDL compiler
Authors: Eric Eide, Kevin Frei, Bryan Ford, Jay Lepreau, Gary Lindstrom
Venue: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation (1997)

An interface definition language (IDL) is a nontraditional language for describing interfaces between software components. IDL compilers generate "stubs" that provide separate communicating processes with the abstraction of local object invocation or procedure call. High-quality stub generation is essential for applications to benefit from component-based designs, whether the components reside on a single computer or on multiple networked hosts. Typical IDL compilers, however, do little code optimization, incorrectly assuming that interprocess communication is always the primary bottleneck. More generally, typical IDL compilers are "rigid" and limited to supporting only a single IDL, a fixed mapping onto a target language, and a narrow range of data encodings and transport mechanisms.Flick, our new IDL compiler, is based on the insight that IDLs are true languages amenable to modern compilation techniques. Flick exploits concepts from traditional programming language compilers to bring both flexibility and optimization to the domain of IDL compilation. Through the use of carefully chosen intermediate representations, Flick supports multiple IDLs, diverse data encodings, multiple transport mechanisms, and applies numerous optimizations to all of the code it generates. Our experiments show that Flick-generated stubs marshal data between 2 and 17 times faster than stubs produced by traditional IDL compilers, and on today's generic operating systems, increase end-to-end throughput by factors between 1.2 and 3.7.
Design of an Actor language for implicit parallel programming
Authors: Yariv Aridor, Shimon Cohen, Amiram Yehudai
Venue: ACM SIGPLAN Notices (1998)

Software tools that support implicit parallel programming hold the key to reducing the complexity of parallel programming and realizing more ubiquitous parallel computation. This paper addresses the topic of implicit concurrent object-oriented programming. It presents a new language, SYMPAL, which unlike most existing COOP languages that provide explicit constructs for concurrency control, is based on a unification of object orientation and pure functional programming with the goals of supporting implicit programming and high efficiency in massively concurrent object-oriented programming. Extensive experience with SYMPAL applications on a parallel machine indicates that it achieves these goals.
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
Authors: Eyal Kushilevitz, Yishay Mansour
Venue: SIAM Journal on Computing (1998)

We show that for any randomized broadcast protocol for radio networks, there exists a network in which the expected time to broadcast a message is $\Omega(D\log (N/D))$, where D is the diameter of the network and N is the number of nodes. This implies a tight lower bound of $\Omega(D\log N)$ for any $D \le N^{1-\varepsilon}$, where $\varepsilon > 0$ is any constant.
A simulation of an imbedded software system for global positioning system navigation
Authors: Jon Vavrus
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A set of software was developed to allow the execution of a set of real time navigation code on a host computer. This program (STM) allowed the debugging and testing of the real time software to be done in an environment containing a large variety of software tools. The program simulated Global Positioning System (radio ranging), and Inertial Measurement System inputs for the target software. It was found that the simulator performed adequately and enhanced our ability to deliver the working real time code. 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
Issues arising from medical system's failure
Authors: Andrew Blyth
Venue: ACM SIGSOFT Software Engineering Notes (1997)

As more health-care providers adopt and utilise information technology in the treatment of there patients, so the number of system failures increases. Analysis of these failures shows us that these systems are failing for a variety of technical and social reason. The question that we are forced to ask is Why? In this paper I seek to highlight some of the problems that are currently facing developers and users of medical computing systems.
Test generation for primitive path delay faults in combinational circuits
Authors: Ramesh C. Tekumalla, Prem R. Menon
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper presents a method of identifying primitive path-delay faults in combinational circuits, and deriving robust tests for all robustly testable primitive faults. It uses the concept of sensitizing cubes to reduce the search space. This approach helps identify faults that cannot be part of any primitive fault, and avoids attempting test generation for them. Sensitization conditions determined for primitive fault identification are also used in test generation, reducing test generation effort. Experimental results on some of the ISCAS'85 and MCNC'91 benchmark circuits indicate that they contain a fair number of primitive multiple path delay faults which must be tested.
Automatic Script Identification From Document Images Using Cluster-Based Templates
Authors: Judith Hochberg, Patrick Kelly, Timothy Thomas, Lila Kerns
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We describe an automated script identification system for typeset document images. Templates for each script are created by clustering textual symbols from a training set. Symbols from new images are compared to the templates to find the best script. Our current system processes thirteen scripts with minimal preprocessing and high accuracy.
An experiment in multi-level modelling
Authors: Michael Whelan
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The primary goal of this experiment was to determine the advantages which multi-level modelling would provide to the designer of a digital system. It is, however, readily apparent that providing multi-level modelling facilities will complicate the tool builders task, since tools may be required to cooperate with other tools in order to 'gain' information concerning the behavior of the system which is modelled. Hence, a secondary goal was to examine the problems presented to the design system implementor, by multi-level modelling.
CS student research experience applied to developing instructional technology
Authors: Dawn Cizmar
Venue: Proceedings of the 2nd conference on Integrating technology into computer science education (1997)

CS undergraduate research in a cooperative development effort is described. Significant experience in current technology was gained by creating an instructional unit. CS students directly applied research skills, and measured learning effectiveness in a controlled study. The work includes research, application, evaluation, model for future work, and presentation. It also provided a learning aid for general students, an interactive tutorial on elementary gate-level logic. JavaScript and HTML were used to rapidly develop this prototype. It was student-tested by student researchers, and served several objectives in a computer science course. Data on student performance was collected and analyzed. Positive results were obtained, indicating a model for further development.
Capacity Expansion and Replacement in Growing Markets with Uncertain Technological Breakthroughs
Authors: Sampath Rajagopalan, Medini R. Singh, Thomas E. Morton
Venue: Management Science (1998)

The capacity in electronics and other industries. Managers must consider the impact of future technologies while making acquisition and replacement decisions in such environments. We consider a problem where a sequence of technological breakthroughs are anticipated but their magnitude and timing are uncertain. A firm, operating in such an environment, must decide how much capacity of the current technology to acquire to meet future demand growth. It must also determine whether to upgrade any of the older vintages. We formulate this problem and present some structural results. Using these results, we then develop a highly efficient regeneration point-based dynamic programming algorithm. The effectiveness of the proposed algorithm is illustrated through a computational study. The sensitivity of the first period decision to various parameters is also explored.
Computerized analysis of daily life motor activity for ambulatory monitoring
Authors: K. Kiani, C. J. Snijders, E. S. Gelsema
Venue: Technology and Health Care (1997)

The primary goal of an ambulatory monitoring of motor activities (AMMA) system is to document the occurrence of random and spontaneous motor activities (e.g., sitting, lying, standing, walking, running, etc.) of the ambulatory subject in natural environmental circumstances. Much progress has been made in recording fidelity, reduction in energy requirement, fixation of the accelerometers, equipment size and weight, memory capacity and data acquisition. At present, our laboratory is interested in developing an automated off-line AMMA-signal analysis system. The system has to take care of activity (wave) detection, recognition of onsets and endpoints of the various activities (waves), and computation of a set of relevant clinical parameters (e.g., total walking time, number of times rising from a chair, etc.) from long-term recorded data. Two methods are currently being used for computerizing the off-line analysis system; using an artificial neural network and using a set of selected features extracted from the input data. The present paper is aimed at the latter method. The method was successfully applied to long-term recorded data sets of eight male amputees and three other subjects. The primary results indicate that the method is a potentially useful tool to computerize the off-line analysis system.
Lexicographic Order and Linearity
Authors: A. J. Van Zanten
Venue: Designs, Codes and Cryptography (1997)

Let \V be a list of all words of (GF(2))^n, lexicographically ordered with respect to some basis. Lexicodes are codes constructed from \V by applying a greedy algorithm. A short proof, only based on simple principles from linear algebra, is given for the linearity of these codes. The proof holds for any ordered basis, and for any selection criterion, thus generalizing the results of several authors. An extension of the applied technique shows that lexicodes over GF(2^{2^k}) are linear for a wide choice of bases and for a large class of selection criteria. This result generalizes a property of Conway and Sloane.
A test synthesis technique using redundant register transfers
Authors: Chris Papachristou, Mikhail Baklashov
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper presents a test synthesis technique for behavioral descriptions. The technique is guided by two testability metrics which quantify the controllability and observability of behavioral variables and structural signals. The method is based on utilizing redundant register transfers in the data path to produce a test behavior with better controllability and observability properties. This approach can avoid unnecessary insertions of test structures in the data path. A test scheme for conditional statements has been developed involving minimal changes in the controller. Our experimental results show improvements in fault coverage at modest hardware overhead.
Probabilistic Multiscale Image Segmentation
Authors: Koen L. Vincken, André S. E. Koster, Max A. Viergever
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

A method is presented to segment multidimensional images using a multiscale (hyperstack) approach with probabilistic linking. A hyperstack is a voxel-based multiscale data structure whose levels are constructed by convolving the original image with a Gaussian kernel of increasing width. Between voxels at adjacent scale levels, child-parent linkages are established according to a model-directed linkage scheme. In the resulting tree-like data structure, roots are formed to indicate the most plausible locations in scale space where segments in the original image are represented by a single voxel. The final segmentation is obtained by tracing back the linkages for all roots.The present paper deals with probabilistic (or multiparent) linking, i.e., a set-up in which a child voxel can be linked to more than one parent voxel. The multiparent linkage structure is translated into a list of probabilities that are indicative of which voxels are partial volume voxels and to which extent. Probability maps are generated to visualize the progress of weak linkages in scale space when going from fine to coarser scale. This is shown to be a valuable tool for the detection of voxels that are difficult to segment properly.The output of a probabilistic hyperstack can be directly related to the opacities used in volume renderers. Results are shown both for artificial and real world (medical) images. It is demonstrated that probabilistic linking gives a significantly improved segmentation as compared with conventional (single-parent) linking. The improvement is quantitatively supported by an objective evaluation method.
The RASSP Program: Origin, Concepts, and Status: An Introduction to the Issue
Authors: Mark A. Richards, Anthony Gadient, Geoffrey A. Frank, Randolph Harr
Venue: Journal of VLSI Signal Processing Systems (1997)

The Rapid Prototyping of Application Specific Signal Processors (RASSP) program is a multi-year DARPA/Tri-Service initiative intended to dramatically improve the process by which complex digital systems, particularly embedded digital signal processors, are designed, manufactured, upgraded, and supported. This paper reviews the genesis of the RASSP program, considering both the problems that defined the need for the program, and the historical conditions under which it began. The RASSP program is then presented from two viewpoints. The first is programmatic, covering the goals and constraints of the program, and describing the roles of the various program participants. The second is technical, covering the major concepts upon which the developing RASSP approach to design is based and showing how the detailed technical discussions contained in the other papers in this issue of the Journal of VLSI Signal Processing relate to one another and fit into an overall development concept. The paper closes with a review of the status of the program as of this writing (Summer 1996).
The dark side of risk (what your mother never told you about Time Warp)
Authors: D. M. Nicol, X. Liu
Venue: ACM SIGSIM Simulation Digest (1997)

This paper is a reminder of the danger of allowing ``risk'' when synchronizing a parallel discrete-event simulation: a simulation code that runs correctly on a serial machine may, when run in parallel, fail catastrophically. This can happen when Time Warp presents an ``inconsistent'' message to an LP, a message that makes absolutely no sense given the LP's state. Failure may result if the simulation modeler did not anticipate the possibility of this inconsistency. While the problem is not new, there has been little discussion of how to deal with it; furthermore the problem may not be evident to new users or potential users of parallel simulation. This paper shows how the problem may occur, and the damage it may cause. We show how one may eliminate inconsistencies due to lagging rollbacks and stale state, but then show that so long as risk is allowed it is still possible for an LP to be placed in a state that is inconsistent with model semantics, again making it vulnerable to failure. We finally show how simulation code can be tested to ensure safe execution under a risk-free protocol. Whether risky or risk-free, we conclude that under current practice the development of correct and safe parallel simulation code is not transparent to the modeler; certain protections must be included in model code or model testing that are not rigorously necessary if the simulation were executed only serially.