ppxscal/embedding_network huggingface dataset:
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
Authors: Anindya Datta, Debra VanderMeer, Krithi Ramamritham
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses tend to be extremely large¿it is quite possible for a data warehouse to be hundreds of gigabytes to terabytes in size. Queries tend to be complex and ad hoc, often requiring computationally expensive operations such as joins and aggregation. Given this, we are interested in developing strategies for improving query processing in data warehouses by exploring the applicability of parallel processing techniques. In particular, we exploit the natural partitionability of a star schema and render it even more efficient by applying DataIndexes¿a storage structure that serves both as an index as well as data and lends itself naturally to vertical partitioning of the data. Dataindexes are derived from the various special purpose access mechanisms currently supported in commercial OLAP products. Specifically, we propose a declustering strategy which incorporates both task and data partitioning and present the Parallel Star Join (PSJ) Algorithm, which provides a means to perform a star join in parallel using efficient operations involving only rowsets and projection columns. We compare the performance of the PSJ Algorithm with two parallel query processing strategies. The first is a parallel join strategy utilizing the Bitmap Join Index (BJI), arguably the state-of-the-art OLAP join structure in use today. For the second strategy we choose a well-known parallel join algorithm, namely the pipelined hash algorithm. To assist in the performance comparison, we first develop a cost model of the disk access and transmission costs for all three approaches. Performance comparisons show that the DataIndex-based approach leads to dramatically lower disk access costs than the BJI, as well as the hybrid hash approaches, in both speedup and scaleup experiments, while the hash-based approach outperforms the BJI in disk access costs. With regard to transmission overhead, our performance results show that PSJ and BJI outperform the hash-based approach. Overall, our parallel star join algorithm and dataindexes form a winning combination.
A neurodynamical model for selective visual attention using oscillators
Authors: Silvia Corchs, Gustavo Deco
Venue: Neural Networks (2001)

We present a neurodynamical model to study and simulate visual search tasks experiments. The model consists of different pools of interconnected phase oscillators. Each oscillator is described by an integrate-and-fire type equation. Visual attention appears as an emergent property of the dynamic of the system, resulting from the temporal synchronization of the pools which bind the features of the searched target. The time courses observed in the psychophysical visual search experiments can be explained within a purely parallel dynamic and without assuming priority maps and serial spotlight mechanisms, as is usually done in the standard theories. The model fits also the measured activity reported for the neural responses in inferotemporal visual cortex of monkeys performing visual search tasks.
Two Complementary Approaches for Microcode Bit Optimization
Authors: In-Cheol Park, Se-Kyoung Hong, Chong-Min Kyung
Venue: IEEE Transactions on Computers (1994)

In the design of microprogrammed processors, the minimization of microcode width is very crucial to reduce the required microcode ROM area. The paper suggests two different procedures which are complementary in nature: first an integer linear programming formulation which guarantees an optimal solution for small or medium size problems; and second, a heuristic algorithm based on the graph bipartitioning to deal with large size problems. Experimental results show that the proposed heuristic algorithm yields near-optimal solutions with polynomial time complexity.
Texture Classification Using Noncausal Hidden Markov Models
Authors: Bennett R. Povlow, Stanley M. Dunn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper addresses the problem of using noncausal hidden Markov models (HMMs) for texture classification. In noncausal models, the state of each pixel may be dependent on its neighbors in all directions. New algorithms are given to learn the parameters of a noncausal HMM of a texture and to classify it into one of several learned categories. Texture classification results using these algorithms are provided.
A Low-Cost Checkpointing Technique for Distributed Databases
Authors: Jun-Lin Lin, Margaret H. Dunham
Venue: Distributed and Parallel Databases (2001)

For distributed databases, checkpointing is used to ensure an efficient way to perform global reconstruction. However, the need for global reconstruction is infrequent. Most current checkpointing approaches for distributed databases are too expensive during run time. Some of them allow the checkpointing process to run in parallel with normal transactions at the cost of more data and resource contention, which in turn causes longer response time for normal transactions. Thus, an efficient way to checkpoint distributed databases is needed to avoid degrading the system performance. This paper presents a low-cost solution, called Loosely Synchronized Local Fuzzy Checkpointing (LSLFC), to these problems. LSLFC supports global reconstruction, and our performance study shows that LSLFC has little overhead during run time.
Analyzing and Improving Reliability: A Tree-Based Approach
Authors: Jeff Tian, Joe Palma
Venue: IEEE Software (1998)

Tree-based reliability modeling integrates the benefits of software reliability growth models and input domain reliability models, offering a framework to assess software reliability and guidance to improve it. To test TBRM, the authors studied five large systems developed using similar processes. Implementation involves close collaboration between quality analysts and the test and development teams in defining measurements, gathering data, building the models, and performing remedial actions. The authors found this integrated approach both feasible and effective.
Toward Intelligent Meeting Agents
Authors: Hsinchun Chen, Andrea Houston, Jay Nunamaker, Jerome Yen
Venue: Computer (1996)

An experiment with an AI-based software agent shows that it can help users organize and consolidate ideas from electronic brainstorming. The agent recalled concepts as effectively as experienced human meeting facilitators and in a fifth of the time. Agent software enhances the productivity of groupware by helping perform convergent tasks, thus freeing users for more creative work. The result is a significant time savings over groupware without agents. We validated the performance of an intelligent agent, which can reason about a task and learn from task performance. Our intelligent agent supports the GroupSystems electronic meeting system developed by the University of Arizona. The agent organizes ideas from brainstorming sessions into category lists for further discussion, a task often difficult for human electronic meeting facilitators.
Talisman: Multimedia for the PC
Authors: Martin Randall
Venue: IEEE Micro (1997)

A revolutionary new approach from an alliance of major industry partners is developing the most dramatic advance in multimedia performance the PC has ever seen. Code-named "Talisman," the new architecture, being jointly developed by Microsoft, Silicon Engineering, Samsung Semiconductor, Philips Microelectronics, Cirrus Logic, and Fujitsu Microelectronics, combines advanced DSP technology with a new approach to 3D graphics to provide vast improvements in performance and image quality. The hardware architecture is designed to dove-tail with Microsoft's DirectX/Direct3D API, making possible sophisticated techniques to accelerate multimedia performance to new levels while maintaining compatibility with this industry-standard API. The first implementation of this new hardware architecture is known as "Escalante," and was described at HotChips8 as "Touchstone". This article focuses on the 3D aspects of the Talisman architecture, specifically discussing the Escalante implementation. The Talisman architecture achieves performance levels significantly higher than can be attained using traditional approaches by exploiting the innate spatial and temporal coherence characteristics of animated 3D graphics. Rather than completely re-rendering each scene every frame, image layers--surfaces or elements of the total scene--are rendered and then transformed and composited during display to form the final image. Surfaces are re-used over several frames before needing to be re-rendered. The resultant offload from the rendering processor allows it to produce images of vastly higher quality, using shadowing and multipass operations in real-time. An image compositor assembles these elements at video rate, performing scaling, translations, rotation and skew to each element independently, allowing reuse of the elements over several frames, and resulting in full frame-rate (75Hz) full-screen (1024 × 768 or higher) animation at full true-color pixel depth (24-bits). Extensive use is made of compression and decompression to reduce memory usage and bandwidth, allowing such a system to be built with only 4 Mbytes of memory. The concept of "chunking"--dividing the geometries into small areas--provides many benefits, including on-chip Z-buffering, cost-effective anti-aliasing, and block-oriented compression. Advanced rendering features such as anisotropic MIP-mapped textures, shadows, transparency, motion blur, lens flare, and more, are implemented in hardware.
Overview of Popular Benchmark Sets
Authors: Justin E. Harlow
Venue: IEEE Design Test (2000)

One of the most difficult tasks CAD users face is the evaluation and comparison of different tools and algorithms. For commercial software purchasers, it is vital to understand how well a given tool does the required job and which of many possible choices is best for the kinds of problems a user will face. For the tool developer, whether in academia or industry, the efficiency of critical algorithms must be measured and compared to understand both tool behavior and progress over time.
A New Family of Bridged and Twisted Hypercubes
Authors: R. K. Das, K. Mukhopadhyaya, B. P. Sinha
Venue: IEEE Transactions on Computers (1994)

We show that by adding eight extra edges, referred to as bridges, to an n-cube (n/spl ges/4) its diameter can be reduced by 2, and by adding sixteen bridges to an n-cube (n/spl ges/6) its diameter can be reduced by 3. We also show that by adding (/sub m+1sup 4m/)+1(m/spl ges/2) bridges to an n-cube (n/spl ges/4m and n/spl ges/8) its diameter can be reduced by 2m and by adding 2(/sub msup 4m-3/)+1, (m
Design of a Radix 4 Division Unit with Simple Selection Table
Authors: P. Montuschi, L. Ciminiera
Venue: IEEE Transactions on Computers (1992)

A radix 4 division architecture is presented which partially overlaps the updating of the remainder with the digit selection procedure. It is obtained by separating the radix 4 digit selection process into two concurrent substeps. The proposed unit requires a simple selection table and involves a small extra expense for the additional hardware compared to the usual radix 4 division units. Four possible implementations are derived from the general model, with different types of substeps. The high level evaluation shows that the proposed architectures offer an efficient alternative.
Temporal Association Algebra: A Mathematical Foundation for Processing Object-Oriented Temporal Databases
Authors: Stanley Y. W. Su, Soon J. Hyun, Hsin-Hsing M. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

This paper describes an object-oriented temporal association algebra (called TA-algebra) which is intended to serve as a formal foundation for supporting a pattern-based query specification and processing paradigm. Different from the traditional table-and-attribute-based paradigm, the pattern-based paradigm views the intension of an object-oriented temporal database as a network of object classes interconnected by different association types and its extension as a network of associated temporal object instances. Consistent with this view, queries can be specified in terms of patterns of temporal object associations or nonassociations (i.e., linear, tree and network structures of object classes/objects with logical AND and OR branches). TA-algebra provides a set of algebraic operators for processing these patterns and allows the direct and/or indirect associations and/or nonassociations among temporal object instances to be more explicitly represented and maintained during processing than the traditional tabular representation of temporary or final query results. TA-algebra operators are based on time-interval and valid-time semantics and they preserve the closure property. The algebra is capable of operating on heterogeneous as well as homogeneous patterns of object associations. Both homogeneous and heterogeneous patterns are decomposed into a set of primitive temporal pattern instances for uniform treatment. This paper formally defines the TA-algebra operators and their mathematical properties. The applications of these operators in query decomposition and processing are illustrated by examples.
Enterprise Knowledge Management
Authors: Daniel E. O'Leary
Venue: Computer (1998)

Many enterprises downsize to adapt to more competitive environments. But unless they have captured the knowledge of their employees, downsizing can result in a loss of critical information. Similarly, as employees leave, organizations are likely to lose access to large quantities of critical knowledge. And as companies expand internationally, geographic barriers can affect knowledge exchange and prevent easy access to information. These and other forces are pushing enterprises to explore better methods for knowledge management. Enterprise knowledge management entails formally managing knowledge resources, typically by using advanced information technology. KM is formal in that knowledge is classified and categorized according to a prespecified but evolving ontology into structured and semistructured data and knowledge bases. The overriding purpose of enterprise KM is to make knowledge accessible and reusable to the enterprise. The business world is becoming so concerned about knowledge management that, according to one report, over 40 percent of the Fortune 1000 now have a chief knowledge officer, a senior-level executive responsible for creating an infrastructure and cultural environment for knowledge sharing. This article surveys some components of this young field.
A Priori Worst Case Error Bounds for Floating-Point Computations
Authors: Walter Krämer
Venue: IEEE Transactions on Computers (1998)

A new technique for the a priori calculation of rigorous error bounds for floating-point computations is introduced. The theorems given in the paper combined with interval arithmetic lead to the implementation of reliable software routines, which enable the user to compute the desired error bounds automatically by a suitable computer program. As a prominent example, a table-lookup algorithm for calculating the function exp(x) $-$ 1 that has been published by Tang [16] is analyzed using these new tools. The result shows the high quality of the new approach.
An MPGA-Like FPGA
Authors: David Marple
Venue: IEEE Design Test (1992)

The CP20K series of field-programmable gate array (FPGA) chips is described. Consisting of an array of individual CMOS transistors and small logic elements linked via antifuse-programmable interconnections to form large functional blocks, the CP20K closely mimics the flexibility and capacity of a mask-programmable gate array (MPGA). It is shown that the chip's fine-grained architecture makes it easy to use logic synthesis tools because area and performance can be traded off exactly as in MPGA logic synthesis.
StepNP: A System-Level Exploration Platform for Network Processors
Authors: Pierre Paulin, Chuck Pilkington, Essaid Bensoudane
Venue: IEEE Design Test (2002)

The fast-changing communications market requires high-performance yet flexible network-processingplatforms. StepNP is an exploratory network processor simulation environment for exploring applications, multiprocessor network-processing architectures, and SoC tools. Supporting model interaction, instrumentation, and analysis, the platform lets R&D teams easily add new processors, coprocessors, and interconnects.
Computing Network Flow on a Multiple Processor Pipeline
Authors: P. Agrawal, A. Ng
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We demonstrate the feasibility of a distributed implementation of the Goldberg-Tarjan algorithm for finding the maximum flow in a network. Unlike other parallel implementations of this algorithm, where the network graph is partitioned among many processors, we partition the algorithm among processors arranged in a pipeline. The network graph data are distributed among the processors according to local requirements. The partitioned algorithm is implemented on six processors within a 15-processor pipelined message-passing multicomputer operating at 5 MHz. We used randomly generated networks with integer capacities as examples. Performance estimates based upon a six-processor pipelined implementation indicated a speedup between 3.8 and 5.9 over a single processor.
How To Evaluate Legacy System Maintenance
Authors: Norman F. Schneidewind
Venue: IEEE Software (1998)

Drawing on extensive data from the NASA Space Shuttle's guidance software, Schneidewind proposes a method for evaluating the effectiveness of legacy software maintenance efforts. He provides several formulas for tracking maintenance stability defined as increasing functionality with decreasing failures, over time and offers data that supports their validity. Schneidewind also provides tips for applying his formulas to different projects.
The MIPS R3010 Floating-Point Coprocessor
Authors: Chris Rowen, Mark Johnson, Paul Ries
Venue: IEEE Micro (1988)

A description is given of the R3010 floating-point accelerator chip, a coprocessor that is based on advanced reduced-instruction-set-computer (RISC) architecture and VLSI design techniques and provides high-speed floating-point operation. The 75000-transistor hard-wired chip executes four instructions in parallel. Its performance is compared with that of available floating-point processors and its architecture is examined. The organization and implementation of the R3010 is discussed.
Specification and Analysis of Intercomponent Communication
Authors: Mats P. E. Heimdahl, Jeffrey M. Thompson, Barbara J. Czerny
Venue: Computer (1998)

Embedded critical systems pose particularly difficult problems in writing and validating software requirements. Often, the interfaces between the software and the embedding environment are a major source of costly errors. At an abstract level, we can view an embedded control system as a collection of physically distinct components communicating over unidirectional communication channels. This view is adopted in the Requirements State Machine Language (RSML), which was used successfully to model TCAS II, a large commercial avionics system that the US Federal Aviation Administration requires on all aircraft with more than 30 seats. This work extends and refines RSML to support rigorous specification and analysis of system-level intercomponent communication. It does this using a formalism that defines interfaces as well as input and output variables. The authors have also developed a set of prototype tools supporting the analysis of system level intercomponent communication.
Mining Optimized Association Rules with Categorical and Numeric Attributes
Authors: R. Rastogi, K. Shim
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Mining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial, and retail sectors. Furthermore, optimized association rules are an effective way to focus on the most interesting characteristics involving certain attributes. Optimized association rules are permitted to contain uninstantiated attributes and the problem is to determine instantiations such that either the support or confidence of the rule is maximized. In this paper, we generalize the optimized association rules problem in three ways: 1) association rules are allowed to contain disjunctions over uninstantiated attributes, 2) association rules are permitted to contain an arbitrary number of uninstantiated attributes, and 3) uninstantiated attributes can be either categorical or numeric. Our generalized association rules enable us to extract more useful information about seasonal and local patterns involving multiple attributes. We present effective techniques for pruning the search space when computing optimized association rules for both categorical and numeric attributes. Finally, we report the results of our experiments that indicate that our pruning algorithms are efficient for a large number of uninstantiated attributes, disjunctions, and values in the domain of the attributes.
A feed-forward network for input that is both categorical and quantitative
Authors: Roelof K. Brouwer
Venue: Neural Networks (2002)

The data on which a multi-layer perceptron (MLP) is to be trained to approximate a continuous function may have inputs that are categorical rather than numeric or quantitative such as color, gender, race, etc. A categorical variable causes a discontinuous relationship between an input variable and the output. A MLP, with connection matrices that multiply input values and sigmoid functions that further transform values, represents a continuous mapping in all input variables. A MLP therefore requires that all inputs correspond to numeric, continuously valued variables and represents a continuous function in all input variables. The way that this problem is usually dealt with is to replace the categorical values by numeric ones and treat them as if they were continuously valued. However, there is no meaningful correspondence between the continuous quantities generated this way and the original categorical values. Another approach is to encode the categorical portion of the input using 1-out-of-n encoding and include this code as input to the MLP.The approach in this paper is to segregate categorical variables from the continuous independent variables completely. The MLP is trained with multiple outputs; a separate output unit for each of the allowed combination of values of the categorical independent variables. During training the categorical value or combination of categorical values determines which of the output units should have the target value on it, with the remaining outputs being 'do not care'. Three data sets were used for comparison of methods. Results show that this approach is much more effective than the conventional approach of assigning continuous variables to the categorical features. In case of the data set where there were several categorical variables the method proposed here is also more effective than the 1-out-of-n input method.