ppxscal/embedding_network huggingface dataset:
Storage Efficient Replicated Databases
Authors: D. Agrawal, A. El Abbadi
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

A fragmentation method that reduces the storage overhead of replicated objects is proposed. A data-management protocol for these fragmented objects is presented, and it is shown that this protocol is a generalization of quorum algorithms for replicated data in which objects are not fragmented. Although the protocol reduces storage requirements, it does not achieve a high level of resiliency for both read and write operations. By integrating a propagation mechanism with the protocol, the same level of resiliency is achieved for both read and write operations as other quorum protocols, while the storage cost is reduced.
Multilevel Testability Analysis and Solutions for Integrated Bluetooth Transceivers
Authors: Sule Ozev, Christian V. Olgaard, Alex Orailoglu
Venue: IEEE Design Test (2002)

As use of wireless communications rises and profit margins shrink, low-cost solutions are becoming increasingly important. Incorporating test design and DFT into the system design flow is essential to achieving such solutions. This case study analyzes test requirements, implications, and test cost for low-cost Bluetooth systems, which enable communication among several electronic components.
Using Extreme Programming in a Maintenance Environment
Authors: Charles Poole, Jan Willem Huisman
Venue: IEEE Software (2001)

In response to problems experienced by the Orbix Generation 3 maintenance and enhancement team, Iona Technologies tried to introduce industry-level best practices by adopting Extreme Programming. The issues discussed are common for companies moving from start-up mode to those supporting numerous customers in need of bug fixes and application enhancements for existing deployment scenarios.
Parameter Estimation in Two-Dimensional Space by Mixed Chebyshev&ndash;Legendre Approximations
Authors: Yonghoon Kwon, Ben-Yu Guo, Ki-Hyun Cha
Venue: Journal of Scientific Computing (2003)

Mixed Chebyshev&ndash;Legendre approximations are proposed for identifications of parameters in two-dimensional differential equations. They are easy to be performed, and have the spectral accuracy. Numerical results coincide with theoretical analysis.
Consensus With Dual Failure Modes
Authors: F. J. Meyer, D. K. Pradhan
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

The problem of achieving consensus in a distributed system is discussed. Systems aretreated in which either or both of two types of faults may occur: dormant (essentiallyomission and timing faults) and arbitrary (exhibiting arbitrary behavior, commonly referred to as Byzantine). Previous results showed that are number of dormant faults may be tolerated when there are no arbitrary faults and that, at most, (n-1/3) arbitrary faults may be tolerated when there are no dormant faults (n is the number of processors). Acontinuum is established between the previous results: an algorithm exists if n(f/submax/+2m/sub max/) and c(f/sub max/+m/sub max/) (where c is the system connectivity),when faults are constrained so that there are at most f/sub max/ and at most m/submax/ of these that are arbitrary. An algorithm is given and compared to known algorithms. A method is given to establish virtual links so that the communications graph appears completely connected.
An Approach to Mobile Software Robots for the WWW
Authors: Kazuhiko Kato, Yuuichi Someya, Katsuya Matsubara, Kunihiko Toumura, Hirotake Abe
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

This paper describes a framework for developing mobile software robots by using the Planet mobile object system, which is characterized by language-neutral layered architecture, the native code execution of mobile objects, and asynchronous object passing. We propose an approach to implementing mobile Web search robots that takes full advantage of these characteristics, and we base our discussion of its effectiveness on experiments conducted in the Internet environment. The results show that the Planet approach to mobile Web search robots significantly reduces the amount of data transferred via the Internet and that it enables the robots to work more efficiently than the robots in the conventional stationary scheme whenever nontrivial amounts of HTML files are processed.
Memory Bandwidth Analysis of Hierarchical Multiprocessors using Model Decomposition and Steady-State Flow Analysis
Authors: S. M. Mahmud, L. T. Samaratunga
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

For memory bandwidth analysis, researchers generally discard requests that are notaccepted during a memory cycle. This assumption simplifies the analysis and producesnegligible discrepancies with actual results for a system with a non-hierarchicalinterconnection network. However, the assumption, "the requests that are not occupiedduring a memory cycle are discarded," cannot be used for a multiprocessor system with ahierarchical interconnection network (HIN), because the error introduced assumption canbe several orders of magnitude higher than the actual bandwidth. An improved analyticalmodel to determine the bandwidth of a HIN-based system is presented.
Test and Reliability: Partners in IC Manufacturing, Part 1
Authors: Charles F. Hawkins, Jaume Segura
Venue: IEEE Design Test (1999)

Transistor oxides rupture, metals open or form bridging defects, and integrated circuit parameters can lie outside of normal product distribution. While test and reliability engineers and physicists share these failure modes and have other mutual interests, they often remain isolated from each other. This two-part series from the view of a test engineer explains the major IC reliability failure mechanisms with perspectives on their severity and relation to test. *Part II will appear in the October-December 1999 issue.
Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet
Authors: Philo Juang, Hidekazu Oki, Yong Wang, Margaret Martonosi, Li Shiuan Peh, Daniel Rubenstein
Venue: Proceedings of the 10th international conference on Architectural support for programming languages and operating systems (2002)

Over the past decade, mobile computing and wireless communication have become increasingly important drivers of many new computing applications. The field of wireless sensor networks particularly focuses on applications involving autonomous use of compute, sensing, and wireless communication devices for both scientific and commercial purposes. This paper examines the research decisions and design tradeoffs that arise when applying wireless peer-to-peer networking techniques in a mobile sensor network designed to support wildlife tracking for biology research.The ZebraNet system includes custom tracking collars (nodes) carried by animals under study across a large, wild area; the collars operate as a peer-to-peer network to deliver logged data back to researchers. The collars include global positioning system (GPS), Flash memory, wireless transceivers, and a small CPU; essentially each node is a small, wireless computing device. Since there is no cellular service or broadcast communication covering the region where animals are studied, ad hoc, peer-to-peer routing is needed. Although numerous ad hoc protocols exist, additional challenges arise because the researchers themselves are mobile and thus there is no fixed base station towards which to aim data. Overall, our goal is to use the least energy, storage, and other resources necessary to maintain a reliable system with a very high `data homing' success rate. We plan to deploy a 30-node ZebraNet system at the Mpala Research Centre in central Kenya. More broadly, we believe that the domain-centric protocols and energy tradeoffs presented here for ZebraNet will have general applicability in other wireless and sensor applications.
On-Line Monitoring: A Tutorial
Authors: Beth A. Schroeder
Venue: Computer (1995)

Monitoring is a little-known technology. Until recently, dedicated, single-purpose, and relatively simple monitors had been in use in debuggers and performance evaluators. Today, monitoring systems are highly sophisticated, general-purpose tools that can beneficially be applied to monitoring distributed applications are improving application dependability. it is a technology that has come of age. After identifying the set of characteristics that define runtime monitoring systems, we lay the groundwork for the remainder of the paper by introducing terms and concepts of event-based monitoring. Runtime monitoring is composed of a number of activities; these activities are identified and discussed. We conclude with a representative set of examples of current work taken from each of the functional areas discussed. To promote a common understanding among works, we first pose key questions then discuss each example in the context of the questions.
Access Control Mechanisms in a Distributed, Persistent Memory System
Authors: Lanfranco Lopriore
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

A distributed, persistent memory system is considered, which implements a form of segmentation with paging within the framework of the single-address-space paradigm of memory reference. A peculiar problem of a system of this type is the lack of protection of the private information items of any given process against unauthorized access attempts possibly performed by the other processes. We present a set of mechanisms able to enforce access control over the private virtual space areas. These mechanisms guarantee a degree of protection comparable to that typical of a multiple-address-space system, while preserving the advantages of ease of information sharing, typical of the single-address-space model. The resulting environment is evaluated from a number of salient viewpoints, including ease of distribution and revocation of access rights, strategies for virtual space reuse, and the storage requirements of the information for memory management.
Guest Editor's Introduction: The Reuse of Complex Architectures
Authors: Grant Martin
Venue: IEEE Design Test (2002)

Platform-Based Design is an efficient way to design complex system-on-a-chip (SoC)products.PBD moves beyond the reuse of individual IP blocks, to the reuse of complex architectures of hardware and software components organized for a specific application domain. Platforms, along with libraries of predesigned and characterized hardware and software virtual components, enable rapid, low-risk creation of derivative products. Examples of SoC platforms include wireless handset chipsets, digital multimedia devices (such as set-top boxes), automotive systems, and personal digital assistants (PDAs).
Prediction of Neural Net Tolerance to Noise
Authors: Khalid A. Al-Mashouq
Venue: Neural Processing Letters (1997)

To protect a feed-forward neural net against errors, error correcting codes have been used in previous studies to encode the output label. Here we analyze the effect of additive noise on the performance of a 1-layer coded net and compare it to an uncoded net. The derived results are then used to predict the performance of any multilayer neural net.
The MetVR case study: meteorological visualization in an immersive virtual environment
Authors: Sean Ziegeler, Robert J. Moorhead, Paul J. Croft, Duanjun Lu
Venue: Proceedings of the conference on Visualization '01 (2001)

Traditional methods for displaying weather products are generally two-dimensional (2D) plots or just text format. It is hard for forecasters to get the entire picture of the atmosphere using these methods. The problems apparent in 2D with comparing and correlating multiple layers are overcome simply by adding a dimension. This is important because pertinent features in the data sets may lie in multiple layers and span several time steps. However, simply using a three-dimensional (3D) approach is not enough. The capacity for analysis of small-scale, but important, features in 2D is lost when transitioning to 3D. We propose that 3D's advantages can be incorporated with 2D's small-scale analysis by using an immersive virtual environment. In this case study, we evaluate our current standing with the project: have we met our goals, and how should we proceed from this point? To evaluate our application, we invited meteorologists to use the application to explore a data set. Then we presented our goals and asked which ones had we met, from a meteorologist's perspective. The results qualitatively reflected that our application was effective and further research would be worthwhile.
Piranha: A CORBA Tool For High Availability
Authors: Silvano Maffeis
Venue: Computer (1997)

Distributed systems, such as satellite surveillance systems and real-time feeds for financial data, must be heterogeneous, interoperable, extensible, and available. Availability is a kind of fault tolerance: The system is able to provide important services despite partial failure of its computers or software objects. The Object Management Group's Common Object Request Broker Architecture addresses only the first three characteristics. With respect to heterogeneity, for example, programmers can hide details of the underlying hardware and system software behind a portable interface, using CORBA's Interface Definition Language. IDL allows CORBA objects to invoke operations on each other even when implemented in different languages and even when running on incompatible operating systems. Wrapper objects and Object Request Broker (ORB) gateways enable interoperability by letting programmers interface new technology to legacy information systems. Finally, CORBA supports the development of highly modular applications, so programmers can more easily achieve extensibility-as well as better maintainability. To help address availability and reliability, the author developed an experimental CORBA-based restart service and monitor called Piranha (not related to the Yale University system). Piranha acts as a network monitor that reports failures through a graphical user interface. It also acts as a manager, automatically restarting failed CORBA objects, replicating stateful objects (objects that maintain an internal set of values) on the fly, migrating objects from one host to another, and enforcing predefined replication degrees-numbers of copies-on groups of objects. The article first examines the ways in which a CORBA ORB should support availability. It then explains how Piranha affords availability.
Towards computations of ocean flows using Navier-Stokes equations
Authors: Murali Beddhu, Min Yee Jiang, Lafayette K. Taylor, David L. Whitfield
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The equations for mass, momentum, temperature and salinity are formulated in a non-inertial general curvilinear coordinate system to be solved numerically. A flux-difference split type of numerical flux formulation is used for the convective fluxes and the equations are numerically solved in a strongly coupled manner using the Discretized Newton-Relaxation scheme. The addition of artificial viscosity is not required for stability. Test cases were considered that included laminar flow over a flat plate with prescribed wall temperature and salinity as well as laminar flow with heat transfer over a backward facing step. These computations compare well with existing results. The present numerical scheme was also applied to a body-fitted grid that approximates the entire Atlantic Ocean and rotates with the Earth. These results, though encouraging, must be considered preliminary.
Knowledge and Data Engineering
Authors: C. V. Ramamoorthy, B. W. Wah
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors provide an overview of the current research and development directions in knowledge and data engineering. They classify research problems and approaches in this area and discuss future trends. Research on knowledge and data engineering is examined with respect to programmability and representation, design tradeoffs, algorithms and control, and emerging technologies. Future challenges are considered with respect to software and hardware architecture and system design. The paper serves as an introduction to this first issue of a new quarter.
Evaluation of algorithms for one-dimensional cutting
Authors: Miro Gradisar, Gortan Resinovic, Miroljub Kljajić
Venue: Computers and Operations Research (2002)

The paper deals with the problem of evaluating and comparing different one-dimensional stock cutting algorithms regarding trim loss. Different types of problems are identified. An evaluation method is developed which enables a comparison of solutions of all types of problems. A practical example of this methods implementation is presented.
The Stanford Hydra CMP
Authors: Lance Hammond, Benedict A. Hubbert, Michael Siu, Manohar K. Prabhu, Michael Chen, Kunle Olukotun
Venue: IEEE Micro (2000)

Chip multiprocessors offer an economical, scalable architecture for future microprocessors. Thread-level speculation support allows them to speed up past software.
Engineering a New Society
Authors: Ana Asuaga
Venue: Computer (2001)

Can applying the principles and techniques of system engineering to social and political issues help create a better world?
Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization
Authors: Wen-Yang Lin
Venue: The Journal of Supercomputing (2003)

In this paper, we consider the problem of finding fill-preserving sparse matrix orderings for parallel factorization. That is, given a large sparse symmetric and positive definite matrix A that has been ordered by some fill-reducing ordering, we want to determine a reordering that is appropriate in terms of preserving the sparsity and minimizing the cost to perform the Cholesky factorization in parallel. Past researches on this problem all are based on the elimination tree model, in which each node represents the task for factoring a column, and thus, can be seen as a coarse-grained task dependence model. To exploit more parallelism, Joseph Liu proposed a medium-grained task model, called the column task graph, and showed that it is amenable to the shared-memory supercomputers. Based on the column task graph, we devise a greedy reordering algorithm, and show that our algorithm can find the optimal ordering among the class of all fill-preserving orderings of the given sparse matrix A.
A rejection model based on multi-layer perceptrons for Mandarin digit recognition
Authors: Zhong Lin, Liu Jia, Liu Runsheng
Venue: Journal of Computer Science and Technology (2002)

High performance Mandarin digit recognition (MDR) is much more difficult to achieve than its English counterpart, especially on inexpensive hardware implementation. In this paper, a new Multi-Layer Perceptrons (MLP) based postprocessor, an a posteriori probability estimator, is presented and used for the rejection model of the speaker independent Mandarin digit recognition system based on hidden Markov model (HMM). Poor utterances, which are recognized by HMMs but have low a posteriori probability, will be rejected. After rejecting about 4.9% of the tested utterances, the MLP rejection model can boost the digit recognition accuracy from 97.1% to 99.6%. The performance is better than those rejection models based on linear discrimination, likelihood ratio or anti-digit.
On approximating the maximum diameter ratio of graphs
Authors: Joze Marincek, Bojan Mohar
Venue: Discrete Mathematics (2002)

It is proved that computing the maximum diameter ratio (also known as the local density) of a graph is APX-complete. The related problem of finding a maximum subgraph of a fixed diameter d ≥ 1 is proved to be even harder to approximate.
A Taxonomy of Indexing Schemes for Parallel Database Systems
Authors: David Taniar, J. Wenny Rahayu
Venue: Distributed and Parallel Databases (2002)

In this paper, we present a taxonomy of indexing schemes in parallel database systems. Index partitioning is not recognized widely as yet. One of the reasons is that most of index structures are trees, not flat structures like tables, and consequently, index partitioning imposes some degree of complexity compared with common data partitioning for tables. We present three parallel indexing schemes, and discuss their maintenance strategies. We also analyze their storage requirements.
Robust Estimation of GARMA Model Parameters with an Application toCointegration among Interest Rates of Industrialized Countries
Authors: Rajalakshmi Ramachandran, Paul Beaumont
Venue: Computational Economics (2001)

We review the literature on long memory ARFIMA and GARMA models and introduce a new efficient estimator for GARMA models, which we show to be robust. Next we conduct a Monte Carlo study to demonstate the power of the Dickie&ndash;Fuller test when the data are generated from a stationary GARMA process. We conclude with a brief discussion of cointegration in the context of GARMA models with an application to international interest rates.
New Answers to Old Questions
Venue: IEEE Software (1990)

No abstract available 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
API-Level Attacks on Embedded Systems
Authors: Mike Bond, Ross Anderson
Venue: Computer (2001)

A growing number of embedded systems use security processors to distribute control, billing, and metering among devices with intermittent or restricted online connectivity. The more obvious examples include smart cards, microcontrollers used as value counters in postal meters and vending machines, and cryptographic processors used in networks of automatic teller machines and point-of-sale equipment to encipher customers' personal identification numbers.Recently, a whole new family of attacks has been discovered on the application programming interfaces these security processors use. These API attacks extend and generalize the known types of attack that target authentication protocols. Such attacks present valid commands to the security processor but in an unexpected sequence, thereby obtaining results that break the security policy its designer envisioned.Designing security APIs is a new research field with significant industrial and scientific importance. The poor design of present interfaces prevents many tamper-resistant processors from achieving their potential and leaves a disappointing dependency on procedural controls¿the design of which involves subtleties likely to exceed the grasp of most implementers.It is unclear that a "generalized" API will work. The natural accretion of functionality presents security with one of its greatest enemies. Yet, getting the API right is relevant for more than just cryptoprocessors. The API is where cryptography, protocols, operating-system access controls, and operating procedures all come together¿or fail to. It truly is a microcosm of the security engineering problem.
Efficient Processing of Nested Fuzzy SQL Queries in a Fuzzy Database
Authors: Q. Yang, W. Zhang, C. Liu, J. Wu, C. Yu, H. Nakajima, N. D. Rishe
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in the Fuzzy SQL language. Although it provides a very convenient way for users to express complex queries, a nested fuzzy query may be very inefficient to process with the naive evaluation method based on its semantics. In conventional databases, nested queries are unnested to improve the efficiency of their evaluation. In this paper, we extend the unnesting techniques to process several types of nested fuzzy queries. An extended merge-join is used to evaluate the unnested fuzzy queries. As shown by both theoretical analysis and experimental results, the unnesting techniques with the extended merge-join significantly improve the performance of evaluating nested fuzzy queries.